Automatic recovery of forgotten passwords

[0002] This application is related to U.S. Pat. No. 5,768,373, entitled “Method for Providing a Secure Non-reusable One-Time Password.”

[0003] The invention relates to computer security and particularly to computer security when a user has lost or forgotten the user password.

[0004] Many personal computers (PCs) or workstations allow a user to secure data and information stored in a computer by requiring the user to enter a password previously defined by the user. The password is used to limit access to data stored on the computer.

[0005] In one type of security system encryption is used to transform “plaintext” data into a form unintelligible to anyone who does not have a decryption key. Data is thus kept private and away from those for whom it is not intended. The password may serve as a decryption key or a means for obtaining the decryption key.

[0006] To regain access to encrypted data, the user, often at logon, must type in the user password exactly as he/she previously defined it. The user password is then used to decrypt the data. However, without the user password, access to the data cannot generally be gained.

[0007] In a centralized network situation, when a user forgets his/her password, a system administrator can give the user access to his/her files by overriding the user password function through a backdoor access, or, if passwords are centrally stored, obtaining the password for the user. However, with a freestanding PC or workstation, unlike with networks, there is no centralized administration or access to passwords, and loss of a user password in an independent PC or workstation situation can be devastating.

[0008] Typically, if a user forgets the user password, for unlocking all files the entire computer product must be removed/replaced and/or the data encrypted with the password must be erased since it is unintelligible without a decryption key. Generally, loss of a user password in such a situation will cause the user to lose a significant amount, if not all, of the user's protected data.

[0009] Thus, it is desirable to develop a system which allows a user to gain access to his/her computer data even if the user has forgotten the password. However, because data security is of prime significance to users who use passwords, it is also desirable to allow a user to override password protection to data in a way that does not significantly compromise the security of the data.

[0010] In accordance with the invention a method of securely and automatically authenticating a user is disclosed. Bona fides are entered for a user, hashed, and then stored at an authenticating entity, remote from the user's computer. When a user forgets his/her password, the user enters his/her bona fides, which are again hashed on the user's system, and then securely transmitted to the authenticating entity. The authenticating entity compares the received, hashed bona fides to those previously stored at the authenticating entity. If the comparison shows that the values match or otherwise appropriately correlate, the user will be authenticated. The user will then be provided with the means to access his/her encrypted data. In other words, once authenticated the authenticating entity will automatically provide the user and/or the user's computer with an access key, in one embodiment, allowing the user to access his/her encrypted data.

[0011] Such a method is advantageous in that it can minimize the live-human resources dedicated at the authenticating entity to responding to lost-password inquiries. In fact, in utilizing the present invention, no human need be present at the authenticating entity to grant a user access to his/her data, and yet the granting of such access is granted remains secure.

[0012] The present invention is described with respect to particular exemplary embodiments thereof and reference is accordingly made to the drawings in which:

[0013] FIG. 1 is a block diagram of a computer system in accordance with one embodiment of the invention;

[0014] FIG. 2 is a diagram of a security system in accordance with the invention;

[0015] FIGS. 3 and 4 together show a flow diagram in accordance with one embodiment of the invention;

[0016] FIGS. 5 and 6 illustrate in block diagram format a system and method for automatically authenticating a user in accordance with the invention.

[0017] FIG. 1 shows a first computer system 100, having at least a processor 110, a memory 120 such as RAM, and a non-volatile storage medium 130. Storage medium 130 may include one or more machine-readable media including semiconductor memories (e.g., EEPROM), optical and magnetic media (e.g., floppy disks, hard disks, CD-ROM), etc. In order to aid the user in securing access to data stored on computer system 100, various application/logon programs have been developed. As shown in FIG. 1, an application 150 resides in storage medium 130. In an alternative embodiment, application 150 resides in memory 120. Application 150 interacts with the user and the system to secure data access to the user and those designated by the user.

[0018] One embodiment of the invention is a portion of an instruction set, shown as a one time password (OTP) program 160 in FIG. 1, residing in storage medium 130 as part of application 150, which is executed by processor 110. OTP program 160 interacts with application 150 to secure data access (discussed in more detail below). Alternatively, OTP program 160 may reside in memory 120.

