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:quant-ph/0407148 · Physical Review Letters

CollectiveAttacks and Unconditional Security in Continuous Variable Quantum KeyDistribution

Frédéric Grosshans

Published Jan 1, 2005• 179 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevlett.94.020504

Related papers

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 binary modulated continuous-variable quantum key distribution under collective attacks

Zhao Yi-Bo, Matthias Heid, Johannes Rigas +1 more

We estimate a lower bound to the secret key rate of a binary modulated continuous variable quantum key distribution scheme. We consider the collective attack scenario with quantum channels that impose arbitrary noise on the exchanged signals. The analysis is done in the infinite key limit. Bob performs ideal homodyne measurements on the received states and the two honest parties employ a reverse reconciliation procedure in the classical postprocessing step of the protocol.

arXiv:0807.3751•Physical Review A•Jan 9, 2009•111 citations

Security of coherent-state quantum cryptography in the presence of Gaussian noise

Matthias Heid, Norbert Lütkenhaus

We investigate the security against collective attacks of a continuous variable quantum key distribution scheme in the asymptotic key limit for a realistic setting. The quantum channel connecting the two honest parties is assumed to be lossy and imposes Gaussian noise on the observed quadrature distributions. Secret key rates are given for direct and reverse reconciliation schemes including post-selection in the collective attack scenario. The effect of a nonideal error correction and two-way communication in the classical post-processing step is also taken into account.

arXiv:quant-ph/0608015•Physical Review A•Aug 14, 2007•71 citations

Security against Collective Attacks for a Continuous-Variable Quantum Key Distribution Protocol Using Homodyne Detection and Postselection

Ryo Namiki

We analyze the security against collective attacks for a homodyne-based continuous-variable quantum key distribution protocol using binary coherent states and postselection. We derive a lower bound of the secret key rate in an asymptotic scenario, and numerically optimize it for the case of a symmetric Gaussian channel.

arXiv:2205.11820•Journal of the Physical Society of Japan•Dec 2, 2022•2 citations

Finite-size secret-key rates of discrete modulation continuous-variable quantum key distribution under Gaussian attacks

Gabriele Staffieri, Giovanni Scala, Cosmo Lupo

Quantum conditional entropies play a fundamental role in quantum information theory. In quantum key distribution, they are exploited to obtain reliable lower bounds on the secret-key rates in the finite-size regime, against collective attacks and coherent attacks under suitable assumptions. Here we consider continuous-variable communication protocols, where the sender Alice encodes information using a discrete modulation of phase-shifted coherent states, and the receiver Bob decodes by homodyne or heterodyne detection. We compute the Petz-Rényi and sandwiched Rényi conditional entropies associated with these setups, assuming either a passive eavesdropper or one that injects thermal photons into the channel, who gathers the quantum information leaked through a lossy communication line of known or bounded transmittance. Whereas our results do not directly provide reliable key-rate estimates, they do represent useful ballpark figures. We obtain analytical or semianalytical expressions that do not require intensive numerical calculations. These expressions serve as bounds on the key rates that may be tight in certain scenarios. We compare different estimates, including known bounds that have already appeared in the literature and bounds that we determine. The latter are found to be tighter for very short block sizes.

arXiv:2509.14345•Physical Review A•Feb 2, 2026•1 citation

The security of practical post-selection in Gaussian-modulated continuous-variable quantum key distribution

Adam Alderton, Weerasinghe Weerasinghe, Muataz Alhussein +2 more

Abstract Gaussian-modulated coherent-state (GMCS) continuous-variable quantum key distribution (CV-QKD) offers a practical path to quantum-secured communication owing to its compatibility with existing optical fibre networks and use of mature security proofs. Achieving high secret key rates in real-time systems, however, requires post-processing schemes that are both information-theoretically efficient and computationally scalable. In previous experimental work 1 , we have demonstrated record real-time key rates using a one-round sliced reconciliation scheme with guard-band post-selection. Here, we present the corresponding theoretical framework and provide an asymptotic security analysis that considers arbitrary collective attacks, a much broader class of attacks than the usually assumed Gaussian collective attacks. The security analysis applies the entropic continuity of quantum channels justified by a quantum channel estimation procedure. In conditions of high noise, our scheme uses 500 times less classical communication than multidimensional reconciliation.

npj Quantum Information•Sep 26, 2026•0 citations
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.
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 investigate the security against collective attacks of a continuous variable quantum key distribution scheme in the asymptotic key limit for a realistic setting. The quantum channel connecting the two honest parties is assumed to be lossy and imposes Gaussian noise on the observed quadrature distributions. Secret key rates are given for direct and reverse reconciliation schemes including post-selection in the collective attack scenario. The effect of a nonideal error correction and two-way communication in the classical post-processing step is also taken into account.
Quantum conditional entropies play a fundamental role in quantum information theory. In quantum key distribution, they are exploited to obtain reliable lower bounds on the secret-key rates in the finite-size regime, against collective attacks and coherent attacks under suitable assumptions. Here we consider continuous-variable communication protocols, where the sender Alice encodes information using a discrete modulation of phase-shifted coherent states, and the receiver Bob decodes by homodyne or heterodyne detection. We compute the Petz-Rényi and sandwiched Rényi conditional entropies associated with these setups, assuming either a passive eavesdropper or one that injects thermal photons into the channel, who gathers the quantum information leaked through a lossy communication line of known or bounded transmittance. Whereas our results do not directly provide reliable key-rate estimates, they do represent useful ballpark figures. We obtain analytical or semianalytical expressions that do not require intensive numerical calculations. These expressions serve as bounds on the key rates that may be tight in certain scenarios. We compare different estimates, including known bounds that have already appeared in the literature and bounds that we determine. The latter are found to be tighter for very short block sizes.
Abstract Gaussian-modulated coherent-state (GMCS) continuous-variable quantum key distribution (CV-QKD) offers a practical path to quantum-secured communication owing to its compatibility with existing optical fibre networks and use of mature security proofs. Achieving high secret key rates in real-time systems, however, requires post-processing schemes that are both information-theoretically efficient and computationally scalable. In previous experimental work 1 , we have demonstrated record real-time key rates using a one-round sliced reconciliation scheme with guard-band post-selection. Here, we present the corresponding theoretical framework and provide an asymptotic security analysis that considers arbitrary collective attacks, a much broader class of attacks than the usually assumed Gaussian collective attacks. The security analysis applies the entropic continuity of quantum channels justified by a quantum channel estimation procedure. In conditions of high noise, our scheme uses 500 times less classical communication than multidimensional reconciliation.