Skip to main content
Scientific Reports logoLink to Scientific Reports
. 2016 Mar 1;6:22225. doi: 10.1038/srep22225

General immunity and superadditivity of two-way Gaussian quantum cryptography

Carlo Ottaviani 1,a, Stefano Pirandola 1
PMCID: PMC4772010  PMID: 26928053

Abstract

We consider two-way continuous-variable quantum key distribution, studying its security against general eavesdropping strategies. Assuming the asymptotic limit of many signals exchanged, we prove that two-way Gaussian protocols are immune to coherent attacks. More precisely we show the general superadditivity of the two-way security thresholds, which are proven to be higher than the corresponding one-way counterparts in all cases. We perform the security analysis first reducing the general eavesdropping to a two-mode coherent Gaussian attack, and then showing that the superadditivity is achieved by exploiting the random on/off switching of the two-way quantum communication. This allows the parties to choose the appropriate communication instances to prepare the key, accordingly to the tomography of the quantum channel. The random opening and closing of the circuit represents, in fact, an additional degree of freedom allowing the parties to convert, a posteriori, the two-mode correlations of the eavesdropping into noise. The eavesdropper is assumed to have no access to the on/off switching and, indeed, cannot adapt her attack. We explicitly prove that this mechanism enhances the security performance, no matter if the eavesdropper performs collective or coherent attacks.


Quantum Key Distribution (QKD)1 is today one of the most advanced quantum technologies among those emerged from the fundamental research in quantum information. Rapidly progressing towards practical implementations2, the interest in QKD is motivated by the promise of achieving efficient distribution of cryptographic keys over insecure channels. In fact its main goal is to provide an information-theoretic secure strategy to share cryptographic keys in order to replace the current computationally-secure solution3, which has been proved to be vulnerable4 to attacks by quantum computers.

The typical scenario involves two parties, Alice and Bob, who want to share a secret message over an insecure channel5. To achieve this goal they encode classical information in non-orthogonal quantum states, which are sent over a noisy quantum channel under control of an eavesdropper, Eve. The standard assumptions to analyze the security of QKD protocols are the following: Eve is computationally unbounded, but has no-access to the parties’ private spaces2,5 and, most importantly, she is restricted by the no-cloning theorem6. The distribution of private keys is possible because any attempt to extract the encoded information unavoidably introduces noise on the quantum states. Monitoring this noise the parties can quantify how much Eve has learnt on the secret key and, consequently, apply classical error correction and privacy amplification protocols reducing Eve’s information to a negligible amount. Once they have distilled such a key, the parties can safely use the one-time pad protocol. In case the level of noise is too high, above the security threshold, they can to abort the protocol (denial of service).

The first theoretical proposals for QKD protocols have been designed for discrete variables (DV)1 systems. Today several remarkable implementation of DV-QKD have been achieved in both fibers7 and free space8. Beside this approach, several protocols exploiting quantum continuous-variable (CV) systems have been put forward9,10,11,12,13,14. In CV-QKD15 the information is encoded in quantum systems with continuous spectra (infinite-dimensional Hilbert space), and a special attention has been devoted to Gaussian CV systems16.

Gaussian CV-QKD has been achieved in in-field implementations17, with practical performances comparable to those of DV-QKD, despite the latter appears to be more robust for long-distances. The result of ref. 17 has been possible combining efficient reconciliation protocols11, post-selection18 techniques and efficient classical compression codes19. The interest in optical CV systems, for quantum information purposes, is now growing, boosted mainly by the natural properties of these systems: relatively cheap experimental implementation, higher rates, broadband detection techniques20, and the possibility of exploiting a wide range of frequencies21,22. These natural properties make CV-QKD a promising candidate for future practical real-world implementations, especially in the mid-range distances like the metropolitan areas where high rates are desirable23.

Today, many theoretical efforts are devoted to the design of device independent (DI) QKD protocols24,25. Despite recent remarkable results, the practical implementation of this approach remains still difficult26,27,28. Very likely the next generation of end-to-end quantum networks will use the recently introduced29,30 measurement device independent QKD (MDI-QKD) which allows the distribution of cryptographic keys preserving the protection against the most typical side-channel attacks, without the need to pass a Bell test (see ref. 29 for a general security analysis). Recently a very high-rate CV-MDI QKD protocol has been proposed and tested in a proof of principle experiment23,31,32.

