Revisiting hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost

02/22/2019
by   Nibesh Shrestha, et al.
0

FaB Paxos[5] sets a lower bound of 5f + 1 replicas for any two-step consensus protocols tolerating f byzantine failures. Yet, hBFT[3] promises a two-step consensus protocol with only 3f + 1 replicas. As a result, it violates safety property of a consensus protocol. In this note, we review the lower bound set by FaB Paxos and present a simple execution scenario that produces a safety violation in hBFT. To demonstrate the scenario, we require a relatively simple setup with only 4 replicas and one view-change.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
12/04/2017

Revisiting Fast Practical Byzantine Fault Tolerance

In this note, we observe a safety violation in Zyzzyva and a liveness vi...
research
01/26/2018

Revisiting Fast Practical Byzantine Fault Tolerance: Thelma, Velma, and Zelma

In a previous note (arXiv:1712.01367 [cs.DC]) , we observed a safety vio...
research
09/09/2019

Revisiting EZBFT: A Decentralized Byzantine Fault Tolerant Protocol with Speculation

In this note, we revisit EZBFT[2] and present safety, liveness and execu...
research
04/21/2022

An Information-theoretical Secured Byzantine-fault Tolerance Consensus in Quantum Key Distribution Network

Quantum key distribution (QKD) networks is expected to provide informati...
research
03/08/2019

Certifying Safety when Implementing Consensus

Ensuring the correctness of distributed system implementations remains a...
research
04/07/2022

Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms

Byzantine fault-tolerant (BFT) consensus algorithms are at the core of p...

Please sign up or login with your details

Forgot password? Click here to reset