• DocumentCode
    2189936
  • Title

    Byzantine Generals Problem in the Light of P2P Computing

  • Author

    Fedotova, Natalya ; Veltri, Luca

  • Author_Institution
    Dept. of Inf. Eng., Parma Univ.
  • fYear
    2006
  • fDate
    38899
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    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
  • Keywords
    peer-to-peer computing; telecommunication security; BGP; Byzantine generals problem; P2P computing; security problems; Computer crime; Computer networks; Electronic mail; Filtering; Information analysis; Information security; Peer to peer computing; Reliability engineering; Routing; Viruses (medical); Byzantine agreement; DHT networks; attacks; component: P2P; malicious node; security; traitors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Mobile and Ubiquitous Systems: Networking & Services, 2006 Third Annual International Conference on
  • Conference_Location
    San Jose, CA
  • Print_ISBN
    1-4244-0498-3
  • Electronic_ISBN
    1-4244-0499-1
  • Type

    conf

  • DOI
    10.1109/MOBIQ.2006.340426
  • Filename
    4141779
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2189936