Alongside the study of end-to-end QKD, it is also of great interest the design of more robust point-to-point QKD schemes improving the security performances of CV-QKD in noisier environments14 or able to exploit trusted noise33 to implement QKD at different frequencies21. In this regard, the two-way protocols14, where the parties make a double use of the quantum channel to improve the tolerance to noise, show higher security thresholds than the one-way counterparts. This idea has been also extended to thermal QKD34. Also note that the two-way protocols have been developed for DV-QKD35,36 and can be used for direct quantum communication37,38.

The main result in this work is the explicit study of the asymptotic security of two-way Gaussian protocols against coherent attacks, and the proof that these schemes are in fact immune to this eavesdropping. The general strategy to achieve this goal follows a previous insight14 and can be summarized as follows (see Fig. 1): The parties randomly switch ON or OFF the two-way communication line, and they post-select the OFF instances if they detect the presence of coherent attacks, otherwise they use the ON instances. We explicitly study the security threshold of the OFF configuration against two-mode coherent attacks, which are the residual eavesdropping after de Finetti reduction. Our approach allows us to prove that the superadditivity of the two-way thresholds is a general feature. This result can also be understood noting that the ON/OFF switching activates an additional degree of freedom, exclusive to the parties, which can be used to convert (a-posteriori) Eve’s correlations into a noise on which Eve has no control.

Figure 1. Two-way CV-QKD protocol. Steps: forward, Bob prepares coherent states of amplitude β and density matrix ρ(β) and sends them through the noisy channel.

Figure 1

Using the circuit in ON configuration, Alice applies a random displacement Inline graphic on Inline graphic encoding information in the amplitude α. Backward, Alice then sends the quantum state Inline graphic to Bob who applies heterodyne detection with outcome Inline graphic, and applies classical post-processing to subtract the reference amplitude β to recover α. In OFF configuration, the circuit is opened at Alice’s station. She applies heterodyne detection on the reference state, obtaining the variable α. She then prepares a new coherent state Inline graphic which is sent back to Bob who heterodynes this state obtaining the variable Inline graphic. During the quantum communication Eve, as well as Bob, does not know which setup of the circuit has been adopted. For this reason, she is forced to attack both communication steps, and cannot adapt her attack to the ON/OFF setup.

Results

The Scheme

In Fig. 1 we describe a two-way quantum communication protocol. We focus on use of coherent states, for the encoding, and heterodyne detections for the decoding10,14. Bob prepares a Gaussian-modulated reference coherent state with density matrix Inline graphic, and use the quantum channel to transmit it to Alice who, randomly, decides to close (case ON) or open (case OFF) the quantum communication. Let discuss the two cases in detail.

Case ON: Alice encoding is performed by applying a Gaussian-modulated displacement Inline graphic on the reference state Inline graphic, obtaining a new coherent state with density matrix Inline graphic. This is sent back to Bob who performs heterodyne detection on the received state Inline graphic, and applies classical post-processing in order to subtract the reference variable β and derive Bob’s estimate Inline graphic of Alice’s variable α.

Case OFF. Alice applies heterodyne detection on the reference state Inline graphic with outcome α. Then, she prepares a new Gaussian-modulated coherent state Inline graphic which is sent back to Bob, who heterodynes it with outcome Inline graphic. After this, the parties can use the two pairs of variables Inline graphic and Inline graphic to prepare the key.

We note that, during the quantum communication, both Bob and Eve do not know the configuration adopted. This information is shared during the phase of parameter estimation and is part of the classical communication performed by Alice over the public channel. In the following we focus on the use of reverse reconciliation (RR)11,16 (direct reconciliation is discussed in the supplemental material). With the quantum communication in ON, the RR corresponds to Alice inferring Bob’s final outcome variable Inline graphic. With the circuit in OFF, the RR corresponds to Bob estimating Alice’s variable α during the forward stage, followed by Alice estimating Bob’s detection variable Inline graphic.

