On the number of authenticated rounds in Byzantine Agreement

  • Malte Borcherding
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 972)


Byzantine Agreement requires a set of nodes in a distributed system to agree on the message of a sender despite the presence of arbitrarily faulty nodes. Solutions for this problem are generally divided into two classes: authenticated protocols and non-authenticated protocols. In the former class, all messages are (digitally) signed and can be assigned to their respective signers, while in the latter no messages are signed. Authenticated protocols can tolerate an arbitrary number of faults, while non-authenticated protocols require more than two thirds of the nodes to be correct.

In this paper, we investigate the fault tolerance of protocols that require signatures in a certain number of communication rounds only. We show that a protocol that is to tolerate one half of the nodes as faulty needs only few authenticated rounds (logarithmic in the number of nodes), while tolerating more faults requires about two authenticated rounds per additional faulty node.


Byzantine Agreement fault tolerance distributed systems authentication 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BNDDS87]
    Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, and H. Raymond Strong. Shifting gears: Changing algorithms on the fly to expedite Byzantine Agreement. In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing (PODC), pages 42–51, Vancouver, 1987.Google Scholar
  2. [DS83]
    Danny Dolev and Raymond Strong. Authenticated algorithms for Byzantine Agreement. SIAM Journal of Computing, 12(5):656–666, November 1983.CrossRefGoogle Scholar
  3. [FL82]
    Michael J. Fischer and Nancy A. Lynch. A lower bound for the time to assure interactive consistency. Information Processing Letters, 14(4):183–186, 1982.CrossRefGoogle Scholar
  4. [LSP82]
    Leslie Lamport, Robert Shostak, and Marshall Pease. The Byzantine Generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382–401, 1982.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Malte Borcherding
    • 1
  1. 1.Institute of Computer Design and Fault ToleranceUniversity of KarlsruheKarlsruhe

Personalised recommendations