Fast quantum byzantine agreement
From MaRDI portal
Publication:3581443
DOI10.1145/1060590.1060662zbMath1192.81053OpenAlexW2028000824MaRDI QIDQ3581443
Avinatan Hassidim, Michael Ben-Or
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items (6)
Quantum detectable Byzantine agreement for distributed data trust management in blockchain ⋮ Revising the Membrane Computing Model for Byzantine Agreement ⋮ A simple voting protocol on quantum blockchain ⋮ P systems and the Byzantine agreement ⋮ Unnamed Item ⋮ Quantum Byzantine agreement for any number of dishonest parties
This page was built for publication: Fast quantum byzantine agreement
