<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Shouvik Ghorai | LIP6 - Équipe QI</title><link>https://qi.lip6.fr/fr/people/shouvik-ghorai/</link><atom:link href="https://qi.lip6.fr/fr/people/shouvik-ghorai/index.xml" rel="self" type="application/rss+xml"/><description>Shouvik Ghorai</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>fr</language><copyright>© 2022 LIP6 Quantum Information Team</copyright><lastBuildDate>Fri, 12 Feb 2021 00:00:00 +0000</lastBuildDate><image><url>https://qi.lip6.fr/media/icon_hu_bdeccd9e706ea09d.png</url><title>Shouvik Ghorai</title><link>https://qi.lip6.fr/fr/people/shouvik-ghorai/</link></image><item><title>Continuous-variable quantum cryptographic protocols</title><link>https://qi.lip6.fr/fr/publication/3571428-continuous-variable-quantum-cryptographic-protocols/</link><pubDate>Fri, 12 Feb 2021 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/3571428-continuous-variable-quantum-cryptographic-protocols/</guid><description>&lt;p&gt;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.&lt;/p&gt;</description></item><item><title>Continuous Variable Quantum Cryptographic Protocols</title><link>https://qi.lip6.fr/fr/defended_thesis/shouvik-ghorai/</link><pubDate>Mon, 01 Feb 2021 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/defended_thesis/shouvik-ghorai/</guid><description>&lt;p&gt;&lt;strong&gt;Abstract&lt;/strong&gt; :&lt;br&gt;
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.&lt;/p&gt;</description></item><item><title>Asymptotic security of continuous-variable quantum key distribution with a discrete modulation</title><link>https://qi.lip6.fr/fr/publication/2163714-asymptotic-security-of-continuous-variable-quantum-key-distribution-with-a-discrete-modulation/</link><pubDate>Tue, 25 Jun 2019 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/2163714-asymptotic-security-of-continuous-variable-quantum-key-distribution-with-a-discrete-modulation/</guid><description>&lt;p&gt;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 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-modulation schemes. This result opens the way to establishing the full security of continuous-variable protocols with a discrete modulation, and thereby to the large-scale deployment of these protocols for quantum key distribution.&lt;/p&gt;</description></item><item><title>Composable security of two-way continuous-variable quantum key distribution without active symmetrization</title><link>https://qi.lip6.fr/fr/publication/2096575-composable-security-of-two-way-continuous-variable-quantum-key-distribution-without-active-symmetrization/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/2096575-composable-security-of-two-way-continuous-variable-quantum-key-distribution-without-active-symmetrization/</guid><description>&lt;p&gt;We present a general framework encompassing a number of continuous-variable quantum key distribution protocols, including standard one-way protocols, measurement-device-independent protocols, as well as some two-way protocols, or any other continuous-variable protocol involving only a Gaussian modulation of coherent states and heterodyne detection. The main interest of this framework is that the corresponding protocols are all covariant with respect to the action of the unitary group U(n), implying that their security can be established thanks to a Gaussian de Finetti reduction. In particular, we give a composable security proof of two-way continuous-variable quantum key distribution against general attacks. We also prove that no active symmetrization procedure is required for these protocols, which would otherwise make them prohibitively costly to implement.&lt;/p&gt;</description></item></channel></rss>