The Next 700 BFT Protocols

Aublin, Pierre-Louis; Guerraoui, Rachid; Knezevic, N.; Quéma, Vivien; Vukolić, Marko

doi:10.1145/2658994

Cited by 110 publications

(113 citation statements)

References 34 publications

Supporting

Mentioning

108

Contrasting

Order By: Relevance

“…Also, our optimizer is generic while Zyzzyva and FaB are specialized solutions. A generic construction for optimized Byzantine consensus protocols appears in [3] along with its Aliph and Azyzzyva instantiations. The construction in [3] enables switching between Byzantine consensus protocols depending on the changing environment conditions in a safe manner.…”

Section: Related Workmentioning

confidence: 99%

A Generic Efficient Biased Optimizer for Consensus Protocols

Buchnik

Friedman

2020

Proceedings of the 21st International Conference on Distributed Computing and Networking

View full text Add to dashboard Cite

Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based faulttolerant systems and in particular in multiple recent blockchain solutions. Depending on its exact variant and other environmental assumptions, solving consensus requires multiple communication rounds. Yet, there are known optimistic protocols that guarantee termination in a single communication round under favorable conditions.In this paper we present a generic optimizer than can turn any consensus protocol into an optimized protocol that terminates in a single communication round whenever all nodes start with the same predetermined value and no Byzantine failures occur (although node crashes are allowed). This is regardless of the network timing assumptions and additional oracle capabilities assumed by the base consensus protocol being optimized.In the case of benign failures, our optimizer works whenever the number of faulty nodes f < n/2. For Byzantine behavior, our optimizer's resiliency depends on the validity variant sought. In the case of classical validity, it can accommodate f < n/4 Byzantine failures. With the more recent external validity function assumption, it works whenever f < n/3. Either way, our optimizer only relies on oral messages, thereby imposing very light-weight crypto requirements.

show abstract

Section: Related Workmentioning

confidence: 99%

A Generic Efficient Biased Optimizer for Consensus Protocols

Buchnik

Friedman

2020

Proceedings of the 21st International Conference on Distributed Computing and Networking

View full text Add to dashboard Cite

show abstract

“…The influential Practical Byzantine Fault Tolerance consensus protocol (Pbft) [18,19] is centralized, as it relies on a single primary replica to coordinate all consensus decisions, and requires a vast amount of global communication (between all pairs of replicas). Protocols such as Zyzzyva improve on this by reducing communication costs in the optimal case [9,62,63]. However, these protocols still have a highly centralized design and do not favor local communication.…”

Section: Challenges For Geo-scale Blockchainsmentioning

confidence: 99%

“…Hence, n = 3f + j for some j ≥ 1. We use the same failure model as Steward [5], but our failure model differs from the more-general failure model utilized by Pbft, Zyzzyva, and HotStuff [9,18,19,62,63,94]. These protocols can each tolerate the failure of up-to-zn/3 = (3fz + zj)/3 = fz + zj/3 replicas, even if more than f of these failures happen in a single region; whereas GeoBFT and Steward can only tolerate fz failures, of which at most f can happen in a single cluster.…”

Section: Preliminariesmentioning

confidence: 99%

“…Let S be a system and let C ∈ S be a cluster with n > 3f . We have the following: 2 Other consensus protocols such as Zyzzyva [9,62,63] and HotStuff [94] promise to improve on Pbft by sharply reducing communication. In our setting, where local communication is abundant (see Table 1), such improvements are unnecessary, and the costs of Zyzzyva (reliable clients) and HotStuff (high computational complexity) can be avoided.…”

Section: Local Replicationmentioning

confidence: 99%

See 1 more Smart Citation

ResilientDB

et al. 2020

View full text Add to dashboard Cite

Recent developments in blockchain technology have inspired innovative new designs in resilient distributed and database systems. At their core, these blockchain applications typically use Byzantine fault-tolerant consensus protocols to maintain a common state across all replicas, even if some replicas are faulty or malicious. Unfortunately, existing consensus protocols are not designed to deal with geo-scale deployments in which many replicas spread across a geographically large area participate in consensus.To address this, we present the Geo-Scale Byzantine Fault-Tolerant consensus protocol (GeoBFT). GeoBFT is designed for excellent scalability by using a topological-aware grouping of replicas in local clusters, by introducing parallelization of consensus at the local level, and by minimizing communication between clusters. To validate our vision of high-performance geo-scale resilient distributed systems, we implement GeoBFT in our efficient ResilientDB permissioned blockchain fabric. We show that GeoBFT is not only sound and provides great scalability, but also outperforms state-of-the-art consensus protocols by a factor of six in geo-scale deployments.

show abstract

“…This comes, however, often at the expense of robustness in the presence of Byzantine faults [16], not to mention that correctness proofs for the respective protocols and the implementation of state machine replication are notoriously difficult [8].…”

Section: Byzantine Consensus In the Partially Synchronous Modelmentioning

confidence: 99%

Byzantine set-union consensus using efficient set reconciliation

Dold

Grothoff

2017

EURASIP J. on Info. Security

View full text Add to dashboard Cite

Applications of secure multiparty computation such as certain electronic voting or auction protocols require Byzantine agreement on large sets of elements. Implementations proposed in the literature so far have relied on state machine replication and reach agreement on each individual set element in sequence. We introduce set-union consensus, a specialization of Byzantine consensus that reaches agreement over whole sets. This primitive admits an efficient and simple implementation by the composition of Eppstein's set reconciliation protocol with Ben-Or's ByzConsensus protocol. A free software implementation of this construction is available in GNUnet. Experimental results indicate that our approach results in an efficient protocol for very large sets, especially in the absence of Byzantine faults. We show the versatility of set-union consensus by using it to implement distributed key generation, ballot collection, and cooperative decryption for an electronic voting protocol implemented in GNUnet. This is a revised and extended version of a paper published under the same title at ARES 2016.

show abstract

The Next 700 BFT Protocols

Cited by 110 publications

References 34 publications

A Generic Efficient Biased Optimizer for Consensus Protocols

A Generic Efficient Biased Optimizer for Consensus Protocols

ResilientDB

Byzantine set-union consensus using efficient set reconciliation

Contact Info

Product

Resources

About