Article

Fast quantum byzantine agreement

Authors:

Michael Ben-Or and

Avinatan HassidimAuthors Info & Claims

STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

May 2005

Pages 481 - 485

https://doi.org/10.1145/1060590.1060662

Published: 22 May 2005 Publication History

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

References

[1]

D. Aharonov and M. Ben-Or, "Fault tolerant quantum computation with constant error rate," quantph/9906129. Preliminary version in STOC '97. Submitted to SIAM J. Comp., June 1999.

Digital Library

[2]

J. Aspnes, "Lower bounds for distributed coin-flipping and randomized consensus", Journal of the ACM 45(3):415--450, May 1998.

Digital Library

[3]

Ziv Bar-Joseph and Michael Ben-Or, "A Tight Lower Bound for Randomized Synchronous Computing, " proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing (PODC), Puerto Vallarta, Mexico, pp. 193--199, 1998.

Digital Library

[4]

M. Ben-Or, "Another advantage of free choice: Completely asynchronous agreement protocols," In In Proceedings of the 2nd Annual ACM Symposium on the Principles of Distributed Computing, pp. 27--30, 1983.

Digital Library

[5]

M. Ben-Or and E. Pavlov, unpublished manuscript.

[6]

Gabriel Bracha, "An asynchronous {(n-1)/3}-resilient consensus protocol," In Proceedings of the third annual ACM symposium on Principles of distributed computing, JACM, pp. 154--162, 1984.

Digital Library

[7]

Ran Canetti and Tal Rabin, "Fast asynchronous Byzantine agreement with optimal resilience." STOC 1993: 42--51.

Digital Library

[8]

Benny Chor and Brian A. Coan, "A Simple and Efficient Randomized Byzantine Agreement Algorithm," IEEE Trans. Software Eng. 11(6): 531--539, 1985.

Digital Library

[9]

Benny Chor, Michael Meritt and David B. Shmoys, "Simple Constant Time Consensus Protocols In Realistic Failure Models" Journal of the ACM, vol. 36, no. 3, pp. 591--614, Jan. 1989.

Digital Library

[10]

Claude Crépeau, Daniel Gottesman and Adam Smith, "Secure Multi-party Quantum Computation," In 34th ACM Symposium on the Theory of Computing, STOC, pp. 643--652, 2002.

Digital Library

[11]

Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer, " Flipping Persuasively in Constant Time," SIAM J. Comput. 19(3): 472--499 (1990)

Digital Library

[12]

P. Feldman and S. Micali, "An Optimal Protocol for Synchronous Byzantine Agreement, "SIAM Journal of Computing, vol. 26, pp. 873--933, 1997.

Digital Library

[13]

J. A. Garay and Y. Moses, "Fully Polynomial Byzantine agreement in t + 1 rounds.," In Proceedings of th 25th Annual ACM Symposyum on Theory of Computing, ACM, pp.31--41, 1993.

Digital Library

[14]

Nancy A. Lynch, Distributed Algorithms, Morgan Kaufman, 1996.

Digital Library

[15]

M. Pease, R. Shostak, L. Lamport, "Reaching Agreement in the Presence of Faults", Journal of the ACM (JACM), v.27 n.2, p.228--234, April 1980

Digital Library

[16]

M. O. Rabin, "Randomized Byzantine Generals," In Proceedings of the 24th Annual IEEE Symposyum on the Foundations of Computer Science, IEEE, pp. 403--409, 1983.

Cited By

Guba ZFinta IBudai ÁFarkas LZimborás ZPályi A(2024)Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet stateQuantum10.22331/q-2024-04-30-13248(1324)Online publication date: 30-Apr-2024
https://doi.org/10.22331/q-2024-04-30-1324
Li NSpee CHebenstreit Mde Vicente JKraus B(2024)Identifying families of multipartite states with non-trivial local entanglement transformationsQuantum10.22331/q-2024-02-29-12708(1270)Online publication date: 29-Feb-2024
https://doi.org/10.22331/q-2024-02-29-1270
Hasegawa AKundu SNishimura HKuznetsov PGelles ROlivetti D(2024)On the Power of Quantum Distributed ProofsProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662788(220-230)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662788
Show More Cited By

Index Terms

Fast quantum byzantine agreement
1. Theory of computation

