Skip to main content
SpringerLink
Log in

A simple Byzantine Generals protocol

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Algorithm 1

Similar content being viewed by others

References

  • Attiya H, Welch J (2004) Distributed computing: fundamentals, simulations and advanced topics. Wiley, New York

    Book  Google Scholar 

  • Dolev D, Strong HR (1983) Authenticated algorithms for Byzantine agreement. SIAM J Comput 12(4):656–666

    Article  MATH  MathSciNet  Google Scholar 

  • Lamport L, Shostak RE, Pease MC (1982) The Byzantine Generals problem. ACM Trans Program Lang Syst 4(3):382–401

    Article  MATH  Google Scholar 

  • Lynch NA (1996) Distributed algorithms. Morgan Kaufmann, San Fransisco

    MATH  Google Scholar 

  • Pease MC, Shostak RE, Lamport L (1980) Reaching agreement in the presence of faults. J ACM 27(2):228–234

    Article  MATH  MathSciNet  Google Scholar 

Download references

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

  1. Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, 100084, China

    Junxing Wang

Authors
  1. Junxing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Junxing Wang.

Additional information

This research was supported in part by the Natural Science Foundation of China (NSFC) under grants 61033001 and 61061130540.

Rights and permissions

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-012-9534-3

Keywords

Search

Navigation