TY - GEN

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

AU - Ben-Or, Michael

AU - Pavlov, Elan

AU - Vaikuntanathan, Vinod

PY - 2006

Y1 - 2006

N2 - We present a randomized Byzantine Agreement (BA) pro tocol 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].

AB - We present a randomized Byzantine Agreement (BA) pro tocol 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].

KW - Byzantine Agreement

KW - Full-Information Model

UR - http://www.scopus.com/inward/record.url?scp=33748112587&partnerID=8YFLogxK

U2 - 10.1145/1132516.1132543

DO - 10.1145/1132516.1132543

M3 - Conference contribution

AN - SCOPUS:33748112587

SN - 1595931341

SN - 9781595931344

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 179

EP - 186

BT - STOC'06

PB - Association for Computing Machinery

T2 - 38th Annual ACM Symposium on Theory of Computing, STOC'06

Y2 - 21 May 2006 through 23 May 2006

ER -