Limits on the usefulness of random oracles
From MaRDI portal
Publication:290382
DOI10.1007/S00145-014-9194-9zbMATH Open1355.94060OpenAlexW2030480083MaRDI QIDQ290382FDOQ290382
Authors: Iftach Haitner, Eran Omri, Hila Zarosim 
Publication date: 1 June 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-014-9194-9
Recommendations
Cites Work
- Theory of Cryptography
- Security Proofs for Signature Schemes
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Title not available (Why is that?)
- Generating quasi-random sequences from semi-random sources
- Secure communications over insecure channels
- Limits of random oracles in secure computation
- Limits of computational differential privacy in the client/server setting
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Computational Differential Privacy
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
- Distributed Private Data Analysis: Simultaneously Solving How and What
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
- Limits on the Usefulness of Random Oracles
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
- A Zero-One Law for Boolean Privacy
- Theory of Cryptography
- Theory of Cryptography
Cited In (12)
- The random oracle hypothesis is false
- Barriers for succinct arguments in the random oracle model
- The Complexity of Differential Privacy
- Communication lower bounds of key-agreement protocols via density increment arguments
- On the Communication Complexity of Key-Agreement Protocols.
- Limits on the Usefulness of Random Oracles
- Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
- On independent random oracles
- Channels of small log-ratio leakage and characterization of two-party differentially private computation
- Non-adaptive programmability of random oracle
- On the impossibility of key agreements from quantum random oracles
- On the Power of Threshold Measurements as Oracles
This page was built for publication: Limits on the usefulness of random oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290382)
