Limits on the Usefulness of Random Oracles
From MaRDI portal
Recommendations
- Limits on the usefulness of random oracles
- Limits of random oracles in secure computation (extended abstract)
- Random oracles and non-uniformity
- On the random oracle hypothesis
- On pseudo-random oracles
- Limitations of Hardness vs. Randomness under Uniform Reductions
- Random oracles with(out) programmability
- Random Oracle Reducibility
- Random Oracles and Auxiliary Input
Cited in
(18)- The random oracle hypothesis is false
- Impossibility of simulation secure functional encryption even with random oracles
- Another step towards realizing random oracles: non-malleable point obfuscation
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- Barriers for succinct arguments in the random oracle 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
- Limits on the usefulness of random oracles
- Limits of random oracles in secure computation (extended abstract)
- Exploring the limits of common coins using frontier analysis of protocols
- Separating computational and statistical differential privacy in the client-server model
- scientific article; zbMATH DE number 1088253 (Why is no real title available?)
- scientific article; zbMATH DE number 1942434 (Why is no real title available?)
- Non-adaptive programmability of random oracle
- On the Power of Threshold Measurements as Oracles
- On the power of public-key encryption in secure computation
- Sometimes you can't distribute random-oracle-based proofs
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 Q4910292)
