Fast large-scale honest-majority MPC for malicious adversaries

DOI10.1007/s00145-023-09453-7zbMath1517.94080OpenAlexW2949716231MaRDI QIDQ6110373

Daniel Genkin, Ariel Nof, Dai Ikarashi, Koji Chida, Koki Hamada, Yehuda Lindell, Ryo Kikuchi

Publication date: 5 July 2023

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-023-09453-7

zbMATH Keywords

cryptographic protocolsMPCmultiparty computationhonest majority

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Fast large-scale honest-majority MPC for malicious adversaries
• Overdrive: making SPDZ great again
• Security and composition of multiparty cryptographic protocols
• High-performance multi-party computation for binary circuits based on oblivious transfer
• Guaranteed output delivery comes free in honest majority MPC
• Communication-efficient unconditional MPC with guaranteed output delivery
• Secure multi-party computation without agreement
• Multiparty Computation from Somewhat Homomorphic Encryption
• Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
• A New Approach to Practical Active-Secure Two-Party Computation
• Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
• Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
• How to share a secret
• Information-Theoretically Secure Protocols and Security under Composition
• Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
• Scalable and Unconditionally Secure Multiparty Computation
• Asynchronous Multiparty Computation: Theory and Implementation
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Foundations of Cryptography
• Circuits resilient to additive attacks with applications to secure computation
• Perfectly-Secure MPC with Linear Communication Complexity
• Theory of Cryptography
• Robust Multiparty Computation with Linear Communication Complexity
• Scalable Secure Multiparty Computation

This page was built for publication: Fast large-scale honest-majority MPC for malicious adversaries