Completely Automated Public Turing Test to Tell Computers and Humans Apart (CAPTCHA) based Robot Challenges for SIP
draft-tschofenig-sipping-captcha-01
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Authors | Hannes Tschofenig , Eva Leppanen , Saverio Niccolini , Mayutan Arumaithurai | ||
| Last updated | 2008-02-25 (Latest revision 2007-07-05) | ||
| Stream | (None) | ||
| Formats |
Expired & archived
plain text
html
xml
htmlized
pdfized
bibtex
|
||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
https://www.ietf.org/archive/id/draft-tschofenig-sipping-captcha-01.txt
Abstract
A common approach to deal with unwanted communication attempts is to rely on some form of authorization policies, typically whitelists. In order to populate the entries in such an access control list it is helpful to have a way to challenge the entity willing to engage in a conversation (unless they are already pre-authorized). One reason why this is desired is to deal with robots that are aggressively distributing messages. This document describes how "Completely Automated Public Turing Test to Tell Computers and Humans Apart" (CAPTCHA) tests, which require human interaction, are applied to SIP.
Authors
Hannes Tschofenig
Eva Leppanen
Saverio Niccolini
Mayutan Arumaithurai
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)