Perfectly-Secure MPC with Constant Online Communication Complexity

ePrint Report: Perfectly-Secure MPC with Constant Online Communication Complexity

Yifan Song, Xiaxi Ye

In this work, we study the communication complexity of perfectly secure MPC protocol with guaranteed output delivery against $t=(n-1)/3$ corruptions. The previously best-known result in this setting is due to Goyal, Liu, and Song (CRYPTO, 2019) which achieves $O(n)$ communication per gate, where $n$ is the number of parties.


On the other hand, in the honest majority setting, a recent trend in designing efficient MPC protocol is …

communication complexity crypto delivery eprint report mpc protocol report result song study work