Two-round secure MPC from indistinguishability obfuscation

DOI10.1007/978-3-642-54242-8_4MaRDI QIDQ5746333zbMATH OpenOpenAlexFDO

Authors Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova

Publication date 18 February 2014

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54242-8_4

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cryptography (94A60)

Recommendations

• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• Three-round secure multiparty computation from black-box two-round oblivious transfer
• Round-optimal secure multiparty computation with honest majority
• Round-optimal secure multi-party computation
• Two-round multiparty secure computation from minimal assumptions

Cited in

(63)

• Two-round MPC: information-theoretic and black-box
• Two-round adaptively secure multiparty computation from standard assumptions
• A simple construction of iO for Turing machines
• An improved affine equivalence algorithm for random permutations
• Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols
• Candidate iO from homomorphic encryption schemes
• Multiparty reusable non-interactive secure computation from LWE
• Unbounded multi-party computation from learning with errors
• Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
• Broadcast-optimal two-round MPC
• Three-round secure multiparty computation from black-box two-round oblivious transfer
• Unclonable polymers and their cryptographic applications
• Probabilistic termination and composability of cryptographic protocols
• On constructing one-way permutations from indistinguishability obfuscation
• On the exact round complexity of best-of-both-worlds multi-party computation
• Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
• Two-round maliciously secure computation with super-polynomial simulation
• How to avoid obfuscation using witness PRFs
• On constructing one-way permutations from indistinguishability obfuscation
• On Adaptively Secure Multiparty Computation with a Short CRS
• Spooky Encryption and Its Applications
• Probabilistic Termination and Composability of Cryptographic Protocols
• How to Generate and Use Universal Samplers
• Limits on the power of indistinguishability obfuscation and functional encryption
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Secure computation with minimal interaction, revisited
• Indistinguishability obfuscation from compact functional encryption
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
• Multikey fully homomorphic encryption and applications
• Foundations of homomorphic secret sharing
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
• Reusable two-round MPC from LPN
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• Lattice-based SNARGs and their application to more efficient obfuscation
• Better two-round adaptive multi-party computation
• Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
• On Removing Graded Encodings from Functional Encryption
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• One-Way Functions and (Im)perfect Obfuscation
• On the exact round complexity of secure three-party computation
• Round-optimal secure multi-party computation
• Candidate iO from homomorphic encryption schemes
• Beyond honest majority: the round complexity of fair and robust multi-party computation
• How to obfuscate MPC inputs
• SCALES. MPC with small clients and larger ephemeral servers
• mrNISC from LWE with polynomial modulus
• mrNISC from LWE with polynomial modulus
• Collusion-resistant functional encryption for RAMs
• Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
• Two-round adaptively secure MPC from isogenies, LPN, or CDH
• The final nail in the coffin of statistically-secure obfuscator
• How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
• Efficiently obfuscating re-encryption program under DDH assumption
• Witness encryption for succinct functional commitments and applications
• A modular approach to unclonable cryptography
• Malicious security for SCALES. Outsourced computation with ephemeral servers
• Lattice-based obfuscation from NTRU and equivocal LWE
• Towards general-purpose program obfuscation via local mixing
• Low communication threshold FHE from standard (module-)LWE
• Information-theoretic broadcast-optimal MPC
• A meta-complexity theoretic approach to indistinguishability obfuscation and witness pseudo-canonicalization
• Lower bounds on the overhead of indistinguishability obfuscation

This page was built for publication: Two-round secure MPC from indistinguishability obfuscation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746333)