1. Field of the Invention
The field of the invention is data processing, or, more specifically, methods, apparatus, and products for user authorization using a Completely Automated Public Turing test to tell Computers and Humans Apart (‘Automated Turing Test’).
2. Description of Related Art
A Completely Automated Public Turing test to tell Computers and Humans Apart (‘Automated Turing Test’) is a rather simple test that can be easily answered by a human but extremely difficult to be answered by a computer. Automated Turing Tests have been widely used for practical security reasons, such as for example, preventing automated registration in web-based services like web-based email. Email providers may use an automated Turing Test as a step in the registration process to prevent automated scripts from subscribing and using their resources for spam distribution. Other applications of Automated Turing Tests involve on-line polls, web-blogs, or purchasing products, where only humans are permitted participate.
An automated Turing Test typically presents a human with a token that includes a key. The token is often implemented as an image and the key is often implemented as text within the image. While a human is generally able to identify the text within the image fairly easily, such identification is often difficult for a computer program. Automated Turing Tests typically attempt to frustrate a computer programs ability to identify the key by embedding text into the image that violates OCR recognition rules. As computer programs have become more advanced, however, a program's ability to recognize the key text is becoming more advanced—often allowing such programs to identify the key and foil the Automated Turing Test. To combat the advancement of computer programs attempting to foil an Automated Turing Test, the Automated Turing Test designers embed the key in the token in ways that make OCR recognition even more difficult, such as, for example, blurring, warping, shading, coloring, or obscuring the text. The drawback to this approach, however, is that attempts to make OCR recognition more difficult have also made text recognition by a human more difficult as well. As such, readers will appreciate that room for improvement exists in the use of Automated Turing Tests.
Methods, apparatus, and products are disclosed for user authorization using an Automated Turing Test that include: selecting, by an automated Turing Test module, a challenge token, the challenge token including a challenge key; repeatedly at an Automated Turing Test pace: selecting, by the Automated Turing Test module, a portion of the challenge token in dependence upon predetermined selection criteria, and revealing, by Automated Turing Test module, only the selected portion of the challenge token to a user; receiving, by the Automated Turing Test module from the user, a user response; determining, by the Automated Turing Test module, whether the user response matches the challenge key; and authorizing, by the Automated Turing Test module, the user to access a resource if the user response matches the challenge key.
The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular descriptions of exemplary embodiments of the invention as illustrated in the accompanying drawings wherein like reference numbers generally represent like parts of exemplary embodiments of the invention.
FIG. 1 sets forth a functional block diagram of an exemplary system capable of user authorization using an automated Turing Test according to exemplary embodiments of the present invention.
FIGS. 2A-H set forth line drawings illustrating an exemplary method of user authorization using an automated Turing Test according to exemplary embodiments of the present invention.
FIG. 3 sets forth a flow chart illustrating a further exemplary method of user authorization using an automated Turing Test according to exemplary embodiments of the present invention.
FIG. 4 sets forth a flow chart illustrating a further exemplary method of user authorization using an automated Turing Test according to exemplary embodiments of the present invention.
FIG. 5 sets forth a flow chart illustrating a further exemplary method of user authorization using an automated Turing Test according to exemplary embodiments of the present invention.
FIGS. 6A-H set forth line drawings illustrating a further exemplary method of user authorization using an automated Turing Test according to exemplary embodiments of the present invention.
Exemplary methods, apparatus, and products for user authorization using an automated Turing Test in accordance with the present invention are described with reference to the accompanying drawings, beginning with FIG. 1. FIG. 1 sets forth a functional block diagram of an exemplary system capable of user authorization using an automated Turing Test according to embodiments of the present invention. The exemplary system of FIG. 1 includes several computing devices (152, 112, 114, 116, 120) connected together for data communications through a network (100).
The exemplary client device (152) of FIG. 1 includes a web browser (110) stored in RAM (168). The web browser (110) of FIG. 1 is a software application that enables a user to display and interact with text, images, videos, music, and other information referenced through a web page (103) retrieved from web server (126) installed on server (120). Examples of web browsers include Microsoft's Internet Explorer®, Mozilla's Firefox®, and Apple's Safari®.
Upon loading the web page (103) of FIG. 1, the web browser (110) of FIG. 1 may instruct the client device (152) to execute an automated Turing Test module (102) to perform user authorization using an automated Turing Test according to embodiments of the present invention. The Automated Turing Test module (102) of FIG. 1 may be implemented as a Java™ applet that the web browser (110) downloads when loading the web page (103). The web browser may execute such an automated Turing Test module implementation using a Java Virtual Machine (‘JVM’) (106) that provide an execution environment for Java™ programs. In other embodiments, however, the Automated Turing Test module (102) may be implemented in the web page (103) as a script such as, for example, JavaScript or a VBScript. In still other embodiments, the Automated Turing Test module (102) may be implemented as an Adobe Flash executable file.
The exemplary client device (152) of FIG. 1 includes the Automated Turing Test module (102) stored in RAM (168). The Automated Turing Test module (102) is a software component having computer program instructions for user authorization using an automated Turing Test according to embodiments of the present invention. The Automated Turing Test module (102) of FIG. 1 operates generally for user authorization using an automated Turing Test according to embodiments of the present invention by: selecting a challenge token, the challenge token including a challenge key; repeatedly at an Automated Turing Test pace, selecting a portion of the challenge token in dependence upon predetermined selection criteria and revealing only the selected portion of the challenge token to a user; receiving a user response from the user; determining whether the user response matches the challenge key; and authorizing the user to access a resource if the user response matches the challenge key. The Automated Turing Test module (102) of FIG. 1 may also operate generally for user authorization using an automated Turing Test according to embodiments of the present invention by: determining the Automated Turing Test pace in dependence upon a workload for the web server (126) providing the resource to the user in the example of FIG. 1.
Also stored in RAM (168) is an operating system (154). Operating systems useful for user authorization using an automated Turing Test according to embodiments of the present invention include UNIX™, Linux™, Microsoft Vista™, AIX™, IBM's i5/OS™, and others as will occur to those of skill in the art. The operating system (154), Automated Turing Test module (102), the JVM (106), the web page (103), and the web browser (110) in the example of FIG. 1 are shown in RAM (168), but many components of such software typically are stored in non-volatile memory also, such as, for example, on a disk drive (170).
The computing device (152) of FIG. 1 includes disk drive adapter (172) coupled through expansion bus (160) and bus adapter (158) to processor (156) and other components of the computing device (152). Disk drive adapter (172) connects non-volatile data storage to the computing device (152) in the form of disk drive (170). Disk drive adapters useful in computing devices for user authorization using an automated Turing Test according to embodiments of the present invention include Integrated Drive Electronics (‘IDE’) adapters, Small Computer System Interface (‘SCSI’) adapters, and others as will occur to those of skill in the art. Non-volatile computer memory also may be implemented for as an optical disk drive, electrically erasable programmable read-only memory (‘EEPROM’ or ‘Flash’ memory)(134), RAM drives, and so on, as will occur to those of skill in the art.
The example computing device (152) of FIG. 1 includes one or more input/output (‘I/O’) adapters (178). I/O adapters implement user-oriented input/output through, for example, software drivers and computer hardware for controlling output to display devices such as computer display screens, as well as user input from user input devices (181) such as keyboards and mice. The example computing device (152) of FIG. 1 includes a video adapter (209), which is an example of an I/O adapter specially designed for graphic output to a display device (180) such as a display screen or computer monitor. Video adapter (209) is connected to processor (156) through a high speed video bus (164), bus adapter (158), and the front side bus (162), which is also a high speed bus.
The exemplary computing device (152) of FIG. 1 includes a communications adapter (167) that couples the computing device for data communications with the other computing devices (112, 114, 116, 120) in the data center through a data communications network (100). Such a data communication network (100) may be implemented with external buses such as a Universal Serial Bus (‘USB’), or as an Internet Protocol (‘IP’) network or an Ethernet™ network, an I2C network, a System Management Bus (‘SMBus’), an Intelligent Platform Management Bus (‘IPMB’), for example, and in other ways as will occur to those of skill in the art. Communications adapters implement the hardware level of data communications through which one computer sends data communications to another computer, directly or through a data communications network. Examples of communications adapters useful for user authorization using an automated Turing Test according to embodiments of the present invention include modems for wired dial-up communications, Ethernet (IEEE 802.3) adapters for wired data communications network communications and 802.11 adapters for wireless data communications network communications.
Although the explanation above with reference to FIG. 1 describes the Automated Turing Test module (102) being executed on the client device (152), readers will note that executing the Automated Turing Test module (102) on the client device (152) is for explanation only and not for limitation. In fact, the Automated Turing Test module (102) may be executed on other remote devices with respect to the user-operated client device (152). For example, the Automated Turing Test module (102) may be installed on the server (120) and invoked by the web server (126). In such an example, the Automated Turing Test module (102) may repeatedly reveal only a selected portion of the challenge token to a user using an animated GIF.
The arrangement of servers and other devices making up the exemplary system illustrated in FIG. 1 are for explanation, not for limitation. Data processing systems useful according to various embodiments of the present invention may include additional servers, routers, other devices, and peer-to-peer architectures, not shown in FIG. 1, as will occur to those of skill in the art. Networks in such data processing systems may support many data communications protocols, including for example TCP (Transmission Control Protocol), IP (Internet Protocol), HTTP (HyperText Transfer Protocol), WAP (Wireless Access Protocol), HDTP (Handheld Device Transport Protocol), and others as will occur to those of skill in the art. Various embodiments of the present invention may be implemented on a variety of hardware platforms in addition to those illustrated in FIG. 1.
For further explanation, FIGS. 2A-H set forth line drawings illustrating an exemplary method of user authorization using an automated Turing Test according to exemplary embodiments of the present invention. FIGS. 2A-H each include a web browser graphical user interface (‘GUI’) (201) used by a user to interact with a web browser. Each web browser GUI (201) includes a challenge token (202). In the examples of FIGS. 2A-H, the challenge token (202) is implemented as an image with both graphical and textual marks. Each web browser GUI (201) also includes a response field (204) for receiving user input that describes the challenge key included in the challenge token (202). In the example of FIGS. 2A-H, the challenge key is implemented as the text ‘3AT8R7’ in the challenge token (202). Readers will note that although the challenge token (202) and the challenge key of FIGS. 2A-H are implemented using visual elements, readers of skill in the art will appreciate that in other embodiments, a challenge token and a challenge key may be implemented using audio elements.
In the example of FIG. 2A, an automated Turing Test module selects the challenge token (202). The challenge token (202) includes the challenge key ‘3AT8R7.’ The Automated Turing Test module may briefly flash the entire challenge token (202) to the user through the web browser GUI (201) as in FIG. 2A. In other embodiments, however, the Automated Turing Test module may never display the entire challenge token (202) to the user.
In the exemplary FIGS. 2B-G, the Automated Turing Test module repeatedly, at an Automated Turing Test pace, selects a portion of the challenge token (202) in dependence upon predetermined selection criteria and reveals only the selected portion of the challenge token (202) to a user. Depending on the pace at which the Automated Turing Test module repeatedly selects a portion of the challenge token (202) and reveals the selected portion and depending on the portion's shape and size, the user may perceive the illusion of a ‘moving spotlight’ or ‘bouncing ball’ over the challenge token (202). The predetermined selection criteria used by the Automated Turing Test module typically specifies a pattern for repeatedly selecting portions of the challenge token (202) to be revealed in such a manner that only portions of the challenge key are revealed to the user at any given moment.
For example, in the exemplary FIG. 2B, the Automated Turing Test module selects a portion of the challenge token (202) that contains the ‘3’ in the challenge key and reveals only the portion of the challenge token that contains the ‘3’ to the user. Based on predefined selection criteria, the Automated Turing Test module of FIG. 2C selects a portion of the challenge token (202) that contains the ‘A’ in the challenge key and reveals only the portion of the challenge token that contains the ‘A’ to the user. In the exemplary FIG. 2D, the Automated Turing Test module selects a portion of the challenge token (202) that contains the ‘T’ in the challenge key and reveals only the portion of the challenge token that contains the ‘T’ to the user. Based on predefined selection criteria, the Automated Turing Test module of FIG. 2E selects a portion of the challenge token (202) that contains the ‘8’ in the challenge key and reveals only the portion of the challenge token that contains the ‘8’ to the user. In the exemplary FIG. 2F, the Automated Turing Test module selects a portion of the challenge token (202) that contains the ‘R’ in the challenge key and reveals only the portion of the challenge token that contains the ‘R’ to the user. Based on predefined selection criteria, the Automated Turing Test module of FIG. 2G selects a portion of the challenge token (202) that contains the ‘7’ in the challenge key and reveals only the portion of the challenge token that contains the ‘7’ to the user.
In the example of FIG. 2H, the Automated Turing Test module receives a user response from the user through the response field (204) in the web browser GUI (201). A user typically provides the user response to the Automated Turing Test module after enough iterations of repeatedly selecting a portion of the challenge token (202) and revealing the selected portion to the user have occurred for the user to identify the challenge key. In the example of FIG. 2H, the Automated Turing Test module receives a user response of ‘3AT8R7’ from the user when the user selects the ‘Submit’ button rendered on the web browser GUI (201). The Automated Turing Test module then determines whether the user response matches the challenge key and authorizes the user to access a resource if the user response matches the challenge key. The resource accessed by the user may be implemented as additional web content, an item emailed or mailed to the user, a service such as web-based email or web-based voting, or any other resource as will occur to those of skill in the art.
For further explanation, FIG. 3 sets forth a flow chart illustrating a further exemplary method of user authorization using an automated Turing Test according to exemplary embodiments of the present invention. The method of FIG. 3 includes selecting (300), by an automated Turing Test module, a challenge token. The challenge token includes a challenge key. The Automated Turing Test module may select (300) a challenge token according to the method of FIG. 3 by randomly selecting a challenge token from a token repository.
In other embodiments, the Automated Turing Test module may select (300) a challenge token according to the method of FIG. 3 by selecting a challenge token in dependence upon user attributes. The user attributes specify characteristics that describe the user. Examples of user attributes may include, for example, the user's location, sex, age, preferences, and so on. The Automated Turing Test module may identify the user's user attributes from a user profile for the user or from other information related to the user such as, for example, the IP address for the user's computer. For further explanation, consider, that user attributes for a user specify that the user is French. In such an example, the Automated Turing Test module may select a challenge token that depicts French symbols such as, for example, the Eiffel tower, the French flag, and so on.
The method of FIG. 3 also includes determining (302), by the Automated Turing Test module, the Automated Turing Test pace in dependence upon a workload for a web server providing the user access to resource. The Automated Turing Test module may determine (302) the Automated Turing Test pace in dependence upon a workload for a web server according to the method of FIG. 3 by transmitting a workload status request to the web server and receiving a workload metric from the web server in response. The workload metric may specify the workload for the web server as the size of the web server's workload request queue, the amount of available cache, the rate at which memory swapping is occurring, or any other way of measuring a web server's workload as will occur to those of skill in the art. As the web server's workload increases, the Automated Turing Test module may determine (302) the Automated Turing Test pace according to the method of FIG. 3 by decreasing the pace at which portions of the challenge token are revealed. Decreasing the pace at which portions of the challenge token are revealed increases the amount of time that a user typically requires to identify the challenge key in the challenge token, thereby giving a web server with a high workload time to process the workload before the user is authorized to access any additional web content. Similarly, as the web server's workload decreases, the Automated Turing Test module may determine (302) the Automated Turing Test pace according to the method of FIG. 3 by increasing the pace at which portions of the challenge token are revealed.
The method of FIG. 3 also includes repeatedly (304), at the Automated Turing Test pace, selecting (306), by the Automated Turing Test module, a portion of the challenge token in dependence upon predetermined selection criteria and revealing (308), by Automated Turing Test module, only the selected portion of the challenge token to a user. The Automated Turing Test module may select (306) a portion of the challenge token according to the method of FIG. 3 by identifying a region of the challenge token for display using the predetermined selection criteria. The predetermined selection criteria may be implemented as an algorithm that specifies the region of the challenge token for display based on the current displayed region of the challenge token. In other embodiments, however, the predetermined selection criteria may be implemented as table that specifies a set of regions for the challenge token and the order in which those regions are to be revealed to the user. Regardless of its implementation, however, the predetermined selection criteria may be used to repeatedly select (306) portions of the challenge token to reveal in order to provide the user with an illusion of a moving spotlight, bouncing ball, sliding rectangles, a moving billboard effect, checkerboard patterns, and any other animated patterns as will occur to those of skill in the art.
The Automated Turing Test module may reveal (308) only the selected portion of the challenge token to a user according to the method of FIG. 3 by rendering the selected portion on a GUI available to the user for view and obscuring the remaining portions of the challenge token from the user's view. In embodiments of the present invention that implement a challenge token and a challenge key using audio elements, the Automated Turing Test module may reveal (308) only the selected portion of the challenge token to a user by rendering the selected portions to the user through a speaker.
The method of FIG. 3 includes receiving (310), by the Automated Turing Test module from the user, a user response. The Automated Turing Test module may receive (310) a user response from the user according to the method of FIG. 3 by prompting the user to provide the user response. The Automated Turing Test module may then receive (310) a user response from the user according to the method of FIG. 3 by receiving text from the user through a GUI. In other embodiments, the Automated Turing Test module may receive (310) a user response from the user according to the method of FIG. 3 by receiving speech utterances from the user and converting those speech utterances to speech text.
The method of FIG. 3 also includes determining (312), by the Automated Turing Test module, whether the user response matches the challenge key. The manner in which the Automated Turing Test module may determines (312) whether the user response matches the challenge key according to the method of FIG. 3 may vary depending on the implementation of the challenge key. For example, when the challenge key is implemented as text embedded within an image, the Automated Turing Test module may determine (312) whether the user response matches the challenge key according to the method of FIG. 3 by comparing the text of the user response with the text of the challenge key. If the text of the user response and the text of the challenge key are the same, then the user response matches the challenge key. The user response does not match the challenge key, however, if the text of the user response and the text of the challenge key are not the same. In other embodiments, the challenge key may be implemented as image embedded within an image implementing the challenge token. For example, the challenge token may be implemented as an image including a various images of animals, and the challenge key may be implemented as an image of a horse within the challenge token. In such embodiments, the Automated Turing Test module may determine (312) whether the user response matches the challenge key according to the method of FIG. 3 by comparing the text of the user response with metadata text describing the image implementing the challenge key.
The method of FIG. 3 includes authorizing (314), by the Automated Turing Test module, the user to access a resource if the user response matches the challenge key and denying (316), by the Automated Turing Test module, the user access to the resource if the user response does not match the challenge key. As mentioned above, the resource may be implemented as additional web content, an item emailed or mailed to the user, a service such as web-based email or web-based voting, or any other resource as will occur to those of skill in the art.
The size for the portion of the challenge token that is revealed to the user may vary depending on a number of factors. For further explanation, therefore, consider, FIG. 4 that sets forth a flow chart illustrating a further exemplary method of user authorization using an automated Turing Test according to exemplary embodiments of the present invention. The method of FIG. 4 is similar to the method of FIG. 3. That is, the method of FIG. 4 includes: selecting (300), by an automated Turing Test module, a challenge token, the challenge token including a challenge key; repeatedly (304) at an Automated Turing Test pace: selecting (306), by the Automated Turing Test module, a portion of the challenge token in dependence upon predetermined selection criteria, and revealing (308), by Automated Turing Test module, only the selected portion of the challenge token to a user; receiving (310), by the Automated Turing Test module from the user, a user response; determining (312), by the Automated Turing Test module, whether the user response matches the challenge key; authorizing (314), by the Automated Turing Test module, the user to access a resource if the user response matches the challenge key; and denying (316), by the Automated Turing Test module, the user access to the resource if the user response does not match the challenge key.
The method of FIG. 4 differs from the method of FIG. 3 in that selecting (306), by the Automated Turing Test module, a portion of the challenge token in dependence upon predetermined selection criteria according to the method of FIG. 4 includes determining (400) a revealed portion size and selecting (402) the portion of the challenge token in dependence upon the revealed portion size. The revealed portion size is the size of the portion of the challenge token revealed to the user during each iteration described above. The Automated Turing Test module may determine (400) the revealed portion size according to the method of FIG. 4 by retrieving a predefined portion size based on the shape of the portion to be revealed, that is, whether the shape is a circle, square, rectangle, and so on. The Automated Turing Test module may also determine (400) the revealed portion size according to the method of FIG. 4 based on the relationship between the size of the challenge token and the size of the challenge key. Still further, the Automated Turing Test module may also determine (400) the revealed portion size according to the method of FIG. 4 by randomly selecting a revealed portion size. The Automated Turing Test module may also determine (400) the revealed portion size according to the method of FIG. 4 in dependence upon the predetermined selection criteria used to select the particular portion of the challenge token to reveal during each iteration.
The shape for the portion of the challenge token that is revealed to the user may vary depending on a number of factors. For further explanation, therefore, consider, FIG. 5 that sets forth a flow chart illustrating a further exemplary method of user authorization using an automated Turing Test according to exemplary embodiments of the present invention. The method of FIG. 5 is similar to the method of FIG. 3. That is, the method of FIG. 5 includes: selecting (300), by an automated Turing Test module, a challenge token, the challenge token including a challenge key; repeatedly (304) at an Automated Turing Test pace: selecting (306), by the Automated Turing Test module, a portion of the challenge token in dependence upon predetermined selection criteria, and revealing (308), by Automated Turing Test module, only the selected portion of the challenge token to a user; receiving (310), by the Automated Turing Test module from the user, a user response; determining (312), by the Automated Turing Test module, whether the user response matches the challenge key; authorizing (314), by the Automated Turing Test module, the user to access a resource if the user response matches the challenge key; and denying (316), by the Automated Turing Test module, the user access to the resource if the user response does not match the challenge key.
The method of FIG. 5 differs from the method of FIG. 3 in that selecting (306), by the Automated Turing Test module, a portion of the challenge token in dependence upon predetermined selection criteria according to the method of FIG. 5 includes determining (500) a revealed portion shape and selecting (502) the portion of the challenge token in dependence upon the revealed portion shape. The revealed portion shape is the shape of the portion of the challenge token revealed to the user during each iteration described above. The Automated Turing Test module may determine (500) a revealed portion shape according to the method of FIG. 5 by selecting a predefined shape such as, for example, a circle, square, rectangle, and so on. The Automated Turing Test module may determine (500) a revealed portion shape according to the method of FIG. 5 based on the relationship between the size of the challenge token and the size of the challenge key. Still further, the Automated Turing Test module may determine (500) a revealed portion shape according to the method of FIG. 5 by randomly selecting the revealed portion shape. The Automated Turing Test module may determine (500) a revealed portion shape according to the method of FIG. 5 in dependence upon the predetermined selection criteria used to select the particular portion of the challenge token to reveal during each iteration.
The exemplary challenge tokens discussed above are generally described as including only a single challenge key. Readers will note, however, that challenge tokens useful in user authorization using an automated Turing Test according to exemplary embodiments of the present invention may include any number of challenge keys. For further explanation, consider FIGS. 6A-H that set forth line drawings illustrating a further exemplary method of user authorization using an automated Turing Test according to exemplary embodiments of the present invention.
FIGS. 6A-H each include a web browser graphical user interface (‘GUI’) (201) used by a user to interact with a web browser. Each web browser GUI (201) includes a challenge token (202). In the examples of FIGS. 6A-H, the challenge token (202) is implemented as an image with textual elements. Each web browser GUI (201) also includes a response field (204) for receiving user input that describes the challenge key. The challenge token (202) of FIGS. 6A-H includes a plurality of challenge keys. In the example of FIGS. 6A-H, the challenge keys are implemented as combinations of the letters in the challenge token (202) such as, for example, the text ‘3AT8R7,’ ‘3AT8P2,’ ‘S4T8R7,’ ‘S4A9MR7,’ and so on.
In the example of FIG. 6A, an automated Turing Test module selects the challenge token (202). The Automated Turing Test module may briefly flash the entire challenge token (202) to the user through the web browser GUI (201) as in FIG. 6A. In other embodiments, however, the Automated Turing Test module may never display the entire challenge token (202) to the user.
In the exemplary FIGS. 6B-G, the Automated Turing Test module repeatedly, at an Automated Turing Test pace, selects a portion of the challenge token (202) in dependence upon predetermined selection criteria and reveals only the selected portion of the challenge token (202) to a user. In the example of FIGS. 6A-H, the predetermined selection criteria specify the challenge key to reveal among the plurality of challenge keys. The predetermined selection criteria specify the challenge key to reveal among the plurality of challenge keys by specifying the portions of the challenge token (202) repeatedly selected and revealed to the user. For example, if the predetermined selection criteria specify repeatedly selecting and revealing the letters ‘S,’ ‘A,’ ‘9,’ ‘M,’ ‘R,’ and ‘7,’ the predetermined selection criteria specify the challenge key ‘SA9MR7’ among the plurality of other challenge keys in the challenge token (202).
For further example, in the exemplary FIG. 6B, the Automated Turing Test module selects a portion of the challenge token (202) that contains the ‘S’ in the challenge key and reveals only the portion of the challenge token that contains the ‘S’ to the user. Based on predefined selection criteria, the Automated Turing Test module of FIG. 6C selects a portion of the challenge token (202) that contains the ‘A’ in the challenge key and reveals only the portion of the challenge token that contains the ‘A’ to the user. In the exemplary FIG. 6D, the Automated Turing Test module selects a portion of the challenge token (202) that contains the ‘9’ in the challenge key and reveals only the portion of the challenge token that contains the ‘9’ to the user. Based on predefined selection criteria, the Automated Turing Test module of FIG. 6E selects a portion of the challenge token (202) that contains the ‘M’ in the challenge key and reveals only the portion of the challenge token that contains the ‘M’ to the user. In the exemplary FIG. 6F, the Automated Turing Test module selects a portion of the challenge token (202) that contains the ‘R’ in the challenge key and reveals only the portion of the challenge token that contains the ‘R’ to the user. Based on predefined selection criteria, the Automated Turing Test module of FIG. 6G selects a portion of the challenge token (202) that contains the ‘7’ in the challenge key and reveals only the portion of the challenge token that contains the ‘7’ to the user.
In the example of FIG. 6H, the Automated Turing Test module receives a user response from the user through the response field (204) in the web browser GUI (201). A user typically provides the user response to the Automated Turing Test module after enough iterations of repeatedly selecting a portion of the challenge token (202) based on the predefined selection criteria and revealing the selected portion to the user have occurred for the user to identify the challenge key. As mentioned above, based on the predefined selection criteria, the Automated Turing Test module repeatedly selects portion of the challenge token (202) containing the letters ‘S,’ ‘A,’ ‘9,’ ‘M,’ ‘R,’ and ‘7,’ and reveals those selected portions to the user. In response, the Automated Turing Test module receives a user response of ‘SA9MR7’ from the user when the user selects the ‘Submit’ button rendered on the web browser GUI (201) in the example of FIG. 6H. The Automated Turing Test module then determines whether the user response matches the challenge key specified by the predetermined selection criteria and authorizes the user to access a resource if the user response matches the challenge key.
Exemplary embodiments of the present invention are described largely in the context of a fully functional computer system for user authorization using an automated Turing Test. Readers of skill in the art will recognize, however, that the present invention also may be embodied in a computer program product disposed on a computer readable media for use with any suitable data processing system. Such computer readable media may be transmission media or recordable media for machine-readable information, including magnetic media, optical media, or other suitable media. Examples of recordable media include magnetic disks in hard drives or diskettes, compact disks for optical drives, magnetic tape, and others as will occur to those of skill in the art. Examples of transmission media include telephone networks for voice communications and digital data communications networks such as, for example, Ethernets™ and networks that communicate with the Internet Protocol and the World Wide Web as well as wireless transmission media such as, for example, networks implemented according to the IEEE 802.11 family of specifications. Persons skilled in the art will immediately recognize that any computer system having suitable programming means will be capable of executing the steps of the method of the invention as embodied in a program product. Persons skilled in the art will recognize immediately that, although some of the exemplary embodiments described in this specification are oriented to software installed and executing on computer hardware, nevertheless, alternative embodiments implemented as firmware or as hardware are well within the scope of the present invention.
It will be understood from the foregoing description that modifications and changes may be made in various embodiments of the present invention without departing from its true spirit. The descriptions in this specification are for purposes of illustration only and are not to be construed in a limiting sense. The scope of the present invention is limited only by the language of the following claims.
Foreman, Paul E.
| Patent |
Priority |
Assignee |
Title |
| 10007776, |
May 05 2017 |
MASTERCARD TECHNOLOGIES CANADA ULC |
Systems and methods for distinguishing among human users and software robots |
| 10127373, |
May 05 2017 |
MASTERCARD TECHNOLOGIES CANADA ULC |
Systems and methods for distinguishing among human users and software robots |
| 10791222, |
Jun 21 2018 |
WELLS FARGO BANK, N A |
Voice captcha and real-time monitoring for contact centers |
| 10839065, |
Apr 01 2008 |
MASTERCARD TECHNOLOGIES CANADA ULC |
Systems and methods for assessing security risk |
| 10997284, |
Apr 01 2008 |
MASTERCARD TECHNOLOGIES CANADA ULC |
Systems and methods for assessing security risk |
| 11036847, |
Apr 01 2008 |
MASTERCARD TECHNOLOGIES CANADA ULC |
Systems and methods for assessing security risk |
| 11445065, |
Jun 21 2018 |
Wells Fargo Bank, N.A. |
Voice captcha and real-time monitoring for contact centers |
| 9990487, |
May 05 2017 |
MASTERCARD TECHNOLOGIES CANADA ULC |
Systems and methods for distinguishing among human users and software robots |
| Patent |
Priority |
Assignee |
Title |
| 3873769, |
|
|
|
| 4393410, |
Nov 13 1981 |
OPTIGRAPHICS CORPORATION C O ELLSWORTH, CORBETT, SEITMAN & MCLEOD, 530 B STREET, SUITE 2150 SAN DIEGO, CALIFORNIA 92101 A CORP OF CA |
Multiple camera automatic digitizer and method |
| 4577058, |
Apr 22 1983 |
|
Current-ratio digitizers |
| 4771336, |
Nov 11 1986 |
Dainippon Screen Mfg. Co., Ltd. |
Device for setting trimming areas of an original |
| 5574577, |
Apr 11 1994 |
BLACK & VEATCH L L P |
Method and apparatus for digitally archiving analog images |
| 5630168, |
Oct 27 1992 |
VADEM |
System for utilizing object oriented approach in a portable pen-based data acquisition system by passing digitized data by data type to hierarchically arranged program objects |
| 5838326, |
Sep 26 1996 |
TRIDIM INNOVATIONS LLC |
System for moving document objects in a 3-D workspace |
| 6014662, |
Nov 26 1997 |
International Business Machines Corporation |
Configurable briefing presentations of search results on a graphical interface |
| 6561678, |
Feb 05 2001 |
|
Variable focus indirect lighting fixture |
| 6571279, |
Dec 05 1997 |
Fred Herz Patents, LLC |
Location enhanced information delivery system |
| 6581104, |
Oct 01 1996 |
ServiceNow, Inc |
Load balancing in a distributed computer enterprise environment |
| 6636831, |
Apr 09 1999 |
INROAD, INC |
System and process for voice-controlled information retrieval |
| 6806636, |
Jun 15 2001 |
MERIDIAN SOLAR & DISPLAY CO , LTD |
Flat CRT with improved coating |
| 6839669, |
Nov 05 1998 |
Nuance Communications, Inc |
Performing actions identified in recognized speech |
| 6850252, |
Oct 05 1999 |
Blanding Hovenweep, LLC; HOFFBERG FAMILY TRUST 1 |
Intelligent electronic appliance system and method |
| 6970821, |
Sep 26 2000 |
Wilmington Trust, National Association, as Administrative Agent |
Method of creating scripts by translating agent/customer conversations |
| 6982649, |
May 04 1999 |
COLLIN PEEL |
Floor display system with interactive features |
| 6999932, |
Oct 10 2000 |
Intel Corporation |
Language independent voice-based search system |
| 7035804, |
Apr 04 2001 |
COURTROOM CONNECT |
Systems and methods for automated audio transcription, translation, and transfer |
| 7174056, |
May 25 1999 |
Silverbrook Research Pty LTD |
Providing information in a document |
| 7209124, |
Aug 08 2002 |
HEWLETT-PACKARD DEVELOPMENT COMPANY, L P |
Multiple-position docking station for a tablet personal computer |
| 7830408, |
Dec 21 2005 |
Cisco Technology, Inc. |
Conference captioning |
| 20020191072, |
|
|
|
| 20030066073, |
|
|
|
| 20030160862, |
|
|
|
| 20040019482, |
|
|
|
| 20040051644, |
|
|
|
| 20040199597, |
|
|
|
| 20040201871, |
|
|
|
| 20040237033, |
|
|
|
| 20050110964, |
|
|
|
| 20050149364, |
|
|
|
| 20050154595, |
|
|
|
| 20050182680, |
|
|
|
| 20050183023, |
|
|
|
| 20060001650, |
|
|
|
| 20060036944, |
|
|
|
| 20060073891, |
|
|
|
| 20060117669, |
|
|
|
| 20060126128, |
|
|
|
| 20060132501, |
|
|
|
| 20060146034, |
|
|
|
| 20060176524, |
|
|
|
| 20060203208, |
|
|
|
| 20060204030, |
|
|
|
| 20060267966, |
|
|
|
| 20060287963, |
|
|
|
| 20070005500, |
|
|
|
| 20070026372, |
|
|
|
| 20070055929, |
|
|
|
| 20070083666, |
|
|
|
| 20070130618, |
|
|
|
| 20070143103, |
|
|
|
| 20070143624, |
|
|
|
| 20070143690, |
|
|
|
| 20070156811, |
|
|
|
| 20070201745, |
|
|
|
| 20070220444, |
|
|
|
| 20070277224, |
|
|
|
| 20080028321, |
|
|
|
| 20080066014, |
|
|
|
| 20080088593, |
|
|
|
| 20080122803, |
|
|
|
| 20080127302, |
|
|
|
| 20080168403, |
|
|
|
| 20080192059, |
|
|
|
| 20080270230, |
|
|
|
| 20090002327, |
|
|
|
| 20090113294, |
|
|
|
| 20090138723, |
|
|
|
| 20090150983, |
|
|
|
| 20090328163, |
|
|
|
| 20100031315, |
|
|
|
| EP450196, |
|
|
|
| EP543566, |
|
|
|
| EP1315071, |
|
|
|
| EP1621989, |
|
|
|
| JP2000148396, |
|
|
|
| WO101391, |
|
|
|
| WO3036415, |
|
|
|
| Date |
Maintenance Fee Events |
| Jul 22 2019 | REM: Maintenance Fee Reminder Mailed. |
| Jan 06 2020 | EXP: Patent Expired for Failure to Pay Maintenance Fees. |
| Date |
Maintenance Schedule |
| Dec 01 2018 | 4 years fee payment window open |
| Jun 01 2019 | 6 months grace period start (w surcharge) |
| Dec 01 2019 | patent expiry (for year 4) |
| Dec 01 2021 | 2 years to revive unintentionally abandoned end. (for year 4) |
| Dec 01 2022 | 8 years fee payment window open |
| Jun 01 2023 | 6 months grace period start (w surcharge) |
| Dec 01 2023 | patent expiry (for year 8) |
| Dec 01 2025 | 2 years to revive unintentionally abandoned end. (for year 8) |
| Dec 01 2026 | 12 years fee payment window open |
| Jun 01 2027 | 6 months grace period start (w surcharge) |
| Dec 01 2027 | patent expiry (for year 12) |
| Dec 01 2029 | 2 years to revive unintentionally abandoned end. (for year 12) |