Fully polynomial byzantine agreement for n > 3t processors in t + 1 rounds

Juan A. Garay; Yoram Moses

doi:10.1137/S0097539794265232

Fully polynomial byzantine agreement for n > 3t processors in t + 1 rounds

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

Abstract

This paper presents a polynomial-time protocol for reaching Byzantine agreement in t + 1 rounds whenever n > 3t, where n is the number of processors and t is an a priori upper bound on the number of failures. This resolves an open problem presented by Pease, Shostak, and Lamport in 1980. An early-stopping variant of this protocol is also presented, reaching agreement in a number of rounds that is proportional to the number of processors that actually fail.

Original language	English
Pages (from-to)	247-290
Number of pages	44
Journal	SIAM Journal on Computing
Volume	27
Issue number	1
DOIs	https://doi.org/10.1137/S0097539794265232
State	Published - Feb 1998
Externally published	Yes

Keywords

Byzantine agreement
Computer security
Consensus
Distributed computing
Fault tolerance

ASJC Scopus subject areas

General Computer Science
General Mathematics

Access to Document

10.1137/S0097539794265232

Cite this

@article{c1891035f9d74b38950479add380d88c,

title = "Fully polynomial byzantine agreement for n > 3t processors in t + 1 rounds",

abstract = "This paper presents a polynomial-time protocol for reaching Byzantine agreement in t + 1 rounds whenever n > 3t, where n is the number of processors and t is an a priori upper bound on the number of failures. This resolves an open problem presented by Pease, Shostak, and Lamport in 1980. An early-stopping variant of this protocol is also presented, reaching agreement in a number of rounds that is proportional to the number of processors that actually fail.",

keywords = "Byzantine agreement, Computer security, Consensus, Distributed computing, Fault tolerance",

author = "Garay, {Juan A.} and Yoram Moses",

year = "1998",

month = feb,

doi = "10.1137/S0097539794265232",

language = "אנגלית",

volume = "27",

pages = "247--290",

number = "1",

}

TY - JOUR

T1 - Fully polynomial byzantine agreement for n > 3t processors in t + 1 rounds

AU - Garay, Juan A.

AU - Moses, Yoram

PY - 1998/2

Y1 - 1998/2

N2 - This paper presents a polynomial-time protocol for reaching Byzantine agreement in t + 1 rounds whenever n > 3t, where n is the number of processors and t is an a priori upper bound on the number of failures. This resolves an open problem presented by Pease, Shostak, and Lamport in 1980. An early-stopping variant of this protocol is also presented, reaching agreement in a number of rounds that is proportional to the number of processors that actually fail.

AB - This paper presents a polynomial-time protocol for reaching Byzantine agreement in t + 1 rounds whenever n > 3t, where n is the number of processors and t is an a priori upper bound on the number of failures. This resolves an open problem presented by Pease, Shostak, and Lamport in 1980. An early-stopping variant of this protocol is also presented, reaching agreement in a number of rounds that is proportional to the number of processors that actually fail.

KW - Byzantine agreement

KW - Computer security

KW - Consensus

KW - Distributed computing

KW - Fault tolerance

UR - http://www.scopus.com/inward/record.url?scp=0012525797&partnerID=8YFLogxK

U2 - 10.1137/S0097539794265232

DO - 10.1137/S0097539794265232

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

AN - SCOPUS:0012525797

SN - 0097-5397

VL - 27

SP - 247

EP - 290

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 1

ER -

Fully polynomial byzantine agreement for n > 3t processors in t + 1 rounds

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this