CAPTCHA: using hard AI problems for security
Luis von Ahn,Manuel Blum,Nicholas Hopper,John Langford +3 more
- pp 294-311
Reads0
Chats0
TLDR
This work introduces captcha, an automated test that humans can pass, but current computer programs can't pass; any program that has high success over a captcha can be used to solve an unsolved Artificial Intelligence (AI) problem; and provides several novel constructions of captchas, which imply a win-win situation.Abstract:
We introduce captcha, an automated test that humans can pass, but current computer programs can't pass: any program that has high success over a captcha can be used to solve an unsolved Artificial Intelligence (AI) problem. We provide several novel constructions of captchas. Since captchas have many applications in practical security, our approach introduces a new class of hard problems that can be exploited for security purposes. Much like research in cryptography has had a positive impact on algorithms for factoring and discrete log, we hope that the use of hard AI problems for security purposes allows us to advance the field of Artificial Intelligence. We introduce two families of AI problems that can be used to construct captchas and we show that solutions to such problems can be used for steganographic communication. captchas based on these AI problem families, then, imply a win-win situation: either the problems remain unsolved and there is a way to differentiate humans from computers, or the problems are solved and there is a way to communicate covertly on some channels.read more
Citations
More filters
Book ChapterDOI
Towards detection of botnet communication through social media by monitoring user activity
TL;DR: A new detection mechanism that measures the causal relationship between network traffic and human activity, like mouse clicks or keyboard strokes is introduced, and successful real time detection of botnet Command and Control traffic is demonstrated.
Journal ArticleDOI
Geo-reCAPTCHA: Crowdsourcing large amounts of geographic information from earth observation data
Florian Hillen,Bernhard Höfle +1 more
TL;DR: The results show that a Geo-reCAPTCHA can be solved by the users of the study on building digitization in a short amount of time and with an overall average accuracy of the digitizations of 82.2%.
Proceedings ArticleDOI
Security when people matter: structuring incentives for user behavior
TL;DR: This work describes incentive-centered design and some tools it provides, and provides a number of examples of security problems for which Incentive Centered Design might be helpful.
Journal ArticleDOI
Foundations, Properties, and Security Applications of Puzzles: A Survey
TL;DR: The term puzzle is redefined by collecting and integrating the scattered notions used in different works, to cover all the existing applications, and a comprehensive study of the most important puzzle construction schemes available in the literature is provided.
Journal ArticleDOI
Dempster-Shafer theoretic resolution of referential ambiguity
TL;DR: It is shown how a Dempster-Shafer theoretic pragmatic reasoning component capable of generating requests to clarify pragmatic uncertainty can also generate requests to resolve referential uncertainty when integrated with probabilistic reference resolution and referring expression generation components.
References
More filters
Journal ArticleDOI
Telling humans and computers apart automatically
TL;DR: In this paper, lazy cryptographers do AI and show how lazy they can be, and how they do it well, and why they do so poorly, and they are lazy.
Proceedings ArticleDOI
Securing passwords against dictionary attacks
Benny Pinkas,Tomas Sander +1 more
TL;DR: The key idea is to efficiently combine traditional password authentication with a challenge that is very easy to answer by human users, but is (almost) infeasible for automated programs attempting to run dictionary attacks.
Patent
Method for selectively restricting access to computer systems
TL;DR: In this paper, a computerized method selectively accepts access requests from a client computer connected to a server computer by a network is proposed, where the server computer receives an access request from the client computer and generates a predetermined number of random characters.
Journal ArticleDOI
Pessimal print: a reverse Turing test
TL;DR: This work proposes a variant of the Turing test using pessimal print: that is, low-quality images of machine-printed text synthesized pseudo-randomly over certain ranges of words, typefaces, and image degradations and shows experimentally that judicious choice of these ranges can ensure that the images are legible to human readers but illegible to several of the best present-day optical character recognition (OCR) machines.
Book ChapterDOI
Provably Secure Steganography
TL;DR: In this article, the authors introduce definitions based on computational indistinguishability and prove that the existence of one-way functions implies secure steganographic protocols, and they also prove that secure protocols can be constructed from a complexity-theoretic point of view.