Perfectly-secure MPC with linear communication complexity

Abstract

Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function, even when up to t players are under the control of an adversary. Known perfectly secure MPC protocols require communication of at least Ω(n 3) field elements per multiplication, whereas cryptographic or unconditional security is possible with communication linear in the number of players. We present a perfectly secure MPC protocol communicating field elements per multiplication. Our protocol provides perfect security against an active, adaptive adversary corrupting t∈