Fast quantum byzantine agreement

We present a fast quantum Byzantine Agreement protocol that can reach agreement in <i>O</i>(1) expected communication rounds against a strong full information, dynamic adversary, tolerating up to the optimal <i>t</i>‹<i>n</i>3 faulty players in the synchronous setting, and up to <i>t</i>‹<i>n</i>4 faulty players for asynchronous systems. This should be contrasted with the known classical synchronous lower bound of Ω(√ <i>n</i>log <i>n</i>) [3] when <i>t</i>=(<i>n</i>).

[1]  James Aspnes,et al.  Lower bounds for distributed coin-flipping and randomized consensus , 1997, STOC '97.

[2]  Gabriel Bracha,et al.  An asynchronous [(n - 1)/3]-resilient consensus protocol , 1984, PODC '84.

[3]  Silvio Micali,et al.  An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..

[4]  Michael O. Rabin,et al.  Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[5]  Ziv Bar-Joseph,et al.  A tight lower bound for randomized synchronous consensus , 1998, PODC '98.

[6]  David B. Shmoys,et al.  Simple constant-time consensus protocols in realistic failure models , 1989, JACM.

[7]  Ran Canetti,et al.  Fast asynchronous Byzantine agreement with optimal resilience , 1993, STOC.

[8]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[9]  Brian A. Coan,et al.  A Simple and Efficient Randomized Byzantine Agreement Algorithm , 1985, IEEE Transactions on Software Engineering.

[10]  Adam D. Smith,et al.  Secure multi-party quantum computation , 2002, STOC '02.

[11]  Yoram Moses,et al.  Fully polynomial Byzantine agreement in t + 1 rounds , 1993, STOC.

[12]  David B. Shmoys,et al.  Flipping Persuasively in Constant Time , 1990, SIAM J. Comput..

[13]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[14]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[15]  Dorit Aharonov,et al.  Fault-tolerant quantum computation with constant error , 1997, STOC '97.

[16]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.