This thesis is concerned with the study and analysis of two quantum cryptographic protocols: quantum key distribution (QKD) and unforgeable quantum money in the continuous-variable (CV) framework. The main advantage of CV protocols is that their implementation only requires standard telecom components. QKD allows two distant parties, Alice and Bob, to establish a secure key, even in the presence of an eavesdropper, Eve. The remarkable property of QKD is that its security can be established in the information-theoretic setting, without appealing to any computational assumptions. Proving the security of CV-QKD protocols is challenging since the protocols are described in an infinite-dimensional Fock space. One of the open questions in CV-QKD was establishing security for two-way QKD protocols against general attacks. We exploit the invariance of Unitary group U(n) of the protocol to establish composable security against general attacks. We answer another pressing question in the field of CV-QKD with a discrete modulation by establishing the asymptotic security of such protocols against collective attacks. We provide a general technique to derive a lower bound on the secret key rate by formulating the problem as a semidefinite program. Quantum money exploits the no-cloning property of quantum mechanics to generate unforgeable tokens, banknotes, and credit cards. We propose a CV private-key quantum money scheme with classical verification. The motivation behind this protocol is to facilitate the process of practical implementation. Previous classical verification money schemes use single-photon detectors for verification, while our protocols use coherent detection.
This thesis is concerned with the study and analysis of two quantum cryptographic protocols: quantum key distribution (QKD) and unforgeable quantum money in the continuous-variable (CV) framework. The main advantage of CV protocols is that their implementation only requires standard telecom components. QKD allows two distant parties, Alice and Bob, to establish a secure key, even in the presence of an eavesdropper, Eve. The remarkable property of QKD is that its security can be established in the information-theoretic setting, without appealing to any computational assumptions. Proving the security of CV-QKD protocols is challenging since the protocols are described in an infinite-dimensional Fock space. One of the open questions in CV-QKD was establishing security for two-way QKD protocols against general attacks. We exploit the invariance of Unitary group U(n) of the protocol to establish composable security against general attacks. We answer another pressing question in the field of CV-QKD with a discrete modulation by establishing the asymptotic security of such protocols against collective attacks. We provide a general technique to derive a lower bound on the secret key rate by formulating the problem as a semidefinite program. Quantum money exploits the no-cloning property of quantum mechanics to generate unforgeable tokens, banknotes, and credit cards. We propose a CV private-key quantum money scheme with classical verification. The motivation behind this protocol is to facilitate the process of practical implementation. Previous classical verification money schemes use single-photon detectors for verification, while our protocols use coherent detection.
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.
The counter-intuitive features of quantum mechanics make it possible to solve problems and perform tasks that are beyond the abilities of non-quantum (classical) computers and communication devices. The field of quantum information processing studies how we can achieve such improvements by representing information as quantum states.One of the early achievements of quantum information processing is the development of quantum key distribution (QKD). QKD protocols allow two participants (Alice and Bob) to achieve the classically-impossible task of generating a secret shared key even if their adversary is computationally unlimited.Unfortunately, the security promises of QKD are true only in theory; practical implementations of QKD deviate from the theoretical protocols, and many of these deviations give rise to practical attacks. In this research thesis, we study the security properties of various QKD protocols in many practical settings:First, we study practical security of semiquantum key distribution (SQKD) protocols, where either Alice or Bob is non-quantum (classical). Following practical security problems in previous SQKD protocols, we suggest a new SQKD protocol (the "Mirror protocol") which can be securely implemented, and we prove it robust and secure against a wide range of attacks (the "uniform collective attacks").Then, we study "composable security" of the first QKD protocol created by Bennett and Brassard (BB84). BB84 has its unconditional security proved against adversaries performing the most general attacks in a theoretical (idealized) setting; however, some security approaches do not prove "composable security", which requires the secret key to remain secret even when Alice and Bob actually use it for cryptographic purposes. We generalize an algebraic security approach for BB84, making it prove composable security of BB84 (and many variants of BB84) against the most general attacks.Finally, we analyze an important practical attack (named "Bright Illumination"), showing how it can be modeled as a theoretical "Reversed-Space" attack.Overall, all results aim to enhance our understanding on how to bridge the gap between theory and practice in various sub-fields of QKD, and they may help solve a major open problem in the field of QKD: constructing a realistic QKD implementation that can be proved truly and unconditionally secure against any possible attack.
Harnessing the laws of quantum theory can drastically boost the security of modern communication networks, from public key encryption to electronic voting and online banking. In this thesis, we bridge the gap between theory and experiment regarding two quantum-cryptographic tasks: quantum money and quantum weak coin flipping. Quantum money exploits the no-cloning property of quantum physics to generate unforgeable tokens, banknotes, and credit cards. We provide the first proof-of-principle implementation of this task, using photonic systems at telecom wavelengths. We then develop a practical security proof for quantum credit card schemes, in which the bank can remotely verify a card even in the presence of a malicious payment terminal. We finally propose a setup for secure quantum storage of the credit card, using electromagnetically-induced transparency in a cloud of cold cesium atoms. Quantum weak coin flipping is a fundamental cryptographic primitive, which helps construct more complex tasks such as bit commitment and multiparty computation. It allows two distant parties to flip a coin when they both desire opposite outcomes. Using quantum entanglement then prevents any party from biasing the outcome of the flip beyond a certain probability. We propose the first implementation for quantum weak coin flipping, which requires a single photon and linear optics only. We provide the complete security analysis in the presence of noise and losses, and show that the protocol is implementable on the scale of a small city with current technology. We finally propose a linear-optical extension of the protocol to lower the coin bias.
Discrete-Modulated (DM) Continuous-Variable (CV) Quantum Key Distribution (QKD) is an experimentally attractive approach to quantum cryptography, offering high key rates over metropolitan-scale distances while relying on state-of-the-art telecom infrastructure. However, a fundamental gap has remained between this experimental promise and rigorous security: for more than two decades, DM CV-QKD has lacked a complete composable finite-size security proof against coherent attacks. Existing works either restrict the adversary to collective attacks, impose additional finite-dimensional assumptions, apply only to specific modulation formats, or fail to recover the known asymptotic rates. Here, we resolve this longstanding problem by establishing the first complete composable finite-size security proof for DM CV-QKD protocols against coherent attacks, incorporating imperfect detectors and both fixed- and variable-length protocol variants. Our proof introduces two central results of broader interest: an infinite-dimensional marginal-constrained entropy accumulation theorem (iMEAT) and a rigorous dimension-reduction technique that makes the infinite-dimensional security bounds numerically tractable. The resulting key rates recover the known asymptotic rates and outperform established finite-size bounds based on collective attacks, while yielding positive key rates beyond 70km for experimentally relevant block sizes and parameters. Thus, our work closes a longstanding gap and places an experimentally attractive class of CV-QKD protocols on a rigorous composable security footing and provides a pathway towards their practical deployment.
Quantum information processing uses the laws of quantum physics to perform tasks that are infeasible or impossible classically. Within this broader programme, quantum communication has emerged as one of the most practically mature sub-fields of quantum information science, with several proposed protocols having already been demonstrated over deployed optical fibre and free-space links. Of the various platforms available for encoding quantum information for communication, the continuous-variable (CV) framework encodes information in the quadratures of the electromagnetic field and is therefore directly compatible with the existing machinery of classical coherent optical communications. The most prominent CV protocol is continuous-variable quantum key distribution (CV-QKD), which establishes an information-theoretically secure cryptographic key between two spatially separated parties. Because CV-QKD reuses much of the hardware of classical coherent telecommunications, including off-the-shelf lasers, modulators, and balanced detectors, it is a leading candidate for the deployment of quantum-secured communication over standard optical fibre networks. The development of CV-QKD has typically proceeded with the underlying physics dictating the engineering. Security proofs, often relying on the Gaussian optimality of collective attacks, set the structure of the protocol, and the practical system is then built to satisfy the assumptions on which those proofs depend. Contributions of this thesis adopt the opposite view, taking the practical engineering of high-rate CV-QKD systems as the starting point and developing the theoretical machinery required to support it. The first contribution is the formalisation of one-round sliced reconciliation with guard-band post-selection as a key distillation scheme designed for real-time, high-throughput operation. Originally introduced experimentally as a means to stabilise bit error rates and enable the use of fixed-rate error correction codes at high symbol rates, guard-band post-selection is shown here to identify the guard-band span as a free parameter that can be tuned to hold the quantum bit error rate approximately constant across a range of channel conditions. However, conditioning on accepted data produces non-Gaussian post-selected statistics that lie outside the reach of standard Gaussian-optimality security arguments, which motivates the remaining two contributions. The second contribution is an asymptotic security analysis of guard-band post-selected CV-QKD against arbitrary collective attacks, no longer restricted to Gaussian adversaries. By using a quantum channel estimate as side information and by lifting reduced-state distances to purification distances via entropic continuity bounds, security is certified against the class of channels lying close to a Gaussian thermal-loss reference, with a key-rate penalty that scales with the energy-constrained diamond distance to that reference. The third contribution is the experimental basis required to apply this framework in practice. A lightweight three-stage protocol for quantum channel estimation is proposed and demonstrated, which repurposes the Gaussian probe constellation already present in the CV-QKD signal and requires no additional hardware or modifications to the underlying protocol. Over single-mode optical fibre at distances from 10 km to 50 km, the protocol produces physically valid process tensor estimates whose energy-constrained diamond distances to a Gaussian reference channel remain on the order of 10^(-3) throughout. Together, these three contributions provide a treatment of post-selected Gaussian-modulated CV-QKD in which the engineering, the security theory, and the channel characterisation are designed to operate together within a deployable system.