Credential roaming

<b>RELATED APPLICATION</b>

This application is related to co-owned, pending U.S. Patent Application Ser. No. 10/365,878 of David B. Cross, et al., filed on February 13, 2003 for "Digital Identity Management."

<b>TECHNICAL FIELD</b>

The described subject matter relates to electronic computing, and more particularly to systems and methods of credential roaming in electronic computing systems.

<b>BACKGROUND</b>

Various types of encryption schemes are widely used to secure data (e.g., an email message or file) for communication over a network. For example, in symmetric encryption, both the user that is encrypting data and the user that is decrypting the data need copies of the same encryption key. Asymmetric encryption, also known as public key encryption, uses key pairs (e.g., a public key and a private key). In asymmetric encryption the public keys may be shared but the private keys are not.

Encryption keys may be stored on a computer system, e.g., as part of a user profile or other repository for user settings, credentials, etc. The encryption keys may be modified or replaced over time to decrease the likelihood that unauthorized users are able to decipher the encryption scheme. In any event, the user is provided access to the encryption keys after the user is authenticated (e.g., during logon) and the user profile is loaded on the computer system.

The user may, however, need access to the encryption keys at more than one computer system (e.g., a personal computer and one or more mobile devices). Although the user may transfer the encryption keys from one computer system to another (e.g., using a diskette or other removable storage media), this is cumbersome and time-consuming. While smartcards may be used, these are expensive. Alternatively, the user profile may be stored on a network server and accessed from a variety of different computer systems every time the user connects to the network. However, the user profile may be large (many megabytes) and downloading the user profile from a network server may slow the logon process. In addition, the user may not be able to logon and use the computer without a locally-stored user profile (when the network is not available).

<b>SUMMARY</b>

Implementations are described and claimed herein to enable credential roaming, e.g., among a plurality of different computing devices. An exemplary system may include an event handler which receives event notifications such as, e.g., an interactive or network logon from an operating system. The event handler may invoke a management service in response to receiving an event notification. The management service may include a synchronizing module to synchronize a user's credentials (e.g., encryption credentials) with a remote cache or directory service. Accordingly, the user's credentials are available from any of a number of different computing devices.

In some implementations, articles of manufacture are provided as computer program products. One implementation of a computer program product provides a computer program storage medium readable by a computer system and encoding a computer program for credential roaming. Another implementation of a computer program product may be provided in a computer data signal embodied in a carrier wave by a computing system and encoding the computer program for credential roaming.

The computer program product encodes a computer program for executing a computer process on a computer system to enumerate local credentials and remote credentials in response to receiving an event notification, and synchronizing the local credentials and remote credentials.

In another implementation, a method is provided. An exemplary method includes enumerating local credentials and remote credentials in response to receiving an event notification, and synchronizing the local credentials and remote credentials.

In another implementation, a system is provided. An exemplary system includes an event handler to receive event notifications. A synchronizing module is operatively associated with the event handler. The synchronizing module synchronizes local credentials and remote credentials when the event handler receives an event notification if the local and remote credentials are different from one another.

<b>BRIEF DESCRIPTION OF THE DRAWINGS</b>

Fig. 1 is a schematic illustration of an exemplary computer network that may implement credential roaming;

Fig. 2 is a functional block diagram of exemplary modules to implement credential roaming;

Fig. 3 is another functional block diagram of exemplary modules to implement credential roaming;

Fig. 4a illustrates an exemplary state file;

Fig. 4b illustrates an exemplary state entry in a state file;

Fig. 5 illustrates exemplary winner arbitration matrices, wherein (a) is a lenient matrix and (b) is a strict matrix;

Fig. 6 is a flowchart illustrating exemplary operations to implement credential roaming; and

Fig. 7 is a schematic illustration of an exemplary computing device that can be utilized to implement credential roaming.

<b>DETAILED DESCRIPTION</b>

Briefly, credential roaming may be implemented to synchronize local credentials (encryption keys, certificates, tokens, etc.) at any number (n) of computing devices. For purposes of illustration, a user may change, modify, add and/or remove credentials at his or her laptop or desktop, computer. When the user logs out of the laptop or desktop computer, a management service synchronizes the local credentials with a remote cache. The remote cache may be implemented as a remote directory service, such as, e.g., Active Directory available for the Microsoft WINDOWS® operating environment. Alternatively, the management service may synchronize in response to other events. For example, real-time synchronizing may occur in response to one or more credentials being added, removed and/or modified.

