skip to main content
research-article
Free Access

Quantum money

Published:01 August 2012Publication History
Skip Abstract Section

Abstract

Imagine money you can carry and spend without a trace.

References

  1. Aaronson, S. Quantum copy-protection and quantum money. In Annual IEEE Conference on Computational Complexity (2009), 229--242. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Bacon, D. and van Dam, W. Recent progress in quantum algorithms. Commun. ACM 53 (Feb. 2010), 84--93. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Ben-Or, M. and Hassidim, A. Fast quantum byzantine agreement. In STOC (2005), 481--485. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Bennett, C.H. and Brassard, G. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of IEEE International Conference on Computers Systems and Signal Processing (Bangalore, India, 1984), 175--179.Google ScholarGoogle Scholar
  5. Bennett, C.H., Brassard, G., Breidbart, S. and Wiesner, S. Quantum cryptography, or unforgeable subway tokens. In Advances in Cryptology---Proceedings of Crypto (1983), volume 82, 267--275.Google ScholarGoogle ScholarCross RefCross Ref
  6. Broadbent, A., Fitzsimons, J. and Kashefi, E. Universal blind quantum computation. In FOCS (2009), 517--526. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Buzek, V. and Hillery, M. Quantum copying: Beyond the no-cloning theorem. Phys. Rev. A 54, 3 (1996), 1844--1852.Google ScholarGoogle ScholarCross RefCross Ref
  8. Chailloux, A. and Kerenidis, I. Optimal quantum strong coin flipping. In 50th Annual IEEE Symposium on Foundations of Computer Science, 2009 (FOCS'09) (2009), IEEE, 527--533. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Childs, A.M. Secure assisted quantum computation. Quant. Inform. Comput. 5, 6 (2005), 456--466. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Farhi, E., Gosset, D., Hassidim, A., Lutomirski, A., Nagaj, D., and Shor, P. Quantum state restoration and single-copy tomography for ground states of hamiltonians. Phys. Rev. Lett. 105, 19 (Nov. 2010), 190503.Google ScholarGoogle ScholarCross RefCross Ref
  11. Farhi, E., Gosset, D., Hassidim, A., Lutomirski, A. and Shor, P. Quantum money from knots. In Innovations in Theoretical Computer Science (2012). Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Feldman, P. and Micali, S. An optimal probabilistic protocol for synchronous byzantine agreement. SIAM J. Comput. 26, 4 (1997), 873--933. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Hass, J. Algorithms for recognizing knots and 3-manifolds. Chaos, Solitons & Fractals 9(4--5) (1998), 569--581.Google ScholarGoogle Scholar
  14. Lo, H.-K. Insecurity of quantum secure computations. Phys. Rev. A 56 (Aug. 1997), 1154--1162.Google ScholarGoogle ScholarCross RefCross Ref
  15. Lutomirski, A. An online attack against Wiesner's quantum money. arXiv:1010.0256, 2010.Google ScholarGoogle Scholar
  16. Lutomirski, A., Aaronson, S., Farhi, E., Gosset, D., Hassidim, A., Kelner, J. and Shor, P. Breaking and making quantum money: Toward a new quantum cryptographic protocol. In Innovations in Computer Science (2010).Google ScholarGoogle Scholar
  17. Mochon, C. Quantum weak coin flipping with arbitrarily small bias. Arxiv preprint arXiv:0711.4114 (2007).Google ScholarGoogle Scholar
  18. Mosca, M. and Stebila, D. A framework for quantum money. Poster at Quantum Information Processing (QIP) (Brisbane, Australia, 2007).Google ScholarGoogle Scholar
  19. Mosca, M. and Stebila, D. Quantum coins. In Error-Correcting Codes, Finite Geometries, and Cryptography. Contemporary Mathematics, Aiden A. Bruen and David L. Wehlau, eds. volume 523. American Mathematical Society, 2010, 35--47.Google ScholarGoogle Scholar
  20. Nielsen, M.A. and Chuang, I.L. Quantum Information and Computation, Cambridge University Press, Cambridge, UK, 2000.Google ScholarGoogle Scholar
  21. Regev, O. On lattices, learning with errors, random linear codes, and cryptography. In Proceedings of the 37th annual ACM symposium on Theory of computing (2005), ACM, 84--93. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Ryan, R., Anderson, Z. and Chiesa, A. Anatomy of a subway hack. http://tech.mit.edu/V128/N30/subway/Defcon_Presentation.pdf (August 2008).Google ScholarGoogle Scholar
  23. Shor, P.W. Algorithms for quantum computation: Discrete logarithms and factoring. In FOCS (1994), IEEE Computer Society, 124--134. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Shor, P.W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41, 2 (1999), 303--332. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Tokunaga, Y., Okamoto, T. and Imoto, N. Anonymous quantum cash. In EQIS (Aug. 2003).Google ScholarGoogle Scholar
  26. Wiesner, S. Conjugate coding. SIGACT News 15, 1 (1983), 78--88. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Quantum money

        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

        Full Access

        • Published in

          cover image Communications of the ACM
          Communications of the ACM  Volume 55, Issue 8
          August 2012
          105 pages
          ISSN:0001-0782
          EISSN:1557-7317
          DOI:10.1145/2240236
          Issue’s Table of Contents

          Copyright © 2012 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: 1 August 2012

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Popular
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format