US 7,165,181 B2Grant
System and method for establishing trust without revealing identity
Issue Date:2007-01-16
•31 Claims
•8 Drawing Sheets
Abstract
One aspect of an embodiment of the invention provides a method, system, and device to prove to a challenger that a prover device has a signature from a device manufacturer without revealing the signature to the challenger. According to one implementation, a challenger is provided with the result of a one-way function of a secret held by a prover device. An interactive proof is employed, between the prover device and the challenger, to prove to the challenger that the secret used in the one-way function has been signed by a device signature without revealing the secret or the device signature or the prover device's identity to the challenger.
Metadata
Assignee
- Intel Corporation
Inventor
- Ernie F. Brickell
Application Information
Application Number:US 10/306,336
Filing Date:2002-11-27
Priority Date:2002-11-27
Art Unit:2132
Classifications
IPC:
G06F9/00
Patent Drawings (8 sheets)
Description
Field
[0001] Various embodiments of the invention pertain generally to secure communications. More particularly, at least one embodiment of the invention relates to enabling a first device to prove to a second device that it has a valid signature without revealing said signature.
Background
[0002] In many modern communication systems, including computer networks, the reliability and security of the information being exchanged is a significant concern.
[0003] For example, in the Trusted Computing Platform Alliance(TCPA) model, each computer (PC) has a trusted hardware device called a Trusted Platform Module (TPM). In one implementation, the TPM may record information about the software and hardware environment of the PC. Each TPM has a unique endorsement key (EK). There is a certificate issued to the EK which contains information about the TPM and platform. When an outside party, hereinafter called a challenger, wants to know the software and/or hardware environment of the PC, the challenger can ask the TPM to give a report. The challenger wants to be sure that the report is really coming from a valid TPM. The owner of the PC wants to maintain as much privacy as possible. In particular, the owner of the PC wants to be able to give reports to two different challengers without those challengers being able to determine that the reports are coming from the same TPM.
[0004] One solution proposed by the TCPA was to establish Trusted Third Parties (TTP). The TPM would create an Attestation Identify Key (AIK) and would send the public portion of the key in a certificate request signed by the EK to a TTP. The TTP would check that the EK was valid, that the signature was okay, and would issue a certificate for the AIK. The TPM would then use the AIK and the certificate of the TTP when the TPM received a request from a challenger. These would be unrelated to the EK, and thus the challenger would get no information about the AIK. The problem with this approach is that it requires TTPs to be established. In practice, identifying parties that can serve as TTPs and a feasible business model for this approach has proven to be a substantial obstacle.
[0005] Thus, the need for TTPs in the TCPA architecture has been a problem. However, no one has suggested a cryptographic protocol that achieved the anonymity and security requirements without the use of a TTP.
Brief Description of the Drawings
[0006] FIG. 1 illustrates a system where a direct proof scheme may be implemented according to an embodiment of the invention.
[0007] FIG. 2 is a block diagram illustrating one embodiment of a platform including a Trusted Platform Module according to one embodiment of the invention.
[0008] FIG. 3 illustrates a procedure to setup a TPM during manufacturing according to one embodiment of the invention.
[0009] FIG. 4 illustrates the setup performed for each platform manufactured according to one embodiment of the invention.
[0010] FIG. 5 illustrates an interactive proof method for a platform (prover) to prove to a challenger that it knows authentication information without revealing that information according to one embodiment of the invention.
[0011] FIG. 6 is a flow diagram illustrating a method between a challenger and platform to implement the interactive proof (IP1) of FIG. 5 .
[0012] FIG. 7 is a flow diagram illustrating a method between a challenger and platform to implement the interactive proof (IP2) of FIG. 5 .
[0013] FIG. 8 illustrates how a direct proof may be implemented in a limited number of rounds to expedite the authentication process according to one embodiment of the invention.
Detailed Description
[0014] In the following detailed description of various embodiments of the invention, numerous specific details are set forth in order to provide a thorough understanding of various aspects of one or more embodiments of the invention. However, one or more embodiments of the invention may be practiced without these specific details. In other instances, well known methods, procedures, and/or components have not been described in detail so as not to unnecessarily obscure aspects of embodiments of the invention.
[0015] In the following description, certain terminology is used to describe certain features of one or more embodiments of the invention. For instance, “platform” includes any type of device, computer, processing unit, etc. The term “challenger” refers to any person, platform, system, software, and/or device that requests some verification of authenticity or authority from a requester prior to disclosing or providing the requested information to the requester. The term “prover” (e.g., prover device) refers to any person, platform, system, software, and/or device that has been requested to provide some proof of its authority, validity, and/or identity. The term “device manufacturer” (e.g., Device Manufacturer C) refers to any person, platform, system, entity, software, and/or device that manufactures or configures a device or platform (e.g., a Trusted Platform Module). The term “device manufacturer” may be used interchangeably with the term “certifying manufacturer”. The term “HASH” refers to any hashing function or algorithm or its equivalent.
[0016] Throughout the description and illustration of the various embodiments of the invention discussed hereinafter, coefficients, variables, and other symbols are referred to by the same label or name. Therefore, where a symbol (e.g., h) appears in different parts of the explanation, the same symbol is being referred to throughout.
[0017] One aspect of an embodiment of the invention presents a way to provide an authentication system with anonymity for devices without the use of a Trusted Third Party (TTP).
[0018] One aspect of an embodiment of the invention provides a method, system, and device to prove to a challenger that a prover platform or device has a signature from a device manufacturer without revealing the signature to the challenger.
[0019] Another aspect of an embodiment of the invention provides a method, system, and device to provide to a challenger the result of a one-way function of a secret held by a prover device (e.g., the requesting device), and to prove to the challenger that the secret used in the one-way function has been signed by a device signature without revealing the secret or the signature to the challenger.
[0020] As used herein, to “prove” or “convince” a challenger that a prover has or knows a signature or secret means that, based on the information and proof disclosed to the challenger, it is highly probabilistically likely that the prover has the signature or secret. To prove this to a challenger without “revealing” or “disclosing” the signature or secret to the challenger means that, based on the information disclosed to the challenger, it would be computationally infeasible to determine the signature or secret.
[0021] Such proofs are hereinafter referred to as direct proofs. The term “direct proof” refers to interactive proofs and/or zero-knowledge proofs, as these types of proofs are commonly known in the field.
[0022] FIG. 1 illustrates a system where a direct proof scheme according to an embodiment of the invention may be implemented. A Platform A 102 (Challenger) requests that Platform B 104 (Prover) provide some information about itself and Platform B 104 provides said requested information. However, Platform A 102 wants to make sure that the requested information came from a device manufactured by Device Manufacturer C. Thus, Platform A 102 challenges Platform B 104 to show that it has a signature generated by Device Manufacturer C. Platform B 104 replies to such request by providing information which convinces Platform A 102 that Platform B 104 has a signature generated by a Device Manufacturer C, without revealing the signature.
[0023] In one embodiment of the invention, Platform B 104 may include a Trusted Platform Module (TPM) 106. It is manufactured by a device manufacturer so that it performs the functions necessary for this invention and conforms to the operations of the protocols described herein. In general, the TPM should be manufactured to maintain the security features described herein. For example, in the protocol IP1 described below and illustrated in FIG. 6 , the TPM performs specified functions using specified values. A TPM should be manufactured or configured to use values (e.g., the values specified below) that would not create a security flaw in the protocol (e.g., make it likely that a device's identify can be determined, etc.).
[0024] FIG. 2 is a block diagram illustrating one embodiment of a device or platform 200 (e.g., Platform B 104) with a Trusted Platform Module (TPM) 204 according to one embodiment of the invention. The device 200 may include a processing unit 202 coupled to the TPM 204. In one implementation, a storage device 206 may also be included in the device 200 to permit storage of information about the device 200 (e.g., hardware information, software information, etc.). In various implementations of the invention, the platform or device 200 may be an electronic device such as a computer, mobile device, etc.
[0025] FIG. 3 illustrates the setup performed for each platform class according to one embodiment of the invention. A platform class may be defined by the device manufacturer to include one or more types of platforms or devices. For instance, a platform class may be the set of all platforms that have the same security relevant information. Each platform has a set of security relevant information about the platform. This information could contain some of the information that is included in the EK or AIK certificate in the TCPA model. It could also include the manufacturer and model number of the particular platform or device.
[0026] For each platform class, a device manufacturer creates the cryptographic parameters that the manufacturer uses for that platform class. The device manufacturer creates a signature key that it uses to sign the secrets for the devices (e.g., device 200) that it manufactures.
[0027] In one embodiment of the invention, the device manufacturer employs the RSA algorithm (a public-key cryptosystem defined by Ronald Rivest, Adi Shamir, and Leonard Adelman) to create an RSA public, private key pair with public modulus n, public exponent d, and private exponent e 302. This can be created using well known methods, such as those described in Applied Cryptography, by Bruce Schneier, John Wiley & Sons; ISBN: 0471117099; Second Edition (Oct. 18, 1995). The modulus n should be chosen large enough so that it was computationally infeasible to factor n.
[0028] The device manufacturer specifies a parameter Z, which is an integer between zero (0) and n 304.
[0029] The device manufacturer specifies a security parameter W, which is an integer between zero (0) and n 306. However, picking W too small or too large may introduce a security failure. In one implementation it may be recommended that W be chosen between 2160 and n/2160. Accordingly, choosing W to be approximately √{square root over (n)} may be a reasonable choice.
[0030] In one embodiment of the invention, the device manufacturer computes a prime number P, such that P=u*n+1 308. There is nothing special about the value of u, other than that u*n+1 is a prime number. For example, the smallest such value u can be used. Generally, the value P should to be large enough so that computing discrete logarithms mod P is computationally infeasible.
[0031] The device manufacturer generates a Platform Class Certificate that includes the cryptographic parameters e, n, u, P, Z, W, the security relevant information of the platform class, and the name of the device manufacturer 310. In one embodiment, the parameters u and P would not both be included since given n and one of these parameters, the other can be computed by P=u*n+1.
[0032] In one embodiment of the invention, the device manufacturer uses the same e, n, u, P, W for several different platform classes, and just varies the value Z for the different platforms. In this case, the values of Z should be chosen to differ by at least 4 W.
[0033] Once the Platform Class Certificate is generated, the device manufacturer provides the Class Certificate to the devices it manufactures which belong to that particular platform class 312.
[0034] The distribution of the Platform Class Certificate from a prover device or platform (e.g., Platform A in FIG. 1 ) to a challenger may be accomplished in a number of ways without deviating from one or more embodiments of the invention. These cryptographic parameters, i.e., Platform Class Certificate, should be distributed to the challenger in such a way that the challenger is convinced that the Class Certificate was generated by the device manufacturer. There are accepted standard methods for doing this, either through distributing the parameters directly to the challenger, or by having the Platform Class Certificate signed by a certifying authority. In this latter case, the public key of the certifying authority must be distributed to the challenger, and the signed Platform Class Certificate can be given to each device or platform (e.g., prover device) in the Platform Class. The device can then give the signed Platform Class Certificate to the challenger.
[0035] FIG. 4 illustrates the setup performed for a Prover Platform or Device manufactured according to one embodiment of the invention. The Prover Device chooses a random number m such that 0<m−Z<W 402. The Prover Device may blind this random number m before sending it to the Certifying Manufacturer for a signature 404. In this case, the Prover Device chooses a random number, B, between 1 and n−1 406, and computes A=Be mod n 408. The Prover Device computes m′=m*A mod n 410.
[0036] If the Device does not blind m, then the Device uses m′=m and A=1 412.
[0037] The Prover Device sends m′ to the Certifying Manufacturer 414. The Certifying Manufacturer computes c′=m′d mod n 416, and gives c′ to the Device 418. The Device computes c=c′*B−1 mod n 420. Notice that this implies that c=md mod n. The numbers c and m are then stored in the TPM 422. The pair, c and m, is referred to as a signature of the Device Manufacturer.
[0038] FIG. 5 illustrates a method for a Prover Device to prove to a Challenger that it has a signature from the Certifying Manufacturer without revealing the signature according to one embodiment of the invention. A Challenger (e.g., Platform A 102) may send a message seeking validity (e.g., ascertain the validity of the device) from a Prover Device (e.g., Device B 104) having a TPM 502. This message may contain the name of the Challenger. The Prover Device sends a device certificate (e.g., Platform Class Certificate) to the Challenger including the number n 504. The TPM in the Prover Device creates an AIK private-public key pair 506. The private-public key pair includes a public key and a private key. In one embodiment, the TPM could have created the AIK private-public key pair sometime earlier. The TPM creates or generates a value h 508. The value h may be determined in a number of ways, including randomly generating the value h and generating the value h in a deterministic manner. The h value should have the property that hn=1 mod P and that the TPM uses a different h value for each challenger.
[0039] In one embodiment of the invention, the value h may be generated in a random or pseudo-random manner. For example, the TPM may select a random number j between 1 and n−1, and compute h=ju mod P.
[0040] The TPM computes a k value, k=hm mod P 510. The Prover Device then sends the Challenger the computed values h and k and the AIK public key 512.
[0041] In another embodiment of the invention, the value h may be generated in a deterministic manner. For example, the TPM may compute h in a deterministic manner from the name of the Challenger. One method to do this is to compute Hi=HASH(i, name of Challenger), for several values, say ten (10), of i=1,2,3 . . . ,10 and then to let j=the concatenation of H1∥H2∥H3 . . . ∥H10. Then, as above, the TPM computes h=ju mod P, where u=(P−1)/n as defined earlier. The TPM computes a k value, k=hm mod P. The Prover Device then sends the Challenger the computed value k and the AIK public key. The user of the TPM wants to be assured that a single h is not used with multiple parties, since this would break the anonymity of this TPM with these multiple parties. Therefore the TPM or the Prover Device might keep a list of all of the h values that it had used, so that it could disallow the use of a repeat, or at least inform the user if one was repeated. In one implementation of the invention, the Prover Device may also display the name of the Challenger, so that the Prover Device user would know the name. In this embodiment, a Challenger is sure that for every TPM key, there is only one k=hm mod P that the TPM can have in the proof. So if the Challenger stores the k, along with the AIK, the Challenger can be sure that a single TPM hasn't created more than one AIK. This method may be referred to as the single h per Challenger method.
[0042] A single service provider could establish multiple challengers, each with its own name, and thus its own h. The different challengers would not be able to correlate the AIKs from a single TPM. It is an implementation decision of a service provider whether to allow multiple challengers within his business.
[0043] The Prover Device then engages in an interactive proof (IP1) with the Challenger 514 that it knows a pair of values c and m such that m=ce mod n and k=hm mod P. The Prover Device also engages in an interactive proof with the Challenger in a second interactive proof (IP2) indicating that the discrete log of k base h is between Z and Z+W 516. FIGS. 6 and 7 give illustrative embodiments of these two interactive proofs IP1 and IP2.
[0044] FIG. 6 is a flow diagram illustrating a method between a Challenger and Prover Device to implement the interactive proof IP1 of FIG. 5 according to one embodiment of the invention. The IP1 can be employed to prove that a TPM knows values c and m such that m=ce mod n and k=hm mod P without the TPM (part of the Prover Device) revealing c or m. The Challenger supplies an Assurance Parameter (AP) to the Prover Device, for instance, a value between ten (10) and forty (40) 602. The TPM then randomly selects a value x mod n 604. The TPM computes a value y 606, such that x*y=c mod n, and computes a value v, such that v=h(xe mod n) mod P 608. The TPM sends the value v to the Challenger 610. The TPM computes the values of HASH(AIK public key, x) and HASH(AIK public key, y) 611. The Challenger then elects to receive either x or y 612. If the Challenger elects to receive x, then the TPM sends x to the Challenger 614. The Challenger verifies that v=h(xe mod n) mod P and that the HASH(AIK public key, x) was correctly sent. Otherwise, if the Challenger elects to receive y 618, then the TPM sends y to the Challenger, and the Challenger verifies that k=v(ye mod n) mod P and that the HASH(AIK public key, y) was correctly sent 620. In one embodiment of the invention, this verification scheme is performed AP times 622.
[0045] FIG. 7 is a flow diagram illustrating a method between a Challenger and Prover Device to implement the interactive proof IP2 of FIG. 5 according to one embodiment of the invention. The IP2 can be employed to prove that a TPM knows a value m such that Z−W<m<Z+2*w, and k=hm mod P without the TPM revealing m.
[0046] The Challenger supplies an Assurance Parameter (AP) to the Prover Device, for instance, a value between ten (10) and forty (40) 701. The TPM (part of the Prover Device) randomly selects a number t such that 0<t<W 702. The TPM computes g0=ht mod P 704 and g1=g0*h(−w) mod P 706. The TPM generates two random 160-bit values, R0 and R1 708, computes H0=HASH(AIK public key, g0, R0) and H1=HASH(AIK public key, g1, R1) 710, and sends H0 and H1 to the Challenger in random order 712.
[0047] The Challenger selects from two choices 714, for example, either choice 0 or 1.
[0048] If the Challenger selects choice 0, then the TPM sends t, R0, R1, and the ordering of H0 and H1 to the Challenger 716. The Challenger computes g0=t mod P and g1=h(t−W) mod P 718. The Challenger checks that 0<t<W 720. The Challenger also checks that H0=HASH(AIK public key, g0, R0) and H1=HASH (AIK public key, g1, R1) 722. The Challenger accepts if all of these checks pass 724.
[0049] If the Challenger selects choice 1, then if m+t is in the interval between Z and Z+W 726, the TPM sends m′=m+t, g0 and R0, 728 and informs the Challenger to use the H0. The Challenger checks that H0=HASH(AIK public key, g0, R0), that m′ is in the interval between Z and Z+W, and that g0*k=hm′ mod P 730. If m+t>Z+W, then the TPM sends m′=m−W+t, g1 and R1 732 and informs the Challenger to use the H1. The Challenger checks that H1=HASH (AIK public key, g1, R1), that Z<m′<Z+W, and that g1*k=hm′ mod P 734. The Challenger accepts if the above checks pass 724.
[0050] In one embodiment of IP2, the above procedures are repeated AP times 723. Note that, repeating the procedure for IP1, as illustrated in FIG. 6 reference 622, and/or IP2, as illustrated in FIG. 7 reference 723, makes it less likely that an unauthorized or cheating prover can succeed in providing adequate proof to a challenger. That is, repeating a proof (e.g., IP1 or IP2) AP times forces a prover to succeed on each round, which is a 1 in 2AP chance.
[0051] After the TPM has successfully completes the IP1 and IP2 processes described above, the Challenger is convinced that the Prover Device/TPM knows values m and c such that Z−W<m<Z+2*W, and c=md mod n. In other words, c is a signature of m. To compute a signature of m for a given value in the interval is equivalent to breaking RSA. To compute a signature of any value in the interval without knowing the factorization of the modulus n, is a difficult computational problem.
[0052] The protocols described in FIGS. 6 and 7 have the disadvantage of requiring multiple rounds of communications between the TPM (Prover Device) and Challenger. However, in another embodiment of the invention, these protocols may be converted to limited round protocols.
[0053] FIG. 8 illustrates how a direct proof may be implemented in a limited number of communications to expedite the authentication process according to one embodiment of the invention. The TPM generates an AIK private-public key pair, which includes an AIK public key and a AIK private key, and sends the AIK public key (or just the HASH of the AIK public key) to the Challenger 802. The Challenger selects an assurance parameter (AP) 804, selects a 2*AP set of random bits (CHOICES) 806, and selects an additional Random Filler of three hundred twenty (320) random bits 808. The Challenger then sets RAND=CHOICES∥Random Filler 810, calculates Commitment=(Public AIK key∥RAND), and sends the HASH of Commitment to the TPM, which the TPM stores 812.
[0054] The TPM determines an h value to use with this Challenger using one of the methods described above, either generating h using a random method or generating the h from the name of the Challenger in the single h per Challenger method 818.
[0055] Instead of serially computing values one loop at a time as illustrated in FIGS. 6 and 7 , the TPM now generates all the calculations for all rounds (loops) of the method for both interactive proofs (IP1 and IP2) and sends all of the calculated values for all rounds to the Challenger 820. The set of calculated values would include, k, h; from each round of IP1, v, HASH(AIK public key, x), and HASH(AIK public key, y); and from each round of IP2, H0 and H1. The Challenger then sends the value of RAND to the TPM 822. The TPM verifies that the first bits of the Commitment are the hash of the public AIK key and uses the first 2*AC bits of RAND as the choices for the challenger during the protocol 824. The TPM prepares the responses for all of the rounds based on these choices, and then sends them all of the responses back to the Challenger.
[0056] In one embodiment of the limited communications version, the HASH(AIK public key, x) and the HASH(AIK public key, y) is not sent to the Challenger. Similarly, the value of H0=HASH (g0, R0) instead of HASH (AIK public key, g0, R0) and H1 is HASH(g1,R1) instead of HASH(AIK public key, g1, R1).
[0057] In certain implementations, it may be desirable to allow Challengers to revoke a TPM if it is determined or suspected that the TPM or its key(s) has been compromised.
[0058] One instance in which a Challenger may determine that a Prover Device's TMP has been compromised is that a key (c and m) for a compromised TPM may be widely disseminated, such as a posting on the web. In this instance, the Challenger can revoke that TPM. For example, suppose that c0 and m0 are the keys of the compromised TPM that have been posted. Whenever the Challenger sees an h value, the Challenger computes k0=hm0 mod P. If this matches the value k given by the prover, then the Challenger knows that the m used by the prover matches the m0 of the compromised TPM, and thus the Challenger will not accept it.
[0059] In another embodiment of revocation, suppose the Challenger always stores the h and k values together with the AIK values. Then when a Challenger receives compromised keys c0 and m0, the Challenger can check to see if any of the h and k values received were computed using the compromised keys c0 and m0. He does this by computing k0=hm0 mod P and checking to see if that matched the k value he received from the TPM. If so, he revokes the corresponding AIK value. If the single h per Challenger method is being used, then the computation by the Challenger is easier, since the Challenger just needs to compute k0 and see if this matches any of the k's received by the Challenger.
[0060] In another instance in which a Challenger may determine that a key has been compromised, a Challenger may detect a usage pattern for the TPM that is indicative of having been compromised. For example, two connections to the Challenger from different Prover Devices at the same time may indicate a compromised key. If the single h per Challenger method is used, the Challenger would know that two connections used the same m, since the same k=hm mod P would be associated with both connections. The Challenger may decide that the secret values could have been compromised, so that Challenger will not accept any more direct proofs using that k. Then the secret values from that TPM can no longer be used with that Challenger. However, this Challenger can't tell any other Challenger not to use secret values coming from that TPM, since the Challenger doesn't know the value of m.
[0061] In another embodiment of the invention, a group of Challengers may decide that they want to all be able to revoke the secret values of a TPM if one of the Challengers in the group decides that those secret values may have been compromised. Enabling this feature requires a change to an embodiment of the invention as it has been described above. The change involves how the values of h are determined. A Trusted Revocation Authority (TRA) is formed. The TRA has a public verification, private signature key pair, such as a standard RSA key pair. The TRA public key is given to the TPM using some secure distribution method, such as having the manufacturer put the key into the TPM during manufacturing.
[0062] The TRA generates a g value such that gn=1 mod P. The TRA can do this by generating a random g′ value between 1 and P, and then computing g=g′u mod P. Then for each challenger in the group, the TRA will pick an exponent (EXP) at random between 1 and n, and compute h=gEXP mod P. The TRA then signs a certificate with the name of this Challenger and this h value in the certificate. The TRA securely stores the EXP used to create the h for each Challenger.
[0063] When a TPM initiates a direct proof with a Challenger in the group, the Challenger sends this certificate for the h value. The TPM validates this certificate by checking the signature of the TRA. If valid, then the TPM uses this h value, instead of generating an h value as described in an earlier embodiment. Other aspects of the direct proof remain the same.
[0064] When a Challenger1, with h1 as its h value, announces that it wants to revoke the TPM which created k1=h1m mod P, the TRA retrieves EXP1, the EXP value used to compute h1 as h1=gEXP1 mod P. Note that neither the Challenger1, nor the TRA may know the value of m in the TPM that the Challenger1 wants to revoke. To tell Challengeri the k value to revoke, the TRA computes b1=EXP1(−1) mod n, and then computes ki=k1 (EXPi *b1 ) mod P. Notice that ki=him mod P. Notice that the TRA did not compute m during this computation; ki is then sent to Challengeri, and Challengeri can then revoke ki if it desires.
[0065] While certain exemplary embodiments of the invention have been described and shown in the accompanying drawings, it is to be understood that such embodiments are merely illustrative of and not restrictive on the broad aspects of various embodiments of the invention, and that these embodiments not be limited to the specific constructions and arrangements shown and described, since various other modifications are possible. It is possible to implement the embodiments of the invention or some of their features in hardware, programmable devices, firmware, software or a combination thereof.
Claims
What is claimed is:
1. A method comprising:
receiving an authentication request from a challenger device; and
sending information to the challenger device from a prover device; and
convincing the challenger device that a valid signature that is not on a revocation list of compromised device signatures is known by the prover device without revealing the signature to the challenger device.
2. The method of claim 1 wherein the information sent to the challenger device includes a device certificate for the prover device.
3. The method of claim 1 further comprising:
generating a value k based on a one-way function; and
generating a private-public key pair in the prover device, the private-public key pair including a private key and a public key, wherein value k and the public key are included in the information sent to the challenger device.
4. The method of claim 3 wherein the value k is defined as
k=hm mod P, where h is a unique number generated by the prover device, m is a randomly generated number, and P is a large prime number.
5. The method of claim 1 wherein convincing the challenger device that a valid signature is known by a prover device without revealing the signature to the challenger device includes
sending the challenger device an interactive proof that the prover device knows the signature without revealing the signature to the challenger device.
6. The method of claim 1 further comprising:
convincing the challenger device that the prover device knows the valid signature without revealing the identity of the prover device.
7. A method comprising:
convincing a challenger that a prover has a valid signature of a known entity without revealing the signature; and
convincing the challenger that the signature is not on a revocation list of compromised signatures without revealing the signature.
8. The method of claim 7 wherein convincing the challenger that the prover has a valid signature of a known entity without revealing the signature includes
generating a value k based on a one-way function; and
generating a private-public key pair in the prover device, the private-public key pair including a private key and a public key, wherein value k and the public key are included in information sent to the challenger.
9. The method of claim 7 wherein convincing the challenger that the prover has a valid signature of a known entity without revealing the signature includes
sending the challenger an interactive proof that the prover knows the valid signature without revealing the signature to the challenger.
10. The method of claim 7 wherein convincing the challenger that the signature is not on a revocation list includes
maintaining a revocation list of information corresponding to one or more provers which are considered compromised, and
comparing the prover's information to the information in the revocation list.
11. The method of claim 7 wherein convincing the challenger that a prover has a valid signature of a known entity means that it is probabilistically likely that the prover knows the signature, and not revealing the signature to the challenger means that it is computationally infeasible for the challenger to calculate the signature based on information revealed by the prover.
12. A method comprising:
convincing a first challenger device that a second device has a valid signature without disclosing the signature to the first device; and
convincing a third challenger device that the second device has a valid signature without disclosing the signature to the third device, wherein the information provided by the second device to the first challenger device and third challenger device is insufficient to permit the first challenger device and third challenger device to determine whether they are communicating with the same second device.
13. The method of claim 12 wherein convincing the first challenger that the second device has a valid signature without disclosing the signature includes
generating a value k based on a one-way function; and
generating a private-public key pair in the prover device, the private-public key pair including a private key and a public key, wherein value k and the public key are included in information sent to the challenger.
14. The method of claim 12 wherein at least some of the information provided by the second device to the first challenger device is different from the information provided by the second device to the third challenger device.
15. A method comprising:
revealing to a first challenger platform the result of a one-way function of a secret held by a prover platform; and
proving to the first challenger platform that the secret has a valid signature without revealing the secret to the first challenger platform.
16. The method of claim 15, further comprising:
revealing to a second challenger platform the result of a one-way function of the secret held by the prover platform; and
proving to the second challenger platform that the secret has the valid signature without revealing the secret to the second challenger platform and such that the first challenger and second challenger cannot determine that they are communicating with the same prover platform.
17. The method of claim 15, further comprising:
sending the first challenger platform an interactive proof that the prover platform knows the valid signature without revealing the signature to the challenger.
18. The method of claim 15, further comprising:
convincing the first challenger platform that an unrevealed signature of the prover platform is not on a revocation list.
19. The method of claim 15 wherein proving to the first challenger platform that the secret has a valid signature means that it is probabilistically likely that the prover platform knows the secret, and proving this to the first challenger platform without revealing the secret to the first challenger platform means that it would be computationally infeasible for the first challenger platform to calculate the secret based on information revealed by the prover platform.
20. A method comprising:
convincing a challenger a first time that a prover has a valid signature of a known entity without revealing the signature; and
convincing the same challenger a second time that the prover has a valid signature of a known entity without revealing the signature, wherein the challenger is not able to determine that the same signature was used during the first and second times.
21. The method of claim 20, further comprising:
sending the challenger an interactive proof that the prover knows the valid signature without revealing the signature to the challenger.
22. The method of claim 20, further comprising:
convincing the challenger that the signature of the prover is not on a revocation list.
23. A method comprising:
generating a first signature key pair in a first device, the first signature key pair including a public signature key and a private signature key;
providing the first public signature key to a first challenger; and
proving to the first challenger that the first device has a signed secret without revealing a signature used to sign the secret or revealing the private signature key.
24. The method of claim 23, further comprising:
sending the first challenger an interactive proof that the first device knows the signed secret without revealing the signed secret to the first challenger.
25. The method of claim 23 wherein proving to the first challenger that the first device has the signature used to sign the secret means that it is probabilistically likely that the prover device knows the secret, and proving this to the first challenger without revealing the signature used to sign the secret or revealing the private signature key to the first challenger means that it would be computationally infeasible for the first challenger to calculate either the secret, the signature used to sign the secret, or the private key based on information revealed by the prover device.
26. The method of claim 23 further comprising:
proving to the first challenger that the first device has a signed secret without revealing the identity of the device.
27. A device comprising:
a communication port; and
a processing unit, the processing unit configured to
communicate with a challenger platform over the communication port, and
convince the challenger platform that it is probabilistically likely that the prover device knows a secret without revealing the identity of the device.
28. The device of claim 27 wherein convincing the challenger platform that the device knows the secret without revealing the identity of the device includes
proving to the challenger platform that it has a valid signature of a known entity without revealing the signature, and
tying a value correlated with the secret to the communication with the challenger platform so that a different value cannot be substituted without violating the proof.
29. A system comprising:
a challenger device; and
a prover device communicatively coupled to the challenger device, the prover device configured to
convince the challenger that the prover device has a valid signature of a known entity that is not on a revocation list of compromised signatures without revealing the signature.
30. The system of claim 29 wherein convincing the challenger device that the prover device has a valid signature of a known entity without revealing the signature includes
revealing to the challenger device the result of a one-way function of a secret held by the prover device, and
proving to the challenger device that the secret has a valid signature without revealing the secret to the challenger device.
31. The system of claim 29 wherein convincing the challenger device that the signature is not on a revocation list includes
maintaining a revocation list of information corresponding to one or more prover devices which are considered compromised, and
comparing the prover device's information to the information in the revocation list.
Patent Citations (240)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3699532(A) | 1972-10-01 | Schaffer et al. | Applicant |
| US3996449(A) | 1976-12-01 | Attanasio et al. | Applicant |
| US4037214(A) | 1977-07-01 | Birney et al. | Applicant |
| US4162536(A) | 1979-07-01 | Morley | Applicant |
| US4207609(A) | 1980-06-01 | Luiz et al. | Applicant |
| US4247905(A) | 1981-01-01 | Yoshida et al. | Applicant |
| US4276594(A) | 1981-06-01 | Morley | Applicant |
| US4278837(A) | 1981-07-01 | Best | Applicant |
| US4307447(A) | 1981-12-01 | Provanzano et al. | Applicant |
| US4319233(A) | 1982-03-01 | Matsuoka et al. | Applicant |
| US4319323(A) | 1982-03-01 | Ermolovich et al. | Applicant |
| US4347565(A) | 1982-08-01 | Kaneda et al. | Applicant |
| US4366537(A) | 1982-12-01 | Heller et al. | Applicant |
| US4403283(A) | 1983-09-01 | Myntti et al. | Applicant |
| US4419724(A) | 1983-12-01 | Branigin et al. | Applicant |
| US4430709(A) | 1984-02-01 | Schleupen et al. | Applicant |
| US4521852(A) | 1985-06-01 | Guttag | Applicant |
| US4571672(A) | 1986-02-01 | Hatada et al. | Applicant |
| US4759064(A) | 1988-07-01 | Chaum | Applicant |
| US4795893(A) | 1989-01-01 | Ugon | Applicant |
| US4802084(A) | 1989-01-01 | Ikegaya et al. | Applicant |
| US4825052(A) | 1989-04-01 | Chemin et al. | Applicant |
| US4907270(A) | 1990-03-01 | Hazard | Applicant |
| US4907272(A) | 1990-03-01 | Hazard | Applicant |
| US4910774(A) | 1990-03-01 | Barakat | Applicant |
| US4975836(A) | 1990-12-01 | Hirosawa et al. | Applicant |
| US5007082(A) | 1991-04-01 | Cummins | Applicant |
| US5022077(A) | 1991-06-01 | Bealkowski et al. | Applicant |
| US5075842(A) | 1991-12-01 | Lai | Applicant |
| US5079737(A) | 1992-01-01 | Hackbarth | Applicant |
| US5187802(A) | 1993-02-01 | Inoue et al. | Applicant |
| US5230069(A) | 1993-07-01 | Brelsford et al. | Applicant |
| US5237616(A) | 1993-08-01 | Abraham et al. | Applicant |
| US5255379(A) | 1993-10-01 | Melo | Applicant |
| US5287363(A) | 1994-02-01 | Wolf et al. | Applicant |
| US5293424(A) | 1994-03-01 | Holtey et al. | Applicant |
| US5295251(A) | 1994-03-01 | Wakui et al. | Applicant |
| US5317705(A) | 1994-05-01 | Gannon et al. | Applicant |
| US5319760(A) | 1994-06-01 | Mason et al. | Applicant |
| US5361375(A) | 1994-11-01 | Ogi | Applicant |
| US5386552(A) | 1995-01-01 | Garney | Applicant |
| US5421006(A) | 1995-05-01 | Jablon et al. | Applicant |
| US5434999(A) | 1995-07-01 | Goire et al. | Applicant |
| US5437033(A) | 1995-07-01 | Inoue et al. | Applicant |
| US5442645(A) | 1995-08-01 | Ugon et al. | Applicant |
| US5455909(A) | 1995-10-01 | Blomgren et al. | Applicant |
| US5459867(A) | 1995-10-01 | Adams et al. | Applicant |
| US5459869(A) | 1995-10-01 | Spilo | Applicant |
| US5469557(A) | 1995-11-01 | Salt et al. | Applicant |
| US5473692(A) | 1995-12-01 | Davis | Applicant |
| US5479509(A) | 1995-12-01 | Ugon | Applicant |
| US5504922(A) | 1996-04-01 | Seki et al. | Applicant |
| US5506975(A) | 1996-04-01 | Onodera | Applicant |
| US5511217(A) | 1996-04-01 | Nakajima et al. | Applicant |
| US5522075(A) | 1996-05-01 | Robinson et al. | Applicant |
| US5528231(A) | 1996-06-01 | Patarin | Applicant |
| US5533126(A) | 1996-07-01 | Hazard et al. | Applicant |
| US5555385(A) | 1996-09-01 | Osisek | Applicant |
| US5555414(A) | 1996-09-01 | Hough et al. | Applicant |
| US5560013(A) | 1996-09-01 | Scalzi et al. | Applicant |
| US5564040(A) | 1996-10-01 | Kubala | Applicant |
| US5566323(A) | 1996-10-01 | Ugon | Applicant |
| US5568552(A) | 1996-10-01 | Davis | Applicant |
| US5574936(A) | 1996-11-01 | Ryba et al. | Applicant |
| US5582717(A) | 1996-12-01 | Di Santo | Applicant |
| US5606617(A) | 1997-02-01 | Brands | Applicant |
| US5615263(A) | 1997-03-01 | Takahashi | Applicant |
| US5628022(A) | 1997-05-01 | Ueno et al. | Applicant |
| US5657445(A) | 1997-08-01 | Pearce | Applicant |
| US5668971(A) | 1997-09-01 | Neufeld | Applicant |
| US5680547(A) | 1997-10-01 | Chang | Examiner |
| US5684948(A) | 1997-11-01 | Johnson et al. | Applicant |
| US5706469(A) | 1998-01-01 | Kobayashi | Applicant |
| US5717903(A) | 1998-02-01 | Bonola | Applicant |
| US5720609(A) | 1998-02-01 | Pfefferle | Applicant |
| US5721222(A) | 1998-02-01 | Bernstein et al. | Applicant |
| US5729760(A) | 1998-03-01 | Poisner | Applicant |
| US5737604(A) | 1998-04-01 | Miller et al. | Applicant |
| US5737760(A) | 1998-04-01 | Grimmer, Jr. et al. | Applicant |
| US5740178(A) | 1998-04-01 | Jacks et al. | Applicant |
| US5752046(A) | 1998-05-01 | Oprescu et al. | Applicant |
| US5757919(A) | 1998-05-01 | Herbert et al. | Applicant |
| US5764969(A) | 1998-06-01 | Kahle | Applicant |
| US5796835(A) | 1998-08-01 | Saada | Applicant |
| US5796845(A) | 1998-08-01 | Serikawa et al. | Applicant |
| US5805712(A) | 1998-09-01 | Davis | Applicant |
| US5809546(A) | 1998-09-01 | Greenstein et al. | Applicant |
| US5815665(A) | 1998-09-01 | Teper et al. | Examiner |
| US5825875(A) | 1998-10-01 | Ugon | Applicant |
| US5825880(A) | 1998-10-01 | Sudia et al. | Applicant |
| US5835594(A) | 1998-11-01 | Albrecht et al. | Applicant |
| US5844986(A) | 1998-12-01 | Davis | Applicant |
| US5852717(A) | 1998-12-01 | Bhide et al. | Applicant |
| US5854913(A) | 1998-12-01 | Goetz et al. | Applicant |
| US5867577(A) | 1999-02-01 | Patarin | Applicant |
| US5872994(A) | 1999-02-01 | Akiyama et al. | Applicant |
| US5890189(A) | 1999-03-01 | Nozue et al. | Applicant |
| US5900606(A) | 1999-05-01 | Rigal | Applicant |
| US5901225(A) | 1999-05-01 | Ireton et al. | Applicant |
| US5903752(A) | 1999-05-01 | Dingwall et al. | Applicant |
| US5919257(A) | 1999-07-01 | Trostle | Applicant |
| US5935242(A) | 1999-08-01 | Madany et al. | Applicant |
| US5935247(A) | 1999-08-01 | Pai et al. | Applicant |
| US5937063(A) | 1999-08-01 | Davis | Applicant |
| US5953502(A) | 1999-09-01 | Helbig, Sr. | Applicant |
| US5956408(A) | 1999-09-01 | Arnold | Applicant |
| US5970147(A) | 1999-10-01 | Davis et al. | Applicant |
| US5978475(A) | 1999-11-01 | Schneier et al. | Applicant |
| US5978481(A) | 1999-11-01 | Ganesan et al. | Applicant |
| US5987557(A) | 1999-11-01 | Ebrahim | Applicant |
| US6014745(A) | 2000-01-01 | Ashe | Applicant |
| US6035374(A) | 2000-03-01 | Panwar et al. | Applicant |
| US6044478(A) | 2000-03-01 | Green | Applicant |
| US6055637(A) | 2000-04-01 | Hudson et al. | Applicant |
| US6058478(A) | 2000-05-01 | Davis | Applicant |
| US6061794(A) | 2000-05-01 | Angelo | Applicant |
| US6075938(A) | 2000-06-01 | Bugnion et al. | Applicant |
| US6085296(A) | 2000-07-01 | Karkhanis et al. | Applicant |
| US6088262(A) | 2000-07-01 | Nasu | Applicant |
| US6092095(A) | 2000-07-01 | Maytal | Applicant |
| US6093213(A) | 2000-07-01 | Favor et al. | Applicant |
| US6101584(A) | 2000-08-01 | Satou et al. | Applicant |
| US6108644(A) | 2000-08-01 | Goldschlag et al. | Applicant |
| US6115816(A) | 2000-09-01 | Davis | Applicant |
| US6125430(A) | 2000-09-01 | Noel et al. | Applicant |
| US6131166(A) | 2000-10-01 | Wong-Isley | Applicant |
| US6138239(A) | 2000-10-01 | Veil | Examiner |
| US6148379(A) | 2000-11-01 | Schimmel | Applicant |
| US6158546(A) | 2000-12-01 | Hanson et al. | Applicant |
| US6173417(B1) | 2001-01-01 | Merrill | Applicant |
| US6175924(B1) | 2001-01-01 | Arnold | Applicant |
| US6175925(B1) | 2001-01-01 | Nardone et al. | Applicant |
| US6178509(B1) | 2001-01-01 | Nardone | Applicant |
| US6182089(B1) | 2001-01-01 | Ganapathy et al. | Applicant |
| US6188257(B1) | 2001-02-01 | Buer | Applicant |
| US6192455(B1) | 2001-02-01 | Bogin et al. | Applicant |
| US6199152(B1) | 2001-03-01 | Kelly et al. | Applicant |
| US6205550(B1) | 2001-03-01 | Nardone et al. | Applicant |
| US6212635(B1) | 2001-04-01 | Reardon | Applicant |
| US6222923(B1) | 2001-04-01 | Schwenk | Applicant |
| US6249872(B1) | 2001-06-01 | Wildgrube et al. | Applicant |
| US6252650(B1) | 2001-06-01 | Nakaumra | Applicant |
| US6269392(B1) | 2001-07-01 | Cotichini et al. | Applicant |
| US6272533(B1) | 2001-08-01 | Browne | Applicant |
| US6272637(B1) | 2001-08-01 | Little et al. | Applicant |
| US6275933(B1) | 2001-08-01 | Fine et al. | Applicant |
| US6282650(B1) | 2001-08-01 | Davis | Applicant |
| US6282651(B1) | 2001-08-01 | Ashe | Applicant |
| US6282657(B1) | 2001-08-01 | Kaplan et al. | Applicant |
| US6292874(B1) | 2001-09-01 | Barnett | Applicant |
| US6301646(B1) | 2001-10-01 | Hostetter | Applicant |
| US6308270(B1) | 2001-10-01 | Guthery et al. | Applicant |
| US6314409(B1) | 2001-11-01 | Schneck et al. | Applicant |
| US6321314(B1) | 2001-11-01 | Van Dyke | Applicant |
| US6327652(B1) | 2001-12-01 | England et al. | Applicant |
| US6330670(B1) | 2001-12-01 | England et al. | Examiner |
| US6339815(B1) | 2002-01-01 | Feng | Applicant |
| US6339816(B1) | 2002-01-01 | Bausch | Applicant |
| US6357004(B1) | 2002-03-01 | Davis | Applicant |
| US6363485(B1) | 2002-03-01 | Adams | Applicant |
| US6374286(B1) | 2002-04-01 | Gee et al. | Applicant |
| US6374317(B1) | 2002-04-01 | Ajanovic et al. | Applicant |
| US6378068(B1) | 2002-04-01 | Foster | Applicant |
| US6378072(B1) | 2002-04-01 | Collins et al. | Applicant |
| US6389537(B1) | 2002-05-01 | Davis et al. | Applicant |
| US6397242(B1) | 2002-05-01 | Devine et al. | Applicant |
| US6397379(B1) | 2002-05-01 | Yates, Jr. et al. | Applicant |
| US6412035(B1) | 2002-06-01 | Webber | Applicant |
| US6421702(B1) | 2002-07-01 | Gulick | Applicant |
| US6435416(B1) | 2002-08-01 | Slassi | Applicant |
| US6445797(B1) | 2002-09-01 | McGough et al. | Applicant |
| US6463535(B1) | 2002-10-01 | Drews et al. | Applicant |
| US6463537(B1) | 2002-10-01 | Tello | Applicant |
| US6473800(B1) | 2002-10-01 | Jerger et al. | Examiner |
| US6499123(B1) | 2002-12-01 | McFarlane et al. | Applicant |
| US6505279(B1) | 2003-01-01 | Phillips et al. | Applicant |
| US6507904(B1) | 2003-01-01 | Ellison et al. | Applicant |
| US6529909(B1) | 2003-03-01 | Bowman-Amuah | Applicant |
| US6535988(B1) | 2003-03-01 | Poisner | Applicant |
| US6557104(B1) | 2003-04-01 | Vu et al. | Applicant |
| US6560627(B1) | 2003-05-01 | McDonald et al. | Applicant |
| US6609199(B1) | 2003-08-01 | DeTreville | Applicant |
| US6615278(B1) | 2003-09-01 | Curtis | Applicant |
| US6633963(B1) | 2003-10-01 | Ellison et al. | Applicant |
| US6633981(B1) | 2003-10-01 | Davis | Applicant |
| US6651171(B1) | 2003-11-01 | England et al. | Applicant |
| US6678825(B1) | 2004-01-01 | Ellison et al. | Applicant |
| US6684326(B1) | 2004-01-01 | Cromer et al. | Applicant |
| US6988250(B1) | 2006-01-01 | Proudler et al. | Examiner |
| US2001/0021969(A1) | 2001-09-01 | Burger et al. | Applicant |
| US2001/0027511(A1) | 2001-10-01 | Wakabayashi et al. | Applicant |
| US2001/0027527(A1) | 2001-10-01 | Yuri et al. | Applicant |
| US2001/0037450(A1) | 2001-11-01 | Metitski et al. | Applicant |
| US2002/0007456(A1) | 2002-01-01 | Peinado et al. | Applicant |
| US2002/0023032(A1) | 2002-02-01 | Pearson et al. | Applicant |
| US2002/0147916(A1) | 2002-10-01 | Strongin et al. | Applicant |
| US2002/0166061(A1) | 2002-11-01 | Falik et al. | Applicant |
| US2003/0018892(A1) | 2003-01-01 | Tello | Applicant |
| US2003/0074548(A1) | 2003-04-01 | Cromer et al. | Applicant |
| US2003/0115453(A1) | 2003-06-01 | Grawrock | Applicant |
| US2003/0126442(A1) | 2003-07-01 | Glew et al. | Applicant |
| US2003/0126453(A1) | 2003-07-01 | Glew et al. | Applicant |
| US2003/0159056(A1) | 2003-08-01 | Cromer et al. | Applicant |
| US2003/0188179(A1) | 2003-10-01 | Challener et al. | Applicant |
| US2003/0196085(A1) | 2003-10-01 | Lampson et al. | Applicant |
| DE4217444 | 1992-12-01 | Applicant | |
| EP473913 | 1992-03-01 | Applicant | |
| EP600112 | 1994-06-01 | Applicant | |
| EP892521 | 1999-01-01 | Applicant | |
| EP930567 | 1999-07-01 | Applicant | |
| EP961193 | 1999-12-01 | Applicant | |
| EP965902 | 1999-12-01 | Applicant | |
| EP1030237 | 2000-08-01 | Applicant | |
| EP1055989 | 2000-11-01 | Applicant | |
| EP1056014 | 2000-11-01 | Applicant | |
| EP1085396 | 2001-03-01 | Applicant | |
| EP1146715 | 2001-10-01 | Applicant | |
| EP1271277 | 2003-01-01 | Applicant | |
| JP2000076139 | 2000-03-01 | Applicant | |
| WO9524696 | 1995-09-01 | Applicant | |
| WO9729567 | 1997-08-01 | Applicant | |
| WO9812620 | 1998-03-01 | Applicant | |
| WO9834365 | 1998-08-01 | Applicant | |
| WO9844402 | 1998-10-01 | Applicant | |
| WO9905600 | 1999-02-01 | Applicant | |
| WO9918511 | 1999-04-01 | Applicant | |
| WO9957863 | 1999-11-01 | Applicant | |
| WO99/65579 | 1999-12-01 | Applicant | |
| WO9965579 | 1999-12-01 | Applicant | |
| WO21238 | 2000-04-01 | Applicant | |
| WO62232 | 2000-10-01 | Applicant | |
| WO127723 | 2001-04-01 | Applicant | |
| WO127821 | 2001-04-01 | Applicant | |
| WO163994 | 2001-08-01 | Applicant | |
| WO175565 | 2001-10-01 | Applicant | |
| WO175595 | 2001-10-01 | Applicant | |
| WO9909482 | 2002-01-01 | Applicant | |
| WO217555 | 2002-02-01 | Applicant | |
| WO175564 | 2002-10-01 | Applicant | |
| WO2086684 | 2002-10-01 | Applicant |
Non-Patent Literature (40)
- Coulouris, George , et al., “Distributed Systems, Concepts and Designs”, 2nd Edition, (1994),422-424.Applicant
- Crawford, John , “Architecture of the Intel 80386”, Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors ICCD '86), (Oct. 6, 1986),155-160.Applicant
- Fabry, R.S. , “Capability-Based Addressing”, Fabry, R.S., “Capability-Based Addressing,” Communications of the ACM, vol. 17, No. 7, (Jul. 1974),403-412.Applicant
- Frieder, Gideon , “The Architecture And Operational Characteristics of the VMX Host Machine”, The Architecture And Operational Characteristics of the VMX Host Machine, IEEE, (1982),9-16.Applicant
- HP Mobile Security Overview, “HP Mobile Security Overview”, (Sep. 2002),1-10.Applicant
- IBM Corporation, “IBM ThinkPad T30 Notebooks”, IBM Product Specification, located at www-1.ibm.com/services/files/cicsco—t30—spec—sheet—070202.pdf, last visited Jun. 23, 2004,(Jul, 2, 2002),1-6.Applicant
- Intel Corporation, “IA-64 System Abstraction Layer Specification”, Intel Product Specification, Order No. 245359-001, (Jan. 2000),1-112.Applicant
- Intel Corporation, “Intel 82802AB/82802AC Firmware Hub (FWH)”, Intel Product Datasheet, Document No. 290658-004,(Nov. 2000),1-6, 17-28.Applicant
- Intel Corporation, “Intel IA-64 Architecture Software Developer's Manual”, vol. 2: IA-64 System Architecture, Order No. 245318-001, (Jan. 2000),i, ii, 5.1-5.3, 11.1-11.8, 11.23-11.26.Applicant
- Menezes, Alfred J., et al., “Handbook of Applied Cryptography”, CRC Press Series on Discrete Mathematices and its Applications, Boca Raton, FL, XP002165287, ISBN 0849385237,(Oct. 1996),403-405, 506-515, 570.Applicant
- Nanba, S. , et al., “VM/4: ACOS-4 Virtual Machine Architecture”, VM/4: ACOS-4 Virtual Machine Architecture, IEEE, (1985),171-178.Applicant
- RSA Security, “Hardware Authenticators”, www.rsasecurity.com/node.asp?id=1158, 1-2.Applicant
- RSA Security, “RSA SecurID Authenticators”, www.rsasecurity.com/products/securid/datasheets/SID—DS—0103.pdf, 1-2.Applicant
- RSA Security, “Software Authenticators”, www.srasecurity.com/node.asp?id=1313, 1-2.Applicant
- Schneier, Bruce , “Applied Cryptography: Protocols, Algorithm, and Source Code in C”, Wiley, John & Sons, Inc., XP002939871; ISBN 0471117099,(Oct. 1995),47-52.Applicant
- Schneier, Bruce , “Applied Crytography: Protocols, Algorithm, and Source Code in C”, Wiley, John & Sons, Inc., XP002138607; ISBN 0471117099,(Oct. 1995),56-65.Applicant
- Schneier, Bruce , “Applied Cryptography: Protocols, Algorithms, and Source Code C”, Wiley, John & Sons, Inc., XP0021111449; ISBN 0471117099,(Oct. 1995),169-187.Applicant
- Schneier, Bruce , “Applied Cryptography: Protocols, Algorithms, and Source Code in C”, 2nd Edition; Wiley, John & Sons, Inc., XP002251738; ISBN 0471128457,(Nov. 1995),28-33; 176-177; 216-217; 461-473; 518-522.Applicant
- Berg, Cliff , “How Do I Create a Signed Applet?”, Dr. Dobb's Journal, (Aug. 1997),1-9.Applicant
- Brands, Stefan , “Restrictive Blinding of Secret-Key Certificates”, Springer-Verlag XP002201306, (1995),Chapter 3.Applicant
- Chen, Andrew A., et al., “Safe and Protected Execution for the Morph/AMRM Reconfigurable Processor”, 7th Annual IEEE Symposium, FCCM '99 Proceedings, XP010359180, ISBN 0-7695-0375-6, Los Alamitos, CA, (Apr. 21, 1999),209-221.Applicant
- Compaq Computer Corporation, et al., “Trusted Computing Platform Alliance (TCPA) Main Specification Version 1.1a”, (Dec. 2001),1-321.Applicant
- Davida, George I., et al., “Defending Systems Against Viruses through Cryptographic Authentication”, Proceedings of the Symposium on Security and Privacy, IEEE Comp. Soc. Press, ISBN 0-8186-1939-2,(May 1989).Applicant
- Goldberg, Robert P., “Survey of Virtual Machine Research”, Computer Magazine, (Jun. 1974), cover, contents, 34-35.Applicant
- Gong, Li , et al., “Going Behond the Sandbox: An Overview of the New Security Architecture in the Java Development Kit 1.2”, Proceedings of the USENIX Symposium on Internet Technologies and Systems, Monterey, CA,(Dec. 1997).Applicant
- Gum, P. H., “System/370 Extended Architecture: Facilities for Virtual Machines”, IBM J. Research Development, vol. 27, No. 6, (Nov. 1983),530-544.Applicant
- Heinrich, Joe , “MIPS R4000 Microprocessor User's Manual, Second Edition”, Chapter 4 “Memory Management”, (Jun. 11, 1993),61-97.Applicant
- IBM, “Information Display Technique for a Terminiate Stay Resident Program IBM Technical Disclosure Bulletin”, TDB-ACC-No. NA9112156, vol. 34, Issue 7A, (Dec. 1, 1991),156-158.Applicant
- INTEL, “Intel386 DX Microprocessor 32-Bit CHMOS Microprocessor With Integrated Memory Management”, (1995), 1-56.Applicant
- Karger, Paul A., et al., “A VMM Security Kernal for the VAX Architecture”, Proceedings of the Symposium on Research in Security and Privacy, XP010020182, ISBN 0-8186-2060-9, Boxborough, MA, (May 7, 1990),2-19.Applicant
- Kashiwagi, Kazuhiko , et al., “Design and Implementation of Dynamically Reconstructing System Software”, Software Engineering Conference, Proceedings 1996 Asia-Pacific Seoul, South Korea Dec. 4-7, 1996, Los Alamitos, CA USA, IEEE Comput. Soc, US, ISBN 0-8186-7638-8,(1996).Applicant
- Lawton, Kevin , et al., “Running Multiple Operating Systems Concurrently on an IA32 PC Using Virtualization Techniques”, http://www.plex86.org/research/paper.txt, (Nov. 29, 1999),1-31.Applicant
- Luke, Jahn , et al., “Replacement Strategy for Aging Avionics Computers”, IEEE AES Systems Magazine, XP002190614,(Mar. 1999).Applicant
- Menezes, Oorschot , “Handbook of Applied Cryptography”, CRC Press LLC, USA XP002201307, (1997),475.Applicant
- Motorola, “M68040 User's Manual”, (1993), cover, vi-xxiii, 1-1 to 8-32.Applicant
- Richt, Stefan , et al., “In-Circuit-Emulator Wird Echtzeittauglich”, Elektronic, Franzis Verlag GMBH, Munchen, DE, vol. 40, No. 16, XP000259620,(100-103),Aug. 6, 1991.Applicant
- Robin, John S., et al., “Analysis of the Pentium's Ability to Support a Secure Virtual Machine Monitor”, Proceedings of the 9th USENIX Security Symposium, XP002247347, Denver, Colorado, (Aug. 14, 2000),1-17.Applicant
- Rosenblum, M. , “Virtual Platform: A Virtual Machine Monitor for Commodity PC”, Proceedings of the 11th Hotchips Conference, (Aug. 17, 1999),185-196.Applicant
- Saez, Sergio , et al., “A Hardware Scheduler for Complex Real-Time Systems”, Proceedings of the IEEE International Symposium on Industrial Electronics, XP002190615,(Jul. 1999),43-48.Applicant
- Sherwood, Timothy , et al., “Patchable Instruction ROM Architecture”, Department of Computer Science and Engineering, University of California, San Diego, La Jolla, CA, (Nov. 2001), 24-33.Applicant