Skip to main content

Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

Best of both worlds

Nature Physics volume 13, pages 3–4 (2017)Cite this article

Subjects

Secure communication is emerging as a significant challenge for our hyper-connected data-dependent society. The answer may lie in a clever combination of quantum and classical cryptographic techniques.

Edward Snowden's revelations on the mass surveillance practices in the US and UK brought to the forefront the issues of privacy and security of data and communications. In an increasingly connected world, the words 'big data' and 'cloud technologies' have left the vocabulary of technology experts to reach mainstream culture and become the very centre of the emerging digital transformation of services and applications. Ensuring privacy and security is now an imperative. At the same time, it poses a formidable challenge — one that may be best served by a hybrid quantum and classical approach.

This is a preview of subscription content, access via your institution

Access options

Rent or buy this article

Get just this article for as long as you need it

$39.95

Learn more

Prices may be subject to local taxes which are calculated during checkout

References

  1. Rivest, R., Shamir, A. & Adleman, L. Commun. ACM 21, 120–126 (1978).

    Article  Google Scholar 

  2. Chen, L. et al. Report on Post-Quantum Cryptography (NIST, US Department of Commerce, 2016); http://go.nature.com/2gY56xB

    Book  Google Scholar 

  3. Kaplan, M., Leurent, G., Leverrier, A. & Naya-Plasencia, M. In Advances in Cryptology – CRYPTO 2016 207–237 (Springer, 2016).

    Book  Google Scholar 

  4. Broadbent, A. & Schaffner, C. Design. Code. Cryptogr. 78, 351–382 (2016).

    Article  Google Scholar 

  5. Broadbent A., Fitzsimons, J. & Kashefi, E. In Proc. 50th Annual IEEE Symp. on Foundations of Computer Science, 517–526 (IEEE, 2009).

    Google Scholar 

  6. Barz, S., Fitzsimons, J. F., Kashefi, E. & Walther, P. Nat. Phys. 9, 727–731 (2013).

    Article  Google Scholar 

  7. Gottesman, D. Quant. Inf. Comp. 14, 1338–1371 (2014).

    MathSciNet  Google Scholar 

  8. Leverrier, A., Tillich, J.-P. & Zémor, G. In Proc. 56th Annual IEEE Symp. on Foundations of Computer Science 810–824 (IEEE, 2015).

    Google Scholar 

  9. Konig, R., Wehner, S., & Wullschleger, J. IEEE Trans. Inf. Theory 58, 1962–1984 (2012).

    Article  Google Scholar 

  10. Berlín, G. et al. Nat. Commun. 2, 561 (2011).

    Article  ADS  Google Scholar 

  11. Pappa, A. et al. Nat. Commun. 5, 3717 (2014).

    Article  ADS  Google Scholar 

  12. Gottesman, D. & Chuang, I. Preprint at https://arxiv.org/abs/quant-ph/0105032 (2001).

  13. Donaldson, R. J. et al. Phys. Rev. A 93, 012329 (2016).

    Article  ADS  Google Scholar 

  14. Broadbent, A., Gutoski, G. & Stebila, D. In Advances in Cryptology – CRYPTO 2013 344–360 (Springer, 2013).

    Book  Google Scholar 

  15. Dupuis, F., Nielsen, J. B. & Salvail, L. In Advances in Cryptology – CRYPTO 2012 794–811 (Springer, 2012).

    Book  Google Scholar 

  16. Dulek, Y., Schaffner, C. & Speelman, F. In Advances in Cryptology – CRYPTO 2016 3–32 (Springer, 2016).

    Book  Google Scholar 

  17. Ben-Or, M., Crépeau, C., Gottesman, D., Hassidim, A. & Smith, A. In Proc. 47th Annual IEEE Symp. on Foundations of Computer Science 249–260 (2006).

    Google Scholar 

  18. Bell, B. A. et al. Nat. Commun. 5, 5480 (2014).

    Article  ADS  Google Scholar 

  19. Anders, J. & Browne, D. E. Phys. Rev. Lett. 102, 050502 (2009).

    Article  ADS  MathSciNet  Google Scholar 

  20. Dunjko, V., Kapourniotis, T. & Kashefi, E. Quant. Inf. Comput. 16, 61–86 (2016).

    Google Scholar 

  21. Loukopoulos, K. & Browne, D. E. Phys. Rev. A 81, 062336 (2010).

    Article  ADS  Google Scholar 

  22. Hallgren, S., Smith, A. & Song, F. In Advances in Cryptology – CRYPTO 2011 411–428 (Springer, 2011).

  23. Unruh, D. In Advances in Cryptology – CRYPTO 2013 380–397 (2013).

    Book  Google Scholar 

  24. Damgård, I. B., Fehr, S., Salvail, L. & Schaffner, C. SIAM J. Comput. 37, 1865–1890 (2008).

    Article  MathSciNet  Google Scholar 

  25. Wehner, S., Schaffner, C. & Terhal, B. M. Phys. Rev. Lett. 100, 220502 (2008).

    Article  ADS  Google Scholar 

  26. Kent, A. Phys. Rev. Lett. 83, 1447–1450 (1999).

    Article  ADS  MathSciNet  Google Scholar 

  27. Chakraborty, K., Chailloux, A. & Leverrier, A. Phys. Rev. Lett. 115, 205501 (2015).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Eleni Diamanti and Elham Kashefi are at CNRS, Université Pierre et Marie Curie, Paris, 75005, France

    Eleni Diamanti & Elham Kashefi

  2. E.K. is also at the University of Edinburgh, Edinburgh EH8 9AB, UK,

    Elham Kashefi

Authors
  1. Eleni Diamanti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elham Kashefi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Eleni Diamanti or Elham Kashefi.

Rights and permissions

Reprints and Permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Diamanti, E., Kashefi, E. Best of both worlds. Nature Phys 13, 3–4 (2017). https://doi.org/10.1038/nphys3972

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1038/nphys3972

This article is cited by

Search

Advanced search

Quick links

Nature Briefing

Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.

Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing