Security loophole in error verification in quantum key distribution

• URL: http://arxiv.org/abs/2507.21416v1
• Date: Tue, 29 Jul 2025 00:50:27 GMT
• Title: Security loophole in error verification in quantum key distribution
• Abstract summary: We show that even if verification's outcome is leaked to Eve, the security can still be guaranteed by increasing the number of bits reduced in privacy amplification by just one bit.<n>This result is expected to play an important role in future standardization and formal certification of quantum key distribution protocols.
• Score: 6.554326244334867
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The security of quantum key distribution (QKD) is evaluated based on the secrecy of Alice's key and the correctness of the keys held by Alice and Bob. A practical method for ensuring correctness is known as error verification, in which Alice and Bob reveal a portion of their reconciled keys and check whether the revealed information matches. In this paper, we argue that when the verification is executed in QKD protocols, it must be assumed that its outcome is leaked to Eve. However, we observe that some existing security proofs for QKD protocols that abort based on this outcome do not explicitly take into account the information leakage associated with this outcome. To address this problem, we present a simple and practical method that builds on Renner's approach using the leftover hash lemma. Specifically, we show that even if verification's outcome is leaked to Eve, the security can still be guaranteed by increasing the number of bits reduced in privacy amplification by just one bit. This result, presenting a method to incorporate a key step in practical QKD protocols into security proofs, is expected to play an important role in future standardization and formal certification of QKD protocols.

Related papers

• Conformal Changepoint Localization and Root Cause Analysis with Corrupted Observations [55.76952683833966]
  This paper proposes weighted CONCH (W-CONCH) and weighted CROC (W-CROC) to reduce confidence set size when data may be corrupted.<n>Experiments on image-based and real-world changepoint and root-cause benchmarks show that uncertainty-based weighting substantially reduces confidence set size.
  arXiv  Detail & Related papers  (2026-07-29T05:16:59Z)
• Anytime-Valid Confirmation of Covariate Balance for Prespecified Corrections [0.6599344783327052]
  We study anytime-valid confirmation of prespecified corrections from sequential unlabeled target inputs.<n>Experiments illustrate false-confirmation control, locality to the balancing-function class, KL-drift diagnostics, acceptable-region monitoring, finite-source effects.
  arXiv  Detail & Related papers  (2026-07-25T11:21:17Z)
• The finite key effect of side-channel-secure quantum key distribution beyond post-selection technique [1.8768434577064823]
  We introduce a security-proof method for variable-length side-channel-secure (SCS) quantum key distribution (QKD) against coherent attacks.<n>It yields tight key rates for the SCS protocol and reduces pulse requirements by over two orders of magnitude compared to prior works.
  arXiv  Detail & Related papers  (2026-07-20T01:31:35Z)
• Discovery of Hidden Miscalibration Regimes [52.452902154360565]
  Models may be systematically overconfident on some kinds of inputs and underconfident on others.<n>We define the corresponding miscalibration field and propose a diagnostic framework for estimating it.<n>Our approach learns a calibration-aware representation of the input space and estimates signed local miscalibration by kernel smoothing in the learned geometry.
  arXiv  Detail & Related papers  (2026-05-13T13:07:50Z)
• Rigorous Security Proofs for Practical Quantum Key Distribution [0.0]
  This thesis is concerned with rigorous security analyses of Quantum Key Distribution (QKD) protocols.<n>We establish a security proof for variable-length QKD protocols against IID collective attacks, and extend this result to coherent attacks using the postselection technique.<n>Second, we develop a method to bound phase error rates in entropic uncertainty relation-based and phase error rate-based proofs, using only the observed statistics of the protocol.<n>Third, we present a very general security analysis based on the marginal-constrained entropy accumulation theorem.
  arXiv  Detail & Related papers  (2026-04-23T15:48:02Z)
• Are We Evaluating the Edit Locality of LLM Model Editing Properly? [68.441768731381]
  We find that existing specificity evaluation protocols are inadequate for this purpose.<n>Existing specificity metrics are weakly correlated with the strength of specificity regularizers.<n>We also find that current metrics lack sufficient sensitivity, rendering them ineffective at distinguishing the specificity performance of different methods.
  arXiv  Detail & Related papers  (2026-01-24T07:07:21Z)
• CLUE: Non-parametric Verification from Experience via Hidden-State Clustering [64.50919789875233]
  We show that correctness of a solution is encoded as a geometrically separable signature within the trajectory of hidden activations.<n>ClUE consistently outperforms LLM-as-a-judge baselines and matches or exceeds modern confidence-based methods in reranking candidates.
  arXiv  Detail & Related papers  (2025-10-02T02:14:33Z)
• Uncertainty-Driven Reliability: Selective Prediction and Trustworthy Deployment in Modern Machine Learning [1.2183405753834562]
  This thesis investigates how uncertainty estimation can enhance the safety and trustworthiness of machine learning (ML) systems.<n>We first show that a model's training trajectory contains rich uncertainty signals that can be exploited without altering its architecture or loss.<n>We propose a lightweight, post-hoc abstention method that works across tasks, avoids the cost of deep ensembles, and achieves state-of-the-art selective prediction performance.
  arXiv  Detail & Related papers  (2025-08-11T02:33:53Z)
• 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)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Protocol-level description and self-contained security proof of decoy-state BB84 QKD protocol [1.0923877073891446]
  We present a self-contained information-theoretic security proof for the decoy-state BB84 quantum key distribution protocol.<n>Our proof yields a key rate consistent with previous findings.
  arXiv  Detail & Related papers  (2025-04-29T04:28:15Z)
• 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)
• Loss-tolerant quantum key distribution with detection efficiency mismatch [39.58317527488534]
  We establish a security proof for the loss-tolerant P&M QKD protocol that incorporates imperfections in both the source and the detectors.<n>Specifically, we demonstrate the security of this scheme when the emitted states deviate from the ideal ones.
  arXiv  Detail & Related papers  (2024-12-12T19:01:56Z)
• Quantum Key Distribution with Basis-Dependent Detection Probability [0.0]
  A common assumption in security proofs is that the detection probability at the receiver, for a given input state, is independent of the measurement basis.<n>This paper presents a security proof for QKD protocols that does not rely on the above assumption.<n>We demonstrate, through simulations, that our proof can extract positive key rates for setups vulnerable to large detection probability mismatches.
  arXiv  Detail & Related papers  (2024-11-29T17:35:27Z)
• An Efficient Error Estimation Method in Quantum Key Distribution [5.433638656301075]
  We propose a hybrid approach to preserve the entire sifted key after error estimation. Although accessible to an eavesdropper, the modified and extended sifted key ensures that the number of attempts to crack it remains the same.
  arXiv  Detail & Related papers  (2024-11-11T17:37:20Z)
• A Coin Has Two Sides: A Novel Detector-Corrector Framework for Chinese Spelling Correction [79.52464132360618]
  Chinese Spelling Correction (CSC) stands as a foundational Natural Language Processing (NLP) task. We introduce a novel approach based on error detector-corrector framework. Our detector is designed to yield two error detection results, each characterized by high precision and recall.
  arXiv  Detail & Related papers  (2024-09-06T09:26:45Z)
• Simultaneous quantum identity authentication scheme utilizing entanglement swapping with secret key preservation [0.0]
  We introduce a new protocol for quantum identity authentication (QIA)<n>Our proposed scheme facilitates simultaneous authentication between two users, Alice and Bob, leveraging Bell states with the assistance of a third party, Charlie.<n>We demonstrate that the proposed protocol withstands various known attacks, including impersonation, intercept and resend and impersonated fraudulent attacks.
  arXiv  Detail & Related papers  (2024-05-23T18:40:15Z)
• Empirical Risk-aware Machine Learning on Trojan-Horse Detection for Trusted Quantum Key Distribution Networks [31.857236131842843]
  Quantum key distribution (QKD) is a cryptographic technique that offers high levels of data security during transmission. The existence of a gap between theoretical concepts and practical implementation has raised concerns about the trustworthiness of QKD networks. We propose the implementation of risk-aware machine learning techniques that present risk analysis for Trojan-horse attacks over the time-variant quantum channel.
  arXiv  Detail & Related papers  (2024-01-26T03:36:13Z)
• Decomposing Uncertainty for Large Language Models through Input Clarification Ensembling [69.83976050879318]
  In large language models (LLMs), identifying sources of uncertainty is an important step toward improving reliability, trustworthiness, and interpretability. In this paper, we introduce an uncertainty decomposition framework for LLMs, called input clarification ensembling. Our approach generates a set of clarifications for the input, feeds them into an LLM, and ensembles the corresponding predictions.
  arXiv  Detail & Related papers  (2023-11-15T05:58:35Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Quantum Chernoff divergence in advantage distillation for quantum key distribution and device-independent quantum key distribution [0.0]
  Device-independent quantum key distribution (DIQKD) aims to mitigate adversarial exploitation of imperfections in quantum devices.<n>We present an alternative proof structure that replaces the fidelity with the quantum Chernoff divergence.<n>Our results provide insight into a fundamental question in quantum information theory regarding the circumstances under which DIQKD is possible.
  arXiv  Detail & Related papers  (2022-12-14T01:44:23Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• 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)
• 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)
• Backflash Light as a Security Vulnerability in Quantum Key Distribution Systems [77.34726150561087]
  We review the security vulnerabilities of quantum key distribution (QKD) systems. We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
  arXiv  Detail & Related papers  (2020-03-23T18:23:12Z)
• Experimental study and pratical realization of a reconciliation method for quantum key distribution system [0.22099217573031674]
  This paper investigates a reconciliation method in order to establish an errorless secret key in a QKD protocol. The proposed method accomplishes reconciliation by using QTC in the special problem of sideinformation source coding.
  arXiv  Detail & Related papers  (2020-02-16T21:40:36Z)

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.