Optimally-resilient Unconditionally-secure Asynchronous Multi-party Computation Revisited

6 In this paper, we present an optimally-resilient, unconditionally-secure asynchronous multi-party 7 computation (AMPC) protocol for n parties, tolerating a computationally unbounded adversary, 8 capable of corrupting up to t < n3 parties. Our protocol needs a communication of O(n 4) field 9 elements per multiplication gate. This is to be compared with previous best AMPC protocol (Patra 10 et al, ICITS 2009) in the same setting, which needs a communication of O(n5) field elements per 11 multiplication gate. To design our protocol, we present a simple and highly efficient asynchronous 12 verifiable secret-sharing (AVSS) protocol, which is of independent interest. 13 14 keywords: Byzantine faults, secret-sharing, unconditional-security, privacy. 15 2012 ACM Subject Classification Security and privacy → Information-theoretic techniques; Theory 16 of computation → Distributed algorithms; Theory of computation → Cryptographic protocols 17