Fixing cracks in the concrete: random oracles with auxiliary input, revisited
From MaRDI portal
(Redirected from Publication:5267415)
Recommendations
Cites work
- A cryptanalytic time-memory trade-off
- Advances in Cryptology - CRYPTO 2003
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Formalizing human ignorance
- Introduction to modern cryptography
- Message Authentication Codes from Unpredictable Block Ciphers
- Multi-instance security and its application to password-based cryptography
- Non-uniform cracks in the concrete: the power of free precomputation
- Random Oracles and Auxiliary Input
- Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
- Rigorous Time/Space Trade-offs for Inverting Functions
- Simple Constructions of Almost k-wise Independent Random Variables
- Time space tradeoffs for attacks against one-way functions and PRGs
Cited in
(41)- Random oracles and non-uniformity
- Hide-and-seek and the non-resignability of the BUFF transform
- 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
- Non-uniformity and quantum advice in the quantum random oracle model
- Lower bounds for (batch) PIR with private preprocessing
- Crooked indifferentiability of the Feistel construction
- 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
- Scrypt is maximally memory-hard
- 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
- The order of hashing in Fiat-Shamir schemes
- Offline-online indifferentiability of cryptographic systems
- Space-deniable proofs
- 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
- 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
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
- Time-space tradeoffs for finding multi-collisions in Merkle-Damgård hash functions
- Breaking RSA generically is equivalent to factoring, with preprocessing
- On the power of adaptivity for function inversion
- 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
- A new approach to generic lower bounds. Classical/quantum MDL, quantum factoring, and more
- Tight characterizations for preprocessing against cryptographic salting
- Unifying presampling via concentration bounds
- Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method
- Lower bound on SNARGs in the random oracle model
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)
