The Next 700 BFT Protocols

By Pierre-Louis Aublin, Rachid Guerraoui, N. Knežević, Vivien Quéma, Marko Vukolic. ACM Transactions on Computer Systems, 2015

381 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

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

How researchers see this paper

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

In Computer Networks and Communications

Citations in the corpus

HotStuff: BFT Consensus with Linearity and Responsiveness (2019, neutral): “, Prime [9], Zyzzyva [34], Upright [22], BFT-SMaRt [13], 700BFT [11], and SBFT [30].”
A Secure Sharding Protocol For Open Blockchains (2016, background): “It led to a ﬂoor of work on Byzantine agreement, with many attempts to improve the efﬁciency and trade-off different aspects of the performance (e.g., [48–51]).”
RBFT: Redundant Byzantine Fault Tolerance (2013, methodology): “This would require a mechanism to synchronize the state of the different instances when switching, similar to the switching mechanism of Abstract [11].”
A Scalable Multi-Layer PBFT Consensus for Blockchain (2020, methodology): “In The Next 700 BFT Protocols , the author present a method to simplify the designing of new protocols by introducing Abortable Byzantine faulT toleRant stAte maChine replicaTion ( Abstract ) as a new way to illustrated BFT [27].”
Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing (2016, methodology): “PBFT was not designed for scalability to large consensus groups: deployments and experiments often employ the minimum of four replicas [38], and generally have not explored scalability levels beyond 7 [14] or 16 replicas [16, 32, 1].”
SBFT: A Scalable and Decentralized Trust Infrastructure (2018, background): “Protocols having two modes like [11], [40], [48], [57] have to carefully handle cases where both modes provide a value to adopt and must explicitly choose the right one.”
A Survey of Distributed Consensus Protocols for Blockchain Networks (2019, background): “Well-known proposals include Quorum/Update (QU) [44], Hybrid Quorum (HQ) [45], Zyzzyva (using speculative execution) [46], FaB [47], Spinning [48], Robust BFT SMR [49], and Aliph [50].”
Security and Privacy for Green IoT-Based Agriculture: Review, Blockchain Solutions, and Challenges (2020, methodology): “Note that there are more variations of PBFT algorithm such as Aardvark [128], Zyzzyva [129], HQ [130], Q/U [131], and Abstract [132].”
The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication (2015, neutral): “Clearly, large batches negatively impact latency, but this could be addressed by Hybrid BFT protocols [2] that may combine very eﬃcient optimistic and deterministic BFT protocols (e.g., those described in [3]) with practical randomized protocols such as HoneyBadger.”
Blockchain Consensus Protocols in the Wild (2017, methodology): “Although it is well-known how to achieve this, as demonstrated by PBFT [22], many related protocols [5], as well as pedagogical descriptions of PBFT [47, 18], Tangaroa fails in at least two ways to withstand maliciously acting nodes: Liveness issue.”