Paper 2023/099 Original: eprint.iacr.org/2023/099 ↗
Scalable Multiparty Garbling
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2023-09-03: last updated
- 2023-01-26: published
- Short URL
- https://ia.cr/2023/099
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2023/099,
author = {Gabrielle Beck and Aarushi Goel and Aditya Hegde and Abhishek Jain and Zhengzhong Jin and Gabriel Kaptchuk},
title = {Scalable Multiparty Garbling},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/099},
year = {2023},
url = {https://eprint.iacr.org/2023/099}
}