Efficient asynchronous secure multiparty distributed computation

Abstract

This paper significantly improves the message complexity of perfect asynchronous secure computations among n players tolerating a computationally unbounded active adversary that corrupts up to t < n4 players. The protocol presented in this paper communicates (Formula Presented.) bits and broadcasts O(mn2) bits, where m is the number of multiplication gates in the circuit. This is to be compared with the most efficient perfect secure asynchronous protocol known so far, namely the protocol of [5], which requires (Formula Presented.) bits of communication apart from O(mn4 lg n) bits of broadcast.