Fast quantum byzantine agreement

DOI10.1145/1060590.1060662MaRDI QIDQ3581443zbMATH OpenOpenAlexWikidataFDO

Authors Michael Ben-Or, Avinatan Hassidim

Publication date 16 August 2010

Published in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1060590.1060662

Mathematics Subject Classification ID

Network protocols (68M12) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Authentication, digital signatures and secret sharing (94A62)

Cited in

(11)

• A simple voting protocol on quantum blockchain
• Quantum Byzantine agreement for any number of dishonest parties
• Revising the membrane computing model for Byzantine agreement
• Quantum advantage for the LOCAL model in distributed computing
• Quantum detectable Byzantine agreement for distributed data trust management in blockchain
• Complex quantum networks: a topical review
• Quantum temporal logic and reachability problems of matrix semigroups
• Distributed fast crash-tolerant consensus with nearly-linear quantum communication
• On the power of quantum distributed proofs
• Distributed quantum proofs for replicated data
• P systems and the Byzantine agreement

This page was built for publication: Fast quantum byzantine agreement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581443)