Patent Grant
8307209
Not Applicable
Not Applicable
On a daily basis, most modern men interface with multiple electronic systems such as personal computers, personal digital media devices, cell phones, PDA, among others. Each electronic system has a different passwords requiring modern man to remember a multitude of information that can be easily lost or stolen. The amount of information modern man is required to remember increases substantially when one accounts for the passwords and/or usernames needed to use applications, including but not limited to web sites, which are run on the electronic systems.
Passwords are limited in length and content by what a user can remember. Additionally, conventional authentication systems are easily infiltrated because both the authentication code and password are stored within the system. Consequently, if a laptop, for example, is stolen, the data stored within is easily accessible.
Information relevant to attempts to address these problems can be found in Blom, U.S. Pat. No. 7,194,765; Yokota et. al., U.S. Pat. No. 7,155,607; Venters, III et. al., US Publication No. 2007/0256140; Prafullchandra et. al., US Publication No. 2007/0256143. However, each of these references suffers from one or more of the following disadvantages:
(a) does not provide a check for bogus websites which will replicate the identifier;
(b) passes passwords over a wire where it can be intercepted by unauthorized users; and
(c) passwords are limited in size and type.
The object of the current invention is to provide the user with an authentication method that is more secure than conventional authentication methods and can be used on personal computers, PDAs, cell phones, personal digital media devices, home and car lock and security systems, television/VCR/DVD remote controls, credit card authentication systems, automatic teller machine authentication systems, among others.
The present invention is directed to an universal authentication method that is more secure than conventional methods found on most electronic systems. The universal authentication method does not send passwords over hard wires or wireless systems. Consequently, it is difficult for would be password thief to intersect password data. It can provide a further layer of security by providing rotating security information.
The universal authentication method also provides security against a “man in the middle” type scam. Scammers will e-mail an unsuspecting internet user about problems with his bank account, for example, and request the user to rectify the problems providing a link to follow. The link takes the user to a websites that looks exactly like the bank's website. When the user enters his username and password to this bogus website, the information is passed on to the real bank website allowing the scammer access to the user's bank account. The universal authentication method provides web site authentication security by using the website name as an identifier and adding the IP address of the website as part of the encryption key. And, because users do not need to remember or generate passwords, the encryption key can be totally random in size and nature.
Other features and advantages of the present invention will become apparent in the following detailed descriptions of the preferred embodiment with reference to the accompanying drawings, of which:
The universal authentication method is a challenge-response method which does not require the user to generate or remember passwords. It may reside on the electronic system as an auxiliary application or reside on the hardware specific for the authentication method. The term electronic system(s) is used to describe systems such as personal computers, personal digital media devices, cell phones, PDAs, among others. The universal authentication method can be used for one and two way authentication. In the universal authentication method the challenger or requester can be either the user or the electronic system.
Because the human requester can remember only a limited number and type of symbols, usernames and passwords are limited in size and content. Conventional authentication methods also allow a would be thief easy access to passwords and usernames. Additionally, electronic systems that use the conventional authentication method usually store usernames and passwords within the electronic system. If, for example, an electronic system is stolen, a thief can, by using the numerous brute force programs available, determine the usernames and passwords to that particular electronic system as well as usernames and passwords that may be stored in the electronic system for other electronic system. Some electronic systems accept authentication data via internet protocol technology. This requires the user to pass along his username and password through cyberspace; a place where this information can be intercepted. The universal authentication method removes these barriers, among others, by removing the human user from the equation. The universal authentication method comprises methods for one-way authentication, two-way authentication, and two-way authentication which utilizes one time authentication keys.
If the decrypted character string matches the random character string sent in the initial request, the random character string from the requester is encrypted (7). The encrypted character string is passed back to the requester along with the authenticator's identifier (8). The requester uses the identifier to retrieve the encryption key for the authenticator and decrypts the encrypted string (9). If the decrypted character string matches the random character string sent in the initial request, both parties are authenticated (11).
If the decrypted character string matches the random character string sent in the initial request, the random character string from the requester is encrypted (7). The encrypted character string is passed back to the requester along with the authenticator's identifier (8). The requester uses the identifier to retrieve the encryption key for the authenticator and decrypts the encrypted string (9). If the decrypted character string matches the random character string sent in the initial request, both parties are authenticated (11).
A new random encryption key (eg. Key C) is then created and encrypted with the next encryption key in the rotation (eg. Key B) and sent to the authenticator (12). The new random encryption key (eg. Key C) is received and decrypted by the authenticator (13). Both the requester and authenticator replace the key use in the current authentication (eg. Key A) with the new encryption key (eg. Key C) (14).
The following is an example how the requested random encryption keys will cycle through the authentication process. Encryption Key A is used once and discarded. The next time through the authentication method the system will use Key B to encrypt and decrypt the random string, and used Key C to transmit the new Key D. The next time the system will use Key C and Key D. It is important to note that each encryption key is used only once. The number of keys held by the requester and authenticator can be predetermined. For example, if the predetermined number of keys is 5 and Keys A, B, C, D, E are the first set of authentication keys, then Keys B, C, D, E, F will be the second set of authentication Keys, Keys C, D, E, F, G will be the third set of authentication keys, etc.
In the two-way universal authentication method the universal authentication system can use either one or two encryption keys per authentication. When two encryption keys are used, one key is designated for incoming requests and another is designated for outgoing responses. If one time keys are to be used, both keys would be replaced after each authentication. Users of the universal authentication method can also request rotating encryption key(s); either a single encryption key or one encryption key for incoming requests and one encryption key for outgoing responses. For website authentication, the IP address of the requester and authenticator can be added as part of the encryption key(s) to prevent “man in the middle” scams.
In view of the above, it will be seen that various aspects and features of the invention are achieved and other results and advantages can be attained. While preferred embodiments of the invention have been shown and described, it will be obvious to those skilled in the art that changes and modification may be made therein without departing from the invention in its broader aspects.
This is a Continuation of application Ser. No. 11/956,559, filed on 14 Dec. 2007, now pending and hereby incorporates by reference, that application in its entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 6084969 | Wright et al. | Jul 2000 | A |
| 7155607 | Yokota et al. | Dec 2006 | B2 |
| 7194765 | Blom | Mar 2007 | B2 |
| 7194766 | Noehring | Mar 2007 | B2 |
| 7197640 | Meisel | Mar 2007 | B2 |
| 7353385 | Nakano et al. | Apr 2008 | B2 |
| 7373509 | Aissi et al. | May 2008 | B2 |
| 20020064279 | Uner | May 2002 | A1 |
| 20020174335 | Zhang et al. | Nov 2002 | A1 |
| 20030110399 | Rail | Jun 2003 | A1 |
| 20050114658 | Dye et al. | May 2005 | A1 |
| 20070067829 | Alrabady | Mar 2007 | A1 |
| 20070256140 | Venters, III et al. | Nov 2007 | A1 |
| 20070256143 | Prafullchandra et al. | Nov 2007 | A1 |
| 20080250481 | Beck et al. | Oct 2008 | A1 |
| 20100316219 | Boubion et al. | Dec 2010 | A1 |
| Number | Date | Country | |
|---|---|---|---|
| 20100005303 A1 | Jan 2010 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 11956559 | Dec 2007 | US |
| Child | 12561112 | US |