Later, the user may use his or her personal digital assistant (PDA) or mobile phone to retrieve email messages. When the user logs onto the mobile device, the user's credentials are synchronized with the remote directory service so that the user has available a current and complete set of credentials, such as, e.g., encryption credentials for sending/receiving email messages.

In exemplary implementations, the management service may be automatically invoked (e.g., in response to a system event) and no affirmative action is even required of the user. Furthermore, the user profile may be stored locally, e.g., on the user's desktop or laptop computer, while still allowing the user to have access to a current and complete set of credentials at any of a number of different computing devices. Exemplary implementations may also ensure old or unused credentials are removed from the user's system when these credentials are no longer needed (e.g., by detecting and propagating a deletion or examining time-stamps for the credentials).

<b>Exemplary System</b>

<b>Fig. 1</b> is a schematic illustration of an exemplary networked computing system 100 in which credential roaming may be implemented. The networked computer system 100 may include one or more communication networks 110, such as local area network (LAN) and/or wide area network (WAN). One or more hosts 120 and one or more clients 130a-c may be communicatively coupled over the communication network(s) 110.

Host 120 and clients 130a-c (hereinafter generally referred to as clients 130) may connect to a network via a communication connection such as, e.g., an Ethernet connection. Although there are no theoretical limits on the number of devices that can be included in a network such as networked computing system 100, the number of devices are limited primarily by the connectivity implemented in the communication network.

The terms "host" and "client" both refer to the hardware and software (the entire computer system) used to perform various computing services. For example, a host may be implemented as a server computer that is dedicated to server applications or that also runs other applications. A client may be implemented as a stand-alone desktop or laptop personal computer (PC), workstation, personal digital assistant (PDA), or any of a wide variety of electronic appliances, to name only a few examples.

Credentials 140a-c (hereinafter generally referred to as credentials 140) may be provided at one or more of the clients 130. Credentials may be provided, for example, for symmetric and/or asymmetric encryption/decryption of data for secure communication over network 110, to apply a digital signature to content, or to authenticate to a system, to name only a few examples. Any number of credentials 140 may be stored in a local cache 135a-c (hereinafter generally referred to as local cache 135). Local cache 135 may include a user profile or other repository (e.g., for user settings and credentials) although other implementations are also contemplated.

It is noted that the credentials 140 may include any of a wide variety of different types of credentials, such as, e.g., symmetric encryption keys, asymmetric encryption key pairs, X.509 certificates, XrML licenses, tokens, and authentication/authorization credentials to name only a few exemplary credentials. Of course credentials 140 are not limited to these examples and may include other types of credentials now known or later developed.

Credentials 140 may be added to the local cache 135, for example, to enerypddecrypt different types of data. In addition, credentials 140 may be modified or replaced, e.g., to decrease the likelihood that unauthorized users are able to decipher the encryption scheme. Credentials that are no longer used may be removed. If one or more credential 140 is added, modified, replaced, or removed at any one of the clients (e.g., 130a), this change may be propagated to one or more other clients (e.g., 130b, 130c) so that a user has available a current and complete set of encryption credentials at any number (n) of different clients, as described in more detail below.

In an exemplary implementation, local credentials 140 may be synchronized with remote credentials 150 provided at a remote cache 125, e.g., at one or more hosts 120 or a shared cache at another client 130 in a workgroup environment. Accordingly, the user has available a current and complete set of credentials when the user logs onto other clients 130.

Remote cache 125 may be implemented as a directory service, such as a distributed lightweight directory access protocol (LDAP) or X.500 directory service. The directory service may be monolithic, or it may be distributed as a multi-master implementation or master-slave implementation. Remote cache 125 may stored in a protected or encrypted state so that the remote credentials 150 are not exposed to compromise, theft, or exploit by unauthorized users.

An exemplary directory service is the Active Directory available with the Microsoft WINDOWS® operating environment. Active Directory is a directory service that may be deployed in distributed computing environments to provide comprehensive directory services. Active Directory serves as a consolidation point for isolating, migrating, centrally managing, and reducing the number of directories that an enterprise needs. Active Directory also serves as a central authority (CA) for network security.

