On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
From MaRDI portal
Recommendations
- Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist
- Hash combiners for second pre-image resistance, target collision resistance and pre-image resistance have long output
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
- Security-Amplifying Combiners for Collision-Resistant Hash Functions
- Cryptophia's short combiner for collision-resistant hash functions
Cited in
(17)- Generic attacks on hash combiners
- Obfuscation combiners
- How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
- Robust Multi-property Combiners for Hash Functions Revisited
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment
- Breaking the ICE – Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
- scientific article; zbMATH DE number 1543036 (Why is no real title available?)
- Multi-collision resistance: a paradigm for keyless hash functions
- On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
- Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist
- Multi-property Preserving Combiners for Hash Functions
- Random oracle combiners: breaking the concatenation barrier for collision-resistance
- Random oracle combiners: Merkle-Damgård style
- Robust non-interactive zero-knowledge combiners
- Robust multi-property combiners for hash functions
This page was built for publication: On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756644)
