Perfectly-Secure Multiparty Computation with Linear Communication Complexity over Any Modulus

ePrint Report: Perfectly-Secure Multiparty Computation with Linear Communication Complexity over Any Modulus

Daniel Escudero, Yifan Song, Wenhao Wang

Consider the task of secure multiparty computation (MPC) among $n$ parties with perfect security and guaranteed output delivery, supporting $t

In this work we provide an MPC protocol in this setting: perfect security, G.O.D. and $t

communication complexity computation daniel delivery eprint report linear mpc perfect protocol report secure multiparty computation security song task wang work