[0019] Referring to FIG. 2, a OTP mechanism is described. In a computer system 200, each file, File_i, is associated with an encryption unit 204 and with a file key K_fi, i=1 . . . n. Encrypting unit 204 receives plaintext file data on line 202 and encrypts file data to create encrypted *file_i* on line 206. Items bound by a pair of asterisks are used herein to indicate the items are encrypted. A file encryption key, K_fi, is supplied as an encryption key to the key input of encrypting unit 204 on line 216.

[0020] The encrypted *file_i* is stored in a region 208 of a non-volatile storage means such as a hard disk. To retrieve an intelligible version of the stored *File_i*, the *file_i* data is extracted from storage region 208 and supplied to decrypting unit 210. The encryption/decryption algorithm performed by units 204/210 is preferably a symmetric one, meaning that the same key K_fiused for encryption by encrypting unit 204 must be used by decrypting unit 210 for decryption.

[0021] If a plaintext version of the file encryption key K_fiis stored on the nonvolatile storage means, system security will be compromised if an unauthorized person discovers its location. Thus, the file encryption key K_fiis supplied to encrypting unit 218 and an encrypted version, *K_fi*, is produced on line 220. *K_fi* is stored in region 222 of non-volatile storage means. In this manner, if an unauthorized person discovers region 222, the plaintext version of key K_firemains unavailable.

[0022] In order to encrypt K_fi, an encryption key also needs to be supplied to encrypting unit 218. Thus, a user public key K_pub, is produced on line 249 by public-private key generator 248. The encryption/decryption algorithm utilized by encryption unit 218 is not a symmetric one, meaning that a key other than K_pubwill be necessary to decrypt the encrypted *K_fi*. Thus public-private key generator 248 also generates a second key, K_pub, for decrypting data encrypted in unit 218.

[0023] Public-private key generator 248 generates keys in accordance with a public-key cryptography system, a general description of which will here be useful. In public key cryptography, each encrypting/decrypting entity utilizes a pair of keys: a public key, which is published, and a private key, which is kept secret. The public key is used to encrypt the data, but only the private key can decrypt the data. Thus, once encrypted, data is available only to the private key holder. In this manner, the public key and the private key work together as a complementary pair. The most common public-key cryptography system is RSA public-key cryptography, which is generally known in the art and, in fact, has become a de facto standard. General information about RSA public-key cryptography can be found in U.S. Pat. No. 4,405,829.

[0024] Using a user public key to encrypt K_fiis beneficial in that it allows files to be accessible to more than a single user. For example, if File_iis owned by user1, user1 can designate user1, user2 and user3 to have access to File_i. User1 would encrypt K_fithree separate times: once with each of user1's, user2's, and user3's public keys (K_pub1, K_pub2, and K_pub3) to form *K_fi−1*, *K_fi31 3*, and *K_fi−3*, respectively.

[0025] However, once K_fiis encrypted in encryption unit 218, e.g., to obtain *K_fi−1*, using user 1's public key, K_pub1, only the user's private K_priv1, applied to decryption unit 224, will be able to recover a useable form of K_fi. Thus, user1 can only access a file using user1's private key (K_priv1) and user2 can only access the same file with K_priv2.

[0026] Generally, encryption/decryption units 218/224 operate in accordance with an asymmetric algorithm such as those found in RSA Corp.'s Bsafe Library™, a publicly available product. Further, the public-private key pair generated by public-private key generator 248 may generally be between 360 and 2048 bits in length. However, use of at least 768 bits is preferred because use of any fewer bits may result in easily penetrable security.

[0027] However, even using asymmetric algorithms, if any user's K_privis stored on the storage medium and is not itself encrypted, data security will again be compromised if an unauthorized person discovers its location. Thus, each K_privis supplied on a line 250 to an encryption unit 252, and an encrypted version, *K_priv*, is produced on line 254. *K_priv* is then stored in storage region 256 of non-volatile storage means and is unreadable by unauthorized persons.

