A low-cost attack on a microsoft CAPTCHA
A low-cost attack on a microsoft CAPTCHA
CAPTCHA is now almost a standard security technology. The most widely deployed CAPTCHAs are text-baaed schemes, which typically require users to solve a text recognition task. The state of the art of CAPTCHA design suggests that such text-based schemes should rely on segmentation resistance to provide security guarantee, as individual character recognition after segmentation can be solved with a high success rate by standard methods such as neural networks. In this paper, we present new character segmentation techniques of general value to attack a number of text CAPTCHAs, including the schemes designed and deployed by Microsoft, Yahoo and Google. In particular, the Microsoft CAPTCHA has been deployed since 2002 at many of their online services including Hotmail, MSN and Windows Live. Designed to be segmentation- resistant, this scheme has been studied and tuned by its designers over the years. However, our simple attack has achieved a segmentation success rate of higher than 90% against this scheme. It took on average -.80 ins for the attack to completely segment a challenge on an ordinary desktop computer. As a result, we estimate that this CAPTCHA could be instantly broken by a malicious bot with an overall (segmentation and then recognition) success rate of more than 60%. On the contrary, the design goal was that automated attacks should not achieve a success rate of higher than 0.01%. For the first time, this paper shows that CAPTCHAs that are carefully designed to be segmentationresistant are vulnerable to novel but simple attacks.
CAFTCHA, Internet security, Robustness, Segmentation attack, Usability
543-554
Yan, Jeff
a2c03187-3722-46c8-b73b-439eb9d1a10e
Ahmad, Ahmad Salah El
e6e3d56d-a029-404f-aca6-14a8d54d2f43
2008
Yan, Jeff
a2c03187-3722-46c8-b73b-439eb9d1a10e
Ahmad, Ahmad Salah El
e6e3d56d-a029-404f-aca6-14a8d54d2f43
Yan, Jeff and Ahmad, Ahmad Salah El
(2008)
A low-cost attack on a microsoft CAPTCHA.
In Proceedings of the 15th ACM Conference on Computer and Communications Security, CCS'08.
.
(doi:10.1145/1455770.1455839).
Record type:
Conference or Workshop Item
(Paper)
Abstract
CAPTCHA is now almost a standard security technology. The most widely deployed CAPTCHAs are text-baaed schemes, which typically require users to solve a text recognition task. The state of the art of CAPTCHA design suggests that such text-based schemes should rely on segmentation resistance to provide security guarantee, as individual character recognition after segmentation can be solved with a high success rate by standard methods such as neural networks. In this paper, we present new character segmentation techniques of general value to attack a number of text CAPTCHAs, including the schemes designed and deployed by Microsoft, Yahoo and Google. In particular, the Microsoft CAPTCHA has been deployed since 2002 at many of their online services including Hotmail, MSN and Windows Live. Designed to be segmentation- resistant, this scheme has been studied and tuned by its designers over the years. However, our simple attack has achieved a segmentation success rate of higher than 90% against this scheme. It took on average -.80 ins for the attack to completely segment a challenge on an ordinary desktop computer. As a result, we estimate that this CAPTCHA could be instantly broken by a malicious bot with an overall (segmentation and then recognition) success rate of more than 60%. On the contrary, the design goal was that automated attacks should not achieve a success rate of higher than 0.01%. For the first time, this paper shows that CAPTCHAs that are carefully designed to be segmentationresistant are vulnerable to novel but simple attacks.
This record has no associated files available for download.
More information
Published date: 2008
Venue - Dates:
15th ACM conference on Computer and Communications Security, CCS'08, , Alexandria, VA, United States, 2008-10-27 - 2008-10-31
Keywords:
CAFTCHA, Internet security, Robustness, Segmentation attack, Usability
Identifiers
Local EPrints ID: 500829
URI: http://eprints.soton.ac.uk/id/eprint/500829
ISSN: 1543-7221
PURE UUID: b58c6f66-7e43-462e-a48d-bc0f8bcaf8f2
Catalogue record
Date deposited: 13 May 2025 17:24
Last modified: 13 May 2025 17:24
Export record
Altmetrics
Contributors
Author:
Jeff Yan
Author:
Ahmad Salah El Ahmad
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics