Abstract
In the prior art there is described a method for achieving a Byzantine Agreement, unanimity and interactive consistency. The general context for Byzantine Agreement is a network of n processors that have a means for conducting several synchronized phases of information exchange after which they must all agree on some set of information. Byzantine Agreement results when, in the presence of undetected faulty processors, all correct processors are able to agree either on the value set by the originator or on the conclusion that the originator is faulty. The current method shows that Byzantine Agreement can be achieved for n processors handling at most t faults within min (t plus 1, F plus 2) phases for f actual faults using at most 0(n(f plus 1)T**2 plus ft**6) messages, provided that n greater than 2t**2 plus 3t plus 4 and that t greater than 1. The improvement lies in eliminating the authentication requirement and in the number of phases in case there are faults: if there are actually f greater than 0 faults, the number of phases for 0080 is T plus 2.
Original language | English |
---|---|
Pages (from-to) | 1510-1513 |
Number of pages | 4 |
Journal | IBM technical disclosure bulletin |
Volume | 27 |
Issue number | 3 |
State | Published - 1984 |