Welcome to the resource topic for 2024/015
Title:
Unconditionally secure MPC for Boolean circuits with constant online communication
Authors: Zhenkai Hu, Kang Yang, Yu Yu
Abstract:Through tremendous efforts, the communication cost of secure multi-party computation (MPC) in the honest-majority setting has been significantly improved.
In particular, the state-of-the-art honest-majority MPC protocol by Escudero et al. (CCS’22) takes 12 field elements in total per multiplication gate for arithmetic circuits in the online phase. However, it still requires 12 \log(5n/4) bits of online communication per AND gate for Boolean circuits. That is, for Boolean circuits, no MPC protocol with constant online communication is known.
In this paper, we present an unconditionally secure MPC protocol for Boolean circuits in the honest-majority setting, which has constant online communication complexity and the offline communication complexity linear to the number n of parties. We first describe the semi-honest MPC protocol and then show how to extend it to achieve malicious security, where the maliciously secure protocol has the same communication cost as the semi-honest protocol.
In particular, our protocol achieves the amortized communication cost 36 bits per AND gate in the online phase and 30n+24 bits per AND gate in the offline phase.
ePrint: https://eprint.iacr.org/2024/015
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .