Improved Extension Protocols for Byzantine Broadcast and Agreement

by   Kartik Nayak, et al.

Byzantine broadcast (BB) and Byzantine agreement (BA) are two most fundamental problems and essential building blocks in distributed computing, and improving their efficiency is of interest to both theoreticians and practitioners. In this paper, we study extension protocols of BB and BA, i.e., protocols that solve BB/BA with long inputs of l bits using lower costs than l single-bit instances. We present new protocols with improved communication complexity in almost all settings: unauthenticated BA/BB with t<n/3, authenticated BA/BB with t<n/2, authenticated BB with t<(1-ϵ)n, and asynchronous reliable broadcast and BA with t<n/3. The new protocols are advantageous and significant in several aspects. First, they achieve the best-possible communication complexity of Θ(nl) for wider ranges of input sizes compared to prior results. Second, the authenticated extension protocols achieve optimal communication complexity given the best available BB/BA protocols for short messages. Third, to the best of our knowledge, our asynchronous and authenticated protocols in the setting are the first extension protocols in that setting.


page 1

page 2

page 3

page 4


Reliable Broadcast in Practical Networks: Algorithm and Evaluation

Reliable broadcast is an important primitive to ensure that a source nod...

Alea-BFT: Practical Asynchronous Byzantine Fault Tolerance

Traditional Byzantine Fault Tolerance (BFT) state machine replication pr...

Optimal Communication Complexity of Byzantine Consensus under Honest Majority

Communication complexity is one of the most important efficiency metrics...

Cordial Miners: Blocklace-Based Ordering Consensus Protocols for Every Eventuality

Cordial Miners are a family of efficient Byzantine Atomic Broadcast prot...

Bolt-Dumbo Transformer: Asynchronous Consensus As Fast As Pipelined BFT

Optimistic asynchronous atomic broadcast was proposed to improve the per...

Boosting Byzantine Protocols in Large Sparse Networks with High System Assumption Coverage

To improve the overall efficiency and reliability of Byzantine protocols...

Oracular Byzantine Reliable Broadcast [Extended Version]

Byzantine Reliable Broadcast (BRB) is a fundamental distributed computin...