Fast quantum Byzantine agreement

Michael Ben-Or; A. Hassidim

Fast quantum Byzantine agreement

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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).

Original language	American English
Title of host publication	Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Publisher	ACM
State	Published - 2005

Bibliographical note

Place of conference:USA

Cite this

@inproceedings{13b0f2be9fc145d9ae3e114112dcd690,

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‹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).",

author = "Michael Ben-Or and A. Hassidim",

note = "Place of conference:USA",

year = "2005",

language = "American English",

booktitle = "Proceedings of the thirty-seventh annual ACM symposium on Theory of computing",

publisher = "ACM",

}

TY - GEN

T1 - Fast quantum Byzantine agreement

AU - Ben-Or, Michael

AU - Hassidim, A.

N1 - Place of conference:USA

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‹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).

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‹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).

UR - https://scholar.google.co.il/scholar?q=Fast+Quantum+Byzantine+Agreement&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

PB - ACM

ER -

Fast quantum Byzantine agreement

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this