It is noted, however, that remote cache 125 may be implemented in any suitable manner and is not limited to the examples given herein.

<b>Fig. 2</b> is a functional block diagram of exemplary modules to implement credential roaming, e.g., using a notification service. Notification service 200 may be implemented in computer-readable program code (e.g., software and/or firmware) stored in computer-readable storage or memory and executable by a processor (or processing units) at one or more clients (e.g., the clients 130a-c in Fig. 1). Notification service 200 receives notification of various system events and invokes a management service 250 to synchronize local and remote credentials for a user. Accordingly, synchronization may be automatic and transparent to the user.

Referring to Fig. 2, notification service 200 may include an event handler 210. Event handler 210 receives notification of events 220a-c (hereinafter generally referred to as events 220). Events 220 may include, by way of example, startup, shutdown, logon, logoff, lock, unlock, to name only a few exemplary events. Other events may also include, but are not limited to session events (e.g., policy update, running a process, network connection), and timer events (e.g., every 8 hours, once a month). Optionally, an event may also be triggered manually, e.g., by the user requesting credential synchronization.

Event handler 210 may generate one or more jobs 230 based at least in part on events 220. Jobs 230 may include calls to other services. For example, a job 230 may call an auto-enrollment service 240. Auto-enrollment is a service that may be used to populate a user profile with credentials, etc., and may be invoked when a user is new to the system (e.g., a guest) to provide limited functionality and access to basic resources without compromising network security. Auto Enrollment automatically "enrolls" a user by requests/renewing the credentials for a user, e.g., based on the system policies for the computing environment. A job 230 may also call a management service 250 to synchronize encryption credentials with a remote cache (e.g., the remote cache 125 in Fig. 1), as discussed in more detail below.

Jobs 230 may be passed to a dispatcher 260. Job dispatcher 260 may remove jobs 230 from the queue and process jobs 230 in a serialized manner. The job dispatcher 260 determines which program code (or modules) to load for processing the job and when to load the program code. The job dispatcher 260 may also unload program code that is no longer being used.

Notification service 200 may also include logic for intelligently managing jobs 230 to reduce unnecessary resource consumption. In an exemplary implementation, job dispatcher 260 determines whether program code (or modules) for processing the job 230 is already loaded. In addition, if the job queue 270 is empty (e.g., there are no pending jobs 230), the job dispatcher 260 releases loaded program code (or modules).

In another exemplary implementation, event handler 210 may order jobs 230 that invoke the management service 250 in the queue 270 ahead of jobs 230 that invoke the auto-enrollment service 240. When events 220 trigger jobs 230 to call both the auto-enrollment service 240 and the management service 250, the jobs 230 invoking the auto-enrollment service 240 may be removed from the queue 270 if the management service is able to provide credentials for a user during synchronization.

In another exemplary implementation, dampening logic may be implemented to reduce repeated calls to the management service 250 (e.g., when an event 220 triggers other events). For example, dispatcher 260 may examine the job queue 270 and discard any jobs 230 which are duplicative or otherwise unnecessary.

Before continuing, it is noted that the notification service 200 is not limited to the exemplary modules shown in Fig. 2. For example, the functions do not need to be embodied in separate modules. In yet other implementations, additional functional components may also be included. Regardless of the implementation, notification service may call management service 250 to synchronize local and remote credentials.

<b>Fig. 3</b> is a functional block diagram of exemplary modules to implement credential roaming, e.g., using a management service. Management service 300 may be operatively associated with a notification service 310 (e.g., the notification service described in more detail above with reference to Fig. 2). Notification service 310 may invoke management service 300 in response to receiving notification of an event. Management service 300 evaluates and compares local credentials and remote credentials and, if these are different, synchronizes the local and remote credentials so that the user has available a current and complete set of credentials when using any number (n) of different clients.

Management service 300 may be implemented in computer-readable program code (e.g., software and/or firmware) stored in computer-readable storage or memory and executable by a processor (or processing units) at one or more clients (e.g., the clients 130a-c in Fig. 1). Management service 300 may include a synchronizing module 320 to evaluate credentials, resolve conflict(s), and update the credentials at the local and remote caches.

Synchronizing module 320 may be operatively associated with local store manager 330 and remote store manager 340. Local store manager 330 may be operatively associated with one or more local cache 350 for local credentials 355. In addition, local store manager 330 may abstract the procedures to load/save local encryption credentials 355 locally. Remote store manager 340 may be operatively associated with a remote cache 360 (e.g., a directory service) provided via one or more server computers or hosts 370. Remote store manager 340 may also securely bind to the host 370 to access one or more remote credentials 365 via the remote directory service 360, e.g., during synchronizing.

Before continuing, it is noted that credentials are not limited to being provided at a host, e.g., via a remote directory service. In another exemplary implementation the remote cache may be a shared cache at another client, e.g., in a workgroup environment. Accordingly, clients in one or more workgroups may synchronize shared credentials among clients in the workgroup.

The store managers 330, 340 may enumerate credentials 355, 365 (e.g., as a list of roaming credentials) for the synchronizing module 320 to evaluate. The store managers 330, 340 may also provide information to the synchronizing module 320, such as, e.g., the last time the collections of credentials 355, 365 were changed so that the synchronizing module 320 can resolve any conflict(s).

Synchronizing module 320 may operate in conjunction with local store manager 330 and remote store manager 340 to synchronize local encryption credentials 355 and remote encryption credentials 365. For many invocations, there may be no changes to either the local or remote encryption credentials. During other invocations, changes may only need to be made to the local credentials 355 or only to the remote credentials 365. However, there may also be circumstances where may need to be made to both the local credentials 355 and the remote credentials 365. Accordingly, synchronizing module may be implemented to handle each of these scenarios.

Evaluating local and remote encryption credentials may be a time-consuming process, particularly if there are several hundred or even several thousand encryption credentials. Accordingly, synchronizing module 320 may first sort the encryption credentials into arrays and then make a linear comparison of the sorted arrays. Of course other implementations are also contemplated, such as but not limited to using a hash and timestamp to determine if there is a change.

During the comparison, synchronizing module 320 may encounter conflicts that need to be resolved in order to synchronize the local and remote credentials 355, 365. For example, a local credential (referred to as an "old credential" for purposes of illustration) may be modified or removed/deleted from the local cache 350 because it is no longer needed. When synchronizing module 320 compares the local and remote credentials 355, 365, however, the remote credentials may still include the old credential. Synchronizing module 320 resolves such a conflict so that the old credential is modified or removed from the remote cache 360 and not rewritten to the local cache 350.

In an exemplary implementation, credentials that have been modified or removed/deleted are "tagged" or otherwise identified in the remote cache. Accordingly, the modify or delete operation may be persisted across multiple clients. As an example, if the old credential is deleted from a first client, synchronizing module 320 identifies the old credential at the remote cache as having been removed or deleted. When a second client also having a copy of the old credential synchronizes with the remote cache, the old credential is deleted from the second client and not rewritten to the remote cache. As another example, if the old credential is modified at a first client, synchronizing module 320 identifies the old credential at the remote cache as having been modified. When a second client also having a copy of the old credential synchronizes with the remote cache, the old credential is modified at the second client and not returned to its original condition at the remote cache.

In as exemplary implementation, synchronizing module 320 maintains one or more state files 395 for conflict resolution. The state file is a per-user persisted data structure (e.g., computer file, database, memory table, log, etc.) and may be used to store the state of local credentials 350. The state file may be stored locally, e.g., in cache 390 operatively associated with the management service 300. In an exemplary implementation, all fields may be stored in binary, native byte-order, although other implementations are also contemplated.

<b>Fig. 4a</b> illustrates an exemplary state file 400 (e.g., a data structure). State file 400 may include a file version 410 and a flag 420. Flag 420 may be used, e.g., to indicate whether the credential is user-protected or can be exchanged on the network. Alternatively, flag 420 (or another flag) may be used to indicate whether a strict or lenient matrix should be used to resolve conflicts.

State file 400 may also include one or more credential states 430-432. For example, state file 400 may include the following states: last time synchronization module called (T_s); last time local store changed (T_L), last time when the remote cache changed (T_R). The state file may also include credential state entries 440.

<b>Fig. 4b</b> illustrates an exemplary state entry 450 (e.g., a data structure) State entry 450 may include a list of local states for each credential. Local states may include credential ID 460, flags 470, time-stamp 480, and hash 490.

