- 期刊
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. We use the original concept of the Byzantine Generals Problem by Lamport [8], and the more formal Byzantine Agreement describe by Linial [10], to find 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.
被引用紀錄
延伸閱讀
- Zhang, W., Zhu, Y., & Qin, J. (2021). Research on Network Encryption Technology and Related Algorithms. Frontiers in Science and Engineering, 1(4), 100-105. https://doi.org/10.29556/FSE.202107_1(4).0015
- Yu, C. M. (2012). Security Issues in Sensor Networks [doctoral dissertation, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2012.02611
- Shen, C. C. (2009). Cryptography in Secret Sharing Schemes Applied to Communication Systems [master's thesis, National Tsing Hua University]. Airiti Library. https://doi.org/10.6843/NTHU.2009.00581
- 廖彥智（2021）。View-Based Federated Byzantine Agreement System〔碩士論文，國立臺灣大學〕。華藝線上圖書館。https://doi.org/10.6342/NTU202100717
- Mashhadi, S. (2012). A Novel Secure Self Proxy Signature Scheme. International Journal of Network Security, 14(1), 22-26. https://doi.org/10.6633/IJNS.201201.14(1).02