TY - JOUR
T1 - An efficient algorithm for byzantine agreement without authentication
AU - Dolev, Danny
AU - Fischer, Michael J.
AU - Fowler, Rob
AU - Lynch, Nancy A.
AU - Raymond Strong, H.
PY - 1982/3
Y1 - 1982/3
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0020097405&partnerID=8YFLogxK
U2 - 10.1016/S0019-9958(82)90776-8
DO - 10.1016/S0019-9958(82)90776-8
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0020097405
SN - 0019-9958
VL - 52
SP - 257
EP - 274
JO - Information and control
JF - Information and control
IS - 3
ER -