Limits of random oracles in secure computation (extended abstract)
DOI10.1145/2554797.2554801zbMATH Open1364.68206OpenAlexW2159284917WikidataQ130973490 ScholiaQ130973490MaRDI QIDQ2988865FDOQ2988865
Authors: Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran 
Publication date: 19 May 2017
Published in: Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2554797.2554801
Recommendations
random oracle modelone-way functionssecure function evaluationblack-box separationImpagliazzo's worlds
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- A hierarchy of polynomial time lattice basis reduction algorithms
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Evaluating Branching Programs on Encrypted Data
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Title not available (Why is that?)
- (Leveled) fully homomorphic encryption without bootstrapping
- On lattices, learning with errors, random linear codes, and cryptography
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Bounds for Width Two Branching Programs
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- New lattice-based cryptographic constructions
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Toward basing fully homomorphic encryption on worst-case hardness
Cited In (19)
- Security of Encryption Schemes in Weakened Random Oracle Models
- On actively-secure elementary MPC reductions
- Security Analysis of Constructions Combining FIL Random Oracles
- On the Communication Complexity of Key-Agreement Protocols.
- Limits on the Usefulness of Random Oracles
- Limits on the usefulness of random oracles
- The limits of common coins: further results
- Exploring the limits of common coins using frontier analysis of protocols
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
- Title not available (Why is that?)
- Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- Secure non-interactive simulation: feasibility and rate
- A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle
- On the impossibility of key agreements from quantum random oracles
- On the power of public-key encryption in secure computation
- Title not available (Why is that?)
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- On the Power of Threshold Measurements as Oracles
This page was built for publication: Limits of random oracles in secure computation (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988865)
