Fast quantum byzantine agreement

Michael Ben-Or; Avinatan Hassidim

doi:10.1145/1060590.1060662

Fast quantum byzantine agreement

Michael Ben-Or^*, Avinatan Hassidim

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Conference article › peer-review

78 Scopus citations

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 < n/3 faulty players in the synchronous setting, and up to t < n/4 faulty players for asynchronous systems. This should be contrasted with the known classical synchronous lower bound of ω(√ n/log n) [3] when t = ω(n).

Original language	English
Pages (from-to)	481-485
Number of pages	5
Journal	Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/1060590.1060662
State	Published - 2005
Event	13th Color Imaging Conference: Color Science, Systems, Technologies, and Applications - Scottsdale, AZ, United States Duration: 7 Nov 2005 → 11 Nov 2005

Keywords

Byzantine Agreement
Quantum Computation

Access to Document

10.1145/1060590.1060662

Cite this

@article{cbe23a6d83724dcb95a59275409b10ad,

title = "Fast quantum byzantine agreement",

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 < n/3 faulty players in the synchronous setting, and up to t < n/4 faulty players for asynchronous systems. This should be contrasted with the known classical synchronous lower bound of ω(√ n/log n) [3] when t = ω(n).",

keywords = "Byzantine Agreement, Quantum Computation",

author = "Michael Ben-Or and Avinatan Hassidim",

year = "2005",

doi = "10.1145/1060590.1060662",

language = "אנגלית",

pages = "481--485",

journal = "Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0737-8017",

publisher = "Association for Computing Machinery (ACM)",

note = "13th Color Imaging Conference: Color Science, Systems, Technologies, and Applications ; Conference date: 07-11-2005 Through 11-11-2005",

}

TY - JOUR

T1 - Fast quantum byzantine agreement

AU - Ben-Or, Michael

AU - Hassidim, Avinatan

PY - 2005

Y1 - 2005

N2 - 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 < n/3 faulty players in the synchronous setting, and up to t < n/4 faulty players for asynchronous systems. This should be contrasted with the known classical synchronous lower bound of ω(√ n/log n) [3] when t = ω(n).

AB - 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 < n/3 faulty players in the synchronous setting, and up to t < n/4 faulty players for asynchronous systems. This should be contrasted with the known classical synchronous lower bound of ω(√ n/log n) [3] when t = ω(n).

KW - Byzantine Agreement

KW - Quantum Computation

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

U2 - 10.1145/1060590.1060662

DO - 10.1145/1060590.1060662

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:34848827464

SN - 0737-8017

SP - 481

EP - 485

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

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

T2 - 13th Color Imaging Conference: Color Science, Systems, Technologies, and Applications

Y2 - 7 November 2005 through 11 November 2005

ER -

Fast quantum byzantine agreement

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this