A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
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 exlSlicit solution not using authentication for n= 3t+ 1 processes is given, using 2t+ 3 rounds and O(t 31ogt) messagedoi:10.1016/s0019-9958(82)90776-8 fatcat:xdoudcmzxvhczot2tb3aqrs5wa