Amplifying Collision Resistance: A Complexity-Theoretic Treatment

DOI10.1007/978-3-540-74143-5_15zbMath1215.94036OpenAlexW2134751726MaRDI QIDQ3612554

Ronald L. Rivest, Ran Canetti, Hoeteck Wee, Luca Trevisan, Salil P. 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

zbMATH Keywords

hardness amplificationhash functionscollision resistancecombiners

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (11)

Parallel Hashing via List Recoverability ⋮ Generic attacks on hash combiners ⋮ Random oracle combiners: breaking the concatenation barrier for collision-resistance ⋮ On derandomizing Yao's weak-to-strong OWF construction ⋮ Direct product hardness amplification ⋮ Memoryless near-collisions via coding theory ⋮ Compression from Collisions, or Why CRHF Combiners Have a Long Output ⋮ Multi-property Preserving Combiners for Hash Functions ⋮ Robust multi-property combiners for hash functions ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Amplifying Collision Resistance: A Complexity-Theoretic Treatment