Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
From MaRDI portal
Publication:5261693
DOI10.1007/978-3-662-46497-7_24zbMath1382.94108OpenAlexW809859946MaRDI QIDQ5261693
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
Related Items
Two-round adaptively secure multiparty computation from standard assumptions, Constant-round leakage-resilient zero-knowledge from collision resistance, Limits on the Power of Indistinguishability Obfuscation and Functional Encryption, Deniable Attribute Based Encryption for Branching Programs from LWE, Adaptively secure computation for RAM programs, On constructing one-way permutations from indistinguishability obfuscation, Multikey Fully Homomorphic Encryption and Applications, Two-round MPC without round collapsing revisited -- towards efficient malicious protocols, Two-round adaptively secure MPC from isogenies, LPN, or CDH, Efficient and round-optimal oblivious transfer and commitment with adaptive security, Two-round maliciously secure computation with super-polynomial simulation, Adaptive security of multi-party protocols, revisited, Efficient one-sided adaptively secure computation, Better Two-Round Adaptive Multi-party Computation, Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model, On Constructing One-Way Permutations from Indistinguishability Obfuscation, Adaptively secure MPC with sublinear communication complexity, Multiparty reusable non-interactive secure computation from LWE, On Adaptively Secure Multiparty Computation with a Short CRS, Leakage resilience from program obfuscation, Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model, Broadcast-optimal two-round MPC
