130
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...