Recommendations
Cites work
- A Zero-One Law for Boolean Privacy
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Can optimally-fair coin tossing be based on one-way functions?
- Computational Differential Privacy
- Distributed Private Data Analysis: Simultaneously Solving How and What
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Generating quasi-random sequences from semi-random sources
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 176554 (Why is no real title available?)
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Limits of computational differential privacy in the client/server setting
- Limits of random oracles in secure computation (extended abstract)
- Limits on the Usefulness of Random Oracles
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
- One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
- Secure communications over insecure channels
- Security proofs for signature schemes
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
Cited in
(15)- On independent random oracles
- The random oracle hypothesis is false
- Barriers for succinct arguments in the random oracle model
- Channels of small log-ratio leakage and characterization of two-party differentially private computation
- Limits of random oracles in secure computation (extended abstract)
- Limits on the Usefulness of Random Oracles
- Non-adaptive programmability of random oracle
- The complexity of differential privacy
- On the Communication Complexity of Key-Agreement Protocols.
- Computational two-party correlation: a dichotomy for key-agreement protocols
- On the Power of Threshold Measurements as Oracles
- On the power of public-key encryption in secure computation
- On the impossibility of key agreements from quantum random oracles
- Communication lower bounds of key-agreement protocols via density increment arguments
- Computationally differentially private inner-product protocols imply oblivious transfer
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)
