Revisiting hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost

Thumbnail Image

Files

1902.08505.pd.pdf (87.2 KB)

Links to Files

https://arxiv.org/abs/1902.08505

Permanent Link

http://hdl.handle.net/11603/13070

Collections

UMBC Information Systems Department
UMBC Faculty Collection

Author/Creator

Author/Creator ORCID

Date

2019-02-25

Type of Work

articles
Text

Department

Program

Citation of Original Publication

Nibesh Shrestha, Mohan Kumar, SiSi Duan, Revisiting hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost, 2019, https://arxiv.org/abs/1902.08505

Rights

This item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.

Subjects

FaB Paxos
two-step byzantine fault tolerant consensus protocol
hBFT protocol

Abstract

FaB Paxos sets a lower bound of 5f + 1 replicas for any two-step consensus protocols tolerating f byzantine failures. Yet, hBFT 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.