Amplifying Collision Resistance: A Complexity-Theoretic Treatment

DOI10.1007/978-3-540-74143-5_15MaRDI QIDQ3612554zbMATH OpenOpenAlexFDO

Authors Ran Canetti, Ronald L. Rivest, Luca Trevisan, Hoeteck Wee, Salil Vadhan, Madhu Sudan

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

hash functionshardness amplificationcollision resistancecombiners

Mathematics Subject Classification ID

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

Recommendations

• Information Security and Cryptology - ICISC 2003
• Some observations on the theory of cryptographic hash functions
• New Constructions for Secure Hash Functions
• Security-Amplifying Combiners for Collision-Resistant Hash Functions
• On the Impossibility of Efficiently Combining Collision Resistant Hash Functions

Cited in

(14)

• Low-complexity cryptographic hash functions
• Compression from Collisions, or Why CRHF Combiners Have a Long Output
• Parallel Hashing via List Recoverability
• scientific article; zbMATH DE number 7286918 (Why is no real title available?)
• Random oracle combiners: breaking the concatenation barrier for collision-resistance
• Multi-property Preserving Combiners for Hash Functions
• Robust multi-property combiners for hash functions
• Query-complexity amplification for random oracles
• Direct product hardness amplification
• Generic attacks on hash combiners
• Memoryless near-collisions via coding theory
• On derandomizing Yao's weak-to-strong OWF construction
• Distributional collision resistance beyond one-way functions
• Information Security and Cryptology - ICISC 2003

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)