A new solution for the Byzantine generals problem

  • Rüdiger K. Reischuk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)


We define a new model for algorithms to reach Byzantine Agreement. It allows to measure the complexity more accurately, to differentiate between processor faults and to include communication link failures. A deterministic algorithm is presented that exhibits early stopping by phase 2f+4 in the worst case, where f is the actual number of faults, under less stringent conditions than the ones of previous algorithms. Also its average performance can easily be analysed making realistic assumptions on random distributions of faults. We show that it stops with high probability after a small number of phases.


Link Failure Fault Recovery Byzantine Agreement State Transition Function Faulty Processor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Da]
    D. Dolev, "The Byzantine Generals Strike Again", Journal of Algorithm, vol. 3, no. 1, 1982.Google Scholar
  2. [Db]
    D. Dolev, "Unanimity in an Unknown and Unreliable Environment", 22nd Annual Symposium on Foundations of Computer Science, pp. 159–168, 1981.Google Scholar
  3. [DFFLS]
    D. Dolev, M. Fischer, R. Fowler, N. Lynch and R. Strong, "Efficient Byzantine Agreement Without Authentication", IBM Research Report RJ3428, 1982.Google Scholar
  4. [DR]
    D. Dolev and R. Reischuk, "Bounds on Information Exchange for Byzantine Agreement", Proceedings, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Ottawa, August 1982, IBM Research Report, RJ3587, 1982.Google Scholar
  5. [DRS]
    D. Dolev, R. Reischuk and H.R. Strong, "'Eventual’ is earlier than ‘Immediate'", 23rd IEEE-FOCS Conference, Chicago, November 1982, IBM Research Report RJ3632, 1982.Google Scholar
  6. [DSa]
    D. Dolev and H.R. Strong, "Polynomial algorithms for multiple processor agreement", Proceedings, the 14th ACM SIGACT Symposium on Theory of Computing, May 1982, IBM Research Report RJ3342, 1981.Google Scholar
  7. [DSb]
    D. Dolev and H.R. Strong; "Authenticated Algorithms for Byzantine Agreement", IBM Research Report RJ3416, 1982.Google Scholar
  8. [DSc]
    D. Dolev and H.R. Strong, "Distributed Commit with Bounded Waiting", Proceedings, Second Symposium on Reliability in Distributed Software and Database Systems, Pittsburgh, July 1982, IBM Research Report RJ3417, 1982.Google Scholar
  9. [DSd]
    D. Dolve and H.R. Strong, "Requirements for Agreement in a Distributed System", Proceedings, the Second International Symposium on Distributed Data Bases, Berlin, Sep. 1982, IBM Research Report RJ3418, 1982.Google Scholar
  10. [FFL]
    M. Fischer, R. Fowler and N. Lynch, "A Simple and Efficient Byzantine Generals Algorithm", Proceedings, Second Symposium on Reliability in Distributed Software and Database Systems, Pittsburgh, July 1982.Google Scholar
  11. [FLy]
    M. Fischer and N. Lynch, "A lower Bound for the Time to Assure Interactive Consistency", Information Processing Letters, to appear.Google Scholar
  12. [LM]
    L. Lamport and P.M. Melliar-Smith, "Synchronizing Clocks in the Presence of Faults", Technical Report, Computer Science Laboratory, March 1982.Google Scholar
  13. [PSL]
    M. Pease, R. Shostak and L. Lamport, "Reaching Agreement in the Presence of Faults", JACM 27, 1980, 228–234.CrossRefGoogle Scholar
  14. [R]
    R. Reischuk, "A New Solution for the Byzantine Generals Problem", IBM Research Report RJ3673, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Rüdiger K. Reischuk
    • 1
  1. 1.Fachbereich InformatikUniversität des SaarlandesSaarbrückenWest-Germany

Personalised recommendations