The invention relates generally to systems and methods for providing encryption and decryption, including authentication, for transactions to be conducted on the Internet, or other networks, and to user interfaces adapted for use in such systems and methods.
The growth in the volume of online transactions conducted by businesses and individuals over the Internet has been staggering. Sensitive, private identity information is typically used for authenticating a user for conducting online transactions. The increased use of identity information for Internet transactions has been accompanied by an increased danger of interception and theft of that information. Identity theft occurs when someone uses the password, username, Social Security number, credit card number, or other identifying personal information of another without consent, to commit fraud. According to a September 2003 Federal Trade Commission (FTC) survey, 27.3 million Americans have been victims of identity theft in a recent five-year period, including 9.9 million people in the year 2002 alone. Identity theft losses to businesses and financial institutions in 2002 totaled nearly $48 billion and consumer victims reported $5 billion in out-of-pocket expenses, according to the FTC survey.
One form of identity theft is perpetrated using a social engineering attack known as “phishing”. Phishing is defined according to the Internet encyclopedia Wikipedia as the fraudulent acquisition, through deception, of sensitive personal information such as passwords and credit card details, by masquerading as someone trustworthy with a real need for such information. Phishing fraud schemes typically use a masquerade website to generate email messages made to appear as originating as requests for necessary information from a trusted service provider, e.g., a bank or a merchant. The phishing email messages typically contain links to websites that also appear to belong to the service provider, but, in fact, are used by the “phishers”. The masquerade web site attempts to deceive users into giving up their password or other sensitive personal information.
Another form of identity theft is perpetrated using an attack known as “pharming”. In this type of attack, software solely intended for purposes of crime misdirects innocent users to fraudulent sites or proxy servers, typically through DNS hijacking or poisoning. Pharming is the exploitation of a DNS server software vulnerability that allows a hacker to acquire the Domain Name for a site, and to cause traffic directed to that web site to be redirected to another web site. DNS servers are the machines responsible for resolving Internet names into their real addresses; they function as the “signposts” of the Internet. If the web site receiving the redirected traffic is a fake web site, such as a copy of a bank's website, it can be used to “phish” or steal a computer user's passwords, PIN number, account number and/or other confidential information.
Various other fraudulent means to acquire confidential information entered by a user are known. For example, espionage software including keyboard loggers, mouse click loggers, and screen capture loggers are well-known and used for this purpose. Also, other types of espionage software, such as snoopware, spyware, non-viral malware, hackers utility, surveillance utility and Trojans are well known. As another example, “evil twin” attacks are becoming common. An evil twin is a home-made wireless access point, also known as a “hot spot” that masquerades as a legitimate one to gather personal or corporate information without the end user's knowledge. The attacker positions himself in the vicinity of the access point and lets his computer discover what name and radio frequency the legitimate access point uses. He then sends out his own radio signal on that frequency using the same name. For the purpose of the present invention, espionage software is any software program that aids in the unauthorized acquisition of information, such as information about a person or organization. Espionage software is also typically hidden from the user. Espionage software typically installs itself on a user's computer without consent and then monitors or controls the use of the device. Every user keystroke, all chat conversations, all websites visited, every user interaction with a browser, every application executed, every document printed and all text and images might be captured by the espionage software. Espionage software typically is capable of locally saving, and/or transmitting the captured data to third parties over the Internet, most often without the user's knowledge or consent. The keyboard loggers and mouse click loggers might also take the form of hardware connected between the keyboard/mouse cable and the computer or the hardware inside the keyboard/mouse device.
Another acquirer of confidential, sensitive personal information who uses it for fraud is known as an “over-the-shoulder” spy. This spy surreptitiously reads a user's display to acquire the information, such as alphanumeric or other forms of information. For example, conventional graphical user interfaces that use keypad and/or keyboard images for user data entry are vulnerable also to mouse click loggers, screen capture loggers and other schemes. Each alphanumeric character in the graphical interface is represented by a unique graphical image, e.g., the pixels comprising the number 1. Screen capture loggers utilize optical character recognition (OCR) technology to decipher the mouse clicks and corresponding alphanumeric graphic in order to ascertain the actual alphanumeric text characters of a user's ID and password. Sophisticated screen capture loggers also have the capability to utilize checksum and size characteristics of the graphic images in order to ascertain which identifier alphanumeric character corresponds to each graphic image selected by a user's mouse click during data entry. In these ways, the screen capture loggers may acquire the personal information even when the graphical user interface has rearranged the order of alphanumeric characters on the keypad or keyboard.
Known anti-virus and anti-spyware software products attempt to enable a user to protect against some identity thieves. However, these products are not capable of providing a secure defense to theft because they are inherently reactive. As such they all depend on a signature that is reproducible. They must be updated constantly and are useful only to the extent that they have been updated. They are always vulnerable to a new virus or form of attack. Thus, the use of outdated anti-virus and anti-spyware files provides minimal protection, at best, for defense of computer data against outside threats. Consequently, a drawback of these products is that the information used by the anti-virus and anti-spyware program must be constantly updated to reflect newly discovered schemes. In addition to keeping the virus information current, the system must be periodically scanned for potential infections.
Firewall software provides an additional line of defense available to a user. Firewall software is installed on the user's computer (personal or corporate Firewall) to alert a user if a program in the user's computer is accessing the network without the user's knowledge or assent. However, if a Trojan compromises an authorized program and port, then the Firewall allows the Trojan to transmit data through the port.
Transmission Control Protocol/Internet Protocol (TCP/IP) is the basic communication protocol of the Internet and some private networks. Hyper Text Transfer Protocol Secure (HTTPS) is a secure Internet communication protocol based on TCP/IP and which uses a Secure Socket Layer (SSL) protocol to allow secure data transfer using encrypted data streams. The primary purpose of HTTPS is to fetch hypertext objects from remote hosts, e.g., web pages, in a secure way. The SSL protocol allows clients, including web browsers and HTTP servers, to communicate over a secure connection. SSL offers encryption, source authentication, and data integrity as a means for protecting information exchanged over insecure, public networks. Many E-commerce applications use these protocols for securing transmissions between the server and the Internet.
Another drawback of known systems is their dependency, to a varying degree, upon a human to maintain their state of security. As described above, a user's information and/or system can be compromised despite taking security precautions. Other known methods to address identity theft include requiring a user to use a “token” or to keep a digital certificate on the user's system for use in authentication during a login process. A token is typically a credit card or key fob-sized authentication device required in order to access a service provider's system. The token usually displays numbers that change over time and synchronizes with an authentication server on the network. The token may also use a challenge/response scheme with the server. This method requires the user to have the token and enter information from the token for authentication in addition to a password and/or personal identification number (PIN). A problem with tokens is that the user must keep the token secure in addition to keeping the required password and/or pin secure. Also, customer support costs associated with lost or damaged tokens create additional problems. What is therefore also needed is a system and method for preventing identity theft that does not require costly hardware devices to be created and maintained in order to provide security for confidential information.
The systems and methods according to the present invention overcome the drawbacks of known systems and methods by providing user interfaces capable of encrypting user authentication credentials at the point of entry of data into the user's computer, as well as providing for encryption and decryption on computer implemented networks of virtually any data that may be represented by symbols such as alphanumeric, other symbols typically provided by word processing or other software and any other symbols capable of processed on or over such networks.
An advantage of the systems and methods according to the present invention is that they provide for encryption of user authentication credentials at the point of entry, thereby preventing the information from existing in a raw form anywhere within the user's computer, and thus preventing the information from vulnerability to interception within the user's computer and to subsequent fraudulent use.
Another advantage is that these systems and methods do not depend on tokens, cards and other similar hardware devices, digital certificates, anti-virus software, or personal firewall solutions for protecting end users against online identity theft.
Broadly stated, the present invention provides methods, systems and interfaces for data encryption at the point of entry into a client computer and decryption at a remote, legitimate server. Preferably the data is identification data used to authenticate the user, wherein a correct authentication identifier for that user is created and stored at a remote server. The authentication identifier is a predetermined number of elements, characters or symbols arranged in a predetermined sequence and/or in a predetermined spatial, numerical or other relationship. One encryption method and system includes choosing a base graphic image, generating base encrypted key data values, randomly assigning key values to graphic attributes by any one or more of randomly and finitely displacing the graphic interface on the x axis and y axis, randomly distorting the graphic interface, randomly distorting the file size of the graphic interface and/or randomly distorting the check sum of the graphic interface. Decryption for that method and system in general includes a user clicking a key on the graphic keypad or keyboard, sending pre-assigned encrypted key data values for alphanumeric interfaces and displacement values for dynamic interfaces, and then looking up corresponding key data values from corresponding encrypted data. Another inventive system and method includes a computer implemented system for providing encryption of a user identifiers at a point of entry of the identifier into a user computer in communication with a computer network and decryption of the identifier at a server located in a remote location on the network using a graphical wheel interface consisting of two pre-defined regions on the computer display where the user identifier, including more than one alphanumeric elements selected from a set of predetermined alphanumeric characters arranged in a sequence in the first region. The second region includes a set of elements or identifiers which are referred to as markers, preferably one marker per sector and preferably a non alphanumeric character. This second region is then displaced by the end user to match its position to each of the expected identifier, in sequence, in the first region by picking a known pre-determined marker from a set of pre-determined markers and entering the chosen marker into the system. The set of pre-determined markers are randomized after each time the user enters an identifier element. By knowing the displacement and the user identifiers the server can then reverse engineer the actions taken by the user to identify the chosen marker and subsequently correlate the user entered identifiers with the pre-determined identifiers to thus authenticate the user.
the server adapted to initially determine a user selected marker associated with the first user selected sector by correlating the displacement with a first element of the user identifier.
These and other embodiments, features, aspects, and advantages of the invention will become better understood with regard to the following description, appended claims and accompanying drawings.
The foregoing aspects and features of the present invention, as well as its attendant advantages will become more readily appreciated by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein:
Reference symbols or names are used in the Figures to indicate certain components, aspects or features shown therein. Reference symbols common to more than one Figure indicate like components, aspects or features shown therein.
In accordance with embodiments of the present invention encryption and decryption of information or data, such as user authentication information, and/or data that is representative of other information, for transactions on the Internet or other networks not later than at the point of entry of the information into the user's computer is achieved by a real time process of image processing and/or by creating images ahead of time to be used randomly in real time and with no set sequence so as make data entry through the interface virtually unpredictable and therefore virtually immune to any illegitimate attempt to decode the image. Thus, the information or data is not vulnerable to theft on any such network. With reference to
The distortion enables a human user to readily identify numbers or other symbols in the image, but prevents a screen capturer/OCR and x-y coordinate logger from linking mouse, or other pointing device clicks to a specific key of the interface. While
As is also readily apparent, this type of embodiment is not limited to use with a keypad. Rather, a keyboard or other type of interface may be used. Also, in this and other types of interface embodiments discussed (but not shown) herein, the X-axis and/or Y-axis may be displaced a minor amount within the computer screen. Such a displacement provides additional difficulties for data logger type software to accurately capture the data shown on the screen that is readily understood by the user and the legitimate server to which the user's computer is connected via the network. Referring to
The displacements, background changes, jitters and distortions of the computer screen images used in the present invention and as described herein can be generated by conventional programming techniques. These displacements, background changers, jitters and distortions are effective to change the spatial relationship of the image of input data as it appears on the user's screen in comparison to what the user and the legitimate server know how the image of that data would appear on a conventional image display. Theses spatial relationship changes are preferably small, i.e., all kept to be within the main window, and are preferably made to be random, as will be described. As such, these spatial relationship changes are sufficiently cryptic to deter computer programs from decoding the encrypted data.
With reference to
Referring to
With respect to the file size and check sum types of encryption illustrated in
Preferably, a three-step process is used to create the secure, unique keyboard graphical authentication interfaces of the types illustrated in
As seen in
The sequencing of the image symbols and marker symbols, normally hosted by the server in a database, are sent over the network in an array form to the GUI to be displayed. The server also may be programmed to apply any of the other forms of encryption, as previously described, on the symbol images before sending them through the network. It is preferable that the sequencing of the marker symbols be randomized each time an element of the code is entered into the system, and this can be done through conventional techniques. While the sequencing of the identifier elements could also be randomized, it is preferable for most applications that they not be randomized during each session.
As another embodiment, not illustrated, the set of symbols for the markers and/or the data elements could be personalized, or made unique and be based on user preferences or set by the service provider. This uniqueness further ensures that the correct authentication device/GUI is being used by the user. This optional feature virtually eliminates the possibility that an identical, illegitimate or masquerade GUI is sent to the end user by for entry of his or her credentials, authentication data or other code. In one preferred implementation, the displacements on the GUI made by user interactions are calculated or determined by shifting the index of the marker array with respect to the identifier array. The resultant displacement values of each marker index for each element are then sent over the network to the server. With the server having been programmed to know the correct code, it can then use the displacement corresponding to entry of the first element of the identifier to determine which marker the user has chosen for that session. The server can then authenticate each subsequent element by verifying that the subsequent displacements correspond only to the displacement of the marker chosen by the user for that session.
Optionally, an ‘ENTER’ button, as seen in
Also with respect to the type of encryption/decryption illustrated in
In accordance with preferred embodiments of the type as shown in
Values representative of the displacement associated with the entry of each element of an identifier, as discussed above is sent to, and decoded by the server. Because the server knows the correct elements and possible marker behaviors for any specific marker picked by the user for the specific authentication information, as well as the image details, such as “jitter”, file size, check sum, distortion, shift and combinations of such type of image details the server deduces the marker element based on expected logic. In such applications, the block diagram chart of
The logic for the wheel type process is that the server, knowing the first letter of the expected identifier looks for the marker the user chose to input the first identifier element. Then the server also knows the likely marker to be used for that session. For the second, and each subsequent input of the identifiers, the server identifies and verifies that the same and correct marker is used. Thus, the system is able to determine if the user has entered the correct authentication identifier for the session. The displacement coordinates are session-specific and unusable once the session ends. As may be appreciated, such encryption and decryption always uses displacement information that is unique, randomly generated at the point of entry into the system and virtually theft-proof.
With respect to an example of the creation of multiple sets of randomized markers for each session, the
As an example of entry of an element of an identifier and with reference to
As also shown in
Preferably, an ‘ENTER’ button is provided for the user to actuate to indicate that the last element of the identifier has been input. Alternatively, the ‘ENTER’ button need not be used where it is not needed, e.g., where the identifier is of a predetermined, fixed length.
According to an alternate embodiment, the inner and outer wheels, and the sectors may be interchangeable. In other words, the markers may be placed on and selectable from a sector of the outer wheel, and the inner wheel would include the identifier elements. In other alternate embodiments, the outer wheel may be made rotatable.
In the
A ‘RESET’ button 234 is preferably provided to enable a user to restart entry of the username, password or other identifier or code. A similar reset capability may also be used with other embodiments, such as with that shown, but not numbered in
According to an alternate embodiment, the rows shown in
Alternatively, the elements and/or markers on the wheel of
The user interfaces in
Each of the graphical interfaces shown in the above figures are preferably generated and sent to the user device using conventional software known to one of ordinary skill in the art, e.g., MACROMEDIA FLASH brand software or JAVA brand software or using SVG standards. In a preferred embodiment, FLASH software is used for generating the graphical interfaces.
Although specific embodiments of the invention have been described, various modifications, alterations, alternative constructions, and equivalents are also encompassed within the scope of the invention.
The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense. It will, however, be evident that additions, subtractions, deletions, and other modifications and changes may be made thereunto without departing from the broader spirit and scope of the invention as set forth in the claims.
With reference to
As an example of the code that could be used for the type of mappings used in the embodiments of
The present application is a divisional application of U.S. application Ser. No. 11/318,424, filed Dec. 22, 2005, which is a continuation of U.S. application Ser. No. 11/169,564, filed Jun. 29, 2005, now U.S. Pat. No. 7,616,764, issued Nov. 10, 2009, which claims the benefit under 35 U.S.C. 119(e) of U.S. Provisional Application No. 60/585,818, filed Jul. 7, 2004, the entire contents of which are incorporated herein by reference for all purposes. A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
Number | Name | Date | Kind |
---|---|---|---|
D95205 | Harrison | Apr 1935 | S |
D298837 | Thomas | Dec 1988 | S |
5416895 | Anderson et al. | May 1995 | A |
5428349 | Baker | Jun 1995 | A |
5452413 | Blades | Sep 1995 | A |
5555365 | Selby et al. | Sep 1996 | A |
5559961 | Blonder | Sep 1996 | A |
5572644 | Liaw et al. | Nov 1996 | A |
5577125 | Salahshour et al. | Nov 1996 | A |
5604854 | Glassey | Feb 1997 | A |
5623591 | Cseri | Apr 1997 | A |
5664099 | Ozzie et al. | Sep 1997 | A |
5798760 | Vayda et al. | Aug 1998 | A |
D400195 | Utesch | Oct 1998 | S |
5821933 | Keller et al. | Oct 1998 | A |
5875296 | Shi et al. | Feb 1999 | A |
5928364 | Yamamoto | Jul 1999 | A |
5949348 | Kapp et al. | Sep 1999 | A |
5966127 | Yajima | Oct 1999 | A |
D419907 | Vogelbruch | Feb 2000 | S |
6023506 | Ote et al. | Feb 2000 | A |
6064972 | Jankowitz et al. | May 2000 | A |
6111984 | Fukasawa | Aug 2000 | A |
6209102 | Hoover | Mar 2001 | B1 |
6209104 | Jalili | Mar 2001 | B1 |
6240183 | Marchant | May 2001 | B1 |
6253326 | Lincke et al. | Jun 2001 | B1 |
6263447 | French et al. | Jul 2001 | B1 |
6282551 | Anderson et al. | Aug 2001 | B1 |
6343361 | Nendell et al. | Jan 2002 | B1 |
6369839 | Peterson | Apr 2002 | B1 |
6448987 | Easty et al. | Sep 2002 | B1 |
6658574 | Anvekar | Dec 2003 | B1 |
6718471 | Kashima | Apr 2004 | B1 |
6720860 | Narayanaswami | Apr 2004 | B1 |
6725422 | Bauchot et al. | Apr 2004 | B1 |
6741268 | Hayakawa | May 2004 | B1 |
D492691 | Kortis | Jul 2004 | S |
D493471 | McIntosh | Jul 2004 | S |
6853973 | Mathews et al. | Feb 2005 | B2 |
D505135 | Sapp et al. | May 2005 | S |
6895502 | Fraser | May 2005 | B1 |
6895558 | Loveland | May 2005 | B1 |
6934860 | Goldstein | Aug 2005 | B1 |
6972363 | Georges et al. | Dec 2005 | B2 |
7007298 | Shinzaki et al. | Feb 2006 | B1 |
7036091 | Nguyen | Apr 2006 | B1 |
7054819 | Loveland | May 2006 | B1 |
7082227 | Baum et al. | Jul 2006 | B1 |
7100049 | Gasparini et al. | Aug 2006 | B2 |
7137008 | Hamid et al. | Nov 2006 | B1 |
D539809 | Totten et al. | Apr 2007 | S |
7200747 | Riedel et al. | Apr 2007 | B2 |
7219368 | Juels et al. | May 2007 | B2 |
7237264 | Graham et al. | Jun 2007 | B1 |
7240367 | Park | Jul 2007 | B2 |
7437024 | Baum et al. | Oct 2008 | B2 |
7523067 | Nakajima | Apr 2009 | B1 |
7586635 | Maeda et al. | Sep 2009 | B2 |
7596701 | Varghese | Sep 2009 | B2 |
7616764 | Varghese | Nov 2009 | B2 |
7822990 | Varghese et al. | Oct 2010 | B2 |
20010027529 | Sasabe et al. | Oct 2001 | A1 |
20020013905 | Hamada | Jan 2002 | A1 |
20020029341 | Juels et al. | Mar 2002 | A1 |
20020049614 | Rice et al. | Apr 2002 | A1 |
20020087894 | Foley et al. | Jul 2002 | A1 |
20020122031 | Maglio et al. | Sep 2002 | A1 |
20020188872 | Willeby | Dec 2002 | A1 |
20030005329 | Ikonen | Jan 2003 | A1 |
20030018558 | Heffner et al. | Jan 2003 | A1 |
20030097593 | Sawa et al. | May 2003 | A1 |
20030159050 | Gantman et al. | Aug 2003 | A1 |
20030182558 | Lazzaro et al. | Sep 2003 | A1 |
20030210127 | Anderson | Nov 2003 | A1 |
20040010721 | Kirovski et al. | Jan 2004 | A1 |
20040030933 | Park | Feb 2004 | A1 |
20040030934 | Mizoguchi et al. | Feb 2004 | A1 |
20040034801 | Jaeger | Feb 2004 | A1 |
20040059951 | Pinkas et al. | Mar 2004 | A1 |
20040073809 | Wing Keong | Apr 2004 | A1 |
20040083389 | Yoshida | Apr 2004 | A1 |
20040117320 | Morioka et al. | Jun 2004 | A1 |
20040128534 | Walker | Jul 2004 | A1 |
20040153660 | Gaither et al. | Aug 2004 | A1 |
20040168083 | Gasparini et al. | Aug 2004 | A1 |
20040215980 | Hamid | Oct 2004 | A1 |
20040221163 | Jorgensen | Nov 2004 | A1 |
20040230843 | Jansen | Nov 2004 | A1 |
20040250138 | Schneider | Dec 2004 | A1 |
20050010768 | Light et al. | Jan 2005 | A1 |
20050015601 | Tabi | Jan 2005 | A1 |
20050044425 | Hypponen | Feb 2005 | A1 |
20050097320 | Golan et al. | May 2005 | A1 |
20050097339 | Wiley et al. | May 2005 | A1 |
20050144451 | Voice et al. | Jun 2005 | A1 |
20050193208 | Charrette et al. | Sep 2005 | A1 |
20050204131 | Kovarik | Sep 2005 | A1 |
20050204145 | Makishima | Sep 2005 | A1 |
20050251752 | Tan et al. | Nov 2005 | A1 |
20050278542 | Pierson et al. | Dec 2005 | A1 |
20050278647 | Leavitt et al. | Dec 2005 | A1 |
20060011045 | Yamashita et al. | Jan 2006 | A1 |
20060212829 | Yahiro et al. | Sep 2006 | A1 |
20060282660 | Varghese et al. | Dec 2006 | A1 |
20060288225 | Jung et al. | Dec 2006 | A1 |
20070028111 | Covely | Feb 2007 | A1 |
20070036314 | Kloberdans et al. | Feb 2007 | A1 |
20070097351 | York et al. | May 2007 | A1 |
20070165849 | Varghese et al. | Jul 2007 | A1 |
20070169190 | Kolton et al. | Jul 2007 | A1 |
20070211925 | Aoki et al. | Sep 2007 | A1 |
20080209526 | Varghese et al. | Aug 2008 | A1 |
20090089869 | Varghese et al. | Apr 2009 | A1 |
Number | Date | Country |
---|---|---|
1 615 181 | Jan 2006 | EP |
2 313 460 | May 1997 | GB |
2002-222172 | Aug 2002 | JP |
2004-2588845 | Sep 2004 | JP |
WO 96-18139 | Jun 1996 | WO |
WO0118636 | Mar 2001 | WO |
WO0165375 | Sep 2001 | WO |
WO 0198912 | Dec 2001 | WO |
WO 2004027632 | Apr 2004 | WO |
WO 2004042550 | May 2004 | WO |
WO 2004-053674 | Jun 2004 | WO |
WO2005025292 | Mar 2005 | WO |
WO 2006-010058 | Jan 2006 | WO |
WO 2006-118968 | Nov 2006 | WO |
WO 2007-087352 | Aug 2007 | WO |
Entry |
---|
Birget et al., “The Graphical Passwords Project,” printed from website http://clam.rutgers.edu/˜birget/grPssw/, on Nov. 26, 2007; 2 pages. |
Echo System, Identita: The Powered Card™ Identity Provider, printed from website http://222.identita.com/sol—eco—sys.html, on Nov. 26, 2007; 2 pages. |
Identita Technologies Inc., “Audio Authentication Devices,” 2 pages. |
Frost & Sullivan, “Leading European Financial Institution Implements Voice Verification Biometrics to Enrich Customer Experience,” Jul. 2006; 13 pages. |
VoiceVault, VoiceVault™ World Leaders in Voice Verification, printed from website http://www.voicevault.com/ca.aspx on Nov. 13, 2007; 2 pages. |
VoiceVault, VoiceVault™ World Leaders in Voice Verification, “What is ‘two factor authentication’?,” printed from website http://www.voicevault.com/twofactor.aspx on Nov. 13, 2007; 2 pages. |
International Search Report and Written Opinion for corresponding International Application No. PCT/US2005/024376 mailed on Apr. 7, 2006, 7 pages. |
International Preliminary Report on Patentability for corresponding International Application No. PCT/US2005/024376 dated Apr. 13, 2007, 4 pages. |
International Search Report and Written Opinion for International Application No. PCT/US2007/01899 mailed on Feb. 14, 2008, 6 pages. |
International Search Report and Written Opinion for International Application No. PCT/US06/016085 mailed on Jul. 7, 2008, 12 pages. |
International Preliminary Report on Patentability for international Application No. PCT/US2006/016085 dated Aug. 28, 2008, 1 page. |
International Preliminary Report on Patentability for International Application No. PCT/US2007/01899 dated Jan. 2, 2009, 10 pages. |
Supplemental European Search Report for EP Application No. EP05773133 dated Nov. 5, 2010, 4 pages. |
Non-Final Office Action for U.S. Appl. No. 11/340,376 mailed on Jul. 27, 2007, 7 pages. |
Final Office Action for U.S. Appl. No. 11/340,376 mailed on Mar. 19, 2008, 8 pages. |
Advisory Action for U.S. Appl. No. 11/340,376 mailed on May 27, 2008, 3 pages. |
Non-Final Office Action for U.S. Appl. No. 11/340,376 mailed on Aug. 4, 2008, 5 pages. |
Non-Final Office Action for U.S. Appl. No. 11/412,997 mailed on Sep. 30, 2008, 23 pages. |
Non-Final Office Action for U.S. Appl. No. 11/169,564 mailed on Nov. 13, 2008, 7 pages. |
Non-Final Office Action for U.S. Appl. No. 11/318,414 mailed on Nov. 13, 2008, 6 pages. |
Non-Final Office Action for U.S. Appl. No. 11/318,424 mailed on Dec. 1, 2008, 12 pages. |
Non-Final Office Action for U.S. Appl. No. 11/340,376 mailed on Jan. 15, 2009, 9 pages. |
Non-Final Office Action for U.S. Appl. No. 11/318,414 mailed on Jan. 27, 2009, 7 pages. |
Non-Final Office Action for U.S. Appl. No. 11/412,997 mailed on Apr. 10, 2009, 30 pages. |
Notice of Allowance for U.S. Appl. No. 11/169,564 mailed on Jun. 1, 2009, 9 pages. |
Final Office Action for U.S. Appl. No. 11/318,424 mailed on Jun. 2, 2009, 12 pages. |
Notice of Allowance for U.S. Appl. No. 11/340,376 mailed on Jun. 12, 2009, 7 pages. |
Advisory Action for U.S. Appl. No. 11/318,424 mailed on Jul. 30, 2009, 3 pages. |
Non-Final Office Action for U.S. Appl. No. 11/318,424 mailed on Sep. 1, 2009, 12 pages. |
Non-Final Office Action for U.S. Appl. No. 11/412,997 mailed on Nov. 16, 2009, 19 pages. |
Final Office Action for U.S. Appl. No. 11/318,424 mailed on Mar. 10, 2010, 11 pages. |
Non-Final Office Action for U.S. Appl. No. 11/412,997 mailed on May 11, 2010, 21 pages. |
Advisory Action for U.S. Appl. No. 11/318,424 mailed on May 25, 2010, 3 pages. |
Notice of Allowance for U.S. Appl. No. 11/318,424 mailed on Jun. 16, 2010, 7 pages. |
Non-Final Office Action for U.S. Appl. No. 11/412,997 mailed on Sep. 13, 2010, 13 pages. |
Non-Final Office Action for U.S. Appl. No. 12/001,586 mailed on Oct. 26, 2010, 10 pages. |
Notice of Allowance for U.S. Appl. No. 11/412,997 mailed on Dec. 14, 2010, 6 pages. |
Non-Final Office Action for U.S. Appl. No. 12/001,586 mailed on Apr. 29, 2011, 8 pages. |
Final Office Action for U.S. Appl. No. 12/001,586 mailed on Oct. 27, 2011, 10 pages. |
Advisory Action for U.S. Appl. No. 12/001,586 mailed on Jan. 6, 2012, 3 pages. |
European Search Report for application EP06758687.5 (Mar. 14, 2012). |
European Search Report for application EP11169063.2 (Mar. 21, 2012). |
“ssh—OpenSSH SSH client (remote login program)” BSD General Commands Manual, from internet: http://unixhelp.ed.ac.uk/CGI/man-cgi?ssh+1 (Sep. 1999). |
Non-Final Office Action for U.S. Appl. No. 12/260,544, mailed on Jun. 7, 2012. |
Office Action from China Intellectual Property Office for application CN200780003321.5 (Jun. 18, 2012). |
European Patent Office (EPO) Communication for European application EP11169063.2 (Nov. 2, 2012). |
Final Office Action for U.S. Appl. No. 12/260,544 (Nov. 15, 2012). |
Non-Final Office Action for U.S. Appl. No. 12/001,586 (Oct. 26, 2012). |
European Examination Report for patent application EP5773133.3 (Apr. 10, 2012 ). |
European Examination Report for patent application EP7762565.5 (Jul. 6, 2012). |
“How to Set a Wallpaper on the Background of a Folder Window”, Microsoft Corporation, Document No. 879735, http://support.microsoft.com/kb/879735/ja (Dec. 27, 2004). |
Number | Date | Country | |
---|---|---|---|
20110055548 A1 | Mar 2011 | US |
Number | Date | Country | |
---|---|---|---|
60585818 | Jul 2004 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11318424 | Dec 2005 | US |
Child | 12882096 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11169564 | Jun 2005 | US |
Child | 11318424 | US |