Method for achieving Byzantine agreement with early stopping and without authentication
Journal Article
·
· IBM Tech. Disclosure Bull.; (United States)
OSTI ID:5342625
The invention shows that Byzantine agreement can be achieved for n processors with at most t faults within 2t + 3 phases using at most o(nt/sup 4/) messages, provided that n > 3t.
- Research Organization:
- IBM Corp., Armonk, NY
- OSTI ID:
- 5342625
- Journal Information:
- IBM Tech. Disclosure Bull.; (United States), Journal Name: IBM Tech. Disclosure Bull.; (United States) Vol. 12; ISSN IBMTA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Efficient algorithm for Byzantine agreement without authentication
Byzantine agreement method without authentication
Authenticated algorithms for Byzantine agreement
Journal Article
·
Sun Feb 28 23:00:00 EST 1982
· Inf. Control; (United States)
·
OSTI ID:5290510
Byzantine agreement method without authentication
Journal Article
·
Wed Nov 30 23:00:00 EST 1983
· IBM Tech. Disclosure Bull.; (United States)
·
OSTI ID:5170778
Authenticated algorithms for Byzantine agreement
Journal Article
·
Mon Oct 31 23:00:00 EST 1983
· SIAM J. Comput.; (United States)
·
OSTI ID:5170704