skip to main content
10.1145/863955.863982acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free Access

Quantum cryptography in practice

Published:25 August 2003Publication History

ABSTRACT

BBN, Harvard, and Boston University are building the DARPA Quantum Network, the world's first network that delivers end-to-end network security via high-speed Quantum Key Distribution, and testing that Network against sophisticated eavesdropping attacks. The first network link has been up and steadily operational in our laboratory since December 2002. It provides a Virtual Private Network between private enclaves, with user traffic protected by a weak-coherent implementation of quantum cryptography. This prototype is suitable for deployment in metro-size areas via standard telecom (dark) fiber. In this paper, we introduce quantum cryptography, discuss its relation to modern secure networks, and describe its unusual physical layer, its specialized quantum cryptographic protocol suite (quite interesting in its own right), and our extensions to IPsec to integrate it with quantum cryptography.

References

  1. C. Bennett and G. Brassard, "Quantum Cryptography: Public Key Distribution and Coin Tossing," International Conference on Computers, Systems, and Signal Processing, Bangalore, India, 1984.]]Google ScholarGoogle Scholar
  2. C. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, "Experimental quantum cryptography," J. Cryptology, vol. 5, no. 1, 1992, pp. 3--28.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. R. Hughes et al, "Quantum cryptography over underground optical fibers," in N Koblitz, editor, Advances in Cryptology -- CRYPTO '96, volume 1109 of Lecture Notes in Computer Science, pages 329--342, 18--22 August 1996. Springer-Verlag.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. Stucki, N. Gisin, O. Guinnard, G. Ribordy and H. Zbinden, "Quantum key distribution over 67 km with a plug&play system," New J. Phys. 4 (July 2002) 41.]]Google ScholarGoogle ScholarCross RefCross Ref
  5. D. Bethune and W. Risk, "Autocompensating quantum cryptography," New J. Phys. 4 (July 2002) 42.]]Google ScholarGoogle ScholarCross RefCross Ref
  6. R. Hughes, J. Nordholt, D. Derkacs and C. Peterson, "Practical free-space quantum key distribution over 10 km in daylight and at night," New J. Phys. 4 (July 2002) 43.]]Google ScholarGoogle ScholarCross RefCross Ref
  7. J. Rarity, P. Tapster, P. Gorman and P. Knight, "Ground to satellite secure key exchange using quantum cryptography," New J. Phys. 4 (October 2002) 82.]]Google ScholarGoogle ScholarCross RefCross Ref
  8. G. Ribordy, J. Brendel, J-D. Gautier, N. Gisin, and H. Zbinden, "Long-distance entanglement-based quantum key distribution," Phys. Rev. A, v. 63, 012309 (13 December 2000).]]Google ScholarGoogle ScholarCross RefCross Ref
  9. W. Tittel, J. Brendel, H. Zbinden, and N. Gisin, Phys. Rev. Lett. 84, 4737 (2000).]]Google ScholarGoogle ScholarCross RefCross Ref
  10. A. Ekert, "Quantum Cryptography Based on Bell's Theorem," Phys. Rev. Lett. 67, 661 (5 August 1991).]]Google ScholarGoogle ScholarCross RefCross Ref
  11. C. Bennett, 1992, "Quantum cryptography using any two nonorthogonal states," Phys. Rev. Lett. 68, 3121--3124.]]Google ScholarGoogle Scholar
  12. J. Franson, "Bell Inequality for Position and Time," Phys. Rev. Lett., 62, 2205 (8 May 1989).]]Google ScholarGoogle ScholarCross RefCross Ref
  13. G. Brassard, T. Mor, and B. Sanders, "Quantum crypto-graphy via parametric downconversion," quant-ph/9906074.]]Google ScholarGoogle Scholar
  14. D. Naik, C. Peterson, A. White, A. Berglund, and P. Kwiat, Phys. Rev. Lett. 84, 4733 (2000).]]Google ScholarGoogle ScholarCross RefCross Ref
  15. T. Jennewin, C. Simon, G. Weihs, H. Weinfurter, and A. Zeilinger, Phys. Rev. Lett. 84, 4729 (2000).]]Google ScholarGoogle ScholarCross RefCross Ref
  16. D. Enzer, P. Hadley, R. Hughes, C. Peterson and P. Kwiat, "Entangled-photon six-state quantum cryptography," New J. Phys. 4 (July 2002) 45.]]Google ScholarGoogle ScholarCross RefCross Ref
  17. N. Gisin et al, "Quantum cryptography," Rev. Mod. Phys., Vol. 74, No. 1, January 2002.]]Google ScholarGoogle ScholarCross RefCross Ref
  18. C. Elliott, "Building the quantum network," New J. Phys. 4 (July 2002) 46.]]Google ScholarGoogle ScholarCross RefCross Ref
  19. G. Brassard and L. Salvail, "Secret key reconciliation by public discussion," Lect. Notes in Computer Science 765, 410. (1994).]]Google ScholarGoogle Scholar
  20. M. Wegman and L. Carter, "New Hash Functions and their Use in Authentication and Set Equality," J. Comp. Sys. Sci., 22, 265--279 (1981).]]Google ScholarGoogle ScholarCross RefCross Ref
  21. B. Slutsky, R. Rao, P. Sun, L. Tancevski, and S. Fainman, "Defense frontier analysis of quantum cryptographic systems," Applied Optics, vol. 37, no. 14, 1998, pp. 2869--2878.]]Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Quantum cryptography in practice

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
      August 2003
      432 pages
      ISBN:1581137354
      DOI:10.1145/863955

      Copyright © 2003 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 25 August 2003

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      SIGCOMM '03 Paper Acceptance Rate34of319submissions,11%Overall Acceptance Rate554of3,547submissions,16%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader