An efficient algorithm for byzantine agreement without authentication

https://doi.org/10.1016/S0019-9958(82)90776-8Get rights and content
Under an Elsevier user license
open archive

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(t3 log t) message bits. This solution is easily extended to the general case of n ⩾ 3t + 1 to give a solution using 2t + 3 rounds and O(nt + t3 log t) message bits.

Cited by (0)

*

This work was supported in part by the Office of Naval Research under Contract N00014-80-C-0221 through a subcontract from the University of Washington and by the National Science Foundation under Grant MCS81-16678.

This work was supported in part by the National Science Foundation under Grant MCS80-04111.

**

On leave from Georgia Institute of Technology, Atlanta, Georgia 30332.