Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation

DOI10.1007/978-3-662-46497-7_24zbMATH Open1382.94108OpenAlexW809859946MaRDI QIDQ5261693FDOQ5261693

Authors: Sanjam Garg, Antigoni Polychroniadou 

Publication date: 6 July 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_24

Recommendations

• Two-round secure MPC from indistinguishability obfuscation
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
• Adaptively secure MPC with sublinear communication complexity
• Adaptively secure MPC with sublinear communication complexity
• Two-round adaptively secure MPC from isogenies, LPN, or CDH
• Information-theoretic 2-round MPC without round collapsing: adaptive security, and more
• Two-round adaptively secure multiparty computation from standard assumptions
• Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
• Two round information-theoretic MPC with malicious security
• Information-theoretically secure MPC against mixed dynamic adversaries

zbMATH Keywords

Adaptively secure multi-party computation (MPC)

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (29)

• Leakage resilience from program obfuscation
• Adaptively secure computation for RAM programs
• Broadcast-optimal two-round MPC
• Information-theoretic 2-round MPC without round collapsing: adaptive security, and more
• On constructing one-way permutations from indistinguishability obfuscation
• Adaptively secure, universally composable, multiparty computation in constant rounds
• Deniable Attribute Based Encryption for Branching Programs from LWE
• Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
• Two-round adaptively secure multiparty computation from standard assumptions
• Two-round secure MPC from indistinguishability obfuscation
• Adaptively secure multi-party computation from LWE (via equivocal FHE)
• Limits on the power of indistinguishability obfuscation and functional encryption
• Better two-round adaptive multi-party computation
• Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
• Efficient and round-optimal oblivious transfer and commitment with adaptive security
• Constant-round leakage-resilient zero-knowledge from collision resistance
• On constructing one-way permutations from indistinguishability obfuscation
• Two-round adaptively secure MPC from isogenies, LPN, or CDH
• Constant round adaptively secure protocols in the tamper-proof hardware model
• Multiparty reusable non-interactive secure computation from LWE
• Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
• Adaptively secure MPC with sublinear communication complexity
• Multikey fully homomorphic encryption and applications
• On Adaptively Secure Multiparty Computation with a Short CRS
• Adaptive security of multi-party protocols, revisited
• Two-round maliciously secure computation with super-polynomial simulation
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
• Efficient one-sided adaptively secure computation
• Deniable cryptosystems: simpler constructions and achieving leakage resilience

This page was built for publication: Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation

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