Byzantine Generals Problem in the Light of P2P Computing

Natalya  Fedotova; Luca  Veltri

1st International ICST Workshop on Ubiquitous Access Control

Research Article

Byzantine Generals Problem in the Light of P2P Computing

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/MOBIQW.2006.361758,
    author={Natalya  Fedotova and Luca  Veltri},
    title={Byzantine Generals Problem in the Light of P2P Computing},
    proceedings={1st International ICST Workshop on Ubiquitous Access Control},
    publisher={IEEE},
    proceedings_a={IWUAC},
    year={2007},
    month={5},
    keywords={},
    doi={10.1109/MOBIQW.2006.361758}
}

Natalya Fedotova
Luca Veltri
Year: 2007
Byzantine Generals Problem in the Light of P2P Computing
IWUAC
IEEE
DOI: 10.1109/MOBIQW.2006.361758

Natalya Fedotova¹, Luca Veltri¹

1: Dept. of Inf. Eng., Parma Univ.

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

Published: 2007-05-21
Publisher: IEEE

: http://dx.doi.org/10.1109/MOBIQW.2006.361758

Byzantine Generals Problem in the Light of P2P Computing

Abstract

About EAI

Community

Publish with EAI