Scalable Multiparty Garbling

Scalable Multiparty Garbling

Multiparty garbling is the most popular approach for constant-round secure multiparty computation (MPC). Despite being the focus of significant research effort, instantiating prior approaches to multiparty garbling results in constant-round MPC that can not realistically accommodate large numbers of...

Full description

Bibliographic Details
Main Authors: Beck, Gabrielle, Goel, Aarushi, Hegde, Aditya, Jain, Abhishek, Jin, Zhengzhong, Kaptchuk, Gabriel
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:English
Published: ACM|Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security 2023
Online Access:https://hdl.handle.net/1721.1/153138
Description
Summary:Multiparty garbling is the most popular approach for constant-round secure multiparty computation (MPC). Despite being the focus of significant research effort, instantiating prior approaches to multiparty garbling results in constant-round MPC that can not realistically accommodate large numbers of parties. In this work we present the first global-scale multiparty garbling protocol. The per-party communication complexity of our protocol decreases as the number of parties participating in the protocol increases - for the first time matching the asymptotic communication complexity of non-constant round MPC protocols. Our protocol achieves malicious security in the honest-majority setting and relies on the hardness of the Learning Party with Noise assumption.

Similar Items