Simple and efficient Byzantine generals algorithm

作者： Nancy A. Lynch , Michael J. Fischer , Robert Fowler

关键词:

摘要: The Byzantine generals problem involves a system of n processes, t which may be unreliable. is for the reliable processes to agree on binary value sent by general itself one processes. If sends same each process, then all must that value, but in any case, they value. An explicit solution given among n=3t+1 using 2t+4 rounds and o(t/sup 3/ log t) message bits, where bounds number faulty This easily extended case n>3t+1 give 2t+5 o(tn+t/sup bits. 5 references.