Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited

DOI10.1007/978-3-319-56614-6_16zbMath1415.94424OpenAlexW2598805891MaRDI QIDQ5267415

Yevgeniy Dodis, Siyao Guo, Jonathan N. Katz

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_16

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (24)

Targeted lossy functions and applications ⋮ DAHash: distribution aware tuning of password hashing costs ⋮ Random oracles and non-uniformity ⋮ Single-server private information retrieval with sublinear amortized time ⋮ On building fine-grained one-way functions from strong average-case hardness ⋮ The function-inversion problem: barriers and opportunities ⋮ 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 ⋮ A random oracle for all of us ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ Non-uniformity and quantum advice in the quantum random oracle model ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ Revisiting time-space tradeoffs for function inversion ⋮ The query-complexity of preprocessing attacks ⋮ Crooked indifferentiability of enveloped XOR revisited ⋮ Lower bound on SNARGs in the random oracle model ⋮ 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 ⋮ Unifying presampling via concentration bounds ⋮ Password hashing and preprocessing ⋮ Proofs of Catalytic Space ⋮ Time-space tradeoffs and short collisions in Merkle-Damgård hash functions ⋮ Scrypt Is Maximally Memory-Hard

Cites Work

• Unnamed Item
• Non-uniform Cracks in the Concrete: The Power of Free Precomputation
• Formalizing Human Ignorance
• Multi-instance Security and Its Application to Password-Based Cryptography
• Message Authentication Codes from Unpredictable Block Ciphers
• Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
• Random Oracles and Auxiliary Input
• A cryptanalytic time-memory trade-off
• Simple Constructions of Almost k-wise Independent Random Variables
• Rigorous Time/Space Trade-offs for Inverting Functions
• Advances in Cryptology - CRYPTO 2003
• Bounds on the Efficiency of Generic Cryptographic Constructions
• Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs

This page was built for publication: Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited