Simple and Efficient Perfectly-Secure Asynchronous MPC

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(n3 ) field elements per multiplication. Our protocol provides perfect security against an active, adaptive adversary corrupting t < n/4 players, which is optimal. This communication complexity is to be compared with the most efficient previously known protocol for the same model, which requires (n5 ) field elements of communication (i.e., (n3 ) broadcasts). Our protocol is as efficient as the most efficient perfectly secure protocol for the synchronous model and the most efficient asynchronous protoco...

• Type: Conference
• Year: 2007
• Where: ASIACRYPT
• Authors: Zuzana Beerliová-Trubíniová, Martin Hirt
• Keywords: ASIACRYPT 2007, Asynchronous Mpc Protocol, Cryptology, Field Elements, Mpc Protocol