Two More Algorithms for Randomized Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3 and O(n^2) Messages and O(1) Round Expected Termination

by   Tyler Crain, et al.

This work describes two randomized, asynchronous, round based, Binary Byzantine faulty tolerant consensus algorithms based on the algorithms of [25] and [26]. Like the algorithms of [25] and [26] they do not use signatures, use O(n^2) messages per round (where each message is composed of a round number and a constant number of bits), tolerate up to one third failures, and have expected termination in constant number of rounds. The first, like [26], uses a weak common coin (i.e. one that can return different values at different processes with a constant probability) to ensure termination. The algorithm consists of 5 to 7 message broadcasts per round. An optimization is described that reduces this to 4 to 5 broadcasts per round for rounds following the first round. Comparatively, [26] consists of 8 to 12 message broadcasts per round. The second algorithm, like [25], uses a perfect common coin (i.e. one that returns the same value at all non-faulty processes) for both termination and correctness. Unlike [25], it does not require a fair scheduler to ensure termination. Furthermore, the algorithm consists of 2 to 3 message broadcasts for the first round and 1 to 2 broadcasts for the following rounds, while [29] consists of 2 to 3 broadcasts per round.


page 1

page 2

page 3

page 4


A Simple and Efficient Asynchronous Randomized Binary Byzantine Consensus Algorithm

This paper describes a simple and efficient asynchronous Binary Byzantin...

A Simple and Efficient Binary Byzantine Consensus Algorithm using Cryptography and Partial Synchrony

This paper describes a simple and efficient Binary Byzantine faulty tole...

Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR

State Machine Replication (SMR) solutions often divide time into rounds,...

Consensus in the Unknown-Participation Message-Adversary Model

We propose a new model that resembles Algorand's mechanism that selects ...

Relaxed Paxos: Quorum Intersection Revisited (Again)

Distributed consensus, the ability to reach agreement in the face of fai...

Message Reduction in the Local Model is a Free Lunch

A new spanner construction algorithm is presented, working under the LOC...

Please sign up or login with your details

Forgot password? Click here to reset