skip to main content
10.1145/335305.335404acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article
Free Access

Quantum bit escrow

Published:01 May 2000Publication History
First page image

References

  1. 1.D. Aharonov, A. Kitaev, and N. Nisan. Quantum circuits with mixed states. In Proceedings of the 30th Annual A CM Symposium on Theory o/Computing ($TOC-98), pages 20-30, New York, May 23-26 1998. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.Manuel Blum. Coin flipping by telephone: A protocol for solving impossible problems. In Alien Gersho, editor, Advances in Cryptology: A Report on CRYPTO 81, pages 11-15. Department of Electrical and Computer Engineering, U. C. Santa Barbara, 24-26 August 1981.Google ScholarGoogle Scholar
  3. 3.Lucien Hardy and Adrian Kent. Cheat sensitive quantum bit commitment. Technical report, quantph/9911043, 1999.Google ScholarGoogle Scholar
  4. 4.R. Jozsa. fidelity. J. Mod. Optics, 41:2315-2323, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  5. 5.H. Lo and H. Chau. Why quantum bit commitment and ideal quantum coin tossing are impossible. Physica D, 120:177-187, 1998. See also quant-ph/9711065. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.D. Mayers. Unconditionally secure quantum bit commitment is impossible. Phys. Rev. Lett., 78:3414-3417, 1997.Google ScholarGoogle ScholarCross RefCross Ref
  7. 7.D. Mayers, L. Salvail, and Y. Chiba-Kohno. Unconditionally secure quantum coin tossing. Technical report, quant-ph/9904078, 1999.Google ScholarGoogle Scholar
  8. 8.J. Preskill. Lecture notes. http: // www. theory. caltech. edu/ people / preskill/ph229/.Google ScholarGoogle Scholar

Index Terms

  1. Quantum bit escrow

              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
                STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing
                May 2000
                756 pages
                ISBN:1581131844
                DOI:10.1145/335305

                Copyright © 2000 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 May 2000

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • Article

                Acceptance Rates

                STOC '00 Paper Acceptance Rate85of182submissions,47%Overall Acceptance Rate1,469of4,586submissions,32%

                Upcoming Conference

                STOC '24
                56th Annual ACM Symposium on Theory of Computing (STOC 2024)
                June 24 - 28, 2024
                Vancouver , BC , Canada

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader