This invention pertains to using information cards, and more particularly to being able use information cards with an untrusted client.
When a user interacts with sites on the Internet (hereafter referred to as “service providers” or “relying parties”), the service provider often expects to know something about the user that is requesting the services of the provider. The typical approach for a service provider is to require the user to log into or authenticate to the service provider's computer system. But this approach, while satisfactory for the service provider, is less than ideal to the user. First, the user must remember a username and password for each service provider who expects such information. Given that different computer systems impose different requirements, and the possibility that another user might have chosen the same username, the user might be unable to use the same username/password combination on each such computer system. (There is also the related problem that if the user uses the same username/password combination on multiple computer systems, someone who hacks one such computer system would be able to access other such computer systems.) Second, the user has no control over how the service provider uses the information it stores. If the service provider uses the stored information in a way the user does not want, the user has relatively little ability to prevent such abuse, or recourse after the fact.
To address this problem, new systems have been developed that allow the user a measure of control over the information stored about the user. Windows CardSpace™ (sometimes called CardSpace) is a Microsoft implementation of an identity meta-system that offers a solution to this problem. (Microsoft, Windows, and CardSpace are either registered trademarks or trademarks of Microsoft Corporation in the United States and/or other countries.) A user can store identity information with an identity provider the user trusts. When a service provider wants some information about the user, the user can control the release of information stored with the identity provider to the service provider. The user can then use the offered services that required the identity information.
While this system simplifies the management of information used to satisfy the requests of service providers, there are potential problems. This system assumes that a client machine is trustworthy. But if the client machine is not trustworthy—if the client might be subject to attacks of different natures—it would be dangerous for a user to use the client with the system. The various attacks to which the client might be subjected might lead to the user involuntarily revealing secret information, which could then be used against the user at a later time.
A need remains for a way to addresses these and other problems associated with the prior art.
In an embodiment of the invention, an untrusted client can engage in a transaction with a relying party. An accessor function acts as an intermediary between the untrusted client and the relying party. The accessor function can invoke the card selector on the untrusted client and act as a pathway through which all sensitive information flows to the relying party. Personal information cards, which normally would be stored directly on the client, can be “managed” on behalf of the user by an identity provider.
In another embodiment of the invention, the accessor function can determine that the relying party can use data stored in an information card, but that the relying party is itself not capable of using the information card system. The accessor function can then invoke the information card system on behalf of this legacy relying party, utilizing data from the information cards in a manner that mimics how the legacy relying party might use the data if the legacy relying party were able to use the information card system.
The foregoing and other features, objects, and advantages of the invention will become more readily apparent from the following detailed description, which proceeds with reference to the accompanying drawings.
Before explaining the invention, it is important to understand the context of the invention.
In
Relying party 130 is a machine managed by a party that relies in some way on the identity of the user of computer system 105. The operator of relying party 130 can be any type of relying party. For example, the operator of relying party 130 can be a merchant running a business on a website. Or, the operator of relying party 130 can be an entity that offers assistance on some matter to registered parties. Relying party 130 is so named because it relies on establishing some identifying information about the user.
Identity provider 135, on the other hand, is managed by a party responsible for providing identity information (or other such information) about the user for consumption by the relying party. Depending on the type of information identity provider 135 stores for a user, a single user might store identifying information with a number of different identity providers 135, any of which might be able to satisfy the request of the relying party. For example, identity provider 135 might be a governmental agency, responsible for storing information generated by the government, such as a driver's license number or a social security number. Or, identity provider 135 might be a third party that is in the business of managing identity information on behalf of users.
The conventional methodology of releasing identity information can be found in a number of sources. One such source is Microsoft Corporation, which has published a document entitled Introducing Windows CardSpace, which can be found on the World Wide Web at http://msdn2.microsoft.com/en-us/library/aa480189.aspx and is hereby incorporated by reference. To summarize the operation of Windows CardSpace, when a user wants to access some data from relying party 130, computer system 105 requests the security policy of relying party 130, as shown in communication 140, which is returned in communication 145 as security policy 150. Security policy 150 is a summary of the information relying party 130 needs, how the information should be formatted, and so on.
Once computer system 105 has security policy 150, computer system 105 can identify which information cards will satisfy security policy 150. Different security policies might result in different information cards being usable. For example, if relying party 130 simply needs a user's e-mail address, the information cards that will satisfy this security policy will be different from the information cards that satisfy a security policy requesting the user's full name, mailing address, and social security number. The user can then select an information card that satisfies security policy 150.
Once the user has selected an acceptable information card, computer system 105 uses the selected information card to transmit a request for a security token from identity provider 135, as shown in communication 155. This request can identify the data to be included in the security token, the credential that identifies the user, and other data the identity provider needs to generate the security token. Identity provider 135 returns security token 160, as shown in communication 165. Security token 160 includes a number of claims, or pieces of information, that include the data the user wants to release to the relying party. Security token 160 is usually encrypted in some manner, and perhaps signed and/or time-stamped by identity provider 135, so that relying party 130 can be certain that the security token originated with identity provider 135 (as opposed to being spoofed by someone intent on defrauding relying party 130). Computer system 105 then forwards security token 160 to relying party 130, as shown in communication 170.
In addition, the selected information card can be a self-issued information card: that is, an information card issued not by an identity provider, but by computer system 105 itself. In that case, identity provider 135 effectively becomes part of computer system 105.
In this model, a person skilled in the art will recognize that because all information flows through computer system 105, the user has a measure of control over the release of the user's identity information. Relying party 130 only receives the information the user wants relying party 130 to have, and does not store that information on behalf of the user (although it would be possible for relying party 130 to store the information in security token 160: there is no effective way to prevent such an act).
The problem with this model is, as noted above, that there is an implicit assumption that client 105 is trustworthy. More specifically, there is an implicit assumption that client 105 is not subject to attacks that might result in sensitive information of the user being captured by a third party. When this assumption is removed—that is, when client 105 is potentially subject to attacks that could leak sensitive information—the problem with this model becomes apparent.
Now that the problem—removing the assumption that client 105 is trustworthy—is understood, embodiments of the invention can be explained. In
A relying party can be relying party 130, a relying party that is capable of processing a security token issued in accordance with the information card system. The relying party can also be a legacy relying party, such as legacy relying party 210. Legacy relying party 210 represents a party with whom trusted client 105 or untrusted client 205 might wish to conduct a transaction, but does not process security tokens issued in accordance with the information card system. For example, legacy relying party 210 might represent a website that expects a user to provide a username and password to access a resource on the website, but does not request a security token from an information card system. Or, legacy relying party 210 might be a website that includes a form that can be filled out from data stored in information card. Or, legacy relying party 210 might be a machine that uses LDAP in order to authenticate credentials and retrieve attribute information; accessor function 215 can populate an LDAP store that can be used by this machine. A person skilled in the art will recognize other types of legacy relying parties, not normally designed to use information card systems, with which embodiments of the invention can be used.
As noted above, when a user uses untrusted client 205 to perform a transaction using the information card system, it is desirable to avoid any sensitive information be made available directly to untrusted client 205. To accomplish this aim, identity provider 135 can store not only the information cards managed by identity provider 135, but also personal information cards created by the user. As discussed above, personal information cards are cards that are self-asserting: the user is asserting the accuracy of the information in the personal information card, rather than some other authority, such as identity provider 135. That identity provider 135 stores personal information cards as well as managed information cards does not represent that identity provider 135 now asserts the information contained in the personal information cards; identity provider 135 is merely offering a service that allows for the use of personal information cards on machines such as untrusted client 205.
As the use of untrusted client 205 depends on identity provider 135 already storing the information cards (either personal or managed), the information cards need to be established before the user can use untrusted client 205. Since establishing information cards involves information about the user that should be kept secret, normally the user will create the information cards on trusted client 105, and then transfer the information cards to identity provider 135, after which the user can use the information cards to perform a transaction on untrusted client 205.
Facilitating communications between trusted client 105, untrusted client 205, relying party 130, legacy relying party 210, and identity provider 135 is accessor function 215. Most communications between trusted client 105 and/or untrusted client 205 on the one hand and identity provider 135, relying party 130, and/or legacy relying party 210 on the other hand pass through accessor function 215, with some exceptions to be discussed below. For example, trusted client 105 and untrusted client 205 communicate with accessor function 215 via lines of communication 220 and 225, respectively. Similarly, identity provider 135, relying party 130, and legacy relying party 210 communicate with accessor function via lines of communication 230, 235, and 240, respectively. (Not shown in
A person skilled in the art might recognize that trusted client 105 can communicate directly with relying party 130 and identity provider 135 without the intervention of accessor function 215. Nevertheless, there is an advantage to including accessor function 215 in the system shown in
Also shown in
As discussed above, legacy relying party 210 represents a relying party that is not capable of using the information card system. Accessor function 215 can detect that legacy relying party 210 is a legacy relying party, and act as a proxy for legacy relying party 210 in using the information card system. Co-pending U.S. patent application Ser. No. 12/019,104, titled “PROCESSING HTML EXTENSIONS TO ENABLE SUPPORT OF INFORMATION CARDS BY A RELYING PARTY”, filed Jan. 24, 2008, and incorporated by reference herein describes how a trusted client can use the information card system on behalf of a legacy relying party. A person skilled in the art will recognize how accessor function can be adapted to provide a similar functionality on behalf of a legacy relying party, separating this functionality from the trusted client.
When the user desires to utilize the information card system from a client (trusted or not), the client can request from identity provider 135 images of any information cards resident on identity provider 135 that belong to the user. The images of the information cards of themselves are not sensitive information, and can be transmitted across any networks, even to an untrusted client. The images of the information cards can be graphical images, such as bitmaps, GIFs, JPGs, or any other desired graphical form, which can be displayed by the client. The images of the information cards can also be structured in a “textual form” that can be displayed by the client. For example, the images can be structured as HTML, XML, or other text-based formats; the client can then process the text-based format and display information about the information card to the user. In either case, the image normally does not include any secret information (which, if made available to an untrusted client, could be captured and used against the user). The user, of course, knows what information is represented by the image of each information card, and therefore can select an appropriate information card to use in the current transaction.
At this point, it is worth noting that the advantage of the virtualization of the user's “wallet” can come at a price. For example, as discussed above, the information card system can use data known about the information cards installed on the system, in conjunction with the security policy from the relying party, to identify installed information cards that can satisfy the security policy. In some embodiments of this invention, the identity provider can transmit to the client only images of information cards that can satisfy the security policy. In such embodiments of the invention, the user can select any information card whose image is shown, in the knowledge that the information card can satisfy the security policy of the relying party. In other embodiments of the invention, however, the identity provider can transmit images of all information cards available at the identity provider, without identifying which information cards can satisfy the security policy of the relying party. In these alternative embodiments of the invention, the burden is on the user to remember which information card might satisfy the security policy of the relying party.
In
Dumb USB device 505 represents a dumb storage device: that is, a storage device that simply stores data, without any inherent security or processing capability. As it lacks any security or processing capabilities, dumb USB device 505 is not considered any more “secure” than untrusted client 205 is. Thus, dumb USB device 505 normally would not store any sensitive information. Dumb USB device 505 is shown as storing personal information card 515 and managed information card 520. These are not true information cards stored on dumb USB device 505; rather, they are merely images representing information cards that can be accessed from some other source, such as an identity provider. When the card selector on untrusted client 205 is invoked, it can detect the presence of dumb USB device 505, and retrieve from the storage therein the images of personal information card 515 and managed information card 520. The user can therefore bring with him on dumb USB device 505 images of information cards the user wants to carry with him, even though the cards themselves remain stored securely at the identity provider.
In contrast, when untrusted client 205 is coupled to smart USB device 510, things can operate a little differently. Because smart USB device 510 is “smart”, smart USB device 510 can securely store information cards, such as personal information card 525 and managed information card 530. In addition, smart USB device 510 can include local secure token service 535. Local secure token service 535 is a trusted secure token service, capable of generating (from within smart USB device 510) a security token responsive to a selected information card. (This of course assumes that the data needed to generate the security token is available within smart USB device 510. For example, local secure token service 535 cannot generate a security token based on managed information card 530, as the data that comprises managed information card 530 is not stored on smart USB device 510, but rather on identity provider 135.) Because smart USB device 510 is secure, and because local secure token service 535 is trusted, local secure token service 535 can generate a security token without any sensitive information being compromised, even though smart USB device 510 is coupled to untrusted client 205, which itself might be compromised.
A comparison with co-pending U.S. patent application Ser. No. 11/843,572, titled “PERFORMING A BUSINESS TRANSACTION WITHOUT DISCLOSING SENSITIVE IDENTITY INFORMATION TO A RELYING PARTY”, filed Aug. 22, 2007, to co-pending U.S. patent application Ser. No. 11/843,638, titled “POLICY-BASED AUDITING OF IDENTITY CREDENTIAL DISCLOSURE BY A SECURE TOKEN SERVICE”, filed Aug. 22, 2007, to co-pending U.S. patent application Ser. No. 11/843,640, titled “FRAMEWORK AND TECHNOLOGY TO ENABLE THE PORTABILITY OF INFORMATION CARDS”, filed Aug. 22, 2007, all of which are herein incorporated by reference, might now be useful. These related applications describe, among other concepts, portable information cards. For example, if the client is coupled to a USB device storing the portable information cards, the client can access the information cards from this USB device. The same is true of any other pluggable card store. But if the client is not trusted, the use of portable information cards as described in these related applications does not avoid the potential revelation of sensitive information on the untrusted client: once the untrusted client has access to the information cards (particularly personal information cards) from the pluggable card store, the sensitive information stored in those cards is vulnerable. In contrast, with remotable information cards, the sensitive information in card stores can be protected.
At this point, it should be clear as to how a client can obtain a list of available information cards. The client can query the identity provider (possibly via the accessor function) for a list of information cards available at the identity provider. Or, the client can access available information cards (either directly available or just images representing information cards available at another source, such as an identity provider) from a locally-coupled data store, such as a USB device. A person skilled in the art will also recognize that a client can generate a list of available information cards by combining multiple sources: for example, both querying an identity provider and accessing a local USB device.
At some point, either the accessor function or an identity provider might request that the user authenticate himself to the system. At block 620 (
Assuming authentication is satisfied (if required), at block 635 the client requests a list of available information cards. As discussed above, this can involve querying an identity provider for list of the information cards available at that identity provider, accessing a local data store, such as a USB device, or some other means. At block 640, the client receives the users selected information card.
At this point, once the information card has been selected, the accessor function needs to receive a security token. As discussed above, with reference to
A person skilled in the art will recognize that normal operation of the information card system has all information flowing through the client: no information normally bypasses the client. Thus, in normal operation, the security token as generated by the identity provider passes through the client before it is delivered to the relying party (in embodiments of the invention, via the accessor function). However, a person skilled in the art will also recognize that, if the security token is considered “sensitive information” (in that the security token represents, usually in encrypted form, data from an information card), the security token can be transmitted from the identity provider directly to the accessor function, bypassing the client. In this embodiment of the invention, it is helpful for the identity provider to also transmit a message to the client, alerting the client that the security token was transmitted directly to the accessor function. In this way, the client is kept aware of the fact that the security token was transmitted to the accessor function, even though the security token did not pass through the client on the way to the accessor function.
As discussed above with reference to block 635, the client can determine a list of available information cards from a number of different sources.
Alternatively, at block 715, the client can request a list of information cards available to it from the accessor function, and at block 720, the client can receive a list of information cards available from the accessor function. In this embodiment of the invention, the accessor function is essentially acting as a proxy for the identity provider(s).
In another alternative, at block 725, the client can access a list of available information cards from a local data store. As discussed above with reference to
The following discussion is intended to provide a brief, general description of a suitable machine in which certain aspects of the invention can be implemented. Typically, the machine includes a system bus to which is attached processors, memory, e.g., random access memory (RAM), read-only memory (ROM), or other state preserving medium, storage devices, a video interface, and input/output interface ports. The machine can be controlled, at least in part, by input from conventional input devices, such as keyboards, mice, etc., as well as by directives received from another machine, interaction with a virtual reality (VR) environment, biometric feedback, or other input signal. As used herein, the term “machine” is intended to broadly encompass a single machine, or a system of communicatively coupled machines or devices operating together. Exemplary machines include computing devices such as personal computers, workstations, servers, portable computers, handheld devices, telephones, tablets, etc., as well as transportation devices, such as private or public transportation, e.g., automobiles, trains, cabs, etc.
The machine can include embedded controllers, such as programmable or non-programmable logic devices or arrays, Application Specific Integrated Circuits, embedded computers, smart cards, and the like. The machine can utilize one or more connections to one or more remote machines, such as through a network interface, modem, or other communicative coupling. Machines can be interconnected by way of a physical and/or logical network, such as an intranet, the Internet, local area networks, wide area networks, etc. One skilled in the art will appreciate that network communication can utilize various wired and/or wireless short range or long range carriers and protocols, including radio frequency (RF), satellite, microwave, Institute of Electrical and Electronics Engineers (IEEE) 545.11, Bluetooth, optical, infrared, cable, laser, etc.
The invention can be described by reference to or in conjunction with associated data including functions, procedures, data structures, application programs, instructions, etc. which, when accessed by a machine, result in the machine performing tasks or defining abstract data types or low-level hardware contexts. Associated data can be stored in, for example, the volatile and/or non-volatile memory, e.g., RAM, ROM, etc., or in other storage devices and their associated storage media, including hard-drives, floppy-disks, optical storage, tapes, flash memory, memory sticks, digital video disks, biological storage, and other tangible, physical storage media. Associated data can also be delivered over transmission environments, including the physical and/or logical network, in the form of packets, serial data, parallel data, propagated signals, etc., and can be used in a compressed or encrypted format. Associated data can be used in a distributed environment, and stored locally and/or remotely for machine access.
Having described and illustrated the principles of the invention with reference to illustrated embodiments, it will be recognized that the illustrated embodiments can be modified in arrangement and detail without departing from such principles, and can be combined in any desired manner. And although the foregoing discussion has focused on particular embodiments, other configurations are contemplated. In particular, even though expressions such as “according to an embodiment of the invention” or the like are used herein, these phrases are meant to generally reference embodiment possibilities, and are not intended to limit the invention to particular embodiment configurations. As used herein, these terms can reference the same or different embodiments that are combinable into other embodiments.
Consequently, in view of the wide variety of permutations to the embodiments described herein, this detailed description and accompanying material is intended to be illustrative only, and should not be taken as limiting the scope of the invention. What is claimed as the invention, therefore, is all such modifications as can come within the scope and spirit of the following claims and equivalents thereto.
This application is a continuation-in-part of co-pending U.S. patent application Ser. No. 11/843,572, titled “PERFORMING A BUSINESS TRANSACTION WITHOUT DISCLOSING SENSITIVE IDENTITY INFORMATION TO A RELYING PARTY”, filed Aug. 22, 2007, of co-pending U.S. patent application Ser. No. 11/843,638, titled “POLICY-BASED AUDITING OF IDENTITY CREDENTIAL DISCLOSURE BY A SECURE TOKEN SERVICE”, filed Aug. 22, 2007, and of co-pending U.S. patent application Ser. No. 11/843,640, titled “FRAMEWORK AND TECHNOLOGY TO ENABLE THE PORTABILITY OF INFORMATION CARDS”, filed Aug. 22, 2007, all of which are herein incorporated by reference for all purposes. Co-pending U.S. patent application Ser. No. 11/843,572, titled “PERFORMING A BUSINESS TRANSACTION WITHOUT DISCLOSING SENSITIVE IDENTITY INFORMATION TO A RELYING PARTY”, filed Aug. 22, 2007, co-pending U.S. patent application Ser. No. 11/843,638, titled “POLICY-BASED AUDITING OF IDENTITY CREDENTIAL DISCLOSURE BY A SECURE TOKEN SERVICE”, filed Aug. 22, 2007, and co-pending U.S. patent application Ser. No 11/843,640, titled “FRAMEWORK AND TECHNOLOGY TO ENABLE THE PORTABILITY OF INFORMATION CARDS”, filed Aug. 22, 2007, all claim the benefit of U.S. Provisional Patent Application Ser. No. 60/895,312, filed Mar. 16, 2007, U.S. Provisional Patent Application Ser. No. 60/895,316, filed Mar. 16, 2007, and U.S. Provisional Patent Application Ser. No. 60/895,325, filed Mar. 16, 2007, all of which are herein incorporated by reference for all purposes. This application is also a continuation-in-part of co-pending U.S. patent application Ser. No. 12/019,104, titled “PROCESSING HTML EXTENSIONS TO ENABLE SUPPORT OF INFORMATION CARDS BY A RELYING PARTY”, filed Jan. 24, 2008, which claims the benefit of U.S. Provisional Patent Application Ser. No. 60/973,679, filed Sep. 19, 2007, both of which are herein incorporated by reference for all purposes. This application is also a continuation-in-part of co-pending U.S. patent application Ser. No. 12/029,373, filed Feb. 11, 2008, which is herein incorporated by reference for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
4153931 | Green et al. | May 1979 | A |
5073950 | Colbert et al. | Dec 1991 | A |
5485510 | Colbert | Jan 1996 | A |
5546471 | Merjanian | Aug 1996 | A |
5546523 | Gatto | Aug 1996 | A |
5594806 | Colbert | Jan 1997 | A |
5613012 | Hoffman et al. | Mar 1997 | A |
5848412 | Rowland et al. | Dec 1998 | A |
6028950 | Merjanian | Feb 2000 | A |
6055595 | Tachibana et al. | Apr 2000 | A |
6327578 | Linehan | Dec 2001 | B1 |
6363488 | Ginter et al. | Mar 2002 | B1 |
6481621 | Herrendoerfer et al. | Nov 2002 | B1 |
6513721 | Salmre et al. | Feb 2003 | B1 |
6612488 | Suzuki | Sep 2003 | B2 |
6721713 | Guheen et al. | Apr 2004 | B1 |
6880155 | Schwabe et al. | Apr 2005 | B2 |
6913194 | Suzuki | Jul 2005 | B2 |
6970836 | Paltenghe et al. | Nov 2005 | B1 |
7003501 | Ostroff | Feb 2006 | B2 |
7103575 | Linehan | Sep 2006 | B1 |
7104444 | Suzuki | Sep 2006 | B2 |
7210620 | Jones | May 2007 | B2 |
7225156 | Fisher et al. | May 2007 | B2 |
7231369 | Hirabayashi | Jun 2007 | B2 |
7353532 | Duri et al. | Apr 2008 | B2 |
7360237 | Engle et al. | Apr 2008 | B2 |
7416486 | Walker et al. | Aug 2008 | B2 |
7444519 | Laferriere et al. | Oct 2008 | B2 |
7487920 | Sato et al. | Feb 2009 | B2 |
7494416 | Walker et al. | Feb 2009 | B2 |
7500607 | Williams | Mar 2009 | B2 |
7529698 | Joao | May 2009 | B2 |
7537152 | Chakiris et al. | May 2009 | B2 |
RE40753 | Wang et al. | Jun 2009 | E |
7555460 | Barkan | Jun 2009 | B1 |
7565329 | Lapsley et al. | Jul 2009 | B2 |
7591424 | Wang et al. | Sep 2009 | B2 |
7594258 | Mao et al. | Sep 2009 | B2 |
7610040 | Cantini et al. | Oct 2009 | B2 |
7613659 | Hoffman et al. | Nov 2009 | B1 |
7620177 | Ibrahim et al. | Nov 2009 | B2 |
7636941 | Blinn et al. | Dec 2009 | B2 |
7661585 | Joao | Feb 2010 | B2 |
7664022 | Hu | Feb 2010 | B2 |
7747540 | Cameron et al. | Jun 2010 | B2 |
7771273 | Walker et al. | Aug 2010 | B2 |
7788499 | Cameron et al. | Aug 2010 | B2 |
7797434 | Blakley et al. | Sep 2010 | B2 |
7831522 | Satish et al. | Nov 2010 | B1 |
7860883 | Hinton et al. | Dec 2010 | B2 |
20010007983 | Lee | Jul 2001 | A1 |
20020026397 | Ieta et al. | Feb 2002 | A1 |
20020029337 | Sudia et al. | Mar 2002 | A1 |
20020029342 | Keech | Mar 2002 | A1 |
20020046041 | Lang | Apr 2002 | A1 |
20020095360 | Joao | Jul 2002 | A1 |
20020103801 | Lyons | Aug 2002 | A1 |
20020116647 | Mont et al. | Aug 2002 | A1 |
20020178370 | Gurevich et al. | Nov 2002 | A1 |
20030061170 | Uzo | Mar 2003 | A1 |
20030126094 | Fisher et al. | Jul 2003 | A1 |
20030158960 | Engberg | Aug 2003 | A1 |
20030172090 | Asunmaa et al. | Sep 2003 | A1 |
20030217140 | Burbeck et al. | Nov 2003 | A1 |
20030218062 | Noriega et al. | Nov 2003 | A1 |
20040019571 | Hurwitz et al. | Jan 2004 | A1 |
20040128392 | Blakley et al. | Jul 2004 | A1 |
20040162786 | Cross et al. | Aug 2004 | A1 |
20040199475 | Rivest et al. | Oct 2004 | A1 |
20040199787 | Hans et al. | Oct 2004 | A1 |
20040230831 | Spelman et al. | Nov 2004 | A1 |
20050033692 | Jarman et al. | Feb 2005 | A1 |
20050091543 | Holtzman et al. | Apr 2005 | A1 |
20050097550 | Schwabe et al. | May 2005 | A1 |
20050124320 | Ernst et al. | Jun 2005 | A1 |
20050135240 | Ozugur | Jun 2005 | A1 |
20050229005 | Le Saint et al. | Oct 2005 | A1 |
20050247777 | Pitroda | Nov 2005 | A1 |
20050247797 | Ramachandran | Nov 2005 | A1 |
20050289080 | Rhiando | Dec 2005 | A1 |
20060020679 | Hinton et al. | Jan 2006 | A1 |
20060136990 | Hinton et al. | Jun 2006 | A1 |
20060155993 | Busboon | Jul 2006 | A1 |
20060200424 | Cameron et al. | Sep 2006 | A1 |
20060206931 | Dillaway et al. | Sep 2006 | A1 |
20060224611 | Dunn et al. | Oct 2006 | A1 |
20060235796 | Johnson et al. | Oct 2006 | A1 |
20070016484 | Waters et al. | Jan 2007 | A1 |
20070016943 | M'Raihi et al. | Jan 2007 | A1 |
20070043651 | Xiao et al. | Feb 2007 | A1 |
20070061567 | Day et al. | Mar 2007 | A1 |
20070118449 | De La Motte | May 2007 | A1 |
20070143835 | Cameron et al. | Jun 2007 | A1 |
20070192245 | Fisher et al. | Aug 2007 | A1 |
20070203852 | Cameron et al. | Aug 2007 | A1 |
20070204168 | Cameron et al. | Aug 2007 | A1 |
20070204325 | Cameron et al. | Aug 2007 | A1 |
20070208869 | Adelman et al. | Sep 2007 | A1 |
20070214429 | Lyudovyk et al. | Sep 2007 | A1 |
20070282951 | Selimis et al. | Dec 2007 | A1 |
20070294431 | Adelman et al. | Dec 2007 | A1 |
20080003977 | Chakiris et al. | Jan 2008 | A1 |
20080010675 | Massascusa et al. | Jan 2008 | A1 |
20080071808 | Hardt et al. | Mar 2008 | A1 |
20080098228 | Anderson et al. | Apr 2008 | A1 |
20080140576 | Lewis et al. | Jun 2008 | A1 |
20080141339 | Gomez et al. | Jun 2008 | A1 |
20080141366 | Cross et al. | Jun 2008 | A1 |
20080162297 | Hershkovitz et al. | Jul 2008 | A1 |
20080178271 | Gajjala et al. | Jul 2008 | A1 |
20080178272 | Gajjala et al. | Jul 2008 | A1 |
20080184339 | Shewchuk et al. | Jul 2008 | A1 |
20080189778 | Rowley | Aug 2008 | A1 |
20080196096 | Grynberg | Aug 2008 | A1 |
20080222714 | Wahl | Sep 2008 | A1 |
20080229410 | Felsted et al. | Sep 2008 | A1 |
20080235144 | Phillips | Sep 2008 | A1 |
20080244722 | Satish et al. | Oct 2008 | A1 |
20080256594 | Satish et al. | Oct 2008 | A1 |
20080263644 | Grinstein | Oct 2008 | A1 |
20080313567 | Sabin et al. | Dec 2008 | A1 |
20090037920 | Brown et al. | Feb 2009 | A1 |
20090077118 | Doman et al. | Mar 2009 | A1 |
20090077627 | Doman et al. | Mar 2009 | A1 |
20090089625 | Kannappan et al. | Apr 2009 | A1 |
20090089870 | Wahl | Apr 2009 | A1 |
20090089871 | Murphy et al. | Apr 2009 | A1 |
20090099860 | Karabulut et al. | Apr 2009 | A1 |
20090125558 | Suh | May 2009 | A1 |
20090138398 | Cole et al. | May 2009 | A1 |
20090178112 | Doman et al. | Jul 2009 | A1 |
20090186701 | Rowe et al. | Jul 2009 | A1 |
20090204622 | Sanders et al. | Aug 2009 | A1 |
20090205014 | Doman et al. | Aug 2009 | A1 |
20090205035 | Sermersheim et al. | Aug 2009 | A1 |
20090216666 | Antao et al. | Aug 2009 | A1 |
20090241178 | Burch et al. | Sep 2009 | A1 |
20090249430 | Buss et al. | Oct 2009 | A1 |
20090254476 | Sharma et al. | Oct 2009 | A1 |
20090254483 | Barkan | Oct 2009 | A1 |
20090260064 | McDowell et al. | Oct 2009 | A1 |
20090300512 | Ahn | Dec 2009 | A1 |
20090300747 | Ahn | Dec 2009 | A1 |
20090320095 | Nanda et al. | Dec 2009 | A1 |
20090328166 | Burch et al. | Dec 2009 | A1 |
20100037303 | Sharif et al. | Feb 2010 | A1 |
20100274691 | Hammad et al. | Oct 2010 | A1 |
20110023103 | Dietrich et al. | Jan 2011 | A1 |
Number | Date | Country |
---|---|---|
0917120 | May 1999 | EP |
11003382 | Jan 1999 | JP |
11039540 | Feb 1999 | JP |
11154260 | Jun 1999 | JP |
WO9823062 | May 1998 | WO |
WO2008088945 | Jul 2008 | WO |
Number | Date | Country | |
---|---|---|---|
20090328166 A1 | Dec 2009 | US |
Number | Date | Country | |
---|---|---|---|
60895312 | Mar 2007 | US | |
60895316 | Mar 2007 | US | |
60895325 | Mar 2007 | US | |
60973679 | Sep 2007 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11843572 | Aug 2007 | US |
Child | 12111874 | US | |
Parent | 11843638 | Aug 2007 | US |
Child | 11843572 | US | |
Parent | 11843640 | Aug 2007 | US |
Child | 11843638 | US | |
Parent | 12019104 | Jan 2008 | US |
Child | 11843640 | US | |
Parent | 12029373 | Feb 2008 | US |
Child | 12019104 | US |