Limits of random oracles in secure computation (extended abstract)

DOI10.1145/2554797.2554801MaRDI QIDQ2988865zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

random oracle modelone-way functionssecure function evaluationblack-box separationImpagliazzo's worlds

Mathematics Subject Classification ID

Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Limits on the Usefulness of Random Oracles
• Limits on the usefulness of random oracles
• On the power of public-key encryption in secure computation
• scientific article; zbMATH DE number 1942416
• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation

Cites work

• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• (Leveled) fully homomorphic encryption without bootstrapping
• A hierarchy of polynomial time lattice basis reduction algorithms
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Bounds for Width Two Branching Programs
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Evaluating Branching Programs on Encrypted Data
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• New lattice-based cryptographic constructions
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
• Public-key cryptosystems from the worst-case shortest vector problem
• Toward basing fully homomorphic encryption on worst-case hardness
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller

Cited in

(19)

• On the Power of Threshold Measurements as Oracles
• 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
• scientific article; zbMATH DE number 1670881 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• Black-box use of one-way functions is useless for optimal fair coin-tossing

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)