Scalable Multiparty Garbling
Name
3576915.3623132.pdf
Size
1.16 MB
Format
Adobe PDF
Checksum (MD5)
5fac6ea9089750d9a6ab330a8b811015
Author(s)
Beck, Gabrielle
Goel, Aarushi
Hegde, Aditya
Jain, Abhishek
Jin, Zhengzhong
Kaptchuk, Gabriel
Date Issued
November 15, 2023
Publisher
ACM|Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security
Citation
Beck, Gabrielle, Goel, Aarushi, Hegde, Aditya, Jain, Abhishek, Jin, Zhengzhong et al. 2023. "Scalable Multiparty Garbling."
Version
Final published version
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3576915.3623132
