The Byzantine generals strike again

Danny Dolev

doi:10.1016/0196-6774(82)90004-9

The Byzantine generals strike again

Danny Dolev^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

426 Scopus citations

Abstract

Can unanimity be achieved in an unreliable distributed system? This problem was named the "Byzantine Generals Problem" by L. Lamport, R. Shostak, and M. Pease (Technical Report 54, Computer Science Laboratory, SRI International, March 1980). The results obtained in the present paper prove that unanimity is achievable in any distributed system if and only if the number of faulty processors in the system is: (1) less than one-third of the total number of processors; and (2) less than one-half of the connectivity of the system's network. In cases where unanimity is achievable, algorithms for obtaining it are given. This result forms a complete characterization of networks in the light of the Byzantine Problem.

Original language	English
Pages (from-to)	14-30
Number of pages	17
Journal	Journal of Algorithms
Volume	3
Issue number	1
DOIs	https://doi.org/10.1016/0196-6774(82)90004-9
State	Published - Mar 1982
Externally published	Yes

Access to Document

10.1016/0196-6774(82)90004-9

Cite this

@article{c235cc30c8514820a28978d11f23215c,

title = "The Byzantine generals strike again",

abstract = "Can unanimity be achieved in an unreliable distributed system? This problem was named the {"}Byzantine Generals Problem{"} by L. Lamport, R. Shostak, and M. Pease (Technical Report 54, Computer Science Laboratory, SRI International, March 1980). The results obtained in the present paper prove that unanimity is achievable in any distributed system if and only if the number of faulty processors in the system is: (1) less than one-third of the total number of processors; and (2) less than one-half of the connectivity of the system's network. In cases where unanimity is achievable, algorithms for obtaining it are given. This result forms a complete characterization of networks in the light of the Byzantine Problem.",

author = "Danny Dolev",

year = "1982",

month = mar,

doi = "10.1016/0196-6774(82)90004-9",

language = "אנגלית",

volume = "3",

pages = "14--30",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Elsevier Inc.",

number = "1",

}

TY - JOUR

T1 - The Byzantine generals strike again

AU - Dolev, Danny

PY - 1982/3

Y1 - 1982/3

N2 - Can unanimity be achieved in an unreliable distributed system? This problem was named the "Byzantine Generals Problem" by L. Lamport, R. Shostak, and M. Pease (Technical Report 54, Computer Science Laboratory, SRI International, March 1980). The results obtained in the present paper prove that unanimity is achievable in any distributed system if and only if the number of faulty processors in the system is: (1) less than one-third of the total number of processors; and (2) less than one-half of the connectivity of the system's network. In cases where unanimity is achievable, algorithms for obtaining it are given. This result forms a complete characterization of networks in the light of the Byzantine Problem.

AB - Can unanimity be achieved in an unreliable distributed system? This problem was named the "Byzantine Generals Problem" by L. Lamport, R. Shostak, and M. Pease (Technical Report 54, Computer Science Laboratory, SRI International, March 1980). The results obtained in the present paper prove that unanimity is achievable in any distributed system if and only if the number of faulty processors in the system is: (1) less than one-third of the total number of processors; and (2) less than one-half of the connectivity of the system's network. In cases where unanimity is achievable, algorithms for obtaining it are given. This result forms a complete characterization of networks in the light of the Byzantine Problem.

UR - https://www.scopus.com/pages/publications/0009768331

U2 - 10.1016/0196-6774(82)90004-9

DO - 10.1016/0196-6774(82)90004-9

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0009768331

SN - 0196-6774

VL - 3

SP - 14

EP - 30

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 1

ER -

The Byzantine generals strike again

Abstract

Access to Document

Other files and links

Fingerprint

Cite this