Security of practical continuous-variable quantum key distribution is addressed and a security analysis framework, which does not rely on phase-space symmetries of signal states and correlations, is developed. In a general purification-based approach, following optimality of Gaussian collective attacks, it is suggested to find an equivalent generally mixed two-mode state shared between the trusted parties and then purifying it using Bloch-Messiah decomposition. This allows to assess security of the schemes with arbitrary parameters, which can be typically expected in experiments. It also allows to theoretically predict the role of asymmetries of signals and correlations on security of the protocols. The method can be used for security analysis of practical continuous-variable schemes directly from the measured data without any symmetrization assumptions.
Security of practical continuous-variable quantum key distribution is addressed and a security analysis framework, which does not rely on phase-space symmetries of signal states and correlations, is developed. In a general purification-based approach, following optimality of Gaussian collective attacks, it is suggested to find an equivalent generally mixed two-mode state shared between the trusted parties and then purifying it using Bloch-Messiah decomposition. This allows to assess security of the schemes with arbitrary parameters, which can be typically expected in experiments. It also allows to theoretically predict the role of asymmetries of signals and correlations on security of the protocols. The method can be used for security analysis of practical continuous-variable schemes directly from the measured data without any symmetrization assumptions.
We introduce a symmetrization technique that can be used as an extra step in some continuous-variable quantum key distribution protocols. By randomizing the data in phase space, one can dramatically simplify the security analysis of the protocols, in particular in the case of collective attacks. The main application of this procedure concerns protocols with postselection, for which security was established only against Gaussian attacks until now. Here, we prove that under some experimentally verifiable conditions, Gaussian attacks are optimal among all collective attacks.
Establishing the security of continuous-variable quantum key distribution against general attacks in a realistic finite-size regime is an outstanding open problem in the field of theoretical quantum cryptography if we restrict our attention to protocols that rely on the exchange of coherent states. Indeed, techniques based on the uncertainty principle are not known to work for such protocols, and the usual tools based on de Finetti reductions only provide security for unrealistically large block lengths. We address this problem here by considering a new type of Gaussian de Finetti reduction, that exploits the invariance of some continuous-variable protocols under the action of the unitary group U(n) (instead of the symmetric group S_{n} as in usual de Finetti theorems), and by introducing generalized SU(2,2) coherent states. Crucially, combined with an energy test, this allows us to truncate the Hilbert space globally instead as at the single-mode level as in previous approaches that failed to provide security in realistic conditions. Our reduction shows that it is sufficient to prove the security of these protocols against Gaussian collective attacks in order to obtain security against general attacks, thereby confirming rigorously the widely held belief that Gaussian attacks are indeed optimal against such protocols.
Quantum Key Distribution (QKD) provides a method for securely sharing a secret key between two distant parties, Alice and Bob, by leveraging the principles of quantum mechanics. This thesis focuses on Continuous-Variable (CV) QKD, a variant of QKD where information is encoded in the quadrature components of coherent light states, allowing for efficient and cost-effective detection using homodyne or heterodyne receivers. The thesis is divided into three main parts: an introduction to quantum cryptography concepts, the presentation of a CV-QKD protocol, and a detailed security proof of the protocol against different types of attacks. The security proof considers both finite and infinite symbol transmission and tackles various eavesdropping attacks, including individual, collective, and coherent attacks. The use of Gaussian states and operations provides a promising approach to enhance QKD security, particularly in the context of practical quantum cryptography. The final sections provide a mathematical framework for the optimization of secure key rates and strategies for addressing the photon-number cutoff assumption in practical implementations.
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 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.
Continuous variable quantum key distribution via discrete modulations ensures information-theoretic security using standard telecom technologies, providing affordable and scalable quantum communications with simplified classical postprocessing. However, existing security proofs against general attacks often rely on restrictive assumptions, such as a bounded dimension for coherent states, or require impractically large block sizes. In this work, we develop a finite-size security analysis that removes these limitations while incorporating realistic experimental features. Our approach combines an optimization under infinite dimensions, a security proof against general attacks, a trusted detector model accounting for the receiver imperfections, and postselection strategies to reuse discarded measurement outcomes. We report positive key rates in the finite-size regime for relevant block sizes of the order of 107. These results contribute to narrowing the gap between theoretical security proofs and practical implementations of discrete-modulated continuous variable quantum key distribution protocols.