Recommendations

Fast byzantine agreement in dynamic networks
PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing

We study Byzantine agreement in dynamic networks where topology can change from round to round and nodes can also experience heavy churn (i.e., nodes can join and leave the network continuously over time). Our main contributions are randomized ...
Read More
Grouping Byzantine Agreement

The reliability of the distributed system has always been an important topic of research. Byzantine Agreement (BA) protocol, which allows the fault-free processors to agree on a common value, is one of the most fundamental problems studied in a ...
Read More
A Simple and Efficient Randomized Byzantine Agreement Algorithm

A new randomized Byzantine agreement algorithm is presented. This algorithm operates in a synchronous system of n processors, at most t of which can fail. The algorithm reaches agreement in 0(t/log n) expected rounds and O(n2tf/log n) expected message ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

May 2005

778 pages

ISBN:1581139608

DOI:10.1145/1060590

General Chair:
Hal Gabow
University of Colorado
,
Program Chair:
Ronald Fagin
IBM Almaden Research Center

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 May 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

STOC05

Sponsor:

STOC05: Symposium on Theory of Computing

May 22 - 24, 2005

MD, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

59
Total Citations
View Citations
1,145
Total Downloads

Downloads (Last 12 months)129
Downloads (Last 6 weeks)23

Other Metrics

View Author Metrics

Citations

Cited By

Guba ZFinta IBudai ÁFarkas LZimborás ZPályi A(2024)Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet stateQuantum10.22331/q-2024-04-30-13248(1324)Online publication date: 30-Apr-2024
https://doi.org/10.22331/q-2024-04-30-1324
Li NSpee CHebenstreit Mde Vicente JKraus B(2024)Identifying families of multipartite states with non-trivial local entanglement transformationsQuantum10.22331/q-2024-02-29-12708(1270)Online publication date: 29-Feb-2024
https://doi.org/10.22331/q-2024-02-29-1270
Hasegawa AKundu SNishimura HKuznetsov PGelles ROlivetti D(2024)On the Power of Quantum Distributed ProofsProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662788(220-230)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662788
Kozlowski WKuipers FSmets RTurkovic B(2024)QuIP: A P4 Quantum Internet Protocol Prototyping FrameworkIEEE Journal on Selected Areas in Communications10.1109/JSAC.2024.338009642:7(1936-1949)Online publication date: Jul-2024
https://doi.org/10.1109/JSAC.2024.3380096
Mor-Ruiz MDür W(2024)Influence of Noise in Entanglement-Based Quantum NetworksIEEE Journal on Selected Areas in Communications10.1109/JSAC.2024.338008942:7(1793-1807)Online publication date: Jul-2024
https://doi.org/10.1109/JSAC.2024.3380089
Nokkala JPiilo JBianconi G(2024)Complex quantum networks: a topical reviewJournal of Physics A: Mathematical and Theoretical10.1088/1751-8121/ad41a657:23(233001)Online publication date: 24-May-2024
https://doi.org/10.1088/1751-8121/ad41a6
Shukla AVedula P(2024)An efficient quantum algorithm for preparation of uniform quantum superposition statesQuantum Information Processing10.1007/s11128-024-04258-423:2Online publication date: 29-Jan-2024
https://doi.org/10.1007/s11128-024-04258-4
Weng CGao RBao YLi BLiu WXie YLu YYin HChen Z(2023)Beating the Fault-Tolerance Bound and Security Loopholes for Byzantine Agreement with a Quantum SolutionResearch10.34133/research.02726Online publication date: 21-Nov-2023
https://doi.org/10.34133/research.0272
Monga ISaglamyurek EKissel EHaffner HWu W(2023)QUANT-NET: A testbed for quantum networking research over deployed fiberProceedings of the 1st Workshop on Quantum Networks and Distributed Quantum Computing10.1145/3610251.3610561(31-37)Online publication date: 10-Sep-2023
https://dl.acm.org/doi/10.1145/3610251.3610561
Azuma KEconomou SElkouss DHilaire PJiang LLo HTzitrin I(2023)Quantum repeaters: From quantum networks to the quantum internetReviews of Modern Physics10.1103/RevModPhys.95.04500695:4Online publication date: 20-Dec-2023
https://doi.org/10.1103/RevModPhys.95.045006
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents