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

Security of quantum protocols against coherent measurements

Published:29 May 1995Publication History
First page image

References

  1. BB84.C. Bennet and G. Brassard, "Quantunl cryptography: Public key distribution and coin tossing," Proceedings oj H?EE Interna-tional Conference on Computers, Systems, and Szgn al Processing, Bangalore, India, December 1984, 175-179.Google ScholarGoogle Scholar
  2. BB89.C. Bennetand G. Brassard, ''The dawnofa new era for quantllm cryptography: the ex-perimental prototype is working," SIGA CT News, 20 (1989), 78-82. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. BBBSS92.C. Bennet, F. Bessette, G. Brassard, L. Salvail and *J. Smoliu, "Experinlent al quan-tum cryptography," Journal of Cryptology, 5 (1992), 3-28. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. BBBW83.C. J3ennet, G. Brassard, S. Breidbard, and S. Wiesner, "Quantum cryptography, or unforgeable subway tokens," in A duan ces m Cryptology: Proceedings of CR YP TO '82, Plenum Press, 1983, 267-275.Google ScholarGoogle Scholar
  5. BBCS92.C. Bennet, G. Brassard, C, Cr6peau, and M.-H. Skubisze.wska, "Practical quan-tum oblivious transfer," of CRYP TO '91, Lecture puter Science, Volume 576, Berlin, 1992, 351-366. in Proceedings Notes in Com-Springer- Verlag, Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. BC91.G. Brassard and C. Cr6peau, "Quantum bit commitment and coin tossing proto-cols," in Advances in Cryptology: Proceed-ings of CR YP 7'0 'W, Lecture Notes in Conl-put er Science, l'olume 537, Springer-Verlag, Berlin, 1991, 49-61. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. BCJL93.G. Brassard, C. Cr6peau, R. Jozsa, and D. Langlois, "A quantum bit commitment scheme provably unbreakable b-y both par-ties," Proceedings of 1993 IEEE Annual Sympos%um on JWundations oj Computer Science, November 1993, 362-369.Google ScholarGoogle Scholar
  8. Cr90.C. Cr6peau, "Correct and private reduc-tions among oblivious transfers,'" Ph.D. the-sis, Depart ment of EE(!S, MIT, 1990.Google ScholarGoogle Scholar
  9. Cr94.C. Cr6peau, "Quantum oblivious transfer,"' in Journal of Modem Optics, special issue on quantum cryptography, to appear.Google ScholarGoogle Scholar
  10. Ki88.J. Kilian, "Founding cryptography on obliv-ious transfer," Proceedings of 1988 ACM Annual Symposium on Theory of Computi-ng, hlay 1988, 20-31. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Ma94b.D. Mayers. "Quantunl transformation and generalized measurements," preprint, dis-tribut ed at Workshop on Qua,n tum Comput-ing and Communication, hTational Institute of Standards and Technology, Gaithersburg. Maryland, August 18-19, 1994.Google ScholarGoogle Scholar
  12. MS94.D. Ma,vers and L. Salvail, "Quantum obliv-ious transfer is secure against individ-ual measurements," preprint, distributed at Workshop on Quantum Computing and Communication, National Institute of Stan-dards and Technology-, Cait hersburg, Mary-land, August 18-19, 1994.Google ScholarGoogle Scholar
  13. Ra81.M. Rabin, "IIow to exchange secrets by oblivious transfer, " technical report TR-81, Aiken Computation Laboratory, Har-vard University. 1981.Google ScholarGoogle Scholar
  14. TRT93.P. Townsend, J. Rarity, and P. Tapster, "Single photon interference in a 10km long op l,ical fibre irlterferolrle~ er," Elec lronac let-ters, 29 (1993), 634-635.Google ScholarGoogle ScholarCross RefCross Ref
  15. TRT94.P. Townsend, J. Rarity, and P. Tapster. "Enhanced single photon visibility in a 10km long prototype quant urn cryptogra-phy channel," Electronic lett~rs, to appear.Google ScholarGoogle Scholar
  16. Wi70.S. Wiesner, "Conjugate coding," SIGA CT News 15 (1983), 78-88; manuscript cn-ca 1970, Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Security of quantum protocols against coherent measurements

                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 '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
                  May 1995
                  776 pages
                  ISBN:0897917189
                  DOI:10.1145/225058

                  Copyright © 1995 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: 29 May 1995

                  Permissions

                  Request permissions about this article.

                  Request Permissions

                  Check for updates

                  Qualifiers

                  • Article

                  Acceptance Rates

                  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