Byzantine Generals Problem in the Light of P2P Computing

摘要

Security problems in P2P environment become more complicated with the growing number of P2P networks and applications. Hence, it is very important to find reliable mechanisms of detection and elimination of various threats, attack sources, and malicious nodes. In this paper we consider how it is possible to apply some classical solutions for Byzantine Generals Problem (BGP), originally described by Lamport and Shostak, in a P2P environment to solve such problems.