A simple Byzantine Generals protocol

Authors:
Junxing Wang
Affiliations:
Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China 100084
Venue:
Journal of Combinatorial Optimization
Year:
2014

Citing 4
Cited 0

Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms

Distributed Algorithms
Distributed Computing: Fundamentals, Simulations and Advanced Topics

Distributed Computing: Fundamentals, Simulations and Advanced Topics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Byzantine Generals Problem is a classical problem in distributed computing that models a system's resiliency against arbitrary adversarial faults. The existing solutions to this problem tend to be quite intricate and many of them employ some form of recursion. This paper gives a new algorithm that solves the problem in an exceptionally simple straight-line program.