A Simple and Efficient Randomized Byzantine Agreement Algorithm
Name
MIT-LCS-TM-266.pdf
Size
4.96 MB
Format
Adobe PDF
Checksum (MD5)
948654963e27ca9e98599c55ae3bfd39
Author(s)
Chor, Benny
Coan, Brian A.
Date Issued
August 1984
Series/Report no.
MIT-LCS-TM-266
Abstract
A new randomized Byantine agreement algorithm is presented. This algorithm operates in a synchronous systems of n processors, at most t of which can fail. The algorithm reaches agreement in O(t/log n) expected rounds and O(n^2 t/log n) expected message bits independent of the distribution of processor failures. This performance is further improved to a constant expected number of rounds and O(n^2) message bits if the distribution of processor failures is assumed to be uniform. In either event, the algorithm improves on the known lower bound on rounds for deterministic algorithms. Some other advantages of the algorithm are that it requires no cryptographic techniques, that the amount of local computation is small, and that the expected number of random bits used per processor is only one. It is argued that in many practical applications of Byzantine agreement, the randomized algorithm of this paper achieves superior performance.
Persistent DSpace Link
