The query-complexity of preprocessing attacks

DOI10.1007/978-3-031-38545-2_16OpenAlexW4385654448MaRDI QIDQ6145923

Ashrujit Ghoshal, Stefano Tessaro

Publication date: 2 February 2024

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

Full work available at URL: https://doi.org/10.1007/978-3-031-38545-2_16

zbMATH Keywords

time-complexityoffline-online time trade-offs

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• A fast software one-way hash function
• Random oracles and non-uniformity
• The Discrete Logarithm problem with preprocessing
• 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
• On the memory-tightness of hashed ElGamal
• Expected-time cryptography: generic techniques and applications to concrete soundness
• Non-uniform Cracks in the Concrete: The Power of Free Precomputation
• The Exact PRF-Security of NMAC and HMAC
• Formalizing Human Ignorance
• Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
• Random Oracles and Auxiliary Input
• A cryptanalytic time-memory trade-off
• Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
• Advances in Cryptology - CRYPTO 2003
• 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: The query-complexity of preprocessing attacks