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
Proceedings ArticleDOI

Detecting spam comments with malicious users' behavioral characteristics

TL;DR: The differences of behavioral characteristics between normal users and malicious users are analyzed and several heuristic methods to detect spam comments are proposed.
Posted Content

Crowd computing: a survey

TL;DR: This paper will compare the current methods of crowed computing, and provide some guidelines for future works based on the current open issues in this field, specially on solving classification problems using multiple checking scenario.
Book

Open research problems in network security : IFIP WG 11.4 international workshop, iNetSec 2010, Sofia, Bulgaria, March 5-6, 2010 : revised selected papers

TL;DR: This book constitutes the refereed post-conference proceedings of the IFIP WG 11.4 International Workshop, iNetSec 2010, held in Sofia, Bulgaria, in March 2010, and contains 14 revised full papers presented together with an invited talk.
Journal ArticleDOI

Review of the use of human senses and capabilities in cryptography

TL;DR: This paper reviews the previous research on utilizing human senses and capabilities in cryptography, and proposes several topics and problems that need to be solved in order to build cryptography that is more accessible to humans.
Book ChapterDOI

Secure distributed human computation

TL;DR: A general paradigm of using large-scale distributed computation to solve difficult problems, but where humans can act as agents and provide candidate solutions is suggested, especially motivated by problem classes that appear to be difficult for computers to solve effectively, but are easier for humans.
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)