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

DOI10.1007/978-3-540-85174-5_23MaRDI QIDQ3600232zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist
• Cryptophia's short combiner for collision-resistant hash functions
• Breaking and Fixing Cryptophia’s Short Combiner
• Hash combiners for second pre-image resistance, target collision resistance and pre-image resistance have long output
• On the Impossibility of Efficiently Combining Collision Resistant Hash Functions

Cites work

• Amplifying Collision Resistance: A Complexity-Theoretic Treatment
• Finding Collisions in the Full SHA-1
• Formalizing human ignorance
• How to Break MD5 and Other Hash Functions
• scientific article; zbMATH DE number 1303133 (Why is no real title available?)
• Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist
• On Robust Combiners for Oblivious Transfer and Other Primitives
• On Robust Combiners for Private Information Retrieval and Other Primitives
• On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Robust Multi-property Combiners for Hash Functions Revisited
• Robuster Combiners for Oblivious Transfer
• Security-Amplifying Combiners for Collision-Resistant Hash Functions
• Theory of Cryptography
• Topics in Cryptology – CT-RSA 2005

Cited in

(10)

• Combiners for backdoored random oracles
• On the complexity of collision resistant hash functions: new and old black-box separations
• Generic attacks on hash combiners
• Obfuscation combiners
• Cryptophia's short combiner for collision-resistant hash functions
• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
• Random oracle combiners: breaking the concatenation barrier for collision-resistance
• Random oracle combiners: Merkle-Damgård style
• Robust multi-property combiners for hash functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600232)