scispace - formally typeset
Open AccessBook ChapterDOI

CAPTCHA: using hard AI problems for security

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

Content maybe subject to copyright    Report

Citations
More filters
Journal Article

Statistical Analysis of Dice CAPTCHA Usability

TL;DR: The elements of the CAPTCHA usability are analyzed based on the usability elements which are abbreviated as user-centric approach to theCAPTCHA and conclusion of their use is drawn.

Secure Authentication Protocol to Detect Sybil Attacks in MANETs

Nidhi Joshi, +1 more
TL;DR: A novel and secure authentication of nodes as soon as they comes in to the network (checks the identity of a new node) and then checking the RSS value of node continuously and accurately detecting the sybil identity in the network.
Proceedings ArticleDOI

Matching Game Mechanics and Human Computation Tasks in Games with a Purpose

TL;DR: This work attempts to solve shortcomings for novel designers by providing a development process to follow when designing new Games with a Purpose (GWAP) and the definition of the multimedia refinement tasks best suited to be solved with GWAPs and the list of traditional game mechanics that best match these tasks.
Proceedings ArticleDOI

Face recognition CAPTCHA made difficult

TL;DR: This paper systematically design and implement a practical face recognition CAPTCHA, informed by psychological findings, and uses gray-scale and binary images, which are computationally inexpensive to generate and deploy.
Book ChapterDOI

Hello, Facebook! Here Is the Stalkers’ Paradise!: Design and Analysis of Enumeration Attack Using Phone Numbers on Facebook

TL;DR: A method to automatically collect Facebook users' personal data by enumerating the possibly almost entire phone number range for the target area by mimicking real users’ search activities with three sybil accounts is developed.
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

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.
Related Papers (5)