Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0809.2252

Unconditional security of continuous-variable quantum key distribution

Anthony Leverrier, Evgueni Karpov, Philippe Grangier, Nicolas J. Cerf

Published Sep 12, 2008• 6 citations
arXivHTMLPDF

Abstract

The unconditional security of continuous-variable quantum key distribution is established for all schemes based on the estimation of the channel loss and excess noise. It is proved that, in the limit of large keys, Gaussian attacks are asymptotically optimal among the most general (coherent) attacks, where the transmission is tapped using arbitrary ancillas and stored in a quantum memory as a whole. Then, it is shown that the previously derived bounds on the achievable secret key rates against collective attacks remain asymptotically valid for arbitrary coherent attacks.

DOI
10.48550/arxiv.0809.2252

Related papers

Unconditional Security of Continuous-Variable Quantum Cryptography

Carlo Ottaviani

This thesis deals with a detailed study of the unconditional security of Continuous-Variable (CV) Quantum Key Distribution (QKD). We consider general communication architectures based on both point-to-point and end-to-end principle. For the first case we develop an extensive analysis of the unconditional security of both one-way and two-way protocol under several eavesdropping conditions. We describe an effective post-processing strategy, to apply to one-way communications, that allows to neutralise general coherent attacks. This result motivates us to formulate the conjecture that the "de Finettization" of the classical data, typically adopted in the asymptotic limit of many signals exchanged in order to reduce the attacks from a general coherent to a collective one, may not be necessary for Gaussian one-way communication. For what it concerns two-way protocols we show that after the reduction of the general attack using the de Finetti symmetrization, two-mode coherent attacks are the optimal eavesdropping. Our cryptanalysis shows that the parties can exploit a strategy, in combination with the results obtained on the security of one-way protocols against two-mode coherent attacks. In fact we prove explicitly that two-way communication with Gaussian continuous variables is immune to general coherent attacks. This is possible exploiting the random opening and closing of the circuit by Alice (ON/OFF switching), in the limit of many uses of the channel. We then conclude that collective attacks represent, strictly, the best strategy available to Eve. We have then studied the general security of one-way protocol considering not just lossy channel, but extending the cryptanalysis to all physically allowed canonical forms attacks. Finally we extended the study of thermal CV-QKD to two-way communication at different frequencies, in the framework of optimal collective attacks. In the last part of this thesis we focused on CV-QKD considering a modern end-to-end configuration. We then extend CV quantum cryptography to a network configuration. We develop a detailed cryptoanalysis of a communication scheme based on an untrusted relay, assisting the parties during the preparation of the secret key. We find the optimal eavesdropping and prove, both theoretically and experimentally, the feasibility of high-rate CV-QKD over metropolitan distances with of-the-shelves devices.

•Jul 15, 2015•0 citations

Asymptotic security of discrete-modulation protocols for continuous-variable quantum key distribution

Eneet Kaur, Saikat Guha, Mark M. Wilde

We consider discrete-modulation protocols for continuous-variable quantum key distribution (CV-QKD) that employ a modulation constellation consisting of a finite number of coherent states and that use a homodyne- or a heterodyne-detection receiver. We establish a security proof for collective attacks in the asymptotic regime, and we provide a formula for an achievable secret-key rate. Previous works established security proofs for discrete-modulation CV-QKD protocols that use two or three coherent states. The main constituents of our approach include approximating a complex, isotropic Gaussian probability distribution by a finite-size Gauss-Hermite constellation, applying entropic continuity bounds, and leveraging previous security proofs for Gaussian-modulation protocols. As an application of our method, we calculate secret-key rates achievable over a lossy thermal bosonic channel. We show that the rates for discrete-modulation protocols approach the rates achieved by a Gaussian-modulation protocol as the constellation size is increased. For pure-loss channels, our results indicate that in the high-loss regime and for sufficiently large constellation size, the achievable key rates scale optimally, i.e., proportional to the channel's transmissivity.

arXiv:1901.10099•Physical Review A•Jan 15, 2021•52 citations

Asymptotic security of the four-state continuous-variable quantum key distribution protocol

Shouvik Ghorai, Philippe Grangier, Eleni Diamanti +1 more

