Limits on the usefulness of random oracles
From MaRDI portal
Publication:290382
DOI10.1007/s00145-014-9194-9zbMath1355.94060OpenAlexW2030480083MaRDI QIDQ290382
Iftach Haitner, Hila Zarosim, Eran Omri
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
Related Items
Channels of small log-ratio leakage and characterization of two-party differentially private computation, On the impossibility of key agreements from quantum random oracles, Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols, On the Communication Complexity of Key-Agreement Protocols., The Complexity of Differential Privacy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating quasi-random sequences from semi-random sources
- Secure communications over insecure channels
- Security Proofs for Signature Schemes
- 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
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- 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
- Theory of Cryptography
