Finding Traitors in Secure Networks Using Byzantine Agreements
| dc.creator | Wagner, Liam | |
| dc.creator | McDonald, Stuart | |
| dc.date | 2003-08-19 | |
| dc.date | 2006-02-05 | |
| dc.date.accessioned | 2026-07-07T06:34:56Z | |
| dc.date.available | 2026-07-07T06:34:56Z | |
| dc.description | 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. | |
| dc.description | Accepted by International Journal of Network Security | |
| dc.identifier | https://arxiv.org/abs/cs/0308028 | |
| dc.identifier | http://arxiv.org/abs/cs/0308028 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/99672 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | Computer Science and Game Theory | |
| dc.subject | Multiagent Systems | |
| dc.subject | B.1.3; C.2.0; C.4.0; D.4.5; H.2.0; H.2.7 | |
| dc.title | Finding Traitors in Secure Networks Using Byzantine Agreements | |
| dc.type | text |