Paper 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.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint. MINOR revision.
- Keywords
- Byzantine faultssecret-sharingunconditional-securityprivacy
- Contact author(s)
- ashish choudhury @ iiitb ac in
- History
- 2020-07-19: revised
- 2020-07-18: received
- See all versions
- Short URL
- https://ia.cr/2020/906
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/906,
author = {Ashish Choudhury},
title = {Optimally-resilient Unconditionally-secure Asynchronous Multi-party Computation Revisited},
howpublished = {Cryptology {ePrint} Archive, Paper 2020/906},
year = {2020},
url = {https://eprint.iacr.org/2020/906}
}
