On the Impossibility of Efficiently Combining Collision Resistant Hash Functions

DOI10.1007/11818175_34zbMath1138.94347OpenAlexW2143765083MaRDI QIDQ5756644

Xavier Boyen, Dan Boneh

Publication date: 4 September 2007

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

Full work available at URL: https://doi.org/10.1007/11818175_34

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Generic attacks on hash combiners ⋮ How (Not) to Efficiently Dither Blockcipher-Based Hash Functions? ⋮ Random oracle combiners: breaking the concatenation barrier for collision-resistance ⋮ 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 ⋮ Multi-property Preserving Combiners for Hash Functions ⋮ Robust multi-property combiners for hash functions ⋮ Obfuscation Combiners

Uses Software

• Whirlpool

This page was built for publication: On the Impossibility of Efficiently Combining Collision Resistant Hash Functions