A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1
Nasit S Sony, Xianzhong Ding, Mukesh Singhal
TL;DR
A committee-based MVBA protocol that achieves agreement without extra communication rounds by analyzing message patterns in asynchronous networks with probability 1, and uses verifiable proofs from these parties to finalize the agreement.
Abstract
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.