Asymptotically tight security analysis of quantum key distribution based on universal source compression

• URL: http://arxiv.org/abs/2504.07356v1
• Date: Thu, 10 Apr 2025 00:52:13 GMT
• Title: Asymptotically tight security analysis of quantum key distribution based on universal source compression
• Authors: Takaya Matsuura, Shinichiro Yamano, Yui Kuramochi, Toshihiko Sasaki, Masato Koashi,
• Abstract summary: Quantum key distribution (QKD) protocols require a finite-size security proof.<n>PEC approach is one of the general strategies for security analyses.<n>New PEC-type strategy can provably achieve theally optimal key rate.
• Score: 0.5242869847419834
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Practical quantum key distribution (QKD) protocols require a finite-size security proof. The phase error correction (PEC) approach is one of the general strategies for security analyses that has successfully proved finite-size security for many protocols. However, the asymptotically optimal key rate cannot in general be achieved with the conventional PEC approach due to the reduction to the estimation problem of the classical quantity, the phase error rate. In this work, we propose a new PEC-type strategy that can provably achieve the asymptotically optimal key rate. The key piece for this is a virtual protocol based on the universal source compression with quantum side information, which is of independent interest. Combined with the reduction method to collective attacks, this enables us to directly estimate the phase error pattern rather than the estimation via the phase error rate, and thus leads to asymptotically tight analyses. As a result, the security of any permutation-symmetrizable QKD protocol gets reduced to the estimation problem of the single conditional R\'enyi entropy, which can be efficiently solved by a convex optimization.

Related papers

• Asymmetric protocols for mode pairing quantum key distribution with finite-key analysis [5.323964523588455]
  We conduct a security analysis of asymmetric MP-QKD protocol with the finite-key analysis. Our work can achieve significantly enhanced secure key rates and transmission distances compared to the original strategy.
  arXiv  Detail & Related papers  (2024-12-17T06:50:15Z)
• Improved postselection security analysis of phase error estimation in quantum key distribution [5.084252553101737]
  Quantum key distribution (QKD) enables the generation of secure keys between two distant users. We propose a method correlating the failure probabilities of phase error estimation against collective and coherent attacks. Our method can be applied to various QKD protocols, providing better performance compared with the traditional postselection method.
  arXiv  Detail & Related papers  (2024-09-29T03:48:08Z)
• 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)
• Tight finite-key analysis for mode-pairing quantum key distribution [21.81489337632085]
  We analyze the finite-key effect for the MP-QKD protocol with rigorous security proof against general attacks. We propose a six-state MP-QKD protocol and analyze its finite-key effect.
  arXiv  Detail & Related papers  (2023-02-27T02:35:52Z)
• 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)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04:34Z)
• 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)
• Tight security bounds for decoy-state quantum key distribution [1.1563829079760959]
  The BB84 quantum key distribution (QKD) combined with decoy-state method is currently the most practical protocol. Here, we provide the rigorous and optimal analytic formula to solve the above tasks. Our results can be widely applied to deal with statistical fluctuation in quantum cryptography protocols.
  arXiv  Detail & Related papers  (2020-02-16T07:48:25Z)

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.