Cryptology ePrint Archive: Report 2020/906

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

Ashish Choudhury

Abstract: In this paper, we present an optimally-resilient, unconditionally-secure asynchronous multi-party computation (AMPC) protocol for $n$ parties, tolerating a computationally unbounded adversary, capable of corrupting up to $t < \frac{n}{3}$ parties. Our protocol needs a communication of ${\cal O}(n^4)$ field elements per multiplication gate. This is to be compared with previous best AMPC protocol (Patra et al, ICITS 2009) in the same setting, which needs a communication of ${\cal O}(n^5)$ field elements per multiplication gate. To design our protocol, we present a simple and highly efficient asynchronous verifiable secret-sharing (AVSS) protocol, which is of independent interest.

Category / Keywords: cryptographic protocols / Byzantine faults, secret-sharing, unconditional-security, privacy

Date: received 18 Jul 2020, last revised 19 Jul 2020

Contact author: ashish choudhury at iiitb ac in

Available format(s): PDF | BibTeX Citation

Version: 20200719:071042 (All versions of this report)

Short URL: ia.cr/2020/906


[ Cryptology ePrint archive ]