Unconditionally secure MPC for Boolean circuits with constant online communication

ePrint Report: Unconditionally secure MPC for Boolean circuits with constant online communication

Zhenkai Hu, Kang Yang, Yu Yu

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 …

art communication computation cost eprint report mpc party protocol report state