We establish a lower bound on the asymptotic secret key rate of continuous-variable quantum key distribution with a discrete modulation of coherent states. The bound is valid against collective attacks and is obtained by formulating the problem as a semidefinite program. We illustrate our general approach with the quadrature phase-shift keying (QPSK) modulation scheme and show that distances over 100 km are achievable for realistic values of noise. We also discuss the application to more complex quadrature amplitude modulations (QAM) schemes. This work is a major step towards establishing the full security of continuous-variable protocols with a discrete modulation in the finite-size regime and opens the way to large-scale deployment of these protocols for quantum key distribution.

•Feb 4, 2019•0 citations

CollectiveAttacks and Unconditional Security in Continuous Variable Quantum KeyDistribution

Frédéric Grosshans

We present here an information theoretic study of Gaussian collective attacks on the continuous variable key distribution protocols based on Gaussian modulation of coherent states. These attacks, overlooked in previous security studies, give a finite advantage to the eavesdropper in the experimentally relevant lossy channel, but are not powerful enough to reduce the range of the reverse reconciliation protocols. Secret key rates are given for the ideal case where Bob performs optimal collective measurements, as well as for the realistic cases where he performs homodyne or heterodyne measurements. We also apply the generic security proof of Christiandl et al. to obtain unconditionally secure rates for these protocols.

arXiv:quant-ph/0407148•Physical Review Letters•Jan 1, 2005•179 citations

Security bound of continuous-variable quantum key distribution with noisy coherent states and channel

Yong Shen, Jian Cheng Yang, Hong Mei Guo

Security of a continuous-variable quantum key distribution protocol based on noisy coherent states and channel is analysed. Assuming that the noise of coherent states is induced by Fred, a neutral party relative to others, we prove that the prepare-and-measurement scheme (P&M) and entanglement-based scheme (E-B) are equivalent. Then, we show that this protocol is secure against Gaussian collective attacks even if the channel is lossy and noisy, and, further, a lower bound to the secure key rate is derived.

arXiv:0904.1327•Journal of Physics B Atomic Molecular and Optical Physics•Nov 23, 2009•23 citations

Composable Security Proof for Continuous-Variable Quantum Key Distribution with Coherent States

Anthony Leverrier

We give the first composable security proof for continuous-variable quantum key distribution with coherent states against collective attacks. Crucially, in the limit of large blocks the secret key rate converges to the usual value computed from the Holevo bound. Combining our proof with either the de Finetti theorem or the postselection technique then shows the security of the protocol against general attacks, thereby confirming the long-standing conjecture that Gaussian attacks are optimal asymptotically in the composable security framework. We expect that our parameter estimation procedure, which does not rely on any assumption about the quantum state being measured, will find applications elsewhere, for instance, for the reliable quantification of continuous-variable entanglement in finite-size settings.

