Random Oracles and Auxiliary Input
From MaRDI portal
Publication:3612551
DOI10.1007/978-3-540-74143-5_12zbMath1215.94071OpenAlexW1540076154MaRDI QIDQ3612551
Publication date: 10 March 2009
Published in: Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74143-5_12
Related Items
One-way functions imply secure computation in a quantum world ⋮ One-message zero knowledge and non-malleable commitments ⋮ Does Fiat-Shamir require a cryptographic hash function? ⋮ Random oracles and non-uniformity ⋮ Bootstrapping for approximate homomorphic encryption ⋮ 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 ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles ⋮ 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 differential privacy and adaptive data analysis with bounded space ⋮ 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 ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ Revisiting time-space tradeoffs for function inversion ⋮ The query-complexity of preprocessing attacks ⋮ 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 ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions ⋮ Unifying presampling via concentration bounds ⋮ Non-malleable time-lock puzzles and applications ⋮ Non-adaptive programmability of random oracle ⋮ Security of Digital Signature Schemes in Weakened Random Oracle Models ⋮ Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems ⋮ Password hashing and preprocessing ⋮ Leaky Random Oracle (Extended Abstract) ⋮ Time-space tradeoffs and short collisions in Merkle-Damgård hash functions ⋮ How to Simulate It – A Tutorial on the Simulation Proof Technique ⋮ Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
