Amplifying Collision Resistance: A Complexity-Theoretic Treatment
From MaRDI portal
Publication:3612554
DOI10.1007/978-3-540-74143-5_15zbMath1215.94036MaRDI QIDQ3612554
Ronald L. Rivest, Ran Canetti, Madhu Sudan, 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
94A60: Cryptography
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68P05: Data structures
Related Items
Unnamed Item, Unnamed Item, Multi-property Preserving Combiners for Hash Functions, Random oracle combiners: breaking the concatenation barrier for collision-resistance, Memoryless near-collisions via coding theory, Robust multi-property combiners for hash functions, Generic attacks on hash combiners, On derandomizing Yao's weak-to-strong OWF construction, Direct product hardness amplification, Parallel Hashing via List Recoverability, Compression from Collisions, or Why CRHF Combiners Have a Long Output