Before continuing, it is noted that the time-stamp is not limited to a clock-based (e.g., physical or system) time. For example, the time-stamp may include counters such as an update sequence number which is changed for every update made. Indeed, a clock-based time-stamp may be used for the local cache and an update sequence number-based time-stamp may be used for the remote cache.

In the implementation shown in Fig. 4, credential ID 460 is the "compressed" path of the encryption credential file. Credential ID 460 may be expressed as a single-byte ASCII string, although other implementations are also contemplated. In addition, any suitable flags 470 may be defined and may be set (e.g., 1) or off (e.g., 0). For example, a flag may indicate whether the encryption credential is roaming (can be synchronized) or fixed (should not be synchronized).

Operations that may be implemented for conflict resolution using state files, such as the state file 400 shown in Fig. 4, are described in more detail below. Conflict resolution may be illustrated by arbitration matrices.

<b>Fig. 5a and 5b</b> illustrate exemplary arbitration matrices, wherein the matrix 500 is lenient and the matrix 550 is strict. In the matrices 500, 550, exportable credentials are denoted by the letter "E" and protected (or non-exportable) credentials are denoted by the letter "P", wherein "/E" and "/P" denote opposites. The time-stamps of both the certificates are used to determine which certificate is the most recent. The most recent certificate is used to overwrite the local and remote cache. The other certificate is deleted.

It is noted that the exemplary implementations discussed above are provided for purposes of illustration. Still other implementations are also contemplated.

<b>Exemplary Operations</b>

Described herein are exemplary methods for implementing encryption credential roaming. The methods described herein may be embodied as logic instructions on one or more computer-readable medium. When executed on a processor, the logic instructions cause a general purpose computing device to be programmed as a special-purpose machine that implements the described methods. In the following exemplary operations, the components and connections depicted in the figures may be used to implement encryption credential roaming.

<b>Fig. 6</b> is a flowchart illustrating exemplary operations that may be implemented for encryption credential roaming. In operation 610, the client may receive an event notification. Event notifications may include, by way of example, a session event, a logon event, a logout event, a lock event, an unlock event, a timer event, a policy application event, and/or a credential update event. In operation 620 local credentials may be enumerated and in operation 630 remote credentials may be enumerated.

In operation 640, the local credentials and remote credentials may be compared to determine if there is a conflict. If there is no conflict, operations return as illustrated by arrow 650 to operation 610. Alternatively, a conflict may exist if any one or more of the enumerated local credentials are different than the enumerated remote credentials. For purposes of illustration, the enumerated local credentials may be different than the enumerated remote credentials if a credential has been added, modified, or deleted from a local credential cache and/or a remote credential cache.

If a conflict exists, the conflict is resolved in operation 660, e.g., by determining which credentials need to be added/removed in the local and remote credential caches. In an exemplary implementation, the conflict may be resolved based on time-stamps associated with the local and remote credentials. In operation 670, local and/or remote credentials are synchronized, e.g., so that both the local and remote credential caches include a complete, updated set of encryption credentials.

For purposes of illustration, operation 660 (conflict resolution) and operation 670 (synchronization) may be implemented as follows:

