Compression from Collisions, or Why CRHF Combiners Have a Long Output

DOI10.1007/978-3-540-85174-5_23zbMath1183.68277OpenAlexW2143126652MaRDI QIDQ3600232

Krzysztof Pietrzak

Publication date: 10 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85174-5_23

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (5)

Generic attacks on hash combiners ⋮ Random oracle combiners: breaking the concatenation barrier for collision-resistance ⋮ Robust multi-property combiners for hash functions ⋮ Obfuscation Combiners ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments

Cites Work

• Unnamed Item
• Formalizing Human Ignorance
• Robust Multi-property Combiners for Hash Functions Revisited
• Robuster Combiners for Oblivious Transfer
• Security-Amplifying Combiners for Collision-Resistant Hash Functions
• Amplifying Collision Resistance: A Complexity-Theoretic Treatment
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• How to Break MD5 and Other Hash Functions
• On Robust Combiners for Oblivious Transfer and Other Primitives
• Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist
• Finding Collisions in the Full SHA-1
• Topics in Cryptology – CT-RSA 2005
• On Robust Combiners for Private Information Retrieval and Other Primitives
• On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
• Theory of Cryptography

This page was built for publication: Compression from Collisions, or Why CRHF Combiners Have a Long Output