Fixing cracks in the concrete: random oracles with auxiliary input, revisited

DOI10.1007/978-3-319-56614-6_16zbMATH Open1415.94424OpenAlexW2598805891MaRDI QIDQ5267415FDOQ5267415

Yevgeniy Dodis, Jonathan Katz, Siyao Guo

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

Recommendations

• Random oracles and non-uniformity
• A random oracle for all of us
• Random Oracles and Auxiliary Input
• Quantum random oracle model with auxiliary input
• Unifying presampling via concentration bounds

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

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

Cited In (30)

• On building fine-grained one-way functions from strong average-case hardness
• Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions
• Random oracles and non-uniformity
• 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
• Proofs of Catalytic Space
• A random oracle for all of us
• On black-box verifiable outsourcing
• Immunizing backdoored PRGs
• On time-space lower bounds for finding short collisions in sponge hash functions
• Crooked indifferentiability of enveloped XOR revisited
• Targeted lossy functions and applications
• Time-space lower bounds for finding collisions in Merkle-Damgård hash functions
• DAHash: distribution aware tuning of password hashing costs
• Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions
• 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
• On building fine-grained one-way functions from strong average-case hardness
• Single-server private information retrieval with sublinear amortized time
• Password hashing and preprocessing
• Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
• The function-inversion problem: barriers and opportunities
• Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions
• Tight characterizations for preprocessing against cryptographic salting
• Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method
• Unifying presampling via concentration bounds
• Lower bound on SNARGs in the random oracle model
• Scrypt Is Maximally Memory-Hard

This page was built for publication: Fixing cracks in the concrete: random oracles with auxiliary input, revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267415)