The Byzantine Generals Problem

by: Lamport, Shostak, Pease

(1995)

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

rahul, rgb, SRL (group), pileWorks (group), ljcamargos, tomek0001, MatsKindahl, pcamacho, HenryR

Find related articles with these CiteULike tags

agreement, algorithms, asynchronous, broadcast, byzantine, classic, consensus, decision, distributed, distributedsystems, fault, fault-tolerance, general, generals, no-tag, problem, problems, secure, security, system, systems, tolerant

Abstract

Reliable computer systems must handle malfunctioning components that give conflicting information to different parts of the system. This situation can be expressed abstractly in terms of a group of generals of the Byzantine army camped with their troops around an enemy city. Communicating only by messenger, the generals must agree upon a common battle plan. However, one of more of them may be traitors who will try to confuse the others. The problem is to find an algorithm to ensure that the...

@incollection{citeulike:313705, abstract = {Reliable computer systems must handle malfunctioning components that give conflicting information to different parts of the system. This situation can be expressed abstractly in terms of a group of generals of the Byzantine army camped with their troops around an enemy city. Communicating only by messenger, the generals must agree upon a common battle plan. However, one of more of them may be traitors who will try to confuse the others. The problem is to find an algorithm to ensure that the...}, author = {Lamport and Shostak and Pease}, booktitle = {Advances in Ultra-Dependable Distributed Systems, N. Suri, C. J. Walter, and M. M. Hugue (Eds.), IEEE Computer Society Press}, citeulike-article-id = {313705}, keywords = {byzantine, decision, distributed, fault, general, generals, problem, problems, system, systems, tolerant}, posted-at = {2008-03-20 07:32:20}, priority = {5}, title = {The Byzantine Generals Problem}, url = {http://citeseer.ist.psu.edu/lamport82byzantine.html}, year = {1995} }

RIS record

TY - CHAP ID - citeulike:313705 L3 - citeulike-article-id:313705 TI - The Byzantine Generals Problem T2 - Advances in Ultra-Dependable Distributed Systems, N. Suri, C. J. Walter, and M. M. Hugue (Eds.), IEEE Computer Society Press N2 - Reliable computer systems must handle malfunctioning components that give conflicting information to different parts of the system. This situation can be expressed abstractly in terms of a group of generals of the Byzantine army camped with their troops around an enemy city. Communicating only by messenger, the generals must agree upon a common battle plan. However, one of more of them may be traitors who will try to confuse the others. The problem is to find an algorithm to ensure that the... KW - byzantine KW - decision KW - distributed KW - fault KW - general KW - generals KW - problem KW - problems KW - system KW - systems KW - tolerant AU - Lamport AU - Shostak AU - Pease PY - 1995/// UR - http://citeseer.ist.psu.edu/lamport82byzantine.html ER -

RIS BibTeX