As described in ref. 14 the advantage of having the ON/OFF switching is that this degree of freedom can be used to post-select the data in order to prepare the key. After the channel tomography they can determine which attack has been performed and in which status of the circuit. Then they keep data from case ON when they detect a collective attack, while they use data exchanged with the circuit in OFF when the attack is coherent.

Security analysis and attack reduction

We study the security of the scheme assuming the asymptotic limit of many uses of the quantum channel, Inline graphic. In the worst-case scenario the eavesdropper attaches ancillary quantum systems, Inline graphic, to each exchanged signal, and process the Ek’s by a global coherent unitary operation. The ancillary output modes are stored in a quantum memory (QM), and coherently measured after the classical communication between Alice and Bob at the end of the protocol. Such an eavesdropping defines a general coherent attack.

The parties can now reduce the complexity of the previous scenario, by applying symmetric random permutations39 of their classical data. This allows them to get rid of all the correlations between distinct instances of the protocol. It is then clear that, in the case of two-way communication, the de Finetti symmetrization provides a residual two-mode coherent attack, where the only surviving correlations are those between Inline graphic and Inline graphic, used by Eve in each single round-trip. These ancillary modes are mixed with the forward and backward signals by means of beam splitters. Note that we can rid of additional modes e because we work in the asymptotic limit and we bound Eve’s accessible information using the Holevo function40. Finally, a further simplification comes from the extremality of Gaussian states16, which means that we can restrict Eve’s input Inline graphic to be a Gaussian state.

The Gaussian attack is collective, when Inline graphic, Inline graphic are uncorrelated, or two-mode coherent when they are correlated. Studying this second case with the circuit in ON and in DR, ref. 41 found that optimal two-mode attacks exist which can reduce the security performances of the two-way protocol below the one-way threshold. Here we show that, using the scheme with the ON/OFF switching, and post-selecting the optimal key-rate accordingly to the attack detected, the parties can overcome this problem. The security analysis is performed according to the setup shown in Fig. 2, where Fig. 2(a) refers to collective attacks, while Fig. 2(b) refers to two-mode coherent attacks. In the latter case, the security analysis is performed in the entanglement based (EB) representation11,16.

Figure 2.

Figure 2

Panel (a) shows the two-way scheme in ON configuration. This is used against collective Gaussian attacks, typically implemented by means of two independent entangling cloners. Each beam-splitter has transmissivity T, and Eve mixes the ancillas Inline graphic and Inline graphic with the signals modes Inline graphic and Inline graphic Panel (b) describes the OFF configuration, whose security is studied against two-mode Gaussian attacks. In this case we study the security of the scheme in the entanglement based representation.

Description of the two-mode Gaussian attack in the EB representation

In EB representation both Bob and Alice remotely prepare coherent states on the travelling modes Inline graphic and Inline graphic by using two-mode squeezed vacuum states, described by covariance matrices (CMs) of the following form

graphic file with name srep22225-m23.jpg
graphic file with name srep22225-m24.jpg

on which they apply heterodyne detections on the respective local modes Inline graphic and Inline graphic. The parameters Inline graphic, and Inline graphic describe the variance of the thermal state injected by Alice and Bob, respectively. The two travelling modes, Inline graphic and Inline graphic, are mixed with Eve’s modes, Inline graphic and Inline graphic, on two identical beam splitters, with transmissivity T. Eve’s input state Inline graphic is a zero mean, two-mode correlated thermal state, with CM

graphic file with name srep22225-m34.jpg

where Inline graphic gives the variance of the thermal noise injected, while g and Inline graphic describe the correlations between the two ancillas.

Note that the double use of the channel corresponds to a sequential use of the same communication line (optical fibre), so it is reasonable to consider a symmetric channel (T and ω are the same during the forward and backward communication). The correlation parameters g and Inline graphic must fulfill the following constraints

graphic file with name srep22225-m38.jpg

in order to certify that Inline graphic is a bona fide CM. If Inline graphic, we must have Inline graphic, with the two extremal conditions corresponding to Inline graphic and Inline graphic sharing maximal separable correlations42,43. If Inline graphic the ancillas share non-separable correlations. The Eq. (4) provides the bound Inline graphic, with the extremal values corresponding to maximally entangled states. Finally, if Inline graphic, the two ancillas are not correlated, and the two-mode attack collapses to a standard collective one, based on two independent entangling cloners.

