A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1

TL;DR

This paper introduces a committee-based MVBA protocol that achieves asynchronous Byzantine agreement efficiently without additional communication rounds, enhancing fault-tolerant distributed systems.

Contribution

The paper proposes a novel committee-based MVBA protocol that optimizes communication and computation in asynchronous networks, achieving agreement with probability 1 without extra rounds.

Findings

Achieves agreement without extra communication rounds.

Ensures agreement with probability 1 in asynchronous networks.

Improves efficiency of Byzantine fault-tolerant protocols.

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.