Degradable Byzantine Agreement

Authors:
Nitin H. Vaidya;Dhiraj K. Pradhan
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1995

Citing 5
Cited 0

On the possibility and impossibility of achieving clock synchronization

Journal of Computer and System Sciences
The fault-tolerant multiprocessor computer

The fault-tolerant multiprocessor computer
Optimal clock synchronization

Journal of the ACM (JACM)
The Weak Byzantine Generals Problem

Journal of the ACM (JACM)
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	14.99

Visualization

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