Perfect Asynchronous MPC with Linear Communication Overhead

Abraham, I and Asharov, G and Patil, S and Patra, A (2024) Perfect Asynchronous MPC with Linear Communication Overhead. In: 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2024, 26 May 2024through 30 May 2024, Zurich, Switzerland, pp. 280-309.

PDF Lec_Not_Com_Sci_14655_280 - 309_2024.pdf - Published Version Restricted to Registered users only Download (14MB) | Request a copy

Abstract

We study secure multiparty computation in the asynchronous setting with perfect security and optimal resilience (less than one-fourth of the participants are malicious). It has been shown that every function can be computed in this model Ben-OR, Canetti, and Goldreich, STOC�1993. Despite 30 years of research, all protocols in the asynchronous setting require Ω(n2C) communication complexity for computing a circuit with C multiplication gates. In contrast, for nearly 15 years, in the synchronous setting, it has been known how to achieve O(nC) communication complexity (Beerliova and Hirt; TCC 2008). The techniques for achieving this result in the synchronous setting are not known to be sufficient for obtaining an analogous result in the asynchronous setting. We close this gap between synchronous and asynchronous secure computation and show the first asynchronous protocol with O(nC) communication complexity for a circuit with C multiplication gates. Linear overhead forms a natural barrier for general secret-sharing-based MPC protocols. Our main technical contribution is an asynchronous weak binding secret sharing that achieves rate-1 communication (i.e., O(1)-overhead per secret). To achieve this goal, we develop new techniques for the asynchronous setting, including the use of trivariate polynomials (as opposed to bivariate polynomials). © International Association for Cryptologic Research 2024.

Item Type:	Conference Proceedings
Publication:	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Series.:	Lecture Notes in Computer Science ((LNCS, volume 14655))
Publisher:	Springer Science and Business Media Deutschland GmbH
Additional Information:	The copyright for this article belongs to Springer Science and Business Media Deutschland GmbH
Keywords:	Computational complexity; Cryptography; Network security; Polynomial approximation, Asynchronous networks; Asynchronous protocols; Communication complexity; Communication overheads; Optimal resilience; Perfect secure computation; Perfect securities; Secret-sharing; Secure computation; Secure multi-party computation, Complex networks
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	29 Jul 2024 09:17
Last Modified:	30 Jul 2024 05:31
URI:	http://eprints.iisc.ac.in/id/eprint/85213

Actions (login required)

View Item