Computer Science – Cryptography and Security
Scientific paper
2003-08-19
Computer Science
Cryptography and Security
Accepted by International Journal of Network Security
Scientific paper
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, and the more formal Byzantine Agreement describe by Linial, to nd 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.
McDonald Stuart
Wagner Liam
No associations
LandOfFree
Finding Traitors in Secure Networks Using Byzantine Agreements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Finding Traitors in Secure Networks Using Byzantine Agreements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding Traitors in Secure Networks Using Byzantine Agreements will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-384337