Rényi security framework against coherent attacks applied to decoy-state QKD

• URL: http://arxiv.org/abs/2504.12248v1
• Date: Wed, 16 Apr 2025 16:54:23 GMT
• Title: Rényi security framework against coherent attacks applied to decoy-state QKD
• Authors: Lars Kamin, John Burniston, Ernest Y. -Z. Tan,
• Abstract summary: We develop a flexible and robust framework for finite-size security proofs of quantum key distribution protocols under coherent attacks.<n>Our approach achieves high finite-size key rates across a broad class of protocols while imposing minimal requirements.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We develop a flexible and robust framework for finite-size security proofs of quantum key distribution (QKD) protocols under coherent attacks, applicable to both fixed- and variable-length protocols. Our approach achieves high finite-size key rates across a broad class of protocols while imposing minimal requirements. In particular, it eliminates the need for restrictive conditions such as limited repetition rates or the implementation of virtual tomography procedures. To achieve this goal, we introduce new numerical techniques for the evaluation of sandwiched conditional R\'enyi entropies. In doing so, we also find an alternative formulation of the "QKD cone" studied in previous work. We illustrate the versatility of our framework by applying it to several practically relevant protocols, including decoy-state protocols. Furthermore, we extend the analysis to accommodate realistic device imperfections, such as independent intensity and phase imperfections. Overall, our framework provides both greater scope of applicability and better key rates than existing techniques, especially for small block sizes, hence offering a scalable path toward secure quantum communication under realistic conditions

Related papers

• 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)
• Numerical security analysis for quantum key distribution with partial state characterization [0.34952465649465553]
  We introduce a novel security proof technique that can evaluate the secret-key rate for both prepare-and-measure and measurement-device-independent QKD protocols.<n>We demonstrate that our method can outperform current analytical approaches addressing partial state characterization in terms of achievable secret-key rates.
  arXiv  Detail & Related papers  (2025-03-10T12:08:25Z)
• Improved finite-size effects in QKD protocols with applications to decoy-state QKD [0.0]
  We present a finite-size security proof for generic quantum key distribution protocols against independent and identically distributed collective attacks. We extend our proof to coherent attacks and variable-length protocols.
  arXiv  Detail & Related papers  (2025-02-07T23:37:50Z)
• Application of $α$-order Information Metrics for Secure Communication in Quantum Physical Layer Design [45.41082277680607]
  We study the $alpha$-order information-theoretic metrics based on R'enyi entropy.<n>We apply our framework to a practical scenario involving BPSK modulation over a lossy bosonic channel.
  arXiv  Detail & Related papers  (2025-02-07T03:44:11Z)
• 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)
• Finite-size analysis of prepare-and-measure and decoy-state QKD via entropy accumulation [0.8246494848934447]
  We present techniques for applying the generalized entropy accumulation theorem (GEAT) in finite-size analysis of generic prepare-and-measure protocols. We develop methods to incorporate some improvements to the finite-size terms in the proofs GEAT, and implement techniques to automatically optimize the min-tradeoff function.
  arXiv  Detail & Related papers  (2024-06-14T17:31:45Z)
• A Survey and Comparative Analysis of Security Properties of CAN Authentication Protocols [92.81385447582882]
  The Controller Area Network (CAN) bus leaves in-vehicle communications inherently non-secure. This paper reviews and compares the 15 most prominent authentication protocols for the CAN bus. We evaluate protocols based on essential operational criteria that contribute to ease of implementation.
  arXiv  Detail & Related papers  (2024-01-19T14:52:04Z)
• Finite-Key Analysis for Coherent One-Way Quantum Key Distribution [18.15943439545963]
  Coherent-one-way (COW) quantum key distribution (QKD) is a significant communication protocol that has been implemented experimentally and deployed in practical products. Existing security analyses of COW-QKD either provide a short transmission distance or lack immunity against coherent attacks in the finite-key regime. We present a tight finite-key framework for a variant of COW-QKD, which has been proven to extend the secure transmission distance in the case.
  arXiv  Detail & Related papers  (2023-09-28T03:32:06Z)
• 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)
• Finite-Size Security for Discrete-Modulated Continuous-Variable Quantum Key Distribution Protocols [4.58733012283457]
  We present a composable finite-size security proof against independently and identically distributed collective attacks for a general DM CV-QKD protocol. We extend and apply a numerical security proof technique to calculate tight lower bounds on the secure key rate. Results show that our security proof method yields secure finitesize key rates under experimentally viable conditions up to at least 72km transmission distance.
  arXiv  Detail & Related papers  (2023-01-20T17:16:21Z)
• Is Vertical Logistic Regression Privacy-Preserving? A Comprehensive Privacy Analysis and Beyond [57.10914865054868]
  We consider vertical logistic regression (VLR) trained with mini-batch descent gradient. We provide a comprehensive and rigorous privacy analysis of VLR in a class of open-source Federated Learning frameworks.
  arXiv  Detail & Related papers  (2022-07-19T05:47:30Z)
• 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)
• Round-robin differential phase-time-shifting protocol for quantum key distribution: theory and experiment [58.03659958248968]
  Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties. Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments. We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario. Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
  arXiv  Detail & Related papers  (2021-03-15T15:20:09Z)
• Learning, compression, and leakage: Minimising classification error via meta-universal compression principles [87.054014983402]
  A promising group of compression techniques for learning scenarios is normalised maximum likelihood (NML) coding. Here we consider a NML-based decision strategy for supervised classification problems, and show that it attains PAC learning when applied to a wide variety of models. We show that the misclassification rate of our method is upper bounded by the maximal leakage, a recently proposed metric to quantify the potential of data leakage in privacy-sensitive scenarios.
  arXiv  Detail & Related papers  (2020-10-14T20:03:58Z)

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.