Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms

Zhang, Gengrui; Pan, Fei; Dang'ana, Michael; Mao, Yunhao; Shashank, Motepalli,; Zhang, Shiquan; Jacobsen, Hans‐Arno

doi:10.48550/arxiv.2204.03181

Cited by 6 publications

(10 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The quality and convergence of the model is influenced by Byzantine and inactive users. Inactive users may cause a slow convergence and Byzantine users may destroy the model [19]. Currently, some typical approaches to detect Byzantine users include Hessian vector product [20], Euclidean distance (ED) [21], and Trimmed-Mean and Median [22] based approaches.…”

Section: A Related Workmentioning

confidence: 99%

“…Byzantine for a K users FL [19], where   represents the round down to the nearest integer. For clarity, the used notations and the corresponding descriptions are summarized in Table 1.…”

Section: • Lower Baseline Modelmentioning

confidence: 99%

“…In practical applications, there may exist some Byzantine or inactive users, the loss function ( 1) cannot be directly applied, as Byzantine users may update the model arbitrarily and inactive users update the model slowly [19]. The loss function is modified as 11…”

Section: B Loss Function Modification With Byzantine and Inactive Usersmentioning

confidence: 99%

See 2 more Smart Citations

Toward Federated Learning With Byzantine and Inactive Users: A Game Theory Approach

et al. 2023

View full text Add to dashboard Cite

Federated learning (FL) can guarantee privacy by allowing local users only upload their training models to central server (CS). However, the existence of Byzantine or inactive users may cause model corruption or inactively participation in FL. In this paper, a game theory based detection and incentive method is designed for Byzantine and inactive users. Specifically, a differential aggregate gradient descent (DAGD) algorithm is adopted to improve the stability and fasten the convergence. Then the loss function is modified by considering Byzantine and inactive users. For Byzantine users, a random Euclidean distance (RED) voting method is designed to identify Byzantine users, and after identification, Byzantine users are motivated by the game theory. For inactive users, when inactive users are detected by contribution, Nash equilibrium with a mixed strategy is used to solve the problem of inactive users' participation in FL. Extensive experimental results show that Byzantine users and inactive users can be detected and motivated by the algorithm. Meanwhile, compared with other methods, the accuracy of the optimized model is improved with reduced training time.

show abstract

Section: A Related Workmentioning

confidence: 99%

Section: • Lower Baseline Modelmentioning

confidence: 99%

See 1 more Smart Citation

Toward Federated Learning With Byzantine and Inactive Users: A Game Theory Approach

et al. 2023

View full text Add to dashboard Cite

show abstract

“…Byzantine fault tolerance refers to nodes that behave arbitrarily after the seminal work by Lamport, et al [155]. BFT protocols have been analyzed in several surveys and empirical studies [6,7,21,27,43,49,52,68,88,95,110,121,194,209,231]. We discuss some of the more relevant studies.…”

Section: Related Workmentioning

confidence: 99%

“…The paper compares these two classes of protocols and analyzes their performance and correctness attacks. Three families of leader-based, leaderless, and robust BFT protocols with focus on message and time complexities have been analyzed in [231]. Finally, in [95], BFT protocols are analyzed along several main dimensions of architecture, clients, agreement, execution, checkpoint, and recovery.…”

Section: Related Workmentioning

confidence: 99%

The Bedrock of Byzantine Fault Tolerance: A Unified Platform for BFT Protocol Design and Implementation

Amiri¹,

Wu²,

Agrawal³

et al. 2022

Preprint

View full text Add to dashboard Cite

Byzantine fault-tolerant protocols cover a broad spectrum of design dimensions from environmental setting on communication topology, to more technical features such as commitment strategy and even fundamental social choice related properties like order fairness. Designing and building BFT protocols remains a laborious task despite of years of intensive research. The proliferation of different BFT protocols has rendered it difficult to navigate BFT landscape, let alone determine the protocol that best meets application needs. This paper presents BEDROCK, a unified platform for BFT protocols design and implementation. BEDROCK exposes an API that presents a set of design choices capturing the trade-offs between different design space dimensions in BFT implementations. Based on user choices, BEDROCK then generates the BFT protocols within the space of plausible choices, evolves current protocols to generate new ones, and even uncovers previously unknown protocols. Our experimental results validate the capability of BEDROCK in deriving existing and new BFT protocols.

show abstract

A Survey and Comparison of Post-Quantum and Quantum Blockchains

Yang,

Alfauri,

Farkiani

et al. 2024

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

Blockchains have gained substantial attention from academia and industry for their ability to facilitate decentralized trust and communications. However, the rapid progress of quantum computing poses a significant threat to the security of existing blockchain technologies. Notably, the emergence of Shor's and Grover's algorithms raises concerns regarding the compromise of the cryptographic systems underlying blockchains. Consequently, it is essential to develop methods that reinforce blockchain technology against quantum attacks. In response to this challenge, two distinct approaches have been proposed. The first approach involves post-quantum blockchains, which aim to utilize classical cryptographic algorithms resilient to quantum attacks. The second approach explores quantum blockchains, which leverage the power of quantum computers and networks to rebuild the foundations of blockchains. This paper aims to provide a comprehensive overview and comparison of post-quantum and quantum blockchains while exploring open questions and remaining challenges in these domains. It offers an in-depth introduction, examines differences in blockchain structure, security, privacy, and other key factors, and concludes by discussing current research trends.

show abstract

Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms

Cited by 6 publications

References 54 publications

Toward Federated Learning With Byzantine and Inactive Users: A Game Theory Approach

Toward Federated Learning With Byzantine and Inactive Users: A Game Theory Approach

The Bedrock of Byzantine Fault Tolerance: A Unified Platform for BFT Protocol Design and Implementation

A Survey and Comparison of Post-Quantum and Quantum Blockchains

Contact Info

Product

Resources

About