Danny Dolev, Ruediger Reischuk, et al.
Journal of the ACM
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. © 1982 Academic Press, Inc.
Danny Dolev, Ruediger Reischuk, et al.
Journal of the ACM
Yaron Weinsberg, Danny Dolev, et al.
ACM SIGPLAN Notices
Andrei Broder, Danny Dolev, et al.
Information and Computation
Danny Dolev, Cynthia Dwork, et al.
STOC 1991