On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
From MaRDI portal
Publication:6163946
DOI10.1007/978-3-031-15982-4_6OpenAlexW4312639955MaRDI QIDQ6163946
Ashrujit Ghoshal, Ilan Komargodski
Publication date: 30 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15982-4_6
Related Items (5)
Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions ⋮ The query-complexity of preprocessing attacks ⋮ Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions ⋮ Time-space lower bounds for finding collisions in Merkle-Damgård hash functions ⋮ Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions
Cites Work
- Unnamed Item
- Unnamed Item
- Random oracles and non-uniformity
- The Discrete Logarithm problem with preprocessing
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
- Beyond Hellman's time-memory trade-offs with applications to proofs of space
- Tight time-space lower bounds for finding multiple collision pairs and their applications
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
- On the memory-tightness of hashed ElGamal
- Lower bounds on the time/memory tradeoff of function inversion
- The function-inversion problem: barriers and opportunities
- A constructive proof of the general lovász local lemma
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- Constructive Proofs of Concentration Bounds
- Random Oracles and Auxiliary Input
- A cryptanalytic time-memory trade-off
- Rigorous Time/Space Trade-offs for Inverting Functions
- Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
- Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions
- Time-space lower bounds for finding collisions in Merkle-Damgård hash functions
This page was built for publication: On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing