Name
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). |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1145/1060590.1060662 | STOC |
Keywords | Field | DocType |
fast quantum byzantine agreement,strong full information,quantum byzantine agreement,n3 faulty player,nlog n,n4 faulty player,synchronous setting,expected communication round,asynchronous system,dynamic adversary,lower bound,quantum computation,quantum computer | Asynchronous communication,Discrete mathematics,Upper and lower bounds,Computer science,Quantum computer,Theoretical computer science,Adversary,Quantum Byzantine agreement | Conference |
ISBN | Citations | PageRank |
1-58113-960-8 | 24 | 1.49 |
References | Authors | |
14 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Ben-Or | 1 | 2008 | 420.97 |
| Avinatan Hassidim | 2 | 475 | 50.17 |