Simple and efficient Byzantine generals algorithm
Book
·
OSTI ID:5247901
The Byzantine generals problem involves a system of n processes, t of which may be unreliable. The problem is for the reliable processes to agree on a binary value sent by a general which may itself be one of the n processes. If the general sends the same value to each process, then all reliable processes must agree on that value, but in any case, they must agree on the same value. An explicit solution is given for a binary value among n=3t+1 processes, using 2t+4 rounds and o(t/sup 3/ log t) message bits, where t bounds the number of faulty processes. This solution is easily extended to the general case of n>3t+1 to give a solution using 2t+5 rounds and o(tn+t/sup 3/ log t) message bits. 5 references.
- OSTI ID:
- 5247901
- Country of Publication:
- United States
- Language:
- English
Similar Records
Efficient algorithm for Byzantine agreement without authentication
Authenticated algorithms for Byzantine agreement
Method for achieving Byzantine agreement with early stopping and without authentication
Journal Article
·
Sun Feb 28 23:00:00 EST 1982
· Inf. Control; (United States)
·
OSTI ID:5290510
Authenticated algorithms for Byzantine agreement
Journal Article
·
Mon Oct 31 23:00:00 EST 1983
· SIAM J. Comput.; (United States)
·
OSTI ID:5170704
Method for achieving Byzantine agreement with early stopping and without authentication
Journal Article
·
Sun May 01 00:00:00 EDT 1983
· IBM Tech. Disclosure Bull.; (United States)
·
OSTI ID:5342625