The Manipulate-and-Observe Attack on Quantum Key Distribution

• URL: http://arxiv.org/abs/2603.29669v1
• Date: Tue, 31 Mar 2026 12:27:37 GMT
• Title: The Manipulate-and-Observe Attack on Quantum Key Distribution
• Abstract summary: Post-processing reveals vulnerabilities that an eavesdropper could target.<n> reconciliation protocols correct errors by comparing the parities of subsets between both parties.<n>There is no holistic threat model that addresses how parity-leakage during reconciliation might be actively manipulated.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Quantum key distribution is often regarded as an unconditionally secure method to exchange a secret key by harnessing fundamental aspects of quantum mechanics. Despite the robustness of key exchange, classical post-processing reveals vulnerabilities that an eavesdropper could target. In particular, many reconciliation protocols correct errors by comparing the parities of subsets between both parties. These communications occur over insecure channels, leaking information that an eavesdropper could exploit. Currently there is no holistic threat model that addresses how parity-leakage during reconciliation might be actively manipulated. In this paper we introduce a new form of attack, namely the Manipulate-and-Observe attack in which the adversary (1) partially intercepts a fraction $ρ$ of the qubits during key exchange, injecting the maximally tolerated amount of errors up to the 11 percent error threshold whilst remaining undetected and (2) probes the maximum amount of parity-leakage during reconciliation, and exploits it using a vectorised, parallel brute force filter to shrink the search space from 2n down to as few as a single candidate, for an n-bit reconciled key. We perform simulations of the attack, deploying it on the most widely used protocol, BB84, andthe benchmark reconciliation protocol, Cascade. Our simulation results demonstrate that the attack can significantly reduce the security below the theoretical bound and, in the worst case, fully recover the reconciled key material. The principles of the attack could threaten other parity-based reconciliation schemes, like Low Density Parity Check, which underscores the need for urgent consideration of the combined security of key exchange and post-processing.

Related papers

• High-rate multipartite quantum secret sharing with composable security [32.68119688797723]
  We experimentally evaluate a quantum secret-sharing protocol whose finite-key analysis provides composable security against general attacks.<n>We distribute the state through a 4-arm star network comprising 20km of fibre in total.<n>We infer that a randomised 24-hour execution with the optimised basis probability would yield a composable finite-key lower bound of 8.7 Mbits.
  arXiv  Detail & Related papers  (2026-09-11T18:00:00Z)
• Quaternary-Squeeze Quantum Identity Authentication: Direction-Scaling Security via Single-Mode Squeezed Light [4.87244033582479]
  Quantum identity authentication (QIA) has emerged as a crucial technology for secure communication systems.<n>This paper proposes a novel QIA protocol based on non-classical characteristics of squeezed light fields.
  arXiv  Detail & Related papers  (2026-07-10T07:31:27Z)
• Self-Sifting quantum key distribution [0.0]
  We introduce a novel two-way quantum key distribution protocol in which the sender and receiver employ one qubit of a maximally entangled Bell state as the quantum channel for key exchange.<n>Unlike conventional two-way QKD protocols, all sifting operations and eavesdropper detection procedures are postponed until the completion of the quantum communication stage.<n>We analyze a broad class of ancilla-based attacks, in which an eavesdropper couples an ancillary system to the transmitted qubit in an attempt to gain information about the key.
  arXiv  Detail & Related papers  (2026-06-25T17:17:12Z)
• Securing Multimodal AI through Internal Information Decomposition [43.51030662124641]
  Multimodal large language models introduce attack surfaces absent in unimodal systems.<n>We propose FlowGuard, a lightweight inference-time framework that detects harmful inputs by monitoring internal multimodal consistency.<n>Our results demonstrate that monitoring cross-modal consistency offers an efficient and effective defense for multimodal reasoning.
  arXiv  Detail & Related papers  (2026-05-03T19:21:06Z)
• Computational Monogamy of Entanglement and Non-Interactive Quantum Key Distribution [21.219588497290115]
  Quantum key distribution (QKD) enables Alice and Bob to exchange a secret key over a public, untrusted quantum channel.<n>Compared to classical key exchange, QKD achieves everlasting security: after the protocol execution the key is secure against adversaries.<n>No non-interactive protocol is known that provides everlasting security, even using quantum information.
  arXiv  Detail & Related papers  (2025-10-01T11:41:04Z)
