IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-319-04720-1_25.html
   My bibliography  Save this book chapter

The Byzantine Generals Problem in Generic and Wireless Networks

In: Applications of Mathematics and Informatics in Science and Engineering

Author

Listed:
  • Chris Litsas

    (National Technical University of Athens (NTUA))

  • Aris T. Pagourtzis

    (National Technical University of Athens (NTUA))

  • Dimitris Sakavalas

    (National Technical University of Athens (NTUA))

Abstract

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.

Suggested Citation

  • Chris Litsas & Aris T. Pagourtzis & Dimitris Sakavalas, 2014. "The Byzantine Generals Problem in Generic and Wireless Networks," Springer Optimization and Its Applications, in: Nicholas J. Daras (ed.), Applications of Mathematics and Informatics in Science and Engineering, edition 127, pages 405-415, Springer.
    • Handle: RePEc:spr:spochp:978-3-319-04720-1_25
    DOI: 10.1007/978-3-319-04720-1_25
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-3-319-04720-1_25. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.