Simple and efficient perfectly-secure asynchronous MPC

Abstract

Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversary. Known asynchronous MPC protocols require communication of at least ω(n3) (with cryptographic security), respectively ω(n4) (with information-theoretic security, but with error probability and non-optimal resilience) field elements per multiplication. We present an asynchronous MPC protocol communicating O(n 3) field elements per multiplication. Our protocol provides perfect security against an active, adaptive adversary corrupting t