Paper 2026/1194 Original: eprint.iacr.org/2026/1194 ↗
Unconditionally Secure MPC for Boolean Circuits with Constant Communication
Abstract
The communication complexity of unconditionally Secure Multi-Party Computation (MPC) protocols has been studied by a series of works in the honest-majority setting. For evaluating an arbitrary Boolean circuit, the state-of-the-art MPC protocol by Goyal et al. (Crypto 2021 and Crypto 2022) achieves the total communication cost of $O(\log n)$ bits per gate, where $n$ is the number of parties. In this work, we present the first unconditional MPC protocol for any Boolean circuit with communication of $O(1)$ bits per gate. We first construct an unconditionally secure protocol in the presence of semi-honest adversaries, and then strengthen it to guarantee security against malicious adversaries with the same communication efficiency.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2026-06-07: last updated
- 2026-06-07: published
- Short URL
- https://ia.cr/2026/1194
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2026/1194,
author = {Yubo Zeng and Kang Yang and Dengguo Feng and Min Zhang},
title = {Unconditionally Secure MPC for Boolean Circuits with Constant Communication},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/1194},
year = {2026},
url = {https://eprint.iacr.org/2026/1194}
}