Amplifying Collision Resistance: A Complexity-Theoretic Treatment
DOI10.1007/978-3-540-74143-5_15zbMATH Open1215.94036OpenAlexW2134751726MaRDI QIDQ3612554FDOQ3612554
Ronald L. Rivest, Ran Canetti, Hoeteck Wee, Madhu Sudan, Luca Trevisan, Salil Vadhan
Publication date: 10 March 2009
Published in: Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74143-5_15
Cryptography (94A60) Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (13)
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
- Random oracle combiners: breaking the concatenation barrier for collision-resistance
- Parallel Hashing via List Recoverability
- Title not available (Why is that?)
- Distributional collision resistance beyond one-way functions
- Title not available (Why is that?)
- Multi-property Preserving Combiners for Hash Functions
- Robust multi-property combiners for hash functions
- Information Security and Cryptology - ICISC 2003
- Direct product hardness amplification
- Generic attacks on hash combiners
- Memoryless near-collisions via coding theory
- On derandomizing Yao's weak-to-strong OWF construction
This page was built for publication: Amplifying Collision Resistance: A Complexity-Theoretic Treatment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612554)
