Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions

DOI10.1007/978-3-031-15982-4_5OpenAlexW4312894262MaRDI QIDQ6163945

Cody Freitag, 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_5

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (4)

Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ 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

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
• Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
• The function-inversion problem: barriers and opportunities
• Provably Robust Sponge-Based PRNGs and KDFs
• Non-uniform Cracks in the Concrete: The Power of Free Precomputation
• Multi-user Collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE
• On obfuscating point functions
• Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
• Random Oracles and Auxiliary Input
• A cryptanalytic time-memory trade-off
• Rigorous Time/Space Trade-offs for Inverting Functions
• Data structures meet cryptography: 3SUM with preprocessing
• Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
• Advances in Cryptology - CRYPTO 2003
• On the Indifferentiability of the Sponge Construction
• Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
• 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: Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions