Scalable and Highly Fault-Tolerant Circular Quantum Byzantine Agreement

• URL: http://arxiv.org/abs/2602.11592v1
• Date: Thu, 12 Feb 2026 05:21:11 GMT
• Title: Scalable and Highly Fault-Tolerant Circular Quantum Byzantine Agreement
• Abstract summary: Quantum Byzantine Agreement (QBA) offers inherent advantages in security and fault tolerance over classical protocols.<n>We propose a multiparty circular QBA protocol that adopts a semi-decentralized architecture, leveraging circular message gathering and quantum digital signatures.<n>Our protocol is experimentally feasible, requiring only weak coherent states, and is compatible with existing star-shaped quantum networks.
• Score: 3.997711170980834
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum Byzantine Agreement (QBA), a cornerstone of quantum blockchain, offers inherent advantages in security and fault tolerance over classical protocols, guaranteed by the laws of quantum mechanics. However, existing multiparty QBA protocols face challenges for large-scale deployment due to exponential communication complexity or reliance on complex multi-particle entanglement. To address this, we propose a multiparty circular QBA protocol that adopts a semi-decentralized architecture, leveraging circular message gathering and quantum digital signatures to achieve quadratic communication complexity and enhanced fault tolerance. Our protocol is experimentally feasible, requiring only weak coherent states, and is compatible with existing star-shaped quantum networks. Simulations conducted on a global satellite-to-ground network demonstrate that the protocol sustains high consensus rates among multiple users, even when employing different key generation protocols under realistic conditions. This work presents a scalable framework for large-scale QBA networks, establishing the foundation for a practical quantum blockchain that enables secure and fault-tolerant decentralized services.

Related papers

• Experimental demonstration of scalable quantum blockchain with exponentially superior quantum communication complexity [22.368056596656675]
  We experimentally demonstrate a scalable quantum blockchain protocol based on weak coherent states.<n>The protocol employs a circular quantum Byzantine agreement mechanism that preserves information-theoretic security.<n>Compared with previous schemes, the protocol requires less than 4% of the quantum communication resources.
  arXiv  Detail & Related papers  (2026-07-14T01:25:28Z)
• Efficient and Quantum-safe Internet Key Exchange Protocols for Satellite Communications [39.39748088551345]
  We study cryptographic key exchange in satellite communications, which requires specific solutions because the satellite context presents unique challenges.<n>We consider the Internet Key Exchange protocol, which is widely used in terrestrial networks, and studying its applicability in the satellite context.
  arXiv  Detail & Related papers  (2026-05-27T15:58:04Z)
• Verifier-initiated quantum message-authentication via quantum zero-knowledge proofs [38.81686642226027]
  We introduce a new method where the verifier can request authentication only when needed, improving efficiency for quantum networks and blockchain applications.<n>Our approach adapts the concept of zero-knowledge widely used in classical cryptography to quantum settings, ensuring that verification reveals nothing about secret keys.<n>This work delivers the first general verifier-initiated quantum signature scheme with formal security, paving the way for scalable, secure authentication in future quantum infrastructures and decentralized systems.
  arXiv  Detail & Related papers  (2025-12-05T04:40:34Z)
• Hybrid Authentication Protocols for Advanced Quantum Networks [0.6827423171182154]
  We introduce a new authentication approach that combines hardware assumptions, particularly Physical Unclonable Functions (PUFs), along with quantum properties of non-local states, such as local indistinguishability, to achieve provable security in entanglement-based protocols.<n>These protocols are suitable for implementation across various platforms, particularly photonics-based ones, and offer a practical and flexible solution to the long-standing challenge of authentication in quantum communication networks.
  arXiv  Detail & Related papers  (2025-04-15T18:51:22Z)
• Implementing an information-theoretically secure Byzantine agreement with quantum signed message solution [9.643164830645038]
  Byzantine agreement (BA) enables all honest nodes in a decentralized network to reach consensus.<n>We propose a quantum signed Byzantine agreement (QSBA) protocol based on the quantum signed message (QSM) scheme.<n>Our protocol achieves information-theoretic security using only QKD-shared key resources between network nodes.
  arXiv  Detail & Related papers  (2025-02-08T10:30:37Z)
• Practical hybrid PQC-QKD protocols with enhanced security and performance [44.8840598334124]
  We develop hybrid protocols by which QKD and PQC inter-operate within a joint quantum-classical network. In particular, we consider different hybrid designs that may offer enhanced speed and/or security over the individual performance of either approach.
  arXiv  Detail & Related papers  (2024-11-02T00:02:01Z)
• Towards efficient and secure quantum-classical communication networks [47.27205216718476]
  There are two primary approaches to achieving quantum-resistant security: quantum key distribution (QKD) and post-quantum cryptography (PQC) We introduce the pros and cons of these protocols and explore how they can be combined to achieve a higher level of security and/or improved performance in key distribution. We hope our discussion inspires further research into the design of hybrid cryptographic protocols for quantum-classical communication networks.
  arXiv  Detail & Related papers  (2024-11-01T23:36:19Z)
• Distributed Quantum Computing in Silicon [40.16556091789959]
  We present preliminary demonstrations of some key distributed quantum computing protocols on silicon T centres in isotopically-enriched silicon. We demonstrate the distribution of entanglement between modules and consume it to apply a teleported gate sequence.
  arXiv  Detail & Related papers  (2024-06-03T18:02:49Z)
• Experimental quantum secret sharing based on phase encoding of coherent states [17.01107355316032]
  We propose a quantum secret sharing protocol with simple phase encoding of coherent states among three parties. Our scheme achieves a key rate of 85.3 bps under a 35 dB channel loss.
  arXiv  Detail & Related papers  (2023-03-26T04:35:07Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Breaking universal limitations on quantum conference key agreement without quantum memory [6.300599548850421]
  We report a measurement-device-independent quantum conference key agreement protocol with enhanced transmission efficiency over lossy channel. Our protocol can break key rate bounds on quantum communication over quantum network without quantum memory. Based on our results, we anticipate that our protocol will play an indispensable role in constructing multipartite quantum network.
  arXiv  Detail & Related papers  (2022-12-10T06:37:53Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds [0.0]
  Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks. We present a composable protocol achieving blindness and verifiability even in the case of a single honest client.
  arXiv  Detail & Related papers  (2021-02-25T15:58:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.