Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist

DOI10.1007/978-3-540-72540-4_2zbMath1141.94369OpenAlexW1741219559MaRDI QIDQ5429381

Krzysztof Pietrzak

Publication date: 29 November 2007

Published in: Advances in Cryptology - EUROCRYPT 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72540-4_2

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

This page was built for publication: Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist