Patent Grant
8065718
1. Field of the Invention
The present invention relates to the secure authentication of computer-interfaceable hardware tokens such as smartcards and USB tokens.
2. Description of the Related Art
In the last decade, the use of personal computers in both the home and in the office have become widespread. These computers provide a high level of functionality to many people at a moderate price, substantially surpassing the performance of the large mainframe computers of only a few decades ago. The trend is further evidenced by the increasing popularity of laptop and notebook computers, which provide high-performance computing power on a mobile basis.
The widespread availability of personal computers has had a profound impact on interpersonal communications as well. Only a decade ago, telephones or fax machines offered virtually the only media for rapid business communications. Today, a growing number of businesses and individuals communicate via electronic mail (e-mail). Personal computers have also been instrumental in the emergence of the Internet and its growing use as a medium of commerce.
While certainly beneficial, the growing use of computers in personal communications, commerce, and business has also given rise to a number of unique challenges.
While it reflects a tremendous advance over telephones and facsimile machines, e-mail also has its problems. One of these problems involves security. Telephone lines are relatively secure and a legally sanctioned way to engage in the private transmission of information, however, e-mails are generally sent over the Internet with no security whatsoever. Persons transmitting electronic messages must be assured that their messages are not opened or disclosed to unauthorized persons. Further, the addressee of the electronic message should be certain of the identity of the sender and that the message was not tampered with at some point during transmission.
Although the packet-switching nature of Internet communications helps to minimize the risk of intercepted communications, it would not be difficult for a determined interloper to obtain access to an unprotected e-mail message.
Many methods have been developed to secure the integrity of electronic messages during transmission. Simple encryption is the most common method of securing data. Both secret key encryption such as DES (Data Encryption Standard) and public key encryption methods that use both a public and a private key are implemented. Public and private key encryption methods allow users to send Internet and e-mail messages without concern that the message will be read by unauthorized persons or that its contents will be tampered with. However, key cryptographic methods do not protect the receiver of the message, because they do not allow the recipient to authenticate the validity of the public key or to validate the identity of the sender of the electronic message.
The use of digital certificates presents one solution to this problem. A digital certificate is a signed document attesting to the identity and public key of the person signing the message. Digital certificates allow the recipient to validate the authenticity of a public key. However, the typical user may use e-mail to communicate with hundreds of persons, and may use anyone of several computers to do so. Hence, a means for managing a number of digital certificates across several computer platforms is needed.
Internet commerce raises other challenges. Users seeking to purchase goods or services using the Internet must be assured that their credit card numbers and the like are safe from compromise. At the same time, vendors must be assured that services and goods are delivered only to those who have paid for them. In many cases, these goals are accomplished with the use of passwords. However, as Internet commerce becomes more commonplace, customers are finding themselves in a position where they must either decide to use a small number of passwords for all transactions, or face the daunting task of remembering multiple passwords. Using a small number of passwords for all transactions inherently compromises security, since the disclosure of any of the passwords may lead to a disclosure of the others. Even the use of a large number of passwords can lead to compromised security. Because customers commonly forget their password, many Internet vendors provide an option whereby the user can be reminded of their password by providing other personal information such as their birthplace, mother's maiden name, and/or social security number. This feature, while often necessary to promote Internet commerce, severely compromises the password by relying on “secret” information that is in fact, publicly available.
Even in cases where the user is willing and able to keep track of a large number of passwords, the password security technique is often compromised by the fact that the user is inclined to select a password that is relatively easy to remember. It is indeed rare that a user selects a truly random password. What is needed is a means for generating and managing random passwords that can be stored and recalled for use on a wide variety of computer platforms.
Smartcards and other hardware tokens provide some of the above-mentioned functionality, but to prevent the unauthorized use of such tokens and the compromise of the information stored therein, there is a need to authenticate such tokens to assure that the possessor of the token is in fact the person entitled to use the token to access the computer.
Typically, hardware tokens require the user to enter a password such as a personal identification number (PIN) before using the card. A token may be designed or configured to be used without a PIN, but that poses a security threat as anybody in possession of a token (whether by finding a lost token or by theft) could use the token without restriction, potentially compromising the data stored therein and possibly using the token to access other computer systems. What is needed is a system and method for securely authenticating hardware tokens. The present invention satisfies that need.
To address the requirements described above, the present invention discloses a method and apparatus for secure authentication of a hardware token. In one embodiment, the method comprises the steps of generating a host fingerprint F; transmitting the fingerprint to an authorizing device such as a server or a host computer, receiving a challenge R′ from the authorizing device, the challenge R′ derived at least in part from the fingerprint F and a random number R; receiving a response X from the hardware token, the response X generated at least in part from the challenge R′; and transmitting the response X to the authorizing device. In another embodiment, the method comprises the steps of retrieving a value X from a memory accessible to an authenticating entity, the value X generated from a fingerprint F of the host and an identifier P securing access to the token; generating the identifier P at least in part from the value X and the fingerprint F; and transmitting the identifier P to the token.
Referring now to the drawings in which like reference numbers represent corresponding parts throughout:
In the following description, reference is made to the accompanying drawings which form a part hereof, and which is shown, by way of illustration, several embodiments of the present invention. It is understood that other embodiments may be utilized and structural changes may be made without departing from the scope of the present invention.
Generally, the computer 102 operates under control of an operating system 108 stored in the memory 106, and interfaces with the user to accept inputs and commands and to present results through a graphical user interface (GUI) module 118A. Although the GUI module 118A is depicted as a separate module, the instructions performing the GUI functions can be resident or distributed in the operating system 108, the computer program 110, or implemented with special purpose memory and processors. The computer 102 also implements a compiler 112 which allows an application program 110 written in a programming language such as COBOL, C++, FORTRAN, or other language to be translated into processor 104 readable code. After completion, the application 110 accesses and manipulates data stored in the memory 106 of the computer 102 using the relationships and logic that are generated using the compiler 112. The computer 102 also comprises an input/output (I/O) port 130. The I/O port can be used to permit communications between the computer 102 and a hardware token 150. The hardware token can be a hardware key 150A such as the IKEY product available from RAINBOW TECHNOLOGIES, INC. or a smartcard 150B. In one embodiment, the I/O port 130 is a USB-compliant port implementing a USB-compliant interface, and the hardware key 150A plugs directly into the I/O port 130. In another embodiment, the I/O port is a serial or USB port, and the smartcard 150B interfaces with the port via a smartcard interface (I/F) device 152. Whether the hardware token 150 is a hardware key 150A or a smartcard 150B, the hardware token 150 comprises a processor 154 (e.g. hardware key processor 154A or smartcard processor 154B) communicatively coupled to a memory 156 (e.g. hardware key memory 156A or smartcard memory 156B). The memory 156 stores instructions commanding the processor to perform the operations described herein. Some or all of such operations may also be performed by hardware modules or software modules having special purpose soft/firmware instructions stored in auxiliary memories as well.
In one embodiment, instructions implementing the operating system 108, the computer program 110, and the compiler 112 are tangibly embodied in a computer-readable medium, e.g., data storage device 120, which could include one or more fixed or removable data storage devices, such as a zip drive, floppy disc drive 124, hard drive, CD-ROM drive, tape drive, etc. Further, the operating system 108 and the computer program 110 are comprised of instructions which, when read and executed by the computer 102, causes the computer 102 to perform the steps necessary to implement and/or use the present invention. Computer program 110 and/or operating instructions may also be tangibly embodied in memory 106 and/or data communications devices, thereby making a computer program product or article of manufacture according to the invention. As such, the terms “article of manufacture” and “computer program product” as used herein are intended to encompass a computer program accessible from any computer readable device or media.
The computer 102 may be communicatively coupled to a remote computer or server 134 via communication medium 132 such as a dial-up network, a wide area network (WAN), local area network (LAN), virtual private network (VPN) or the Internet. Program instructions for computer operation, including additional or alternative application programs can be loaded from the remote computer/server 134. In one embodiment, the computer 102 implements an Internet browser, allowing the user to access the world wide web (WWW) and other internet resources.
Those skilled in the art will recognize that many modifications may be made to this configuration without departing from the scope of the present invention. For example, those skilled in the art will recognize that any combination of the above components, or any number of different components, peripherals, and other devices, may be used with the present invention.
Information regarding the host computer 102 is collected. This information can include, for example, the computer processor 104 serial and/or model number(s), the hard drive serial and/or model number(s), MAC address of a network interface card (a unique serial number burned into Ethernet and Token Ring adapters that identifies that network card from all others); Basic Input Output System (BIOS) code area checksum; OS type and/or version, or the system directory create timestamp. This information is used to generate a byte string C. This can be accomplished, for example, by concatenating all or some of the collected information. This information is used to generate a host computer 102 fingerprint F, as shown in block 204. In one embodiment, the fingerprint F is simply the concatenation of all or some of the collected information. In another embodiment, the fingerprint F is a hash function (e.g. M5 or SHA-1) applied to the collected information, or F=HASH (C). For privacy reasons, it may be desirable to generate a fingerprint F that can only be used by a particular server (e.g. service provider) 134. In this case, a server specific value V may be provided by the server 134 and used to determine the fingerprint F. It is possible to use C+V as the computer fingerprint, however, this is not preferred because the value C+V may be quite lengthy, and would give out too much identifiable information about the computer 102 and/or the server 134. Hence, in the preferred embodiment, a hash function is applied to C+V, resulting in a fingerprint F=HASH(C+V). The fingerprint F is then transmitted to the server 134 where it is stored, as shown in blocks 206 and 208.
A secure means for transmitting information between the hardware token 150 and the server 134 is then established, as shown in blocks 210A and 210B. This can be accomplished by establishing a shared secret S between the server 134 and the token 150, and/or by a asymmetric key pair shared between the server 134 and the token 150. For example, the a private key Kpr may be generated and stored in the token 150 and a corresponding public key Kpu (e.g. in a certificate) be stored in the server 134.
In the authentication phase, a challenge R is generated, as shown in block 212. In one embodiment, the challenge is a random (or pseudorandom) value R. Turning to
The host computer-unique challenge R′ is transmitted to the hardware token 150. The hardware token 150 receives the challenge R′ and signs the challenge by generating a response X, as shown in block 216. If the token 150 and server 134 had established a secret S as the means for secure communications, the response X is generated using the shared secret, for example by determining a hash of the challenge and the shared secret, or X=HMAC(R′, S) or an analogous secure combination. If the token 150 and the server 134 established a asymmetric, private and public key pair for such communications, the token 150 signs the challenge R′ with its private key Kpr. The response X is then transmitted to the server 134, as shown in block 217. The server receives the response X, as shown in block 218. In block 219, the server 134 computes R′=HASH(F+R) from the stored fingerprint value F and the server-generated value of R.
If the received response X favorably compares to an expected response X′, the token is authenticated. One technique of determining if the received response compares favorably with the expected response X′ is to compare a regenerated version of R′ to the version of R′ that was signed by the token 150 and returned to the server 134 within the value X.
For example, since the server 134 shared either the secret S with the token 150 or received the public key of the token Kpu, the received value X can be processed to determine the received value R′ (e.g. by computing Y′=VERIFY(X, Kpu) or Y′=HMAC (R′+S)). Since the server 134 has access to the fingerprint F (it was stored in block 208) and because it generated the random challenge R, it can recall from memory or recompute the value for Y. If and only if the received value of R′ (obtained from the value X received from the hardware token 150) favorably compares to the recalled or recomputed value of R′, then the token 150 is authenticated. This is shown in blocks 219-222.
If additional security is desired (for example, to assure that the person in possession of the hardware token 150 is the intended possessor), it is possible to require user authentication before the token 150 generates the value X by signing the challenge R′ as described in block 214, or before the token 150 transmits the value X to the server 134. This authentication can be in the form of a PIN entered into the hardware token 150 either directly, or through an interfacing device such as a smartcard I/F device 152.
Using techniques analogous to those discussed above, a fingerprint F of the host computer 102 is computed, as shown in block 304. The fingerprint F can be a hash of any combination of the computer parameters C described above, and may also include a server-specific value V, which is transmitted from the server 134 to the host computer 102 in block 302.
In a first embodiment, the token 150 is intended to be used at only the particular host computer 102 that generated the fingerprint F. In this embodiment, the token's 150 PIN is set to the fingerprint value F. Since the fingerprint is usually longer (e.g. more characters) than that which is allowed for a PIN, the first or last set of digits of the fingerprint's decimal representation can be used for the PIN.
However, if is desirable to use the token 150 with multiple computers, a derivative of the computer 102 fingerprint F and the token's PIN may instead be stored in the host computer 102 memory. In this embodiment, a value X is computed at least in part from the fingerprint F and the token's current PIN, P. This value is transmitted to and stored in the host computer 102, as shown in blocks 306-310. Preferably, X is computed from the fingerprint F and the token's current PIN P using a reversible function ƒ. That is, X=ƒ(P, F), wherein ƒ(P, F) is a function such that ƒ(ƒ(P, F), F)=P. In the embodiment discussed above, the reversible function ƒ is an exclusive OR (“XOR”) function.
When the token 150 is to be authenticated, the host computer 102 re-computes the fingerprint F, and retrieves the value X received from the token, as shown in blocks 312 and 314. For security reasons, the fingerprint F is preferably not stored in the host computer 102. The value X can be associated with the token 150 in a number of ways, including, for example, storing the value X with the token's serial number (which can be used later to retrieve the value X for a particular token 150). The host computer 102 then computes the hardware token's PIN P from the received and stored value X and the host computer's fingerprint F, as shown in block 316. In the preferred embodiment in which the value X was computed with a reversible function ƒ, this can be accomplished by applying the function ƒ to the received value X and the fingerprint F. If the reversible function ƒ is the XOR function, this amounts to computing P=XXOR F. This computed PIN P is then transmitted to the hardware token 150, thus unlocking the token and making it available for use, as shown in block 318.
Turning first to
Although this may be accomplished by simply storing a table or a mapping relating F1, F2, . . . , Fn to X1, X2, . . . , Xn, for security reasons, it is preferable associate the values X1, X2, . . . , Xn with the values F1, F2, . . . , Fn without actually storing the values F1, F2, . . . , Fn in the token 150.
In one embodiment, this is accomplished by generating an index value H1, H2, . . . , Hn for each fingerprint F1, F2, . . . , Fn, and associably storing the X1, X2, . . . , X and H1, H2, . . . , Hn values. The H1, H2, . . . , Hn values may be a HASH of F1, F2, . . . , Fn as follows
In the embodiment illustrated in
Alternatively, the index values H1, H2, . . . , Hn can be computed as a slightly different HASH from the original host computer 102 information C1, for example, by combining (e.g. concatenating or hashing) the computer information C1 with a fixed string Z. In this embodiment, the index values Hi are computed by the host computer 102 and become Hi=HASH(Fi+Z).
Turning now to the authentication phase shown in
The host computer 102 receives the value X1 from the hardware token 150, and uses it to compute the PIN value P required to unlock the hardware token 150. In the illustrated embodiment, the PIN value P computed applying the reversible XOR function to the received value of X1 and the fingerprint F, as shown in block 422, and providing the PIN value P to the token 150 as shown in block 424. At this point, the token 150 can proceed with any further authentication procedures (e.g. user identification via biometric or password entry).
In cases where it is desirable to restrict the use of the token 150 to the host computer 102 as well as to a given person in possession of the token, a user password U can be incorporated into the above authentication technique. In the setup phase of this embodiment, the token prompts the user to select a password U which is different than the PIN of the token. This value of Xi described in
This concludes the description of the preferred embodiments of the present invention. The foregoing description of the preferred embodiment of the invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. For example, while the foregoing has been described with respect to an implementation with a host computer 102 and a server 134 performing particular functions, the present invention may also be practiced with a single entity (e.g. a host computer 102 or a server 134) performing all server 134 and host computer 102 related functions.
It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto. The above specification, examples and data provide a complete description of the manufacture and use of the composition of the invention. Since many embodiments of the invention can be made without departing from the spirit and scope of the invention, the invention resides in the claims hereinafter appended.
This application is a divisional of U.S. patent application Ser. No. 10/701,029, filed Nov. 4, 2003, entitled “SECURE AUTHENTICATION USING HARDWARE TOKEN AND COMPUTER FINGERPRINT,” which claims benefit of U.S. Provisional Patent Application No. 60/423,944, filed Nov. 5, 2002, both of which are hereby incorporated by reference herein. This application is also related to U.S. patent application Ser. No. 09/449,159, filed Nov. 24, 1999, by Shawn D. Abbott, Bahram Afghani, Mehdi Sotoodeh, Norman L. Denton III, and Calvin W. Long, and entitled “USB-COMPLIANT PERSONAL KEY WITH INTEGRAL INPUT AND OUTPUT DEVICES,” which is a continuation-in-part of U.S. patent application Ser. No. 09/281,017, filed Mar. 30, 1999 by Shawn D. Abbott, Bahram Afghani, Allan D. Anderson, Patrick N. Godding, Maarten G. Punt, and Mehdi Sotoodeh, and entitled “USB-COMPLIANT PERSONAL KEY,” which claims benefit of U.S. Provisional Patent Application No. 60/116,006, filed Jan. 15, 1999 by Shawn D. Abbott, Barham Afghani, Allan D. Anderson, Patrick N. Godding, Maarten G. Punt, and Mehdi Sotoodeh, and entitled “USB-COMPLIANT PERSONAL KEY,” all of which applications are hereby incorporated by reference herein.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4799258 | Davies | Jan 1989 | A |
| 5212729 | Schafer | May 1993 | A |
| 5386369 | Christiano | Jan 1995 | A |
| 5396558 | Ishiguro et al. | Mar 1995 | A |
| 5446796 | Ishiguro et al. | Aug 1995 | A |
| 5502765 | Ishiguro et al. | Mar 1996 | A |
| 5664950 | Lawrence | Sep 1997 | A |
| 5706426 | Hsu | Jan 1998 | A |
| 5754761 | Willsey | May 1998 | A |
| 5761309 | Ohashi et al. | Jun 1998 | A |
| 5778071 | Caputo et al. | Jul 1998 | A |
| 5784581 | Hannah | Jul 1998 | A |
| 5799085 | Shona | Aug 1998 | A |
| 5812662 | Hsu et al. | Sep 1998 | A |
| 5815577 | Clark | Sep 1998 | A |
| 5857024 | Nishino et al. | Jan 1999 | A |
| 5870080 | Burnett et al. | Feb 1999 | A |
| 5937068 | Audebert | Aug 1999 | A |
| 5943423 | Muftic | Aug 1999 | A |
| 6052468 | Hillhouse | Apr 2000 | A |
| 6067621 | Yu et al. | May 2000 | A |
| 6075860 | Ketcham | Jun 2000 | A |
| 6076164 | Tanaka et al. | Jun 2000 | A |
| 6092202 | Veil et al. | Jul 2000 | A |
| 6128741 | Goetz et al. | Oct 2000 | A |
| 6161185 | Guthrie et al. | Dec 2000 | A |
| 6178507 | Vanstone | Jan 2001 | B1 |
| 6189099 | Rallis et al. | Feb 2001 | B1 |
| 6216230 | Rallis et al. | Apr 2001 | B1 |
| 6240517 | Nishioka | May 2001 | B1 |
| 6304658 | Kocher et al. | Oct 2001 | B1 |
| 6317836 | Goren et al. | Nov 2001 | B1 |
| 6356935 | Gibbs | Mar 2002 | B1 |
| 6401205 | Rallis et al. | Jun 2002 | B1 |
| 6425084 | Rallis et al. | Jul 2002 | B1 |
| 6434700 | Alonso et al. | Aug 2002 | B1 |
| 6523119 | Pavlin et al. | Feb 2003 | B2 |
| 6557104 | Vu et al. | Apr 2003 | B2 |
| 6647494 | Drews | Nov 2003 | B1 |
| 6697944 | Jones et al. | Feb 2004 | B1 |
| 6892302 | Wheeler et al. | May 2005 | B2 |
| 6913193 | Kawan | Jul 2005 | B1 |
| 6990471 | Rajaram | Jan 2006 | B1 |
| 7047414 | Wheeler et al. | May 2006 | B2 |
| 7076062 | Spies | Jul 2006 | B1 |
| 7085931 | Smith et al. | Aug 2006 | B1 |
| 7103575 | Linehan | Sep 2006 | B1 |
| 7131002 | Yoshizawa | Oct 2006 | B2 |
| 7137007 | Terao et al. | Nov 2006 | B2 |
| 7266695 | Nakayama | Sep 2007 | B2 |
| 7281132 | Bender et al. | Oct 2007 | B2 |
| 7318550 | Bonalle et al. | Jan 2008 | B2 |
| 7409552 | Buttyan et al. | Aug 2008 | B2 |
| 7434066 | Kuriyama | Oct 2008 | B2 |
| 7469837 | Mizushima | Dec 2008 | B2 |
| 7487357 | Smith et al. | Feb 2009 | B2 |
| 7530101 | Gallo et al. | May 2009 | B2 |
| 7536722 | Saltz et al. | May 2009 | B1 |
| 7752445 | Satoh | Jul 2010 | B2 |
| 7844819 | Minemura | Nov 2010 | B2 |
| 7861077 | Gallagher, III | Dec 2010 | B1 |
| 7873579 | Hobson et al. | Jan 2011 | B2 |
| 7895443 | Grove et al. | Feb 2011 | B2 |
| 20010014946 | Ichinoi et al. | Aug 2001 | A1 |
| 20020023217 | Wheeler et al. | Feb 2002 | A1 |
| 20020032859 | Yoshizawa | Mar 2002 | A1 |
| 20020133467 | Hobson et al. | Sep 2002 | A1 |
| 20030014372 | Wheeler et al. | Jan 2003 | A1 |
| 20030037264 | Ezaki et al. | Feb 2003 | A1 |
| 20030041244 | Buttyan et al. | Feb 2003 | A1 |
| 20030145182 | Naito et al. | Jul 2003 | A1 |
| 20030182551 | Frantz et al. | Sep 2003 | A1 |
| 20040030901 | Wheeler et al. | Feb 2004 | A1 |
| 20040059916 | Mizushima et al. | Mar 2004 | A1 |
| 20040098585 | Grove et al. | May 2004 | A1 |
| 20040122931 | Rowland et al. | Jun 2004 | A1 |
| 20040166942 | Muir | Aug 2004 | A1 |
| 20050055557 | Yamada et al. | Mar 2005 | A1 |
| 20050132151 | Kuriyama | Jun 2005 | A1 |
| 20050235148 | Scheidt et al. | Oct 2005 | A1 |
| 20060005011 | Satoh | Jan 2006 | A1 |
| 20060078109 | Akashika et al. | Apr 2006 | A1 |
| 20060101506 | Gallo et al. | May 2006 | A1 |
| 20080052183 | Hobson et al. | Feb 2008 | A1 |
| 20090144534 | Calhoon et al. | Jun 2009 | A1 |
| 20090157556 | Hobson et al. | Jun 2009 | A1 |
| 20100100746 | Grove et al. | Apr 2010 | A1 |
| 20100325428 | Satoh | Dec 2010 | A1 |
| Number | Date | Country |
|---|---|---|
| 0587375 | Mar 1994 | EP |
| 0791877 | Aug 1997 | EP |
| 0936530 | Aug 1999 | EP |
| 1001329 | May 2000 | EP |
| 0791877 | May 2002 | EP |
| 2154344 | Sep 1985 | GB |
| WO 0023936 | Apr 2000 | WO |
| WO 0075755 | Dec 2000 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20080065887 A1 | Mar 2008 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 10701029 | Nov 2003 | US |
| Child | 11978757 | US |
