Security/Efficiency Tradeoffs for Permutation-Based Hashing

DOI10.1007/978-3-540-78967-3_13zbMath1149.94328OpenAlexW2140596630MaRDI QIDQ5458594

John P. Steinberger, Phillip Rogaway

Publication date: 15 April 2008

Published in: Advances in Cryptology – EUROCRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78967-3_13

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

How to build an ideal cipher: the indifferentiability of the Feistel construction ⋮ An analysis of the blockcipher-based hash functions from PGV ⋮ Open problems in hash function security ⋮ Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls ⋮ How (Not) to Efficiently Dither Blockcipher-Based Hash Functions? ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ Security of permutation-based compression function {\textsf{lp}}231 ⋮ Strengthening the Known-Key Security Notion for Block Ciphers ⋮ MJH: a faster alternative to MDC-2 ⋮ Optimal collision security in double block length hashing with single length key ⋮ Public-Seed Pseudorandom Permutations ⋮ Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions ⋮ Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers ⋮ A New Mode of Operation for Block Ciphers and Length-Preserving MACs ⋮ Security/Efficiency Tradeoffs for Permutation-Based Hashing ⋮ MJH: A Faster Alternative to MDC-2 ⋮ Salvaging Merkle-Damgård for Practical Applications ⋮ Compactness of hashing modes and efficiency beyond Merkle tree ⋮ Cryptanalysis of Tweaked Versions of SMASH and Reparation ⋮ Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\) ⋮ Hashing Garbled Circuits for Free

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Attacks on fast double block length hash functions
• On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
• Towards Optimal Double-Length Hash Functions
• A Failure-Friendly Design Principle for Hash Functions
• Security/Efficiency Tradeoffs for Permutation-Based Hashing