Byzantine agreement in the full-information model in O(log n) rounds

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 constant > 0, the constructed protocol tolerates t non-adaptive Byzantine faults, as long as n (4+ )t. In the full-information model, no restrictions are placed on the computational power of the faulty players or the information available to them. In particular, the faulty players may be infinitely powerful, and they can observe all communication among the honest players. This constitutes significant progress over the best known randomized BA protocol in the same setting which has a round-complexity of ( t log n ) rounds [9], and answers an open problem posed by Chor and Dwork [10]. Incumbent of the Jean and Helena Alfassa Chair in Computer Science. Research supported in part by an Israel Defense Ministry Research Authority grant and by the Israel Science Foundation. Supported in part by an NSF grant CNS-04304...

• Type: Conference
• Year: 2006
• Where: STOC
• Authors: Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
• Keywords: Algorithms, Faulty Players, Helena Alfassa Chair, Randomized Byzantine Agreement, STOC 2006