Key-rates and security thresholds

We compute now the secret-key rate Inline graphic, where I is Alice-Bob mutual information, and Inline graphic is Eve’s accessible information. In the asymptotic case Inline graphic, Inline graphic can be replaced by the Holevo information Inline graphic. Hence we write

graphic file with name srep22225-m52.jpg

The goal of the security analysis is the computation of the bound Inline graphic, which is defined as

graphic file with name srep22225-m54.jpg

The functional Inline graphic is the von Neumann entropy, relative to Eve’s quantum state Inline graphic, and Inline graphic is that corresponding to Inline graphic, which describes Eve’s sate conditioned on the outcomes of the measurements performed by the parties.

Against collective attacks, the parties use the protocol in ON, and we have the following ON key-rate

graphic file with name srep22225-m59.jpg

By contrast, against coherent attacks, they use the circuit in OFF, for which we have the following OFF key-rate

graphic file with name srep22225-m60.jpg

where

graphic file with name srep22225-m61.jpg

is the mutual information averaged over the forward and backward use, and

graphic file with name srep22225-m62.jpg

is computed on Alice and Bob’s output state ρAB.

Thus, for collective attacks we select the ON key-rate Inline graphic, while for coherent attacks we select the OFF key-rate Inline graphic. Both these key-rates are function of channel parameters, i.e., transmissivity T and excess noise Inline graphic (which gives the extra noise on the channel with respect the vacuum shot-noise). The OFF key-rate, Inline graphic, is also function of the correlation parameters g and Inline graphic. Therefore, once we have R, we find the security thresholds solving the following equation

graphic file with name srep22225-m68.jpg

This condition provides threshold curves of the type Inline graphic which simplifies to Inline graphic for collective attacks.

Formulas for the key-rates

The computation of the secret-key rates can be performed using the mathematical tools described in ref. 16. From the knowledge of the CM describing the total and conditional states, we can compute the von Neumann entropies and finally the key rates. For the protocol with coherent states and heterodyne detection we find the following key-rates

graphic file with name srep22225-m71.jpg
graphic file with name srep22225-m72.jpg

where

graphic file with name srep22225-m73.jpg

