Efficient algorithm for Byzantine agreement without authentication
Journal Article
·
· Inf. Control; (United States)
Byzantine agreement involves a system of n processes, of which some t may be faulty. The problem is for the correct processes to agree on a binary value sent by a transmitter that may itself be one of the n processes. If the transmitter sends the same value to each process, then all correct processes must agree on that value, but in any case, they must agree on some value. An explicit solution not using authentication for n=3t + 1 processes is given, using 2t + 3 rounds and o(t/sup 3/ log t) message bits. This solution is easily extended to the general case of n > 3t + 11 to give a solution using 2t + 3 rounds and o(nt + t/sup 3/ log t) message bits. 9 references.
- Research Organization:
- IBM Research Lab., San Jose, CA
- OSTI ID:
- 5290510
- Journal Information:
- Inf. Control; (United States), Journal Name: Inf. Control; (United States) Vol. 3; ISSN IFCNA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Simple and efficient Byzantine generals algorithm
Authenticated algorithms for Byzantine agreement
Method for achieving Byzantine agreement with early stopping and without authentication
Book
·
Thu Dec 31 23:00:00 EST 1981
·
OSTI ID:5247901
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