Robustness and efficiency of leaderless probabilistic consensus protocols within Byzantine infrastructures

11/20/2019
by   Angelo Capossele, et al.
0

This paper investigates leaderless binary majority consensus protocols with low computational complexity in noisy Byzantine infrastructures. Using computer simulations, we show that explicit randomization of the consensus protocol can significantly increase the robustness towards faulty and malicious nodes. We identify the optimal amount of randomness for various Byzantine attack strategies on different kinds of network topologies.

READ FULL TEXT

page 14

page 15

page 16

page 17

research
11/23/2019

No Need for Recovery: A Simple Two-Step Byzantine Consensus

In this paper, we give a deterministic two-step Byzantine consensus prot...
research
04/12/2021

Voting-based probabilistic consensuses and their applications in distributed ledgers

We review probabilistic models known as majority dynamics (also known as...
research
05/15/2021

Byzantine-Resilient Population Protocols

Population protocols model information spreading in networks where pairw...
research
08/17/2022

Robustness of the Tangle 2.0 Consensus

In this paper, we investigate the performance of the Tangle 2.0 consensu...
research
06/01/2020

Fast Probabilistic Consensus with Weighted Votes

The fast probabilistic consensus (FPC) is a voting consensus protocol th...
research
05/11/2019

Another Look at ALGORAND

ALGORAND is a celebrated public ledger technology designed by Dr. Micali...
research
06/19/2020

Stateless Distributed Ledgers

In public distributed ledger technologies (DLTs), such as Blockchains, n...

Please sign up or login with your details

Forgot password? Click here to reset