Welcome to the resource topic for 2020/906
Title:
Optimally-resilient Unconditionally-secure Asynchronous Multi-party Computation Revisited
Authors: 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.
ePrint: https://eprint.iacr.org/2020/906
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .