Collision Resistance from Multi-collision Resistance

DOI10.1007/S00145-024-09495-5MaRDI QIDQ6489330

Ron D. Rothblum, Prashant Nalini Vasudevan

Publication date: 21 April 2024

Published in: Journal of Cryptology (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• BPP and the polynomial hierarchy
• Decoding of Reed Solomon codes beyond the error-correction bound
• Multi-collision resistant hash functions and their applications
• Collision resistant hashing for paranoids: dealing with multiple collisions
• On distributional collision resistant hashing
• On the complexity of collision resistant hash functions: new and old black-box separations
• Distributional collision resistance beyond one-way functions
• Learning Polynomials with Queries: The Highly Noisy Case
• On the randomness complexity of efficient sampling
• Multicollision Attacks on Some Generalized Sequential Hash Functions
• Foundations of Cryptography
• Multi-collision resistance: a paradigm for keyless hash functions
• Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
• A Note on Perfect Correctness by Derandomization
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Multi-collision Attack on the Compression Functions of MD4 and 3-Pass HAVAL
• Zaps and Their Applications

This page was built for publication: Collision Resistance from Multi-collision Resistance