On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
From MaRDI portal
Publication:6083214
DOI10.1007/s00037-023-00243-yOpenAlexW4386707635MaRDI QIDQ6083214
Ashrujit Ghoshal, Ilan Komargodski
Publication date: 31 October 2023
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-023-00243-y
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Classical models of computation (Turing machines, etc.) (68Q04)
Cites Work
- Unnamed Item
- Unnamed Item
- Random oracles and non-uniformity
- Multi-collision resistant hash functions and their applications
- Collision resistant hashing for paranoids: dealing with multiple collisions
- 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
- Multi-collision resistance: a paradigm for keyless hash 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
