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.
Aditya Hegde is a second year PhD student in the ARC group at Johns Hopkins University where he is advised by Abhishek Jain and Matthew Green. He is broadly interested in cryptography and more specifically in the foundations and construction of efficient solutions to compute on private data.
Galois was pleased to host this tech talk via live-stream for the public on March 15, 2023. Please see above for the video recording of this talk.