### Abstract

Secure Multi-Party Computation (MPC) providing information-theoretic security allows a set of *n* parties to securely compute an agreed function over a finite field, even if *t* parties are under the control of a computationally unbounded active adversary. Asynchronous MPC (AMPC) is an important variant of MPC, which works over an asynchronous network. It is well known that perfect AMPC is possible if and only if *t*<*n*/4, while statistical AMPC is possible if and only if *t*<*n*/3. In this paper, we study the communication complexity of AMPC protocols (both statistical and perfect) designed with exactly *n*=4*t*+1 parties. Our major contributions in this paper are as follows:

Asynchronous Verifiable Secret Sharing (AVSS) is one of the main building blocks for AMPC protocols. In this paper, we design two AVSS schemes with 4*t*+1 parties: the first one is statistically-secure and has non-optimal resilience, while the second one is perfectly-secure and has optimal resilience. Both these schemes achieve a common interesting property, which was not achieved by the previous schemes. Specifically, our AVSS schemes allow to share a secret with the degree of sharing at most *d*, where *t*≤*d*≤2*t*. In contrast, the existing AVSS schemes allow the degree of sharing to be at most *t*. The new property of our AVSS schemes simplifies the degree-reduction step for the evaluation of multiplication gates in an AMPC protocol.

Using our statistical AVSS scheme, we design a statistical AMPC protocol with *n*=4*t*+1 which requires an amortized communication of O(n2)

field elements per multiplication gate. Though this protocol has non-optimal resilience, it significantly improves the communication complexity of the existing statistical AMPC protocols.

3.We then present a perfect AMPC protocol with *n*=4*t*+1 (using our perfect AVSS scheme), which also incurs an amortized communication of O(n2)

Original language | English |
---|---|

Pages (from-to) | 49-109 |

Number of pages | 61 |

Journal | Journal of Cryptology |

Volume | 28 |

Issue number | 1 |

Early online date | 11 Dec 2013 |

DOIs | |

Publication status | Published - Jan 2015 |

### Fingerprint

### Keywords

- Unconditional security
- Fault tolerance
- Communication complexity

### Cite this

*Journal of Cryptology*,

*28*(1), 49-109. https://doi.org/10.1007/s00145-013-9172-7