Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions

DOI10.1007/978-3-031-30634-1_15zbMath1528.94050OpenAlexW4365806635MaRDI QIDQ6083138

Ilan Komargodski, Ashrujit Ghoshal, Cody Freitag

Publication date: 8 December 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-30634-1_15

zbMATH Keywords

cryptographic hash functionsfixed-input length function

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• The hash function \texttt{BLAKE}
• Random oracles and non-uniformity
• Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
• Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
• Careful with Composition: Limitations of the Indifferentiability Framework
• Constructive Proofs of Concentration Bounds
• Random Oracles and Auxiliary Input
• A cryptanalytic time-memory trade-off
• On the Composition of Zero-Knowledge Proof Systems
• Rigorous Time/Space Trade-offs for Inverting Functions
• Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
• Advances in Cryptology - CRYPTO 2003
• Merkle-Damgård Revisited: How to Construct a Hash Function
• On the Indifferentiability of the Sponge Construction
• Theory of Cryptography
• Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions
• On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
• Time-space lower bounds for finding collisions in Merkle-Damgård hash functions

This page was built for publication: Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions