{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:10Z","timestamp":1750307290529,"version":"3.41.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2011,4,1]],"date-time":"2011-04-01T00:00:00Z","timestamp":1301616000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001868","name":"National Science Council Taiwan","doi-asserted-by":"publisher","award":["NSC99-2631-H-001-018NSC99-2631-H-001-020NSC98-2221-E-001-017"],"award-info":[{"award-number":["NSC99-2631-H-001-018NSC99-2631-H-001-020NSC98-2221-E-001-017"]}],"id":[{"id":"10.13039\/501100001868","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Comput. Entertain."],"published-print":{"date-parts":[[2011,4]]},"abstract":"<jats:p>CAPTCHA is an effective and widely used solution for preventing computer programs (i.e., bots) from performing automated but often malicious actions, such as registering thousands of free email accounts or posting advertisement on Web blogs. To make CAPTCHAs robust to automatic character recognition techniques, the text in the tests are often distorted, blurred, and obscure. At the same time, those robust tests may prevent genuine users from telling the text easily and thus distribute the cost of crime prevention among all the users. Thus, we are facing a dilemma, that is, a CAPTCHA should be robust enough so that it cannot be broken by programs, but also needs to be easy enough so that users need not to repeatedly take tests because of wrong guesses.<\/jats:p>\n          <jats:p>In this article, we attempt to resolve the dilemma by proposing a human computation game for quantifying the usability of CAPTCHAs. In our game, DevilTyper, players try to defeat as many devils as possible by solving CAPTCHAs, and player behavior in completing a CAPTCHA is recorded at the same time. Therefore, we can evaluate CAPTCHAs' usability by analyzing collected player inputs. Since DevilTyper provides entertainment itself, we conduct a large-scale study for CAPTCHAs' usability without the resource overhead required by traditional survey-based studies. In addition, we propose a consistent and reliable metric for assessing usability. Our evaluation results show that DevilTyper provides a fun and efficient platform for CAPTCHA designers to assess their CAPTCHA usability and thus improve CAPTCHA design.<\/jats:p>","DOI":"10.1145\/1953005.1953008","type":"journal-article","created":{"date-parts":[[2011,4,26]],"date-time":"2011-04-26T12:01:31Z","timestamp":1303819291000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["DevilTyper"],"prefix":"10.1145","volume":"9","author":[{"given":"Chien-Ju","family":"Ho","sequence":"first","affiliation":[{"name":"University of California, Los Angeles"}]},{"given":"Chen-Chi","family":"Wu","sequence":"additional","affiliation":[{"name":"National Taiwan University"}]},{"given":"Kuan-Ta","family":"Chen","sequence":"additional","affiliation":[{"name":"Institute of Information Science, Academia Sinica"}]},{"given":"Chin-Laung","family":"Lei","sequence":"additional","affiliation":[{"name":"National Taiwan University"}]}],"member":"320","published-online":{"date-parts":[[2011,4]]},"reference":[{"volume-title":"Proceedings of SPIE Document Recognition and Retrieval Conference. 16--20","author":"Baird H. S.","key":"e_1_2_1_1_1","unstructured":"Baird , H. S. and Riopka , T . 2005. ScatterType: A reading CAPTCHA resistant to segmentation attack . In Proceedings of SPIE Document Recognition and Retrieval Conference. 16--20 . Baird, H. S. and Riopka, T. 2005. ScatterType: A reading CAPTCHA resistant to segmentation attack. In Proceedings of SPIE Document Recognition and Retrieval Conference. 16--20."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1054972.1055070"},{"volume-title":"Proceedings of Advances in Neural Information Processing Systems 17 (NIPS'04)","author":"Chellapilla K.","key":"e_1_2_1_3_1","unstructured":"Chellapilla , K. and Simard , P . 2004. Using machine learning to break visual human interaction proofs (HIPs) . In Proceedings of Advances in Neural Information Processing Systems 17 (NIPS'04) . MIT Press. Chellapilla, K. and Simard, P. 2004. Using machine learning to break visual human interaction proofs (HIPs). In Proceedings of Advances in Neural Information Processing Systems 17 (NIPS'04). MIT Press."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1101149.1101218"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1600150.1600153"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1600150.1600172"},{"volume-title":"Proceedings of the International Conference on Spoken Language Processing (ICSLP'02)","author":"Kochanski G.","key":"e_1_2_1_7_1","unstructured":"Kochanski , G. , Lopresti , D. , and Shih , C . 2002. A reverse turing test using speech . In Proceedings of the International Conference on Spoken Language Processing (ICSLP'02) . 1357--1360. Kochanski, G., Lopresti, D., and Shih, C. 2002. A reverse turing test using speech. In Proceedings of the International Conference on Spoken Language Processing (ICSLP'02). 1357--1360."},{"volume-title":"Proceedings of Computer Vision and Pattern Recognition Conference. 134--141","author":"Mori G.","key":"e_1_2_1_8_1","unstructured":"Mori , G. and Malik , J . 2003. Recognizing objects in adversarial clutter: Breaking a visual CAPTCHA . In Proceedings of Computer Vision and Pattern Recognition Conference. 134--141 . Mori, G. and Malik, J. 2003. Recognizing objects in adversarial clutter: Breaking a visual CAPTCHA. In Proceedings of Computer Vision and Pattern Recognition Conference. 134--141."},{"key":"e_1_2_1_9_1","unstructured":"PWNtcha. 2011. CAPTCHA decoder. http:\/\/libcaca.zoy.org\/wiki\/PWNtcha\/.  PWNtcha. 2011. CAPTCHA decoder. http:\/\/libcaca.zoy.org\/wiki\/PWNtcha\/."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/IWFHR.2004.54"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2006.196"},{"volume-title":"Proceedings of the Eurocrypt Conference. 294--311","author":"von Ahn L.","key":"e_1_2_1_12_1","unstructured":"von Ahn , L. , Blum , M. , Hopper , N. J. , and Langford , J . 2003. CAPTCHA: Using hard ai problems for security . In Proceedings of the Eurocrypt Conference. 294--311 . von Ahn, L., Blum, M., Hopper, N. J., and Langford, J. 2003. CAPTCHA: Using hard ai problems for security. In Proceedings of the Eurocrypt Conference. 294--311."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/985692.985733"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1124772.1124784"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1124772.1124782"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2006.355"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1408664.1408671"}],"container-title":["Computers in Entertainment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1953005.1953008","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1953005.1953008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:41Z","timestamp":1750244381000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1953005.1953008"}},"subtitle":["a game for CAPTCHA usability evaluation"],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["10.1145\/1953005.1953008"],"URL":"https:\/\/doi.org\/10.1145\/1953005.1953008","relation":{},"ISSN":["1544-3574"],"issn-type":[{"type":"electronic","value":"1544-3574"}],"subject":[],"published":{"date-parts":[[2011,4]]},"assertion":[{"value":"2010-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}