Security of discrete-modulated continuous-variable quantum key distribution

• URL: http://arxiv.org/abs/2303.09255v4
• Date: Wed, 17 Jul 2024 14:39:52 GMT
• Title: Security of discrete-modulated continuous-variable quantum key distribution
• Authors: Stefan Bäuml, Carlos Pascual-García, Victoria Wright, Omar Fawzi, Antonio Acín,
• Abstract summary: Continuous variable quantum key distribution with discrete modulation has the potential to provide information-theoretic security. We prove finite-size security against coherent attacks for a discrete-modulated quantum key distribution protocol.
• Score: 4.637027109495763
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Continuous variable quantum key distribution with discrete modulation has the potential to provide information-theoretic security using widely available optical elements and existing telecom infrastructure. While their implementation is significantly simpler than that for protocols based on Gaussian modulation, proving their finite-size security against coherent attacks poses a challenge. In this work we prove finite-size security against coherent attacks for a discrete-modulated quantum key distribution protocol involving four coherent states and heterodyne detection. To do so, and contrary to most of the existing schemes, we first discretize all the continuous variables generated during the protocol. This allows us to use the entropy accumulation theorem, a tool that has previously been used in the setting of discrete variables, to construct the finite-size security proof. We then compute the corresponding finite-key rates through semi-definite programming and under a photon-number cutoff. Our analysis provides asymptotic rates in the range of $0.1-10^{-4}$ bits per round for distances up to hundred kilometres, while in the finite case and for realistic parameters, we get of the order of $10$ Gbits of secret key after $n\sim10^{11}$ rounds and distances of few tens of kilometres.

Related papers

• On the practicality of quantum sieving algorithms for the shortest vector problem [42.70026220176376]
  lattice-based cryptography is one of the main candidates of post-quantum cryptography. cryptographic security against quantum attackers is based on lattice problems like the shortest vector problem (SVP) Asymptotic quantum speedups for solving SVP are known and rely on Grover's search.
  arXiv  Detail & Related papers  (2024-10-17T16:54:41Z)
• Experimental composable key distribution using discrete-modulated continuous variable quantum cryptography [1.9464379888286716]
  We present the first experimental demonstration of a four-state DM CVQKD system, successfully generating composable finite-size keys. This accomplishment is enabled by using an advanced security proof. Results mark a significant step toward the large-scale deployment of practical, high-performance, cost-effective, and highly secure quantum key distribution networks.
  arXiv  Detail & Related papers  (2024-10-17T16:05:08Z)
• Improved finite-size key rates for discrete-modulated continuous variable quantum key distribution under coherent attacks [0.0]
  We consider a prepare-and-measure CVQKD protocol, where Alice chooses from a set of four coherent states and Bob performs a heterodyne measurement. We provide a security proof against coherent attacks in the finite-size regime, and compute the achievable key rate.
  arXiv  Detail & Related papers  (2024-07-03T13:18:31Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• Quantum Key Distribution Using a Quantum Emitter in Hexagonal Boron Nitride [48.97025221755422]
  We demonstrate a room temperature, discrete-variable quantum key distribution system using a bright single photon source in hexagonal-boron nitride. We have generated keys with one million bits length, and demonstrated a secret key of approximately 70,000 bits, at a quantum bit error rate of 6%. Our work demonstrates the first proof of concept finite-key BB84 QKD system realised with hBN defects.
  arXiv  Detail & Related papers  (2023-02-13T09:38:51Z)
• 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 key distribution with non-ideal heterodyne detection: composable security of discrete-modulation continuous-variable protocols [6.85316573653194]
  Continuous-variable quantum key distribution exploits coherent measurements of the electromagnetic field. In doing this, we establish for the first time the composable security of discrete-modulation continuous-variable quantum key distribution in the finite-size regime.
  arXiv  Detail & Related papers  (2021-08-01T11:00:10Z)
• 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)
• Dimension Reduction in Quantum Key Distribution for Continuous- and Discrete-Variable Protocols [3.749120127914018]
  We develop a method to connect the infinite-dimensional description of optical continuous-variable key distribution protocols to a finite-dimensional formulation. The secure key rates of quantum optical QKD protocols can then be evaluated using recently-developed reliable numerical methods for key rate calculations.
  arXiv  Detail & Related papers  (2021-01-14T18:59:19Z)
• Computing conditional entropies for quantum correlations [10.549307055348596]
  In particular, we find new upper bounds on the minimal global detection efficiency required to perform device-independent quantum key distribution. We introduce the family of iterated mean quantum R'enyi divergences with parameters $alpha_k = 1+frac12k-1$ for positive integers $k$. We show that the corresponding conditional entropies admit a particularly nice form which, in the context of device-independent optimization, can be relaxed to a semidefinite programming problem.
  arXiv  Detail & Related papers  (2020-07-24T15:27:51Z)
• Post-Quantum Multi-Party Computation [32.75732860329838]
  We study multi-party computation for classical functionalities (in the plain model) with security against malicious-time quantum adversaries. We assume superpolynomial quantum hardness of learning with errors (LWE), and quantum hardness of an LWE-based circular security assumption. Along the way, we develop cryptographic primitives that may be of independent interest.
  arXiv  Detail & Related papers  (2020-05-23T00:42:52Z)

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.