Collision resistant hashing for paranoids: dealing with multiple collisions
From MaRDI portal
Publication:1648826
DOI10.1007/978-3-319-78375-8_6zbMath1423.94079OpenAlexW2732980408MaRDI QIDQ1648826
Moni Naor, Eylon Yogev, Ilan Komargodski
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78375-8_6
Related Items (12)
Non-malleable codes for bounded parallel-time tampering ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ Statistical difference beyond the polarizing regime ⋮ Non-adaptive universal one-way hash functions from arbitrary one-way functions ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ 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 ⋮ Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash ⋮ Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols ⋮ Quantum algorithm for the multicollision problem ⋮ On the CCA compatibility of public-key infrastructure ⋮ On subset-resilient hash function families
This page was built for publication: Collision resistant hashing for paranoids: dealing with multiple collisions
