Finding traitors in secure networks using Byzantine agreements

Liam Wagner, Stuart McDonald

Research output: Journal PublicationArticlepeer-review


Secure networks rely upon players to maintain security and reliability. However not every player can be assumed to have total loyalty and one must use methods to uncover traitors in such networks. We use the original concept of the Byzantine Generals Problem by Lamport [8], and the more formal Byzantine Agreement describe by Linial [10], to and traitors in secure networks. By applying general fault-tolerance methods to develop a more formal design of secure networks we are able to uncover traitors amongst a group of players. We also propose methods to integrate this system with insecure channels. This new resiliency can be applied to broadcast and peer-to-peer secure communication systems where agents may be traitors or become unreliable due to faults.

Original languageEnglish
Pages (from-to)11-17
Number of pages7
JournalInternational Journal of Network Security
Issue number1
Publication statusPublished - 2010


  • Byzantine agreement
  • Distributed systems
  • Fault tolerance
  • Message authentication
  • Secure communication

ASJC Scopus subject areas

  • Computer Networks and Communications


Dive into the research topics of 'Finding traitors in secure networks using Byzantine agreements'. Together they form a unique fingerprint.

Cite this