In the previous formulas, the symplectic eigenvalues Inline graphic are computed numerically and we define Inline graphic and Inline graphic. It is of particular interest the OFF key-rate of Eq. (13), from which we notice that one can recover the one-way key-rate in the case of collective attacks (Inline graphic. The expressions of the total and conditional symplectic eigenvalues can be computed analytically for large modulation, being equal to

graphic file with name srep22225-m78.jpg
graphic file with name srep22225-m79.jpg

where Inline graphic and Inline graphic.

Protocol with coherent states and homodyne detection

Here we give the key-rate Inline graphic for the two-way protocol with coherent states and homodyne detection. The only change with respect to the previous scheme is clearly the use of homodyne detection for decoding. With the circuit in ON, Bob prepares coherent states, randomly displaced by Alice and finally homodyned by Bob. With the protocol in OFF, Bob prepares coherent states and Alice performs homodyne detection. Then she sends back newly prepared coherent states which are homodyned by Bob. After some algebra, we obtain the following analytical expressions for the key-rates

graphic file with name srep22225-m83.jpg
graphic file with name srep22225-m84.jpg

In the ON key-rate of Eq. (16), used against collective attacks, the asymptotic symplectic eigenvalue Inline graphic can be computed analytically as

graphic file with name srep22225-m86.jpg

By contrast, the OFF key-rate of Eq. (17) is exploited under coherent attacks, and the total symplectic eigenvalues Inline graphic are the same as given in Eq. (14). The details to obtain Eqs. (16) and (17) can be found in the supplemental material, where we also include the secret-key rates computed in DR.

Discussion

The security analysis of the thresholds coming from Eqs. (12) and (13) is summarized in Fig. 3. In particular, the security threshold for the ON configuration is confirmed14 to be superadditive in Fig. 3 (top-left). The black-solid line corresponds to the ON threshold, which is clearly above the threshold of the one-way protocol (dashed line). This comparison is done against collective attacks. The top-right panel of Fig. 3, shows the security threshold for the OFF configuration in the presence of several two-mode attacks with different values of the correlation parameters Inline graphic. The curves labeled (a–d) corresponds to the points in Fig. 3 (bottom-left). For example, the red curve (a) describes coherent attacks performed with maximally entangled states. The curve (b) describes attacks with Inline graphic, and the curve (c) corresponds to Inline graphic. Finally, the dashed curve (d) corresponds to the center of the correlation plane, where the OFF threshold coincides with the one-way threshold. Thus, we see that for any value of Eve’s correlation parameters, g and Inline graphic, Alice and Bob can always post-select an instance of the two-way protocol (ON or OFF) whose threshold is strictly greater than that of the corresponding one-way protocol.

Figure 3. This figure summarizes the results for the protocol with coherent states and heterodyne detection, whose rates are given in Eqs. (12) and (13).

Figure 3

The top panels describe the security thresholds, in terms of tolerable excess noise N versus transmissivity T. In the top-left panel, we consider collective attacks and we compare the ON two-way threshold Inline graphic (black solid line) with the threshold of the one-way protocol (dashed line). In the pink region the two-way protocol is secure, while the one-way counterpart is not. In the top-right panel, we consider coherent attacks and we compare the OFF two-way threshold (ac) with respect to the one-way threshold (d). In particular, curve (a) is obtained for Inline graphic, i.e., Eve using maximally entangled states; curve (b) considers the case Inline graphic with Inline graphic; and curve (c) refers to Inline graphic and Inline graphic. Note that curve (d) coincides with the OFF threshold against collective attacks, in which case the protocol is used in ON. The same labels (ad) are used in the bottom-left panel, which describes the various attacks on the correlation plane Inline graphic, obtained setting Inline graphic in the constraint of Eq. (4). Finally, in the bottom-right panel, we plot the OFF key-rate against coherent attacks (red lines), compared to the quantum mutual information (black lines) describing the correlations of Eve’s ancillas. We set Inline graphic and Inline graphic, so that the one-way rate is Inline graphic zero. We see that the OFF key-rate is always strictly positive and it increases for increasing correlations in the attack.

Finally, Fig. 3 (bottom-right) describes the connection between the OFF key rate and the amount of correlations in Eve’s ancillas, as quantified by the quantum mutual information. We can see that the OFF key rate not only is positive (while the one-way rate is always zero) but it also increases with Eve’s correlations, which are converted into noise by the OFF configuration. Thus, the ON/OFF switching, together with the post-selection of the correct instances, allows one to implement two-way CV-QKD in a way which is not only secure, but also more robust to excess noise with respect to one-way protocols under completely general attacks.

Methods

A detailed description of the methods can be found in the supplementary material. The security analysis of the protocol has been performed in the entanglement based representation for the case OFF, so that we could compute the Holevo bound from the study of Alice-Bob CM. For the case ON in RR, we started from the output covariance matrix of Eve, to compute the total von Neumann entropy. We then computed the conditional von Neumann entropy completing Eve’s covariance matrix with the Bob’s mode on which we applied the heterodyne or the homodyne measurement, accordingly with the case studied.

Conclusions

In this work we have studied the security of two-way CV-QKD addressing, explicitly, the superadditivity of its security threshold against coherent attack. To the best of our knowledge this represents the first attempt of such a complete study for direct point-to-point two-way protocols. Our security analysis is obtained assuming the asymptotic limit, i.e., large number of signals exchanged and large modulation. This allowed us to find closed formulas for the secret-key rates, from which we have proved that the two-way Gaussian protocols are more robust to excess noise than their one-way counterparts in both collective and coherent attacks.

For this property, it is crucial the random ON/OFF switching of the protocol, so that the eavesdropper’s correlations are under control of the parties and they are transformed, if needed, into useless noise. Our analysis contributes to the general understanding of the security properties of two-way protocols and is useful to extend CV-QKD to regime with high excess noise. Future developments could involve the study of this ON/OFF switching strategy in more complex quantum communication scenarios.

Additional Information

How to cite this article: Ottaviani, C. and Pirandola, S. General immunity and superadditivity of two-way Gaussian quantum cryptography. Sci. Rep. 6, 22225; doi: 10.1038/srep22225 (2016).

Supplementary Material

Supplementary Information
srep22225-s1.pdf (453.5KB, pdf)

Acknowledgments

We acknowledge financial support from the EPSRC via the ‘UK Quantum Communications HUB’ (Grant no. EP/M013472/1).

Footnotes

Author Contributions C.O. performed the security analysis and wrote the manuscript. S.P. supervised the project.

References

  1. Bennet C. H. & Brassard G. Quantum cryptography: public key distribution and coin tossing, Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, p. 175 (1984).
  2. Scarani V. et al. The security of practical quantum key distribution. Rev. Mod. Phys. 81, 1301 (2009). [Google Scholar]
  3. Rivest R., Shamir A. & Adleman L. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2), 120–126, (1978). [Google Scholar]
  4. Shor P. W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Sci. Statist. Comput. 26, 1484 (1997), quant-ph/9508027. [Google Scholar]
  5. Gisin N. et al. Quantum cryptography. Rev. Mod. Phys. 74, 145–195 (2002). [Google Scholar]
  6. Wootters W. & Zurek W. A single quantum cannot be cloned. Nature 299, 802–803 (1982). [Google Scholar]
  7. Korzh B. et al. Provably secure and practical quantum key distribution over 307 km of optical fibre. Nature Phot. 9, 163–168 (2015). [Google Scholar]
  8. Ursin R. et al. Entanglement-based quantum communication over 144 km. Nature Phys 3, 481–486 (2007). [Google Scholar]
  9. Grosshans F. & Grangier P. Continuous variable quantum cryptography using coherent states, Phys. Rev. Lett. 88, 057902 (2002). [DOI] [PubMed] [Google Scholar]
  10. Weedbrook C. et al. Quantum cryptography without switching. Phys. Rev. Lett. 93(17), 170504 (2004). [DOI] [PubMed] [Google Scholar]
  11. Grosshans F. et al. Virtual entanglement and reconciliation protocols for quantum cryptography with continuous variables. Quantum Information & computation (2003). [Google Scholar]
  12. Garcia-Patron R. & Cerf N. J. Continuous-variable quantum key distribution protocols over noisy channels. Phys. Rev. Lett. 102, 130501 (2009). [DOI] [PubMed] [Google Scholar]
  13. Grosshans F. et al. High-rate quantum cryptography using Gaussian-modulated coherent states. Nature 421, 238–241 (2003). [DOI] [PubMed] [Google Scholar]
  14. Pirandola S. et al. Continuous variable quantum cryptography using two-way quantum communication. Nature Phys. 4, 726 (2008). [Google Scholar]
  15. Diamanti E. & Leverrier E. Distributing secret keys with quantum continuous variables: principle, security and implementations. Entropy 17, 6072 (2015). [Google Scholar]
  16. Weedbrook C. et al. Gaussian quantum information, Rev. Mod. Phys. 84, 621 (2012). [Google Scholar]
  17. Jouguet P. et al. Experimental demonstration of long-distance continuous-variable quantum key distribution. Nature Photonics 7, 378–381 (2013). [Google Scholar]
  18. Silberhorn C. et al. Continuous variable quantum cryptography: beating the 3 dB Loss Limit, Phys. Rev. Lett. 89, 167901 (2002). [DOI] [PubMed] [Google Scholar]
  19. Leverrier A. et al. Multidimensional reconciliation for a continuous-variable quantum key distribution. Phys. Rev. A 77, 042325 (2008). [Google Scholar]
  20. Braunstein S. L. & van Lock P. Quantum information with continuous variables. Rev.Mod.Phys. 77, 513 (2005). [Google Scholar]
  21. Weedbrook C. et al. Quantum cryptography approaching the classical limit Phys. Rev. Lett. 105, 110501 (2010). [DOI] [PubMed] [Google Scholar]
  22. Weedbrook C. et al. Continuous-variable quantum key distribution using thermal states. Phys. Rev. A 86, 022318 (2012). [Google Scholar]
  23. Pirandola S. et al. Reply to ‘Discrete and continuous variables for measurement-device-independent quantum cryptography’. Nature Phot. 9, 773 (2015). [Google Scholar]
  24. Ekert A. Quantum cryptography based on the Bell’s theorem. Phys. Rev. Lett. 69, 1293 (1992). [DOI] [PubMed] [Google Scholar]
  25. Gisin N. et al. Proposal for implementing device-independent quantum key distribution based on a heralded qubit amplifier. Phys. Rev. Lett. 105, 070501 (2010). [DOI] [PubMed] [Google Scholar]
  26. Vazirani U. & Vidick T. Fully device-independent quantum key distribution. Phys. Rev. Lett. 113, 140501 (2014). [DOI] [PubMed] [Google Scholar]
  27. Colbeck R. Victory for the quantum code maker? Physics 7, 99 (2014). [Google Scholar]
  28. Hensen B. et al. Experimental loophole-free violation of a Bell inequality using entangled electron spins separated by 1.3 km, arXiv 1508.05949 (2015). [DOI] [PubMed]
  29. Braunstein S. L. & Pirandola S. Side-channel-free quantum key distribution. Phys. Rev. Lett. 108, 130502 (2012). [DOI] [PubMed] [Google Scholar]
  30. Lo H.-K., Curty M. & Qi B. Measurement-device-independent quantumkey distribution. Phys. Rev. Lett. 108, 130503 (2012). [DOI] [PubMed] [Google Scholar]
  31. Pirandola S. et al. High-rate measurement-device-independent quantum cryptography. Nature. Phot. 9, 396 (2015). See also arXiv.1312.4104 (2013). [Google Scholar]
  32. Ottaviani C., Spedalieri G., Braunstein S. L. & Pirandola S. Continuous-variable quantum cryptography with an untrusted relay: Detailed security analysis of the symmetric configuration. Phys. Rev. A 91, 022320 (2015). [Google Scholar]
  33. Pirandola S. Quantum discord as a resource for quantum cryptography. Sci. Rep. 4, 6956 (2014). [DOI] [PMC free article] [PubMed] [Google Scholar]
  34. Weedbrook C., Ottaviani C. & Pirandola S. Two-way quantum cryptography at different wavelengths. Phys. Rev. A 89, 012309 (2014). [Google Scholar]
  35. Boström K. & Felbinger T. Deterministic secure direct communication using entanglement. Phys. Rev. Lett. 89, 187902 (2002). [DOI] [PubMed] [Google Scholar]
  36. Lucamarini M. & Mancini S. secure deterministic communication without entanglement, Phys. Rev. Lett. 94, 140501 (2005). [DOI] [PubMed] [Google Scholar]
  37. Shapiro J. H. Defeating passive eavesdropping with quantum illumination. Phys. Rev. A 80, 022320 (2009). [Google Scholar]
  38. Zhang Z. et al. Entanglement’s benefit survives an entanglement-breaking channel. Phys. Rev. Lett. 111, 010501 (2013). [DOI] [PubMed] [Google Scholar]
  39. Renner R. & Cirac J. I. de Finetti representation theorem for infinite-dimensional quantum systems and applications to quantum cryptography. Phys. Rev. Lett. 102, 110504 (2009). [DOI] [PubMed] [Google Scholar]
  40. Pirandola S., Braunstein S. L. & Lloyd S. Characterization of collective gaussian attacks and security of coherent-state quantum cryptography. Phys. Rev. Lett. 101, 200504 (2008). [DOI] [PubMed] [Google Scholar]
  41. Ottaviani C., Mancini S. & Pirandola S. Two-way Gaussian quantum cryptography against coherent attacks in direct reconciliation. Phys. Rev. A 92, 062323 (2015). [Google Scholar]
  42. Pirandola S. Entanglement reactivation in separable environments. New J. Phys. 15, 113046 (2013). [Google Scholar]
  43. Pirandola S., Serafini A. & Lloyd S. Correlation matrices of two-mode bosonic systems. Phys. Rev. A 79, 052327 (2009). [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

Supplementary Information
srep22225-s1.pdf (453.5KB, pdf)

Articles from Scientific Reports are provided here courtesy of Nature Publishing Group

RESOURCES