## Abstract

Secure multi-party computation (MPC) is a fundamental problem in secure distributed computing. The optimal resilience for perfectly-secure MPC in synchronous and asynchronous networks is t < n/3 and t < n/4 respectively, where n is the number of parties and t is the number of corruptions. A natural question is whether there exists a protocol tolerating ts < n/3 corruptions in a synchronous network and ta < n/4 corruptions in an asynchronous network. We design such a protocol, if 3ts + ta < n. For our protocol, we present a perfectly-secure Byzantine agreement (BA) protocol, tolerating t < n/3 corruptions in any network and a perfectly-secure verifiable secret-sharing (VSS) protocol, tolerating ts and ta corruptions in a synchronous and an asynchronous network respectively.

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

Title of host publication | PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing |

Publisher | Association for Computing Machinery |

Pages | 92-102 |

Number of pages | 11 |

ISBN (Electronic) | 9781450392624 |

DOIs | |

State | Published - 20 Jul 2022 |

Externally published | Yes |

Event | 41st ACM Symposium on Principles of Distributed Computing, PODC 2022 - Salerno, Italy Duration: 25 Jul 2022 → 29 Jul 2022 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Principles of Distributed Computing |
---|

### Conference

Conference | 41st ACM Symposium on Principles of Distributed Computing, PODC 2022 |
---|---|

Country/Territory | Italy |

City | Salerno |

Period | 25/07/22 → 29/07/22 |

### Bibliographical note

Publisher Copyright:© 2022 ACM.

## Keywords

- byzantine agreement
- secret-sharing
- unconditional-security