{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T14:58:11Z","timestamp":1776783491617,"version":"3.51.2"},"reference-count":68,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2007,7,6]],"date-time":"2007-07-06T00:00:00Z","timestamp":1183680000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2007,7,6]]},"abstract":"<jats:p>We survey some results in quantum cryptography. After a brief introduction to classical cryptography, we provide the quantum-mechanical background needed to present some fundamental protocols from quantum cryptography. In particular, we review quantum key distribution via the BB84 protocol and its security proof, as well as the related quantum bit commitment protocol and its proof of insecurity.<\/jats:p>","DOI":"10.1145\/1242471.1242474","type":"journal-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T13:44:55Z","timestamp":1189777495000},"page":"6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":66,"title":["Quantum cryptography"],"prefix":"10.1145","volume":"39","author":[{"given":"Dagmar","family":"Bruss","sequence":"first","affiliation":[{"name":"Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf, D\u00fcsseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Erd\u00e9lyi","sequence":"additional","affiliation":[{"name":"Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf, D\u00fcsseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Meyer","sequence":"additional","affiliation":[{"name":"Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf, D\u00fcsseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Riege","sequence":"additional","affiliation":[{"name":"Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf, D\u00fcsseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[{"name":"Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf, D\u00fcsseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,7,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258604"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217075"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.59.4238"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_21"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.68.3121"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing. IEEE Computer Society Press","author":"Bennett C.","unstructured":"Bennett , C. and Brassard , G . 1984. Quantum cryptography: Public key distribution and coin tossing . In Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing. IEEE Computer Society Press , Los Alamitos, CA, 175--179. Bennett, C. and Brassard, G. 1984. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing. IEEE Computer Society Press, Los Alamitos, CA, 175--179."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.476316"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.68.557"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/337885.337891"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Bouwmeester D. Ekert A. and Zeilinger A. 2000. The Physics of Quantum Information. Springer-Verlag New York.  Bouwmeester D. Ekert A. and Zeilinger A. 2000. The Physics of Quantum Information. Springer-Verlag New York.","DOI":"10.1007\/978-3-662-04209-0"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056010"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 34th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press","author":"Brassard G.","unstructured":"Brassard , G. , Cr\u00e9peau , C. , Jozsa , R. , and Langlois , D . 1993. A quantum bit commitment scheme provably unbreakable by both parties . In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press , Los Alamitos, CA, 362--371. Brassard, G., Cr\u00e9peau, C., Jozsa, R., and Langlois, D. 1993. A quantum bit commitment scheme provably unbreakable by both parties. In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 362--371."},{"key":"e_1_2_1_14_1","unstructured":"Brassard G. Fortune S. and Hopcroft J. 1978. A note on cryptography and NP &cap; coNP - P. Tech. Rep. TR-338 Department of Computer Science Cornell University Ithaca NY. Apr.   Brassard G. Fortune S. and Hopcroft J. 1978. A note on cryptography and NP &cap; coNP - P. Tech. Rep. TR-338 Department of Computer Science Cornell University Ithaca NY. Apr."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.81.3018"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.88.127901"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.30"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.67.661"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00141967"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00119-6"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.145"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217018"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90323-T"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.05.022"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1613"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00014-1"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11560586_22"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050109"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 3rd Italian Conference on Algorithms and Complexity. Lecture Notes in Computer Science","volume":"1203","author":"Hemaspaandra L.","unstructured":"Hemaspaandra , L. , Rothe , J. , and Wechsung , G . 1997b. On sets with easy certificates and the existence of one-way permutations . In Proceedings of the 3rd Italian Conference on Algorithms and Complexity. Lecture Notes in Computer Science , vol. 1203 . Springer-Verlag, New York, 264--275. Hemaspaandra, L., Rothe, J., and Wechsung, G. 1997b. On sets with easy certificates and the existence of one-way permutations. In Proceedings of the 3rd Italian Conference on Algorithms and Complexity. Lecture Notes in Computer Science, vol. 1203. Springer-Verlag, New York, 264--275."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.10.004"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00068-0"},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Huffman W. and Pless V. 2003. Fundamentals of Error-Correcting Codes. Cambridge University Press Cambridge MA.  Huffman W. and Pless V. 2003. Fundamentals of Error-Correcting Codes. Cambridge University Press Cambridge MA.","DOI":"10.1017\/CBO9780511807077"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.91.057901"},{"key":"e_1_2_1_38_1","unstructured":"Inamori H. L\u00fctkenhaus N. and Mayers D. 2001. Unconditional security of practical quantum key distribution. Tech. Rep. quant-ph\/0107017 Computing Research Repository (CoRR). Available on-line at http:\/\/arxiv.org\/abs\/quant-ph\/0107017.  Inamori H. L\u00fctkenhaus N. and Mayers D. 2001. Unconditional security of practical quantum key distribution. Tech. Rep. quant-ph\/0107017 Computing Research Repository (CoRR). Available on-line at http:\/\/arxiv.org\/abs\/quant-ph\/0107017."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.07.036"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.83.1447"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90085-4"},{"key":"e_1_2_1_42_1","unstructured":"K\u00f6nig R. Renner R. Bariska A. and Maurer U. 2006. Locking of accessible information and implications for the security of quantum cryptography. Tech. Rep. quant-ph\/0512021v2 Computing Research Repository (CoRR). Available on-line at http:\/\/arxiv.org\/abs\/quant-ph\/0512021.  K\u00f6nig R. Renner R. Bariska A. and Maurer U. 2006. Locking of accessible information and implications for the security of quantum cryptography. Tech. Rep. quant-ph\/0512021v2 Computing Research Repository (CoRR). Available on-line at http:\/\/arxiv.org\/abs\/quant-ph\/0512021."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1038\/419450a"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215020"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.78.3410"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.283.5410.2050"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796302749"},{"key":"e_1_2_1_49_1","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology---CRYPTO '04","author":"May A.","unstructured":"May , A. 2004. Computing the RSA secret key is deterministic polynomial time equivalent to factoring . In Advances in Cryptology---CRYPTO '04 . Lecture Notes in Computer Science , vol. 3152 . Springer-Verlag , New York , 213--219. May, A. 2004. Computing the RSA secret key is deterministic polynomial time equivalent to factoring. In Advances in Cryptology---CRYPTO '04. Lecture Notes in Computer Science, vol. 3152. Springer-Verlag, New York, 213--219."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.78.3414"},{"key":"e_1_2_1_52_1","volume-title":"Advances in Cryptology---CRYPTO '98","volume":"1462","author":"Nguyen P.","unstructured":"Nguyen , P. and Stern , J . 1998. Cryptanalysis of the Ajtai-Dwork cryptosystem . In Advances in Cryptology---CRYPTO '98 . Lecture Notes in Computer Science , vol. 1462 . Springer-Verlag, New York, 223--242. Nguyen, P. and Stern, J. 1998. Cryptanalysis of the Ajtai-Dwork cryptosystem. In Advances in Cryptology---CRYPTO '98. Lecture Notes in Computer Science, vol. 1462. Springer-Verlag, New York, 223--242."},{"key":"e_1_2_1_53_1","unstructured":"Nielsen M. and Chuang I. 2000. Quantum Computation and Quantum Information. Cambridge University Press Cambridge MA.   Nielsen M. and Chuang I. 2000. Quantum Computation and Quantum Information. Cambridge University Press Cambridge MA."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00186-5"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_2_1_56_1","volume-title":"Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoret. Comput. Sci","author":"Rothe J.","unstructured":"Rothe , J. 2005. Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoret. Comput. Sci . Springer-Verlag , Berlin, Heidelberg , New York. Rothe, J. 2005. Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoret. Comput. Sci. Springer-Verlag, Berlin, Heidelberg, New York."},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00269-1"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.92.057901"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01491891"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01374525"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.85.441"},{"key":"e_1_2_1_64_1","volume-title":"The Code Book. The Science of Secrecy from Ancient Egypt to Quantum Cryptography. Fourth Estate","author":"Singh S.","unstructured":"Singh , S. 1999. The Code Book. The Science of Secrecy from Ancient Egypt to Quantum Cryptography. Fourth Estate , London, England . Singh, S. 1999. The Code Book. The Science of Secrecy from Ancient Egypt to Quantum Cryptography. Fourth Estate, London, England."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1201\/9781420057133"},{"key":"e_1_2_1_66_1","volume-title":"Average-case computational complexity theory","author":"Wang J.","unstructured":"Wang , J. 1997. Average-case computational complexity theory . In Complexity Theory Retrospective II, L. Hemaspaandra and A. Selman, Eds. Springer-Verlag, New York , 295--328. Wang, J. 1997. Average-case computational complexity theory. In Complexity Theory Retrospective II, L. Hemaspaandra and A. Selman, Eds. Springer-Verlag, New York, 295--328."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90071-3"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.40.4277"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008908.1008920"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1038\/299802a0"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225085"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1242471.1242474","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1242471.1242474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:38:56Z","timestamp":1750268336000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1242471.1242474"}},"subtitle":["A survey"],"short-title":[],"issued":{"date-parts":[[2007,7,6]]},"references-count":68,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,7,6]]}},"alternative-id":["10.1145\/1242471.1242474"],"URL":"https:\/\/doi.org\/10.1145\/1242471.1242474","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,6]]},"assertion":[{"value":"2007-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}