On distributional collision resistant hashing
From MaRDI portal
Publication:1784095
DOI10.1007/978-3-319-96881-0_11zbMath1436.94077OpenAlexW2811194755MaRDI QIDQ1784095
Publication date: 26 September 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-96881-0_11
Related Items (10)
On the complexity of collision resistant hash functions: new and old black-box separations ⋮ Statistical difference beyond the polarizing regime ⋮ Collision-resistance from multi-collision-resistance ⋮ The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions ⋮ Non-interactive universal arguments ⋮ Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols ⋮ A note on non-interactive zero-knowledge from CDH ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ Public-coin statistical zero-knowledge batch verification against malicious verifiers ⋮ On subset-resilient hash function families
This page was built for publication: On distributional collision resistant hashing
