Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
From MaRDI portal
Publication:5261693
DOI10.1007/978-3-662-46497-7_24zbMATH Open1382.94108OpenAlexW809859946MaRDI QIDQ5261693FDOQ5261693
Antigoni Polychroniadou, Sanjam Garg
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
Cited In (24)
- Leakage resilience from program obfuscation
- Better Two-Round Adaptive Multi-party Computation
- Adaptively secure computation for RAM programs
- Broadcast-optimal two-round MPC
- On constructing one-way permutations from indistinguishability obfuscation
- 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
- Multikey Fully Homomorphic Encryption and Applications
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model
- 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
- Two-round adaptively secure MPC from isogenies, LPN, or CDH
- On Constructing One-Way Permutations from Indistinguishability Obfuscation
- Multiparty reusable non-interactive secure computation from LWE
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
- Adaptively secure MPC with sublinear communication complexity
- 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
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 👍 👎
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)
