Fast quantum byzantine agreement

Authors:
Michael Ben-Or;Avinatan Hassidim
Affiliations:
Incumbent of the Jean and Helena Alfassa Chair in Computer Science;Hebrew University, Jerusalem, Israel
Venue:
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Year:
2005

Citing 13
Cited 8

Simple constant-time consensus protocols in realistic failure models

Journal of the ACM (JACM)
Flipping persuasively in constant time

SIAM Journal on Computing
Fully polynomial Byzantine agreement in t + 1 rounds

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fast asynchronous Byzantine agreement with optimal resilience

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fault-tolerant quantum computation with constant error

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement

SIAM Journal on Computing
A tight lower bound for randomized synchronous consensus

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Lower bounds for distributed coin-flipping and randomized consensus

Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
Secure multi-party quantum computation

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Distributed Algorithms

Distributed Algorithms
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
An asynchronous [(n - 1)/3]-resilient consensus protocol

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing

Quantum distributed consensus

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
What can be observed locally? round-based models for quantum distributed computing

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Scalable quantum consensus for crash failures

DISC'10 Proceedings of the 24th international conference on Distributed computing
A faster P solution for the Byzantine agreement problem

CMC'10 Proceedings of the 11th international conference on Membrane computing
Locally undetermined states, generalized schmidt decomposition, and application in deistributed comuting

Quantum Information & Computation
Protocol design for quantum repeater networks

AINTEC '11 Proceedings of the 7th Asian Internet Engineering Conference
Exact Quantum Algorithms for the Leader Election Problem

ACM Transactions on Computation Theory (TOCT)
Quantum money

Communications of the ACM

Quantified Score

Hi-index	0.02

Visualization

Abstract

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