{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T16:08:07Z","timestamp":1784736487020,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540140399","type":"print"},{"value":"9783540392002","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-39200-9_18","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:35:32Z","timestamp":1187249732000},"page":"294-311","source":"Crossref","is-referenced-by-count":545,"title":["CAPTCHA: Using Hard AI Problems for Security"],"prefix":"10.1007","author":[{"given":"Luis","family":"von Ahn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manuel","family":"Blum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicholas J.","family":"Hopper","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Langford","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"18_CR1","unstructured":"Luis von Ahn, Manuel Blum, Nicholas J. Hopper and John Langford. The CAPTCHA Web Page: http:\/\/www.captcha.net . 2000."},{"key":"18_CR2","unstructured":"Luis von Ahn, Manuel Blum and John Langford. Telling Humans and Computers part (Automatically) or How Lazy Cryptographers do AI. To appear in Communications of the ACM."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Mihir Bellare, Russell Impagliazzo and Moni Naor. Does Parallel Repetition Lower the Error in Computationally Sound Protocols? In 38th IEEE Symposium on Foundations of Computer Science (FOCS\u2019 97), pages 374\u2013383. IEEE Computer Society, 1997.","DOI":"10.1109\/SFCS.1997.646126"},{"key":"18_CR4","volume-title":"Pattern Recognition","author":"M. M. Bongard","year":"1970","unstructured":"Mikhail M. Bongard. Pattern Recognition. Spartan Books, Rochelle Park NJ, 1970."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"A. L. Coates, H. S. Baird, and R. J. Fateman. Pessimal Print: A Reverse Turing Test. In Proceedings of the International Conference on Document Analysis and Recognition (ICDAR\u2019 01), pages 1154\u20131159. Seattle WA, 2001.","DOI":"10.1109\/ICDAR.2001.953966"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Scott Craver. On Public-key Steganography in the Presence of an Active Warden. In Proceedings of the Second International Information Hiding Workshop, pages 355\u2013368. Springer, 1998.","DOI":"10.1007\/3-540-49380-8_25"},{"key":"18_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-45708-9_6","volume-title":"Advances in Cryptology, CRYPTO\u2019 02","author":"N. J. Hopper","year":"2002","unstructured":"Nicholas J. Hopper, John Langford and Luis von Ahn. Provably Secure Steganography. In Advances in Cryptology, CRYPTO\u2019 02, volume 2442 of Lecture Notes in Computer Science, pages 77\u201392. Santa Barbara, CA, 2002."},{"key":"18_CR8","unstructured":"M. D. Lillibridge, M. Adabi, K. Bharat, and A. Broder. Method for selectively restricting access to computer systems. Technical report, US Patent 6,195,698. Applied April 1998 and Approved February 2001."},{"key":"18_CR9","unstructured":"Greg Mori and Jitendra Malik. Breaking a Visual CAPTCHA. Unpublished Manuscript, 2002. Available electronically: http:\/\/www.cs.berkeley.edu\/~mori\/gimpy\/gimpy.pdf ."},{"key":"18_CR10","unstructured":"Moni Naor. Verification of a human in the loop or Identification via the Turing Test. Unpublished Manuscript, 1997. Available electronically: http:\/\/www.wisdom.weizmann.ac.il\/~naor\/PAPERS\/human.ps ."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Benny Pinkas and Tomas Sander. Securing Passwords Against Dictionary Attacks. In Proceedings of the ACM Computer and Security Conference (CCS\u2019 02), pages 161\u2013170. ACM Press, November 2002.","DOI":"10.1145\/586110.586133"},{"key":"18_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5021-1","volume-title":"Optical Character Recognition: An Illustrated Guide to the Frontier","author":"S. Rice","year":"1999","unstructured":"S. Rice, G. Nagy, and T. Nartker. Optical Character Recognition: An Illustrated Guide to the Frontier. Kluwer Academic Publishers, Boston, 1999."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Adi Shamir and Eran Tromer. Factoring Large Numbers with the TWIRL Device. Unpublished Manuscript, 2003. Available electronically: http:\/\/www.cryptome.org\/twirl.ps.gz .","DOI":"10.1007\/978-3-540-45146-4_1"},{"key":"18_CR14","unstructured":"J. Xu, R. Lipton and I. Essa. Hello, are you human. Technical Report GIT-CC-00-28, Georgia Institute of Technology, November 2000."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39200-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:09:34Z","timestamp":1556770174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39200-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540140399","9783540392002"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-39200-9_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}