EconPapers    
Economics at your fingertips  
 

The Byzantine Generals Problem in Generic and Wireless Networks

Chris Litsas (), Aris T. Pagourtzis () and Dimitris Sakavalas ()
Additional contact information
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)

A chapter in Applications of Mathematics and Informatics in Science and Engineering, 2014, pp 405-415 from Springer

Abstract: 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.

Keywords: Polynomial Protocol; Secure Broadcast; Broadcast Problem; Achieve Secure Transmission; Collision Assumption (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-04720-1_25

Ordering information: This item can be ordered from
http://www.springer.com/9783319047201

DOI: 10.1007/978-3-319-04720-1_25

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-04-01
Handle: RePEc:spr:spochp:978-3-319-04720-1_25