[0028] When a user desires to access a file, the user must extract *K_priv* from storage region 256 and decrypt it in decryption unit 258, producing decrypted K_priv**. Items that have been previously encrypted and thereafter decrypted are indicated as being followed by a pair of asterisks. K_priv** is then applied on line 260 to decryption unit 224, resulting in decrypted key K_fi**. *File* is then extracted from storage region 208 and K_fi** is applied to decryption unit 210 and File** is produced, the desired result.

[0029] Returning to K_privencryption at encryption unit 252, to encrypt K_priv, an access key, K_accis supplied on line 232 to encryption unit 252. K_accis produced on line 232 by a random key generator 230 and in one embodiment K_accis 128 bits in length. Further, in one embodiment of the invention, random key generator 230 is a random number generator. A suitable random number generator can be found in RSA Corp.'s Bsafe Library™, although other random number generators are also suitable. Generally, random number generators have to be “seeded” with some sort of initial vector (or “seed”) 228. Such a seed in one embodiment of the invention may be produced using timers (e.g., the length of time it takes the user to type a certain number of keystrokes). Other embodiments may use other well known random seed generators to produce such a seed.

[0030] The encryption/decryption algorithm performed by units 252 and 258 is symmetric. Thus, since K_accis supplied to encryption unit 252, K_accmust also be supplied to decryption unit 258. Yet, as with other keys, if K_accis stored in plaintext form in non-volatile storage means, and sometime later an unauthorized person discovers the location of K_acc, the security of data will be compromised as other encrypted keys will then become accessible. Therefore, access key k_accis supplied on line 232 to encrypting unit 234 which operates according to well-known symmetric encryption/decryption algorithms such as “Blowfish”, which can generally be found in Bruce Schneier, Applied Cryptography (2d.Ed. 1995). The resulting encrypted signal *K_acc1* produced on line 236 is stored in storage region 238. The key signal that is applied to encrypting unit 234 on line 264 is K_pwhand is produced by hashing unit 262 from a user-supplied password on line 261.

[0031] “Hashing” is generally the using of an algorithm to take a variable size input and produce a unique fixed-length identifier representative of the original input (here, the user password). One hash algorithm, MD5, or message digest 5, is generally known in the art, and is suitable for hashing a user password. Other algorithms are also generally known and are also suitable for hashing a user password in system 200. Often hash functions are thought to take a large block of data and reduce it to a smaller block. However, because the user password can vary from a few characters to up to 99 bytes in one embodiment, hash function 262 may produce a larger or smaller block of data than a given input (the user password), but it will return a password hash (K_pwh) of consistently fixed length. In one embodiment using the MD5 hash function, such fixed length is set to 16 bytes.

[0032] To retrieve the access key, k_acc, the user must enter the correct password on line 261 into hashing unit 262. The resulting signal, K_pwh, on line 264 is applied to decryption unit 240. The resulting, decrypted access key on line 242 is now referred to as K_acc1**. This decrypted access key K_acc1** is passed through selector 244 and supplied on line 246 to decryption unit 258 to obtain decrypted K_priv** and, ultimately, to obtain decrypted File_i** information.

[0033] As can be seen from the above discussion, access to secured files is ultimately through entry of the user password 261. That is, user password 261 is entered into user system 200 and is applied to hash function 262 to obtain K_pwh. K_pwhis used to decrypt *K_acc1* to obtain K_acc1**. K_acc1** is then used to decrypt *K_priv* to obtain K_priv**, which is used to obtain decrypted K_fi** and ultimately decrypted File_i**. The user password 261 is not stored anywhere in the computer system. If the password were so stored, the security of the system would be compromised by anyone discovering its location. Yet if the user forgets his/her password, access to decrypted File_i** cannot be obtained through the above-described method.

[0034] Thus, further in accordance with the invention, when K_accis encrypted at encrypting unit 234, it is also passed through encrypting unit 268 to form a second encrypted access key *K_acc2* on line 270. *K_acc2* is stored in storage region 272. Encrypting unit 268 operates according to an asymmetric encryption/decryption algorithm, such as those found in RSA Corp.'s Bsafe Library™, meaning that different keys are used for encryption and decryption, respectively. A one-time (OT) public key is applied on line 266 to encrypting unit 268. A companion, but different OT private key 280 will be later applied to a companion decrypting unit 282. The OT public key (K_otpub) and OT private key (K_otpub) are generated in accordance with a public-key cryptography system and preferably in accordance with RSA public-key cryptography, discussed previously. Further, OT public-private key pairs are preferably 1024 bits in length, but other lengths are also suitable.

[0035] The OT private key is held by an authenticating entity 299, remote from user system 200, in a secure location. In one embodiment, this authenticating entity 299 is referred to as a “help desk”. The help desk can comprise a human at a terminal or it can be an automated entity. The OT public key is stored on the user's computer system 200. The OT public-private key pair is generated, in one embodiment, before distribution of system 200 to the user, allowing for storage of OT public key on user system 200. In other embodiments the OT public-private key pair is generated by user system 200 subsequent to distribution. In such an embodiment, OT private key would be communicated via a secure channel to authenticating entity 299 along with various identifying information.

[0036] When the user forgets his/her password, a one-time password mechanism is activated to read the encrypted signal *K_acc2* stored in storage region 272 and to output that *K_acc2* signal, for example, to a display monitor 274. User 276 reads the displayed information and communicates it by a secured channel to the authenticating entity 299. Such communication with the authenticating entity can be obtained via verbal telephone communication. In an alternate embodiment, the fetched data *K_acc2* is transmitted through a secure channel 273 via modem or internet to the authenticating entity 299, in which case display of *K_acc2* may be unnecessary. In either case, user 276 must supply additional authenticating information to the authenticating entity 299 to prove that user 276 is whom he or she claims to be. An example is randomly selected personal information about the user such as date of birth and/or mother's maiden name. The user 276 may demand that the authenticating entity 278 also prove that it is whom it claims to be.

[0037] Optionally, system 200 further includes encryption unit 290 and decryption unit 296, to further ensure user authentication. Rather than having *K_acc2* go directly from storage region 272 to display 274, *K_acc2* is encrypted in encryption unit 290 using the user's UserID (e.g., a logon name) as the encryption key for a symmetric encryption algorithm. *K_acc2ID* results and is displayed for user 276 communication, or is otherwise communicated, to authenticating entity 299. Authenticating entity 299, then, in addition to requesting identifying information from the user 276 will request the user's UserID. The authenticating entity decrypts *K_acc2ID* using the UserID conveyed. Thus, because a user must supply UserID information in addition to other identifying information, system security is further enhanced.

[0038] If the UserID's match, *K_acc2ID* is decrypted in decrypting unit 296 to recover *K_acc2*, which in turn is applied to decrypting unit 282. If decrypting unit 296 is not utilized, *K_acc2* is passed directly to decrypting unit 282 subsequent to user authentication 278. The authenticating entity 299 applies its OT private key to the key-input 280 of unit 282. The output 284 of unit 282 is the decrypted access key K_acc2** which is then returned verbally to the user 276 for entry into system 200 in one embodiment. Alternatively, K_acc2** is returned directly via a secure communication channel 285 to user system 200. In either case, K_acc2** is applied to line 286 of the user's system. This returned, secondary access key K_acc2** is then passed through selector 244, which selects between K_acc1** and K_acc2**, and K_acc2used to unlock the remainder of the system.

[0039] Immediately thereafter, random key generator 230 is activated to generate a new access key K_acc. The user is prompted to enter a new password 261. The securing process repeats all over again.

[0040] User system 200 shown in FIG. 2 may be implemented as OTP program computer code and stored on a non-volatile storage medium 130 (FIG. 1) such as a floppy disk or hard disk. In such an embodiment, storage regions 238, 256, and 272 may be represented by a logon record data structure. Such computer code, when activated may be transferred to memory 120 (FIG. 1) such as RAM and executed by a processor 110 (FIG. 1). Alternatively, user system 200 may be implemented as dedicated hardware.

[0041] FIG. 3 shows the steps followed for securing data and an access key. File_idata is encrypted with K_fiin step 602 to form *file_i* which is stored. K_fiis encrypted with K_pub, step 603 to form *K_fi* and stored. In step 604, access key, K_acc, is generated, and, in step 605, K_privis encrypted with K_accand stored. The user password, received in step 607, is hashed, step 610, and K_accis encrypted with each K_pwhand K_otpubin step 615 forming *K_acc1* and *K_acc2*, respectively. Note that while FIG. 3 shows step 604 following step 603, in other embodiments step 604 can precede steps 602 or 603 or can be performed simultaneously with either steps 602 or 603. Likewise, steps 607 and 610 can occur any time before, or simultaneously with, any of steps 602-605, provided step 610 follows step 607.

[0042] When the user attempts to regain data access later, referring to FIG. 4, if the user knows his password, step 620, then the user enters his password, step 625, the hash of the entered user password is taken, step 630, *K_acc1* is decrypted with K_pwh, step 635, and *K_priv* is decrypted with K_acc1**, step 640. *K_fi* is then decrypted, step 645, and *file_i* can be decrypted, the desired result, step 647.

[0043] However, if at step 620 the user does not know his password when he attempts to gain data access, *K_acc2* is displayed, step 650. Alternatively, in one embodiment, *K_acc2* may optionally be further encrypted with UserID, to form *K_acc2ID*, step 649, for better user authentication, and then *K_acc2* is displayed in step 650. Following display, the user may then communicate the encrypted *K_acc2* to the authenticating entity, step 655. Note, as previously discussed, some methods of communication may not require display of *K_acc2*, in which case step 650 can be bypassed in some embodiments of the invention. Upon receiving the user's communication, authenticating entity authenticates the user, step 656, by requesting certain identifying information of the user. Optionally, if step 649 was performed, authenticating entity will decrypt *K_acc2ID* with the UserID, obtained by authentication entity from the user in step 656, to recover *K_acc2*, step 658. In step 660, the authenticating entity decrypts *K_acc2* with K_otpriv, the OT private key. The authenticating entity then communicates the decrypted K_acc2** to the user in step 665, and the user enters the decrypted K_acc2** on his or her system, step 670. (Note here again that the method of communication may be by directly transmitting the decrypted K_acc2** to the user's system.) By receiving a decrypted K_acc2**, *K_priv* can be decrypted, step 640. *K_fi* is then decrypted, step 645, and file access, step 647, is obtained.

[0044] If *K_acc2* was decrypted by the authenticating entity with the OT private key, then, in step 675, a new K_accwill be automatically generated and the user will be prompted to change the user password. In this manner, a one-time password feature is enabled that does not significantly compromise data security and does not require decrypting any encrypted data without a decryption key. Further, because all File_iare encrypted with a K_fiand not K_acc, the system in accordance with the invention is transparent to the files, File_i; that is, files do not have to be decrypted and/or re-encrypted when the user loses his or her password.

[0045] Authenticating the User

[0046] As described with reference to FIGS. 2 and 4, when a user forgets his/her password, the user must contact a “help desk,” or authenticating entity. The authenticating entity must authenticate the user before providing that user with the means to access his/her data. As described, although the encrypted access key (*K_acc2*) can be directly sent to the authenticating entity over a modem or internet, to actually authenticate the identity of the user will typically require a live human asking the user certain questions. Such querying of the user is usually done via a telephone conversation. Such authentication can result in a large percentage of “help desk” resources being dedicated to helping users who have forgotten their passwords, a frequent occurrence.

[0047] In order to minimize the necessity of having a live human at the “help desk” interact with the user who has forgotten his password, a method in accordance with the invention provides for the automatic authentication of users.

[0048] Referring to FIG. 5, when a user 276 is first created, or established, with the authenticating entity 299, the user 276 is requested to provide the authenticating entity 299 with identifying information 502, referred to herein as “bona fides.” Such bona fides should contain several facts that are known only to the user. Preferably these facts will also not be easily identifiable from public records. For instance, such facts may include the name of the user's first girlfriend/boyfriend, the user's favorite golf hole, or the name of the user's first childhood pet. Although five facts are shown in the bona fides 502 in FIG. 5, where each fact includes a question Q and an answer A, it is to be understood by those of skill in the art that more or fewer facts could be included and that the number five was selected for illustrative purposes only.

