Efficient quantum detectable weak Byzantine agreement with optimal fault-tolerant bound

2026/07/24 by Lide Xue, Wei Yang, BingRen Chen +2

paper · doi:10.1016/j.ic.2026.105497

published in Information and Computation 312, 105497 (Elsevier BV)

crossref created 2026/07/24 · crossref deposited 2026/08/07 · crossref indexed 2026/08/07 · crossref issued 2026/09/01 · crossref published 2026/09/01 · crossref published-print 2026/09/01

Citations

• Secure Internet of Things (IoT) using a novel Brooks Iyengar quantum Byzantine Agreement-centered blockchain Networking (BIQBA-BCN) model in smart healthcare
• 5G Software Defined Vehicular Networks
• Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing
• Bitcoin-NG: A Scalable Blockchain Protocol
• Quantum cryptography: Public key distribution and coin tossing
• Quantum Byzantine Agreement via Hardy correlations and entanglement swapping
• Experimental demonstration of a quantum protocol for Byzantine agreement and liar detection
• Byzantine Agreement with Two Quantum Key Distribution Setups
• Quantum Digital Signature based on Quantum One-way Functions
• Secure Multi-party Quantum Computing
• An arbitrated quantum signature scheme
• Quantum Solution to the Byzantine Agreement Problem
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• A fast quantum mechanical algorithm for database search
• A fast quantum mechanical algorithm for database search
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Flipping Persuasively in Constant Time
• Authenticated Algorithms for Byzantine Agreement
• The Weak Byzantine Generals Problem
• The Byzantine Generals Problem
• Reaching Agreement in the Presence of Faults