When credential roaming is first enabled for a client, the client may already have the same credentials (e.g. via manual key or PKCS #12 blob import) as in the remote cache. However, the credential storage and linker details may be different depending on how the credential was imported. This initial conflict may be resolved as follows.

If the remote credentials have already been downloaded, master keys (e.g., for accessing private keys) may be synchronized before these operations are performed so that private keys that need master keys are available.

A management service may then retrieve the creation time of the remote cache, e.g., via attribute's meta-data, and assigns it to T_C. If either or both of the time-stamps for the conflicting certificates are newer than T_C, at least one of the certificates was modified after deployment of credential roaming and the most recent cache is used.

Otherwise, both the local and remote caches may have been created before the deployment of credential roaming. The information flags for both certificates are retrieved to determine if the credential is user-protected or exportable. The policy flag may also be retrieved and determined whether a lenient matrix (e.g., matrix 500 in Fig. 5) or strict matrix (e.g., matrix 550 in Fig. 5) should be used to resolve the conflict.

An exemplary implementation of an algorithm for credential roaming is described as follows. According to this implementation, T_L represents the most recent time the entire local cache changed. T_L is based on the local machine's system time and may be compared with the local cache's update time so there is no timer skew. T_R represents the most recent time changes were made to the Update Sequence Number (USN) of the entire remote cache at the last synchronization. T_R may use the USN from the remote cache and may be compared with the remote cache USN so there is no timer skew.

First, the current last change time is read from the local cache and the USN is read from the remote cache. Then T_L and T_R are read from the state file header. T_L is compared with the last change time just read from the local cache and T_R is compared with the USN read from the remote cache. If they are both equal, nothing needs to be done. Otherwise, the algorithm may create a local change list C_L and a remote change list C_R, both initially empty.

If the last time the local cache was changed is later than T_L, the all the local cache credentials are read and compared with a corresponding entry in the state file. If any of the credentials are different, an entry may be created in C_L recording the credential or the state file entry, the most recent time a credential was updated, and a suggested action (e.g., add to the remote/local cache, modify the corresponding remote/local cache credential, delete the corresponding remote/local cache credential, update state file entry, etc.). Credentials may be deemed to be different if the hash value has changed, if the flag value has changed (e.g., to DELETED, UNWR1TEABLE, UNREADABLE), or if the local cache has a credential that the state file does not have a record of, or state file has an entry that local cache does not have a record of.

If the remote cache's last USN is different than T_R, all of the remote cache credentials are read and the same operations as just described are performed. The change list C_R may also be updated.

Both the C_L and C_R may then be evaluated to determine if actions have been performed on the same credential in both lists. If actions have been performed on the same credential in both lists, these actions may be evaluated to determine if there are any conflicts. For example, there may be a conflict if C_L includes an entry for credential A to "modify remote" while C_R includes an entry for the same credential to "modify local." The conflict may be resolved based on the last change times of both the local and remote credentials. That is, the entry with the earlier change time may be deleted from the list.

After resolving the conflicts, if any, the local and remote cache are updated based on the union of C_L and C_R, A flag is set for each entry that failed to update even after a few retries.

The state file may then be updated. For example, DELETED flags that have been set for an excessively long time may be identified and removed. The state file header and entries may also be updated based on the resultant C_L and C_R entries. If the state file failed to update even after a few retries, credential roaming may be disabled because a corrupted state file may generate unpredictable results.

It is noted that the entries described above may be evaluated as hash values. Hash values provide security, e.g., so that credentials are not duplicated in unnecessary caches, and for performance (hash comparisons are typically fast). However, it is noted that using a hash is only exemplary. For example, if the state file stores the entire credential, it may be used for binary or exact comparison in place of a hash.

The last sync time T_S maintained in the state file may be used to determine how to handle the local cache entry that exists in the state file but not in the remote cache. If the time elapsed from T_S until the current time is less than a threshold time, then the remote cache adds this entry. Otherwise the entry may be deleted from the local cache.

Error conditions in synchronizing the credentials may also result in partially updated or corrupted credentials. Accordingly, error handling may be provided so that a failure is not propagated, e.g., to the remote cache.

In any exemplary implementation, a "Write State" is returned to indicate a completion status of the write operation. The values may be: NONE, PARTIAL and DONE to indicate that the credential is (1) not altered, (2) partially changed or (3) successfully changed, respectfully. If a save operation results in a PARTIAL write state, the state file entry is marked as UNWRITEABLE. If a delete operation results in a NONE or PARTIAL write state, the state file entry is marked as UNWRITEABLE. For any sporadic write or delete failures, write or delete operations may be retired and the state file entry may be marked when all tries for a credential have failed.

The synchronization ignores the local change if it is marked as UNWRITEABLE and may retry deleting the local credential if it is marked UNWRITEABLE. If the credential is successfully overwritten when it is marked as UNWRITEABLE, or if it disappeared when state file marks it as UNWRITEABLE, the UNWRITEABLE flag may be cleared from the state file entry.

If State file fails to update (e.g., indicating a potentially corrupted state file), the credential roaming may be disabled for the failed client or for a particular user. It may be manually re-enabled if the problem is fixed later. The system may also perform automatic recovery steps to override any bad data by downloading known good data from the remote store at the next invocation interval.

Local cache read failures may also be handled. The read failures may be handled more leniently than update failures so that a read failure of a roaming credential does not affect the roaming for other credentials.

In an exemplary implementation, a credential having a read failure appears in the roaming credential set returned by a GET ALL operation so that synchronization does not treat it as a deletion. Local cache reads may be retried with delay when any failure occurs. If the failure still exists after a number of retries, a roaming credential is nevertheless generated with the UNREADABLE flag bit set. Informational, warning, and/or error events may be traced or logged to facilitate trouble shooting/maintenance.

The operations shown and described herein are merely illustrative of an exemplary implementation of credential roaming. It is noted that the operations are not limited to any particular order. In Fig. 6 for example, operation 620 may occur before, after, or simultaneously with operation 630. In another example, operations 620-670 may be iterative for individual encryption credentials, different types of encryption credentials, or other groupings (or sets) of encryption credentials. Still other operations may also be implemented to enable credential roaming.

<b>Exemplary Computing Device</b>

<b>Fig. 7</b> is a schematic illustration of an exemplary computing device 700 that can be utilized to implement credential roaming. Computing device 700 includes one or more processors or processing units 732, a system memory 734, and a bus 736 that couples various system components including the system memory 734 to processors 732. The bus 736 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. The system memory 734 includes read only memory (ROM) 738 and random access memory (RAM) 740. A basic input/output system (BIOS) 742, containing the basic routines that help to transfer information between elements within computing device 700, such as during start-up, is stored in ROM 738.

Computing device 700 further includes a hard disk drive 744 for reading from and writing to a hard disk (not shown), and may include a magnetic disk drive 746 for reading from and writing to a removable magnetic disk 748, and an optical disk drive 750 for reading from or writing to a removable optical disk 752 such as a CD ROM or other optical media. The hard disk drive 744, magnetic disk drive 746, and optical disk drive 750 are connected to the bus 736 by appropriate interfaces 754a, 754b, and 754c. The drives and their associated computer-readable media provide nonvolatile storage of computer-readable instructions, data structures, program modules and other data for computing device 700. Although the exemplary environment described herein employs a hard disk, a removable magnetic disk 748 and a removable optical disk 752, other types of computer-readable media such as magnetic cassettes, flash memory cards, digital video disks, random access memories (RAMs), read only memories (ROMs), and the like, may also be used in the exemplary operating environment.

A number of program modules may be stored on the hard disk 744, magnetic disk 748, optical disk 752, ROM 738, or RAM 740, including an operating system 758, one or more application programs 760, other program modules 762, and program data 764. A user may enter commands and information into computing device 700 through input devices such as a keyboard 766 and a pointing device 768. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are connected to the processing unit 732 through an interface 756 that is coupled to the bus 736. A monitor 772 or other type of display device is also connected to the bus 736 via an interface, such as a video adapter 774.

Generally, the data processors of computing device 700 are programmed by means of instructions stored at different times in the various computer-readable storage media of the computer. Programs and operating systems may be distributed, for example, on floppy disks, CD-ROMs, or electronically, and are installed or loaded into the secondary memory of a computer. At execution, the programs are loaded at least partially into the computer's primary electronic memory.

Computing device 700 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 776. The remote computer 776 may be a personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to computing device 700. The logical connections depicted in Fig. 7 include a LAN 780 and a WAN 782.

When used in a LAN networking environment, computing device 700 is connected to the local network 780 through a network interface or adapter 784. When used in a WAN networking environment, computing device 700 typically includes a modem 786 or other means for establishing communications over the wide area network 782, such as the Internet. The modem 786, which may be internal or external, is connected to the bus 736 via a serial port interface 756. In a networked environment, program modules depicted relative to the computing device 700, or portions thereof, may be stored in the remote memory storage device. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.

Hosts may include host adapter hardware and software to enable a connection to the communication network. The connection to communication network may be through an optical coupling or more conventional conductive cabling depending on the bandwidth requirements. A host adapter may be implemented as a plug-in card on computing device 700. Hosts may implement any number of host adapters to provide as many connections to communication network as the hardware and software support.

In addition to the specific implementations explicitly set forth herein, other aspects and implementations will be apparent to those skilled in the art from consideration of the specification disclosed herein. It is intended that the specification and illustrated implementations be considered as examples only, with a true scope and spirit of the following claims.