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 Chapter
Trust Models for Community Aware Identity Management
TL;DR: This article presents methods for constructing community-aware identity management systems and for computing trust levels between users of a social network, using a novel trust model that takes advantage of both the capabilities of the Semantic Web and of a distributed topology.
Journal ArticleDOI
Neighbor Similarity Trust against Sybil Attack in P2P E-Commerce
TL;DR: This work exploits the neighbor similarity trust relationship to address Sybil attack, an active attack, in which peers can have bogus and multiple identities to fake their owns.
Proceedings ArticleDOI
How to achieve blocking resistance for existing systems enabling anonymous web surfing
Stefan Köpsell,Ulf Hillig +1 more
TL;DR: A blocking resistant, practical and usable system for anonymous web surfing that tries to provide as much reachability and availability as possible, even to users in countries where the free flow of information is legally, organizationally and physically restricted.
Proceedings ArticleDOI
Web Spambot Detection Based on Web Navigation Behaviour
TL;DR: An automated supervised machine learning solution which utilises web navigation behaviour to detect web spambots and proposes a new feature set (referred to as an action set) as a representation of user behaviour to differentiate web spamots from human users.
Journal ArticleDOI
Chernoff-Type Direct Product Theorems
TL;DR: The first proof that parallel repetition with thresholds improves the security of challenge-response protocols is given, with a very general result about an attacker’s ability to solve a large fraction of many independent instances of a hard problem.
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.