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.
Access this article
Rent this article via DeepDyve
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10878-012-9534-3/MediaObjects/10878_2012_9534_Fig1_HTML.gif)
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Attiya H, Welch J (2004) Distributed computing: fundamentals, simulations and advanced topics. Wiley, New York
Dolev D, Strong HR (1983) Authenticated algorithms for Byzantine agreement. SIAM J Comput 12(4):656–666
Lamport L, Shostak RE, Pease MC (1982) The Byzantine Generals problem. ACM Trans Program Lang Syst 4(3):382–401
Lynch NA (1996) Distributed algorithms. Morgan Kaufmann, San Fransisco
Pease MC, Shostak RE, Lamport L (1980) Reaching agreement in the presence of faults. J ACM 27(2):228–234
Acknowledgements
I would like to thank Prof. Andrew Yao for his encouragement and guidance on this research. I would also like to thank Prof. Danny Dolev for his helpful comments and Prof. Frances Yao for her careful reading of the manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported in part by the Natural Science Foundation of China (NSFC) under grants 61033001 and 61061130540.
Rights and permissions
About this article
Cite this article
Wang, J. A simple Byzantine Generals protocol. J Comb Optim 27, 541–544 (2014). https://doi.org/10.1007/s10878-012-9534-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-012-9534-3