• Secure quantum key distribution against correlated leakage source [20.01403427477703]
  Quantum key distribution (QKD) provides information theoretic security based on quantum mechanics.<n>Among various source loopholes, correlations between transmitted pulses pose a significant yet underexplored security risk.<n>We propose a security analysis framework for QKD under correlations, enabling finite-key analysis for the first time.
  arXiv  Detail & Related papers  (2025-07-15T12:23:24Z)
• Breaking Quantum Key Distributions under Quantum Switch-Based Attack [0.0]
  We introduce a new attack scenario where an eavesdropper, Eve, exploits a quantum switch using the indefinite causal order to intercept and manipulate quantum communication channel.<n>Our results highlight a previously overlooked vulnerability, emphasizing the need for countermeasures against quantum-controlled adversarial strategies.
  arXiv  Detail & Related papers  (2025-02-10T18:56:47Z)
• Secure Multi-Party Biometric Verification using QKD assisted Quantum Oblivious Transfer [34.46964288961048]
  We present a practical implementation of a secure multiparty computation application enabled by quantum oblivious transfer (QOT)<n>The QOT protocol uses polarization-encoded entangled states to share oblivious keys between two parties with quantum key distribution (QKD) providing authentication.<n>A practical use case is demonstrated for privacy-preserving fingerprint matching against no-fly lists from Interpol and the United Nations.
  arXiv  Detail & Related papers  (2025-01-09T15:51:30Z)
• Quantum Key Leasing for PKE and FHE with a Classical Lessor [19.148581164364387]
  We consider the problem of secure key leasing, also known as revocable cryptography. This problem aims to leverage unclonable nature of quantum information. We construct a secure key leasing scheme to lease a decryption key of a (classical) public-key, homomorphic encryption scheme.
  arXiv  Detail & Related papers  (2023-10-22T15:25:29Z)
• Phase-Matching Quantum Key Distribution without Intensity Modulation [25.004151934190965]
  We propose a phase-matching quantum key distribution protocol without intensity modulation. Simulation results show that the transmission distance of our protocol could reach 305 km in telecommunication fiber. Our protocol provides a promising solution for constructing quantum networks.
  arXiv  Detail & Related papers  (2023-03-21T04:32:01Z)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• Upper bounds on key rates in device-independent quantum key distribution based on convex-combination attacks [1.118478900782898]
  We present the convex-combination attack as an efficient, easy-to-use technique for upper-bounding DIQKD key rates. It allows verifying the accuracy of lower bounds on key rates for state-of-the-art protocols.
  arXiv  Detail & Related papers  (2022-06-13T15:27:48Z)
• Security of quantum key distribution from generalised entropy accumulation [2.1030878979833467]
  We provide a formal framework for general quantum key distribution protocols. We show that security against general attacks reduces to security against collective attacks. Our proof relies on a recently developed information-theoretic tool called generalised entropy accumulation.
  arXiv  Detail & Related papers  (2022-03-09T19:00:07Z)
• 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)
• On Provable Backdoor Defense in Collaborative Learning [35.22450536986004]
  Malicious users can upload data to prevent the model's convergence or inject hidden backdoors. Backdoor attacks are especially difficult to detect since the model behaves normally on standard test data but gives wrong outputs when triggered by certain backdoor keys. We propose a novel framework that generalizes existing subset aggregation methods.
  arXiv  Detail & Related papers  (2021-01-19T14:39:32Z)
• Noiseless attack and counterfactual security of quantum key distribution [0.0]
  We show that the efficiency of counterfactual QKD protocols can be enhanced by including non-counterfactual bits. We show how this problem can be resolved in a simple way, whereby the non-counterfactual key bits are indicated to be secure. This method of enhancing the key rate is shown to be applicable to various existing quantum counterfactual key distribution protocols.
  arXiv  Detail & Related papers  (2020-12-09T16:48:43Z)

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.