Asynchronous Multiparty Computation: Theory and Implementation

We propose an asynchronous protocol for general multiparty computation. The protocol has perfect security and communication complexity

$\mathcal{O}(n^2|C|k)$

, where

n

is the number of parties, |

C

| is the size of the arithmetic circuit being computed, and

k

is the size of elements in the underlying field. The protocol guarantees termination if the adversary allows a preprocessing phase to terminate, in which no information is released. The communication complexity of this protocol is the same as that of a passively secure solution up to a constant factor. It is secure against an adaptive and active adversary corrupting less than

n

/3 players. We also present a software framework for implementation of asynchronous protocols called VIFF (Virtual Ideal Functionality Framework), which allows automatic parallelization of primitive operations such as secure multiplications, without having to resort to complicated multithreading. Benchmarking of a VIFF implementation of our protocol confirms that it is applicable to practical non-trivial secure computations.