Limits on the Usefulness of Random Oracles

DOI10.1007/978-3-642-36594-2_25zbMath1310.94150OpenAlexW1690350740MaRDI QIDQ4910292

Eran Omri, Iftach Haitner, Hila Zarosim

Publication date: 18 March 2013

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_25

zbMATH Keywords

differential privacyblack-box separationskey agreementone-way functionsrandom oracles

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (6)

Limits on the usefulness of random oracles ⋮ Separating Computational and Statistical Differential Privacy in the Client-Server Model ⋮ Estimating gaps in martingales and applications to coin-tossing: constructions and hardness ⋮ Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles ⋮ On actively-secure elementary MPC reductions ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing

This page was built for publication: Limits on the Usefulness of Random Oracles