This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
June 1985 (vol. 11 no. 6)
pp. 531-539
B. Chor, Laboratory for Computer Science, Massachusetts Institute of Technology
A new randomized Byzantine agreement algorithm is presented. This algorithm operates in a synchronous system of n processors, at most t of which can fail. The algorithm reaches agreement in 0(t/log n) expected rounds and O(n2tf/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(n2) 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.
Index Terms:
randomized algorithms, Byzantine agreement, fault-tolerance
Citation:
B. Chor, B.A. Coan, "A Simple and Efficient Randomized Byzantine Agreement Algorithm," IEEE Transactions on Software Engineering, vol. 11, no. 6, pp. 531-539, June 1985, doi:10.1109/TSE.1985.232245
Usage of this product signifies your acceptance of the Terms of Use.