Secure MPC: laziness leads to GOD

DOI10.1007/978-3-030-64840-4_5OpenAlexW2886139987MaRDI QIDQ2691583

Saikrishna Badrinarayanan, Amit Sahai, Nathan Manohar, Aayush Jain

Publication date: 29 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-64840-4_5

zbMATH Keywords

secure multi party computation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ On linear communication complexity for (maximally) fluid MPC ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ On the exact round complexity of secure three-party computation ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Multiparty reusable non-interactive secure computation from LWE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption
• Threshold cryptosystems from threshold fully homomorphic encryption
• From obfuscation to the security of Fiat-Shamir for proofs
• Round-optimal secure multiparty computation with honest majority
• Statistical ZAP arguments
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Synchronous, with a chance of partition tolerance
• (Leveled) fully homomorphic encryption without bootstrapping
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• The random oracle methodology, revisited
• Constant-Round MPC with Fairness and Guarantee of Output Delivery
• Multi-identity and Multi-key Leveled FHE from Learning with Errors
• MPC vs. SFE : Unconditional and Computational Security
• Cryptography in the Multi-string Model
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Zaps and Their Applications
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Two Round Multiparty Computation via Multi-key FHE
• MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture
• Adaptively secure MPC with sublinear communication complexity

This page was built for publication: Secure MPC: laziness leads to GOD