A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912120235360256 |
|---|---|
| author | Sony, Nasit S Ding, Xianzhong Singhal, Mukesh |
| author_facet | Sony, Nasit S Ding, Xianzhong Singhal, Mukesh |
| contents | Multi-valued Byzantine agreement (MVBA) protocols are essential for atomic broadcast and fault-tolerant state machine replication in asynchronous networks. Despite advances, challenges persist in optimizing these protocols for communication and computation efficiency. This paper presents a committee-based MVBA protocol (cMVBA), a novel approach that achieves agreement without extra communication rounds by analyzing message patterns in asynchronous networks with probability 1. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_23477 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1 Sony, Nasit S Ding, Xianzhong Singhal, Mukesh Distributed, Parallel, and Cluster Computing Cryptography and Security Multi-valued Byzantine agreement (MVBA) protocols are essential for atomic broadcast and fault-tolerant state machine replication in asynchronous networks. Despite advances, challenges persist in optimizing these protocols for communication and computation efficiency. This paper presents a committee-based MVBA protocol (cMVBA), a novel approach that achieves agreement without extra communication rounds by analyzing message patterns in asynchronous networks with probability 1. |
| title | A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1 |
| topic | Distributed, Parallel, and Cluster Computing Cryptography and Security |
| url | https://arxiv.org/abs/2410.23477 |