Revisiting hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost
| dc.contributor.author | Shrestha, Nibesh | |
| dc.contributor.author | Kumar, Mohan | |
| dc.contributor.author | Duan, SiSi | |
| dc.date.accessioned | 2019-03-15T15:13:49Z | |
| dc.date.available | 2019-03-15T15:13:49Z | |
| dc.date.issued | 2019-02-25 | |
| dc.description.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. | en |
| dc.description.uri | https://arxiv.org/abs/1902.08505 | en |
| dc.format.extent | 4 pages | en |
| dc.genre | articles | en |
| dc.identifier | doi:10.13016/m2wc0c-5wmc | |
| dc.identifier.citation | Nibesh Shrestha, Mohan Kumar, SiSi Duan, Revisiting hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost, 2019, https://arxiv.org/abs/1902.08505 | en |
| dc.identifier.uri | http://hdl.handle.net/11603/13070 | |
| dc.language.iso | en | en |
| dc.relation.isAvailableAt | The University of Maryland, Baltimore County (UMBC) | |
| dc.relation.ispartof | UMBC Information Systems Department Collection | |
| dc.relation.ispartof | UMBC Faculty Collection | |
| dc.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. | |
| dc.subject | FaB Paxos | en |
| dc.subject | two-step byzantine fault tolerant consensus protocol | en |
| dc.subject | hBFT protocol | en |
| dc.title | Revisiting hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost | en |
| dc.type | Text | en |