[0049] In one embodiment each bona fide is entered in the form of a question and an answer. For instance, a bona fide fact may be entered as follows:

[0050] “Q: First girlfriend?”

[0051] “A: Lola”

[0052] Since each bona fide should typically contain facts known only to the user, in one embodiment of the invention the user will devise both the questions and the answers. In other embodiments, however, the user system 200 or authenticating entity 299 may provide the questions to the user.

[0053] If the questions and answers are stored in text form, either at the user's system or at the authenticating entity, anyone gaining access to the user's system 200 or the authenticating entity 299 may be able to impersonate the user. Even if only the questions are stored in text form and the answers are encrypted or otherwise encoded, an unauthorized individual may be able guess the answers to the questions. Therefore, in one embodiment, both the question and the answer to each bona fide are hashed with hash functions 504a-504j(collectively, hash function 504). In some embodiments, each hash function 504a-504jis the same hash function, e.g., MD5. In other embodiments, each hash function 504a-504jis distinct from the others. As well, although in FIG. 5, each question and answer are hashed separately, in some embodiments each question and answer are hashed together, resulting in one hash output for each question-answer pair.

[0054] Because both the questions and answers for each bona fide are hashed, at authentication time the user will have to enter both the question and answer. Hence, because user's are apt to forget their questions, at the time of entering the question and answer for the bona fide, the user may, in some embodiments, also enter a hint to remind him- or herself of the bona fide. For instance,

[0055] “Q: First girlfriend?”

[0056] “A: Lola”

[0057] “Hint: 10th Grade”

[0058] The hints may be stored in text form either on the user's computer system 200 or at the authenticating entity 299.

[0059] Of course, if the authenticating entity is providing the questions, such hints may be unnecessary in other embodiments of the invention. Nonetheless, in such an embodiment where the questions are provided by and/or stored at the authenticating entity, the questions should be stored in an encrypted format and/or transmitted over a secure channel using encryption (as will be described below) to protect the secrecy of the questions. Otherwise, imposters could gain access to the questions and attempt to guess the answers.

[0060] Once the user has entered his/her bona fides 502 and they have each been hashed by hash function 504, the hashed bona fides Q1_H-Q5_Hand A1_H-A5_H, collectively referred to as BF_H, are sent to the authenticating entity 299. To maintain the secrecy of the bona fides, however, a secure communication line is set up between the user's system 200 and the authenticating entity 299. In one embodiment, the set up of such a secure communication line is automatic and uses a protocol such as DCOM, CORBA, or SSL. These protocols as well as others are known in the art.

[0061] In some embodiments, the Diffie-Hellman protocol or other public key algorithm is used to establish a secure channel and to create a unique session key. In accordance with the Diffie-Hellman protocol, such a session key can be independently established at both the user's system 200 and the authenticating entity 299 without transmitting the session key itself between the two entities.

[0062] The session key, S-Key1, is used in symmetric encryption unit 506 to encrypt the hashed bona fides, BF_H. The encrypted and hashed bona fides, *BF_H*, are then transmitted to the authenticating entity 299 over the secure channel 508. In this manner, so-called “replay” attacks are minimized. In other embodiments, other methods of establishing a secure channel are also acceptable, and those given are meant as examples only and are not intended to limit the scope of the invention.

[0063] In an alternative embodiment, BF_His not communicated over a secure channel as described above, but is instead communicated to the authenticating entity 299 by the user via telephone. In such a case, encryption unit 506 used with the Diffie-Hellman protocol described would not be necessary.

[0064] When *BF_H* is received at the authenticating entity 299, *BF_H* is decrypted with symmetric decryption unit 510, using the same session key, S-Key1 (if required by the secure channel protocol utilized), the result is decrypted hashed bona fides, BF_H**. The set of decrypted, hashed bona fides, BF_H**, is then stored in a user record 514.

