Fast Byzantine Consensus

By Jean-Philippe Martin, Lorenzo Alvisi. IEEE Transactions on Dependable and Secure Computing, 2006

443 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/a59d3e0f0ceaf4b35959e13863f9c304a461567e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Classics

Citations in the corpus

The Ripple Protocol Consensus Algorithm (2014, background): “FaB Paxos [5] will tolerate (n− 1)/5 Byzantine failures in a network of n nodes, amounting”
Hybrid Consensus: Efficient Consensus in the Permissionless Model (2016, methodology): “Since classical permissioned consensus [15, 19, 21, 25, 39, 40,42,45] has been studied and optimized for decades and have been shown to achieve responsiveness against 1/3 corruptions, our idea is to use a slow blockchain protocol (called snailchain) such as Nakamoto consensus [30, 46] to bootstrap f”
A Comprehensive Review of Blockchain Consensus Mechanisms (2021, background): “The outstanding difference between the previously discussed fast paxos and FaB paxos is their failure models: fast Paxos tends to fail by a crash while FaB Paxos fails more arbitrarily, [131].”
A Survey of Distributed Consensus Protocols for Blockchain Networks (2019, background): “FaB [47], Spinning [48], Robust BFT SMR [49], and Aliph [50].”
SBFT: A Scalable and Decentralized Trust Infrastructure (2018, methodology): “Our linear message complexity fast path is based on the techniques of Zyzzyva [47], [48] and its theoretical foundations [57].”
Efficient Byzantine Fault-Tolerance (2013, background): “The main idea of these algorithms is to allow a system to automatically continue operating correctly, even if some of its components exhibit arbitrary, possibly malicious behavior [4], [12], [13], [15], [17], [19], [26], [29], [30], [39], [49].”
Zyzzyva (2007, background): “Numerous BFT agreement protocols 4,6,13,18,23,26 have used tentative execution to reduce the latency experienced by clients.”
Fast Paxos (2006, methodology): “The Fast Byzantine Consensus algorithm developed independently by Martin and Alvisi [13] is one version of the resulting algorithm.”
The latest gossip on BFT consensus (2018, background): “As explained in [9], [10], the existing BFT consensus (and SMR) algorithms for the partially synchronous system model (for example PBFT [8], [6], [11]) typically relies on the communication pattern illustrated in Figure 1 for termination.”
Fault-scalable Byzantine fault-tolerant services (2005, background): “The recent FaB Paxos protocol of Martin and Alvisi also requires one fewer phase of communication, relative to other agreement-based protocols, during stable periods in which correct processes agree upon which correct process is currently the leader (stable periods are more general than failure-free”