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

From MaRDI portal
Publication:5267415

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




Related Items (24)

Targeted lossy functions and applicationsDAHash: distribution aware tuning of password hashing costsRandom oracles and non-uniformitySingle-server private information retrieval with sublinear amortized timeOn building fine-grained one-way functions from strong average-case hardnessThe function-inversion problem: barriers and opportunitiesOptimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisionsOn time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashingA random oracle for all of usOn time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashingNon-uniformity and quantum advice in the quantum random oracle modelLower bounds for (batch) PIR with private preprocessingRevisiting time-space tradeoffs for function inversionThe query-complexity of preprocessing attacksCrooked indifferentiability of enveloped XOR revisitedLower bound on SNARGs in the random oracle modelTime-space tradeoffs for sponge hashing: attacks and limitations for short collisionsTime-space lower bounds for finding collisions in Merkle-Damgård hash functionsTime-space lower bounds for finding collisions in Merkle-Damgård Hash functionsUnifying presampling via concentration boundsPassword hashing and preprocessingProofs of Catalytic SpaceTime-space tradeoffs and short collisions in Merkle-Damgård hash functionsScrypt Is Maximally Memory-Hard



Cites Work


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