The Byzantine Generals Problem in Generic and Wireless Networks

  • Chris Litsas
  • Aris T. PagourtzisEmail author
  • Dimitris Sakavalas
Part of the Springer Optimization and Its Applications book series (SOIA, volume 91)


In this chapter we consider the design of Secure Broadcast protocols in generic networks of known topology. Studying the problem of Secure Message Transmission (SMT) proves essential for achieving Broadcast in incomplete networks. We present a polynomial protocol that achieves parallel secure message transmissions between any two sets of nodes of an incomplete network provided that the weakest connectivity conditions which render the Broadcast problem solvable hold. Using the above, we show that the SMT protocol can be used as a subroutine for the simulation of any known protocol for complete networks, which leads us to protocols for generic networks which remain polynomial with respect to the measures of consideration. We extend our result to the case of wireless networks by exploiting the fact that participants are committed to perform local broadcasts, which greatly facilitates achieving an agreement.


  1. 1.
    L. Lamport, R. E. Shostak and M. C. Pease, The Byzantine Generals Problem. ACM Trans. Program. Lang. Syst. pp. 382–401. 1982.Google Scholar
  2. 2.
    B. A. Coan, Achieving consensus in fault-tolerant distributed computer systems: protocols, lower bounds, and simulations, Massachusetts Institute of Technology, 1987.Google Scholar
  3. 3.
    J. A. Garay and Y. Moses, Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds. SIAM J. Comput. pp. 247–290 1998.Google Scholar
  4. 4.
    A. Bar-Noy, D. Dolev, C. Dwork and H. R. Strong, Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement. Information and Computation pp. 205–233 1992.Google Scholar
  5. 5.
    D. Dolev, The Byzantine Generals Strike Again. J. Algorithms pp. 14–30 1982.Google Scholar
  6. 6.
    C. Y. Koo, V. Bhandari, J. Katz and N. H. Vaidya, Reliable broadcast in radio networks: the bounded collision case. PODC pp. 258–264 2006.Google Scholar
  7. 7.
    R. K. Ahuja, and T. L. Magnanti, and J. B. Orlin, Network flows: theory, algorithms, and applications. Prentice-Hall, Inc. 1993.Google Scholar
  8. 8.
    D. Dolev, C. Dwork, O. Waarts and M. Yung, Perfectly Secure Message Transmission. J. ACM, pp. 17–47, 1993.Google Scholar
  9. 9.
    A. Pelc and D. Peleg, Broadcasting with locally bounded Byzantine faults. Inf. Process. Lett., pp. 109–115, 2005.Google Scholar
  10. 10.
    Mikhail Nesterenko and Sébastien Tixeuil, Discovering Network Topology in the Presence of Byzantine Faults. IEEE Trans. Parallel Distrib. Syst. vol. 20, pp. 1777–1789, 2009.Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Chris Litsas
    • 1
  • Aris T. Pagourtzis
    • 1
    Email author
  • Dimitris Sakavalas
    • 1
  1. 1.Department of Computer Science, School of Electrical and Computer EngineeringNational Technical University of Athens (NTUA)ZographouGreece

Personalised recommendations