On distributional collision resistant hashing
From MaRDI portal
Publication:1784095
DOI10.1007/978-3-319-96881-0_11zbMATH Open1436.94077OpenAlexW2811194755MaRDI QIDQ1784095FDOQ1784095
Authors: Ilan Komargodski, Eylon Yogev 
Publication date: 26 September 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-96881-0_11
Recommendations
- Distributional collision resistance beyond one-way functions
- Collision resistant hashing for paranoids: dealing with multiple collisions
- Multi-collision resistant hash functions and their applications
- Theory of Cryptography
- On the complexity of collision resistant hash functions: new and old black-box separations
Cited In (23)
- SPN-Hash: Improving the Provable Resistance against Differential Collision Attacks
- On subset-resilient hash function families
- Non-interactive universal arguments
- Collision resistant hashing for paranoids: dealing with multiple collisions
- Multi-collision resistant hash functions and their applications
- Searching for ELFs in the cryptographic forest
- Distributional collision resistance beyond one-way functions
- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on non-interactive zero-knowledge from CDH
- Theory of Cryptography
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Collision-resistance from multi-collision-resistance
- A public key identity-based revocation scheme: fully attribute-hiding and function private
- 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
- Structure versus hardness through the obfuscation lens
- Collision resistance from multi-collision resistance for all constant parameters
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds
- Quantum advantage from one-way functions
- The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
This page was built for publication: On distributional collision resistant hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784095)
