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
Proceedings ArticleDOI
Improving HTTP performance using "stateless" TCP
TL;DR: This work introduces a server-side kernel modification which enables a web server to perform HTTP over a UDP socket while the kernel provides a regular TCP interface 'on the wire' to remote clients.
Journal ArticleDOI
Digital Labor: The Internet as Playground and Factory, edited by Trebor Scholz. New York, NY: Routledge, 2013. 258 pp. $37.95 paper. ISBN 9780415896955 paper.
TL;DR: Taylor and Francis shall not be liable for any losses, actions, claims, proceedings, demands, costs, expenses, damages, and other liabilities whatsoever or howsoever caused arising directly or indirectly in connection with, in relation to or arising out of the use of the Content.
Proceedings ArticleDOI
Remote Internet voting: Security and performance issues
TL;DR: Properly implemented, e-voting solutions can increase the security of the ballot, speed up the processing of results and make voting easier, however, the challenges are considerable.
Proceedings ArticleDOI
Secure Image Display through Visual Cryptography: Exploiting Temporal Responsibilities of the Human Eye
TL;DR: A new protection scheme for displaying a static binary image on a screen is proposed by a visual cryptography algorithm that divides the target images into several divisions and demonstrates that encrypted visual information was mentally recovered by the human visual system.
Visual Learning of Socio-Video Semantics
TL;DR: It is demonstrated, that concept detection can serve as a key component to infer the sentiment reflected in visual content, and an automatic concept-to-query mapping for the retrieval of relevant training video material, and active relevance filtering to generate reliable annotations from web video tags are suggested.
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.