[0065] In order to prevent BF_H** from being accessed and/or changed while stored at the authenticating entity, BF_H** is further protected. At a minimum, the user record 514 is digitally signed, as shown by attached signature 515, and will be understood by those of skill in the art. In other embodiments, each bona fide can be individually digitally signed. Still other forms of security, such as encrypting BF_H** can also be used in other embodiments of the invention. Without at least providing a digital signature, the bona fides would be accessible and/or changeable to unauthorized individuals located at the authenticating entity. Digitally signing the bona fides prevents user authentication when the stored bona fides have been unauthorizedly altered.

[0066] In addition to BF_H, user record 514 will also include other information specific to the user, such as a UserID. The UserID may be useful for indexing the user records.

[0067] Referring to FIG. 6, when the user forgets his/her password, the user is prompted at computer 200 to enter his/her bona fides. The user may enter all of the bona fides he/she originally established at user set-up time, or the user may enter a subset of those bona fides. In FIG. 6, a subset of bona fides 502′ is shown for illustrative purposes. In some embodiments, the user will select the subset while in other embodiments the authenticating entity will select the subset.

[0068] The bona fides 502′ are hashed with the same hash functions 504 as were used to initially hash the user's bona fides in FIG. 5. Again, each question and answer are hashed. Although the bona fides are hashed individually, BF2_His used to collectively refer to the subset of entered and hashed bona fides.

[0069] Again, once the user has entered bona fides 502′ and they have each been hashed by hash function 504, the hashed bona fides, BF2_H, are sent to the authenticating entity 299. A secure communication line 508′ is again set up between the user's system 200 and the authenticating entity 299 in a manner similar to that described above. If the Diffie-Hellman protocol is used, a session key, S-Key2 is established for security purposes, and BF2_His symmetrically encrypted by encryption unit 506′, resulting in *BF2_H*. In some embodiments, the algorithm used by encryption unit 506′ is the same as that used at user creation by unit 506. It should again be understood that any method of establishing a secure communication channel is contemplated as within the scope of the invention.

[0070] Once *BF2_H* has been received via secure line 508′ by the authenticating entity 299, *BF2_H* is decrypted with decryption unit 510′, using the same session key, S-Key2, as was used for encryption (if required by the secure channel protocol utilized). The decrypted hashed bona fides, BF2_H** are then provided to comparison unit 516.

[0071] If the user record 512 and/or individual bona fides are digitally signed, the comparison unit 516 verifies that the stored information has not been altered. If the stored information has been encrypted, the information is decrypted as is understood in the art. BF2_H** is then compared with the stored BF_H** in comparison unit 516. Each individual hashed bona fide in the subset BF2_H-Sis compared to the hashed bona fides stored in user record 514. If a minimum number of matches are obtained then the user is authenticated. For instance, if three bona fides are entered, the authenticating entity may require that only two match those stored. In other embodiments, all of the bona fides in the subset entered must be matched.

[0072] If the user is authenticated, the access key, K_acc2will be decrypted, as described with reference to FIGS. 2 and 4. If no match is found, the user will not be provided with a one-time password such as K_acc2**.

[0073] When all transmissions are performed through modem or internet, including transmission of *K_acc2* and K_acc2** between system 200 to system 299 as well as transmission of hashed and encrypted bona fides, the need for a live human at a help desk is eliminated. The user can be automatically authenticated by the authenticating entity, and then the authenticating entity can automatically provide the means necessary (e.g., K_acc2**) for the user to gain access to his encrypted data. Because forgotten passwords are a common occurrence, such automation will significantly free-up help desk personnel and resources.

[0074] Moreover, hashing of bona fides as well as encrypting the resulting hash provides an additional measure of security. Help desk personnel will never need to access a user's personal information, and therefore, the risks attendant in allowing help desk personnel access to user information and subsequently attempting to gain access to a user's data are significantly reduced.

[0075] To further enhance security, the user's bona fides can be required to be changed based on certain aging characteristics. For instance, the user can be required to change his/her bona fides after those bona fides have been existence for a given time period, e.g., 2 months. Alternatively, the user may be required to change his/her bona fides after they have been used for authentication purposes a particular number of times.

[0076] It should be understood that the particular embodiments described above are only illustrative of the principles of the present invention, and various modifications could be made by those skilled in the art without departing from the scope and spirit of the invention. Thus, the scope of the present invention is limited only by the claims that follow.