Degradable Byzantine agreement
Vaidya, N.H.
Pradhan, D.K.
Dept. of Comput. Sci., Texas A&M Univ., College Station, TX;
This paper appears in: Computers, IEEE Transactions on
Publication Date: Jan 1995
Volume: 44,
Issue: 1
On page(s): 146-150
ISSN: 0018-9340
References Cited: 13
CODEN: ITCOB4
INSPEC Accession Number: 4887651
Digital Object Identifier: 10.1109/12.367999
Current Version Published: 2002-08-06
Abstract
Traditional Byzantine agreement protocols require all fault-free
receivers to agree on an identical value. The proposed degradable
agreement approach achieves traditional agreement up to m faults and a
degraded form of agreement up to u faults (u⩾m), which allows
fault-free receivers to agree on at most two different values (one of
which is necessarily the default value). A degradable agreement
algorithm and lower bounds are presented
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
