Public-Key Quantum Authentication and Digital Signature Schemes Based on the QMA-Complete Problem

• URL: http://arxiv.org/abs/2506.16904v1
• Date: Fri, 20 Jun 2025 10:56:50 GMT
• Title: Public-Key Quantum Authentication and Digital Signature Schemes Based on the QMA-Complete Problem
• Authors: Le-Ran Liu, Min-Quan He, Dan-Bo Zhang, Z. D. Wang,
• Abstract summary: We propose a quantum authentication and digital signature protocol whose security is founded on the Quantum Merlin Arthur(QMA)-completeness of the consistency of local density matrices.<n>We provide a rigorous security analysis, proving the scheme's unforgeability against adaptive chosen-message attacks by quantum adversaries.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a quantum authentication and digital signature protocol whose security is founded on the Quantum Merlin Arthur~(QMA)-completeness of the consistency of local density matrices. The protocol functions as a true public-key cryptography system, where the public key is a set of local density matrices generated from the private key, a global quantum state. This construction uniquely eliminates the need for trusted third parties, pre-shared secrets, or authenticated classical channels for public key distribution, making a significant departure from symmetric protocols like quantum key distribution. We provide a rigorous security analysis, proving the scheme's unforgeability against adaptive chosen-message attacks by quantum adversaries. The proof proceeds by a formal reduction, demonstrating that a successful forgery would imply an efficient quantum algorithm for the QMA-complete Consistency of Quantum Marginal Problem~(QMP). We further analyze the efficiency of verification using partial quantum state tomography, establishing the protocol's theoretical robustness and outlining a path towards practical implementation

Related papers

• On Post-Quantum Cryptography Authentication for Quantum Key Distribution [0.0]
  Quantum Key Distribution (QKD) users authenticate themselves using pre-shared key material to join a quantum network.<n>Public Key Infrastructure (PKI) combined with Post-Quantum Cryptography (PQC) offers a more scalable solution.<n>Unlike traditional PKI, which relies on classical cryptographic algorithms such as RSA, the approach presented in this paper leverages PQC algorithms believed to be resistant to quantum attacks.
  arXiv  Detail & Related papers  (2025-07-28T20:40:11Z)
• Quantum Skyshield: Quantum Key Distribution and Post-Quantum Authentication for Low-Altitude Wireless Networks in Adverse Skies [36.14072181405793]
  Low-altitude wireless networks (LAWNs) have emerged as a critical backbone for supporting the low-altitude economy.<n>To meet growing data demands, some LAWN deployments incorporate free-space optical (FSO) links, which offer exceptional bandwidth and beam directivity.<n>Quantum Skyshield is proposed to enable reliable communication between the base transceiver station (BTS) and LAWN.
  arXiv  Detail & Related papers  (2025-07-20T04:43:33Z)
• Integration of quantum random number generators with post-quantum cryptography algorithms [36.136619420474766]
  Post-Quantum Cryptography (PQC) has become a potential solution to prolong the life of existing Public Key Infrastructure (PKI) systems.<n>PQC protocols depend on high-quality randomness for key generation and encapsulation procedures.<n>We demonstrate a proof-of-concept enabling the incorporation of Quantum Random Number Generation (QRNG) devices within communication networks using PQC-based Transport Layer Security (TLS)
  arXiv  Detail & Related papers  (2025-07-01T10:56:39Z)
• Device-Independent Ternary Quantum Key Distribution Protocol Based on the Impossible Colouring Game [0.59374762912328]
  We propose a quantum key distribution protocol based on the two-party Impossible Colouring pseudo-telepathy game.<n>The protocol makes use of non-contextuality from the Kochen-Specker theorem, providing a quantum advantage in a task that is classically unachievable.<n>The protocol is secure within an adequate security framework and demonstrates a higher key generation rate compared to standard QKD protocols.
  arXiv  Detail & Related papers  (2025-05-21T14:52:31Z)
• 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)
• Quantum Homogenization as a Quantum Steady State Protocol on NISQ Hardware [42.52549987351643]
  Quantum homogenization is a reservoir-based quantum state approximation protocol.<n>We extend the standard quantum homogenization protocol to the dynamically-equivalent ($mathttSWAP$)$alpha$ formulation.<n>We show that our proposed protocol yields a completely positive, trace preserving (CPTP) map under which the code subspace is correctable.
  arXiv  Detail & Related papers  (2024-12-19T05:50:54Z)
• 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)
• Reliable Quantum Communications based on Asymmetry in Distillation and Coding [35.693513369212646]
  We address the problem of reliable provision of entangled qubits in quantum computing schemes. We combine indirect transmission based on teleportation and distillation; (2) direct transmission, based on quantum error correction (QEC) Our results show that ad-hoc asymmetric codes give, compared to conventional QEC, a performance boost and codeword size reduction both in a single link and in a quantum network scenario.
  arXiv  Detail & Related papers  (2023-05-01T17:13:23Z)
• Secure Key from Quantum Discord [22.97866257572447]
  We show how to make use of discord to analyze security in a specific quantum cryptography protocol. Our method is robust against imperfections in qubit sources and qubit measurements as well as basis misalignment due to quantum channels.
  arXiv  Detail & Related papers  (2023-04-12T14:21:49Z)
• Quantum Public Key Distribution using Randomized Glauber States [0.0]
  State-of-the-art Quantum Key Distribution (QKD) is based on the uncertainty principle of qubits on quantum measurements. We propose a novel quantum key distribution mechanism over a pure optical channel using randomized Glauber states.
  arXiv  Detail & Related papers  (2023-02-15T14:12:52Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)

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.