Finding Traitors in Secure Networks Using Byzantine Agreements
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. The authors use the original concept of the Byzantine Generals Problem by Lamport, and the more formal Byzantine Agreement describe by Linial, to find traitors in secure networks. By applying general fault-tolerance methods to develop a more formal design of secure networks they are able to uncover traitors amongst a group of players. They also propose methods to integrate this system with insecure channels.