arXiv:1408.5689•Physical Review Letters•Feb 19, 2015•382 citations
The unconditional security of continuous-variable quantum key distribution is established for all schemes based on the estimation of the channel loss and excess noise. It is proved that, in the limit of large keys, Gaussian attacks are asymptotically optimal among the most general (coherent) attacks, where the transmission is tapped using arbitrary ancillas and stored in a quantum memory as a whole. Then, it is shown that the previously derived bounds on the achievable secret key rates against collective attacks remain asymptotically valid for arbitrary coherent attacks.
This thesis deals with a detailed study of the unconditional security of Continuous-Variable (CV) Quantum Key Distribution (QKD). We consider general communication architectures based on both point-to-point and end-to-end principle. For the first case we develop an extensive analysis of the unconditional security of both one-way and two-way protocol under several eavesdropping conditions. We describe an effective post-processing strategy, to apply to one-way communications, that allows to neutralise general coherent attacks. This result motivates us to formulate the conjecture that the "de Finettization" of the classical data, typically adopted in the asymptotic limit of many signals exchanged in order to reduce the attacks from a general coherent to a collective one, may not be necessary for Gaussian one-way communication. For what it concerns two-way protocols we show that after the reduction of the general attack using the de Finetti symmetrization, two-mode coherent attacks are the optimal eavesdropping. Our cryptanalysis shows that the parties can exploit a strategy, in combination with the results obtained on the security of one-way protocols against two-mode coherent attacks. In fact we prove explicitly that two-way communication with Gaussian continuous variables is immune to general coherent attacks. This is possible exploiting the random opening and closing of the circuit by Alice (ON/OFF switching), in the limit of many uses of the channel. We then conclude that collective attacks represent, strictly, the best strategy available to Eve. We have then studied the general security of one-way protocol considering not just lossy channel, but extending the cryptanalysis to all physically allowed canonical forms attacks. Finally we extended the study of thermal CV-QKD to two-way communication at different frequencies, in the framework of optimal collective attacks. In the last part of this thesis we focused on CV-QKD considering a modern end-to-end configuration. We then extend CV quantum cryptography to a network configuration. We develop a detailed cryptoanalysis of a communication scheme based on an untrusted relay, assisting the parties during the preparation of the secret key. We find the optimal eavesdropping and prove, both theoretically and experimentally, the feasibility of high-rate CV-QKD over metropolitan distances with of-the-shelves devices.
We consider discrete-modulation protocols for continuous-variable quantum key distribution (CV-QKD) that employ a modulation constellation consisting of a finite number of coherent states and that use a homodyne- or a heterodyne-detection receiver. We establish a security proof for collective attacks in the asymptotic regime, and we provide a formula for an achievable secret-key rate. Previous works established security proofs for discrete-modulation CV-QKD protocols that use two or three coherent states. The main constituents of our approach include approximating a complex, isotropic Gaussian probability distribution by a finite-size Gauss-Hermite constellation, applying entropic continuity bounds, and leveraging previous security proofs for Gaussian-modulation protocols. As an application of our method, we calculate secret-key rates achievable over a lossy thermal bosonic channel. We show that the rates for discrete-modulation protocols approach the rates achieved by a Gaussian-modulation protocol as the constellation size is increased. For pure-loss channels, our results indicate that in the high-loss regime and for sufficiently large constellation size, the achievable key rates scale optimally, i.e., proportional to the channel's transmissivity.
We establish a lower bound on the asymptotic secret key rate of continuous-variable quantum key distribution with a discrete modulation of coherent states. The bound is valid against collective attacks and is obtained by formulating the problem as a semidefinite program. We illustrate our general approach with the quadrature phase-shift keying (QPSK) modulation scheme and show that distances over 100 km are achievable for realistic values of noise. We also discuss the application to more complex quadrature amplitude modulations (QAM) schemes. This work is a major step towards establishing the full security of continuous-variable protocols with a discrete modulation in the finite-size regime and opens the way to large-scale deployment of these protocols for quantum key distribution.
We present here an information theoretic study of Gaussian collective attacks on the continuous variable key distribution protocols based on Gaussian modulation of coherent states. These attacks, overlooked in previous security studies, give a finite advantage to the eavesdropper in the experimentally relevant lossy channel, but are not powerful enough to reduce the range of the reverse reconciliation protocols. Secret key rates are given for the ideal case where Bob performs optimal collective measurements, as well as for the realistic cases where he performs homodyne or heterodyne measurements. We also apply the generic security proof of Christiandl et al. to obtain unconditionally secure rates for these protocols.
Security of a continuous-variable quantum key distribution protocol based on noisy coherent states and channel is analysed. Assuming that the noise of coherent states is induced by Fred, a neutral party relative to others, we prove that the prepare-and-measurement scheme (P&M) and entanglement-based scheme (E-B) are equivalent. Then, we show that this protocol is secure against Gaussian collective attacks even if the channel is lossy and noisy, and, further, a lower bound to the secure key rate is derived.
We give the first composable security proof for continuous-variable quantum key distribution with coherent states against collective attacks. Crucially, in the limit of large blocks the secret key rate converges to the usual value computed from the Holevo bound. Combining our proof with either the de Finetti theorem or the postselection technique then shows the security of the protocol against general attacks, thereby confirming the long-standing conjecture that Gaussian attacks are optimal asymptotically in the composable security framework. We expect that our parameter estimation procedure, which does not rely on any assumption about the quantum state being measured, will find applications elsewhere, for instance, for the reliable quantification of continuous-variable entanglement in finite-size settings.