US 8,190,893 B2Grant
Portable security transaction protocol
Issue Date:2012-05-29
•24 Claims
•8 Drawing Sheets
Abstract
A technique for providing message authenticity includes accepting transaction information, accepting a first data item used for authenticating an originating user, cryptographically processing the transaction information using only a second data item, wherein the entropy of the first data item is less than the entropy of the second data item, and authenticating the originating user using the first data item. The first data item can be a sequence of digits corresponding to those displayed on an external device, such as, for example, an RSA authorization token, credit card, etc. In general, the first data item will be a short alphanumeric string and the second data item will generally be much larger, e.g., a 128 bit sequence to be used principally for data authentication. According to another aspect of the present invention, consequential evidence of the transaction may be secured to provide after-the-fact evidence of the transaction. This evidence can include a message written to a tamper-resistant log record, the message including the transaction information, the first data item, the second item, and an identifier for the originating user, as well as other information. At a subsequent point, the transaction can be shown to have been sent by the originating user and received by the intended recipient, by consulting the log record. Preferably, the validity of the transaction would be ascertained by an independent, mutually trusted third party.
Metadata
Assignee
- JP Morgan Chase Bank
Inventors
- Glenn Stuart Benson
- Joseph R. Calaceto
- Russell M. Logar
Application Information
Application Number:US 10/882,527
Filing Date:2004-07-01
Priority Date:2003-10-27
Art Unit:2493
Classifications
IPC:
H04L9/32H04L29/06G06F21/00G06F7/04G06F15/16G06F17/30
Patent Drawings (8 sheets)
Description
Cross Reference to Related Applications
[0001] This application claims the benefit of U.S. Provisional Application Ser. No. 60/514,760, filed by Glenn Benson et al. on Oct. 27, 2003 and entitled “Methods and Systems For Providing After-The-Fact Transaction Evidence Using Authentication Technology and Message Digests”, which is incorporated herein by reference.
Field of the Invention
[0002] The present invention relates generally to secure computer communication systems, and, more particularly, to methods and systems for providing end-to-end message authenticity and securing consequential evidence of a transaction.
Background of the Invention
[0003] End-to-end message authenticity generally includes three components: message authentication to authenticate an originating user of a transaction, message integrity to ensure that the transaction does not change in-transit, and replay protection to protect against replay attacks. Conventionally, end-to-end message authenticity is addressed through Public Key Infrastructure (PKI) technology, or in some cases symmetric key technology. However, various aspects of the PKI render this technology problematic.
[0004] One of the main disadvantages of the PKI is that it requires secure storage of private keys by the originating user. If these keys are simply stored in a computer system, the authentication suffices only to link the equipment with the transaction; the authentication suffices only if one protects the computer system from unauthorized access. This may be unacceptable for many applications due to the difficulty of adequately protecting computer systems. An external device such as a floppy disk or IC card might be used to store the private key, but this has proven to be unwieldy and expensive, especially where widespread dissemination is desired. Moreover, the floppy disk has the property that it can be easily copied, so the owner of the floppy cannot be sure if another person had not previously copied the floppy without notice. An IC card or USB token may incorporate copy protection; however, these devices may require installation of system software, drivers, and sometimes hardware, all of which precipitate user resistance.
Summary of the Invention
[0005] According to the methods and systems of the present invention, a technique for providing message authenticity includes accepting transaction or other information, accepting a first data item used for authenticating an originating user, cryptographically processing the transaction information using only a second data item, wherein the entropy used to construct the first data item is less than the entropy used to construct the second data item, and authenticating the originating user using the first data item.
[0006] According to an aspect of the invention, the first data item is obtained from an authentication token. In this case, the first data item can include a sequence of digits corresponding to those displayed on an external device, such as, for example, an RSA authorization token, a credit card, etc. Usually, the first data item would be manually input by a user. Typical values for the number of digits corresponding to the first data item are around 5 to 21. In general, the first data item will be a short alphanumeric string and the second data item will generally be much larger, e.g., a 128 bit sequence to be used principally for data authentication.
[0007] According to an aspect of the invention, information obtained from the authentication token contributes to the first data item exclusively.
[0008] According to another aspect of the invention, the authentication token is a one-way authentication token.
[0009] According to another aspect of the invention, the external device is not electronically connected to a computer system.
[0010] According to another aspect of the invention, the first data item is inaccessible to an entity authorized to process the transaction.
[0011] According to another aspect of the invention, consequential evidence of the transaction is kept. This evidence can include a message written to a tamper-resistant log record, the message including the transaction information, the first data item, the second item, and an identifier for the originating user, as well as other information. At a subsequent point, the transaction can be shown to have been sent by the originating user and received by the intended recipient, by consulting the log record. Preferably, the validity of the transaction would be ascertained by an independent, mutually trusted third party.
[0012] These and other aspects, features and advantages of the present invention will become apparent from the following detailed description of preferred embodiments, which is to be read in connection with the accompanying drawings.
Brief Description of the Drawings
[0013] FIG. 1 is a high-level diagram illustrating the Portable Security Transaction Protocol (PSTP);
[0014] FIG. 2 is an exemplary activity diagram for the PSTP;
[0015] FIG. 3 illustrates an exemplary message layout;
[0016] FIG. 4 illustrates an exemplary architecture for providing consequential evidence of a transaction using the PSTP;
[0017] FIG. 5 illustrates an exemplary screen display of a value-bearing transaction entry form for securely wiring money using the PSTP;
[0018] FIG. 6 illustrates a RSA SecurID token useable to generate a unique number; and
[0019] FIG. 7 illustrates the architecture of a RSA SecurID token.
Description of Preferred Embodiments
[0020] Throughout the description and drawings various terms and expressions are used with meanings as per the following definitions.
[0021] Asymmetric Cryptography: ASYM(e,K) denotes that public keying material, e, encrypts information, K, for the purpose of providing confidentiality. It is assumed that ASYM combines an encoding method with an asymmetric encryption primitive. The resulting encryption scheme must ensure the integrity of the encrypted information. A specific example of asymmetric cryptography with encoding is RSA Encryption Primitive with Optimal Asymmetric Encryption Padding (RSAES-OAEP). This mechanism ensures both confidentiality, and has the property of cypertext indistinguishability which has been shown to be equivalent to non-malleability (See M. Bellare et al., Relations among Notions of Security for Public-Key Encryption Schemes, International Association of Cryptologic Research, 1998, which is incorporated herein by reference). In this disclosure, the notation RSAESOAEP(e,K) denotes encrypting K with the asymmetric key, e, in accordance with RSAES-OAEP. An example public key is the public key of the application server ea.
[0022] Symmetric Cryptography: SYM(k,y) denotes that symmetric key, k, encrypts information, y for the purpose of providing confidentiality. A specific example of symmetric cryptography is Advanced Encryption Standard (AES) in CBC mode using a 128-bit key that was created using 128 bits of key entropy denoted AES(k,y). Other specific example of symmetric cryptography include but are not limited to AES in CBC mode with 192 or 256 bit keys created using 192 or 256 bits of key entropy, respectively; or Triple DES using a 168-bit key.
[0023] Message Digest: MD(x) is a deterministic function mapping bit strings of arbitrary length to bit strings of fixed length such that MD is collision-resistant and one-way (non-invertible). A specific example of a message digest algorithm is SHA1 denoted SHA1(x).
[0024] Message Integrity. MI(k,z) denotes the keyed message authentication code (message integrity) function, MI, using key, k, applied against data, z. A specific example of a message authentication code function is HMAC, using a 160-bit key which was created with 160 bits of entropy, denoted HMAC(k,z). In this disclosure HMAC denotes the message integrity function specification that uses SHA1 as the underlying message digest algorithm.
[0025] Unique nonce: r denotes a unique nonce. r must be completely unique, e.g., unique over time, server reboots, multiple machines, etc. Let ∥ denote the concatenation operation. A specific example of a unique nonce is SHA1(n∥t∥Server 150DN), where n is a unique number generated through a secure pseudo-random number generator (where the generator has the unguessability property); t is the server's current timestamp, and server DN is the server's unique distinguished name found in the server's certificate 611. In this case, the secure pseudo random number generator has a seed of at least 160 bits created with at least 160 bits of entropy. If the server generates multiple nonces with the same value, t, then each nonce must have a different value, n.
[0026] Userid: userid denotes a unique username
[0027] Tokenfactor: SIV denotes the Secure Identity Vector which is a value supplied by an authentication token. PSTP uses the SIV as one of the authentication factors. A specific example of a SIV is the current value displayed on an RSA SecurID token. PSTP uses the SIV as one of the authentication factors.
[0028] Password: SIP denotes the Secure Identity Password. The purpose of the SIP is to demonstrate that a user knows a secret. PSTP uses the SIP as one of the authentication factors.
[0029] Authentication token: An authentication token provides the facility for two-factor authentication (provide something one knows, and something one has).
[0030] One-way authentication token: A one-way authentication token is an authentication token that has the following property: A one-way authentication token displays information as output; however, a one-way authentication token does not accept information as input if that information contains or is derived from the information being secured, e.g., signed, HMAC'd. For example, if one wants to obtain the message authenticity property when transmitting the message “1234”, then a one-way authentication token would not require the user to input 1-2-3-4, or any other data derived from the value “1234” through a mechanism such as a digest or transformation. An example of a one-way authentication token is an RSA SecurID card because it displays a token code without accepting as input any information pertinent to a transaction. An example authentication token that does not have the one-way property is a PKI-based smart card. A PKI-based smart card may digitally sign data by transforming that data cryptographically. The PKI-based smart card accepts the data as input and provides the transformation as output. Note that the SecurID illustration 400 has digits 0 through 9 near the bottom. This is an optional feature that appears on some SecurID cards that permits the user the ability to enter a password directly into the token. Despite the fact that the user inputs a password, we classify the token as one-way because the user input is independent of the data being secured.
[0031] One may employ an authentication token, or a one-way authentication token in the context of a multifactor authentication system. The authentication token provides one component of the authentication credential, while another factor such as a PIN may provide another factor. Typically, a validation module permits authentication only if the authentication module successfully validates all authentication factors.
[0032] Message authenticity: An originator resides at one end of a communication link; and a recipient resides at the opposite end. Message authenticity ensures: (i) the recipient authenticates the originator's identity, (ii) the message received by the recipient matches the message transmitted by the sender (the message was not modified in transit), and (iii) replay prevention which ensures that the recipient does not obtain multiple copies of a message that was transmitted only once by the originator.
[0033] Entropy: The present invention uses the definition of the term entropy in: Denning, Dorothy, Cryptography and Data Security, Reading, Mass.: Addison-Wesley Publishing Co., January, 1983, pp. 17-22.
[0034] Pseudo-random number generator and random number generator Pseudo-random number generators and random number generators are discussed in the following literature: Menezes et al., Handbook of Applied Cryptography, Boca Raton: CRC Press, 1997, pp.169-190.
[0035] Unguessable key values (unguessability property): A pseudo-random number generator has the unguessability property if the “sequence of output bits are unpredictable to an adversary with limited computational resources.” Menezes et al., supra, at 169-190. A discussion of secure pseudo random number generators is also found therein. The unguessability property holds even in the case that the adversary knows the history of all previous outputs of the pseudo random number generator.
[0036] Consequential evidence: Evidence used to ensure that the sender of a message sent the message, or the recipient received the message, and that the message authenticity property was preserved. Such evidence is particularly useful if the sender or recipient were to subsequently deny being associated with the message, because a cryptographic mechanism could be used to determine the veracity of their denial.
[0037] Certificate validation: The topics of Public-key certificates and validation of Public-key certificates are discussed in Menezes et al., supra, at 559-561.
[0038] Trusted Party: A Trusted Party is an entity which is trusted by all participants and independent judges to operate in accordance to its specification. Examples of Trusted Parties include Certificate Authorities and Trusted Timestamp Authorities.
[0039] CVV: The Credit Card Validation code (CVV) is typically a three or four digit number printed on some credit cards. The intention of the CVV is to demonstrate physical possession of the credit card because the CVV is not embossed on the card and hence not printed on receipts. This makes it difficult for anyone other than the genuine cardholder to know the CVV. Some card issuers refer to this number as the Card Security Code, Personal Security Code, or Card Verification Value.
[0040] SSL: SSL refers to the Secure Socket Layer v3 protocol. While this document references SSL, one may substitute TLS version 1.0 for any reference to SSL. One of the options for operating either SSL or TLS is bidirectional authentication. In this case, the two peers of the SSL protocol authenticate each other through demonstrations that involve asymmetric cryptographic methods. That is, each peer demonstrates access to their respective private keying material, and the other peer validates the demonstration using the corresponding public keying material. TLS reference: Dierks, T., et. al., Network Working Group RFC 2246, the TLS Version 1.0, January, 1999.
[0041] FIG. 1 is a high-level diagram summarizing the Portable Security Transaction Protocol (PSTP). The PSTP's end-points are a Client 120 that initiates a transaction and a Server 150 that authenticates and then executes the transaction.
[0042] In Step 1, the Client 120 downloads from the Server 150 two items: a server-generated unique nonce, r, and the Server's 150 certificate, which contains the Server's 150 public key, ea. The Client 120 validates the Server's 150 certificate and extracts the public key for subsequent use. It is to be appreciated that the Client 120 will have already obtained through out-of-band means the certificate's distinguished name and root certificate required for validation. It is to be further appreciated that identical notation for the Server's 150 public key and certificate are herein adopted, but one may readily determine the notation's meaning from context.
[0043] Next, in Step 2, the central cryptographic aspect of the protocol takes place. The Client 120 transmits a single message that contains three components. The Authenticator component 130 contains material that uniquely authenticates the user associated with the Client 120. The Message Integrity component 132 is a cryptographic seal that protects data against unauthorized modification. The Key Management component 134 securely transports symmetric keys, k1 and k2, encrypted with the Server 150's public key. The Authenticator component 130 and Message Integrity component 132 use these keys, respectively.
[0044] Next, in Step 3, an optional signaling takes place. The Client 120 may ignore this signal and proceed to the next step immediately.
[0045] Lastly, in Step 4, the Client 120 transmits data to the Server 150. The Server 150 cross-references this data into the Message Integrity component 132. If the cryptographic seal communicated in the Message Integrity component 132 does not correspond to the data transmitted in Step 4, then the protocol raises an exception. If Step 4 is executed without an exception, then the Server 150 executes the transaction.
[0046] To better appreciate the protocol described above, an activity diagram is provided in FIG. 2 . In general, an activity diagram shows activities and events that cause an object to be in a particular state.
[0047] Step 1
[0048] The Client 120 begins by sending an initiation request to the Server 150 (201). The Server 150 prepares for the first message by generating a unique nonce, r (202). The value r need not be a random value; however, the Server 150 must ensure r's uniqueness. In this present example, r has the properties of production by a pseudo-random number generator and unguessability. The Server 150 could create r from the current timestamp and additional entropy information. The Server 150 stores r in volatile memory, and subsequently references r as a countermeasure against playback attacks (203). If the Server 150 wishes to cancel any transaction before completion, then the Server 150 must delete r (or any unique number or timestamp used to create r) from its volatile memory. The Server 150 downloads the first message including r and the server's certificate containing ea to the Client 120. The Client 120 then validates the Server's 150 certificate and extracts ea. If the Server's 150 certificate is not valid, then the Client 120 terminates the protocol in the state labeled “Server cert not valid” (204). The Server 150 stores the nonce, r, in its volatile memory.
Step 2
[0049] The Client 120 then generates two unguessable key values k, and k2 (205). In order to produce these values, the Client 120 confidentially seeds a pseudo-random number generator with 160 bits of entropy, and then executes the pseudo random number generator to produce any required random values, e.g., k1 and k2, any initial vector required for symmetric cryptography, and any randomness required by RSA OAEP. Then, the Client 120 prompts the user for the two-factors of the authentication material: SIV and SIP (206). The Client 120 uses k1 as a key for the authenticator; and the Client 120 uses k2 as the key for the Message Integrity component (207). The Client 120 encrypts k1 and k2 into the Key Management component 134 (207).
[0050] Upon receipt, the Server 150 uses its private keying material to decrypt the Key Management component 134 yielding k1 and k2 (208). The Server 150 applies k1 to the symmetric algorithm to decrypt the authenticator, and then perform the authentication. The authentication step uses the information extracted from the Authenticator component 130 to query a server which knows how to validate authentication requests. In the case of the SecurID token, the server is RSA Security's ACE server. If user authentication fails, then the Server 150 terminates PSTP in the state labeled “Failed Authentication” (209), and cancels the transaction. The Server 150 holds the Message Integrity Component 132 including k2 for subsequent validation (210). Referring to FIG. 3 , the Step 2 message transmitted from the Client 120 to the Server 150 has the following specification:
- [0051] Authenticator 130: SYM(k1,(userid∥SIV∥SIP))
- [0052] Message Integrity 132: MI(k2,MD(userid∥SIV∥r∥MD(data)))
- [0053] Key Management 134: ASYM(ea,(k1∥k2))
[0054] The Server 150 uses the private keying material associated with ea 611 to decrypt the Key Management component 134 yielding k1 601 and k2 609. The Server 150 uses the k1 601 to decrypt the Authenticator Component 130. Using userid 602, SIV 420, and SIP 604, the Server 150 authenticates the user and cancels the transaction if the authentication fails.
[0055] If the Server 150 detects any errors, then the Server 150 discards the nonce 202 from its volatile memory in order to protect against reuse. Note that data 608 is the message which PSTP secures, i.e., PSTP ensures that data 608 gets the properties of message authenticity and stores the associated consequential evidence.
[0056] Step 3
[0057] If the Server 150 correctly authenticates the Client 120, then the Server 150 sends an optional message to the Client 120 signaling that the Client 120 may proceed (211, 212).
[0058] Step 4
[0059] The Client 120 then uploads the data 608. At this point the Client 120 concludes its PSTP processing in the state labeled “PSTP transmission conclusion” (213). Upon the Server's 150 receipt, the Server 150 validates the Message Integrity component 132 by revalidating the HMAC using the userid 602, the SIV 420, the r 202, and the data 608. The validation relies upon the Server 150 to input (the message digest of the data 608) 613 into the HMAC computation. Additionally, if r 202 contains an embedded timestamp, then the Server 150 should optionally validate that the timestamp is not too old, e.g., over 10 minutes old. If the HMAC or timestamp validation fails, then the Server 150 terminates PSTP in the failed state labeled, “Message integrity failure” (214) and cancels the transaction. If the validation succeeds, then the Server 150 terminates the protocol in the state labeled “Success, execute transaction.” (215) In this case, the Server 150 may execute the transaction authorized by the Client 120, i.e., use the information called data 608 above. Regardless of the outcome of the validation, the Server 150 discards all of PSTP's temporary information from volatile memory in order to protect against the reuse of the nonce or other temporary information. Any notification to the Client 120 that the transaction failed, is communicated from the Server 150 through out-of-band means.
[0060] The following example provides further details of the four steps described above. This further detail augments the description of the four steps by specifying exemplary algorithms and other pertinent information which instantiate the abstract specification described above.
[0061] Step 1: The client downloads r=SHA1(n,t,serverDN) (202), and ea 611 from the Server 150, where n is a the result of a pseudo-random number generator seeded with 160 bits of entropy, t is the current timestamp in milliseconds, and serverDN is the server's distinguished name. The server stores n, t, and serverDN in volatile memory, and can regenerate r upon request. However, if in one of the subsequent steps of the protocol, the server were to detect an error, then the server would discard n and t from volatile memory, thus prohibiting any practical possibility of regenerating r.
[0062] Step 2: The client uploads the following message to the server
-
- [0063] AES(k1,(userid∥SIV∥SIP)) 130,
- [0064] HMAC(k2,SHA1(userid∥SIV∥r∥SHA1(data))) 132,
- [0065] RSAESOAEP (ea,(k1,k2)) 134
where SIV 420 is the current value displayed on the user's RSA SecurID token 400, and SIP 604 is the corresponding password.
[0066] Step 3: The Client 120 downloads a message from the Server 150 indicating that the client may proceed. In the case of HTTP interaction, the client sends the Step 2 message in an HTTP POST which requests the next URL. The client downloads this URL from the server, and this download acts as the proceed message.
[0067] Step 4: In Step 4, the Client 120 uploads the data 608. The Server 150 uses the data and the values stored in memory to validate the HMAC result. Additionally, the Server 150 fails validation if the difference between the current time, and the value t is larger than a predefined threshold. The Server 150 responds with a PSTP transaction success message if and only if the validation succeeds.
[0068] Referring to FIG. 4 , an exemplary architecture for providing consequential evidence of a transaction is illustrated. FIG. 4 includes the Client 120, a Transaction Security Authority TSA 145, a Transaction Execution Engine TEE 150, and a Trust Distributor 147. The Client 120 is communicatively coupled to the TSA 145. The TSA is communicatively coupled to the TD 147 and the TEE 150 (an embodiment of the Server 150).
[0069] Asymmetric key pair (ea,da) where da 701 is the private keying material which decrypts information that was encrypted with ea 611. The private keying material da 701 resides on the Trust Distributor 147. A collection of asymmetric key pairs, where each key pair is used to authenticate a bidirectionally authenticated SSL link. The TSA 145 and the Trust Distributor 147 conduct all communication over an SSL link where the two parties mutually authenticate under the auspices of the SSL protocol using db 702 and dc 704, respectively; and they validate the peers' authentication using ec 705 and eb 703, respectively. The TSA 145 and the TEE 150 conduct all communication over an SSL link where the two parties mutually authenticate under the auspices of the SSL protocol using db 702 and dd 707, respectively; and they validate the peers' authentication using ed 706 and eb 703, respectively.
[0070] The TSA 145 and the TEE 150 create their bidirectionally authenticated SSL link at system initialization time (before processing any PSTP signatures). Each respective machine implicitly trusts that any information received over the SSL link was transmitted by the peer of the SSL link. For example, if a message claims to originate from the TSA 145, then the TEE 150 allows the message if it arrived over the SSL link from the TSA 145; and discards the message if it did not arrive from the SSL link from the TSA 145.
[0071] The private keying material of each asymmetric key pair is held confidentially by each machine and is not shared with other parties. The private keying materials are: da 701, db 702, dc 704, and dd 707.
[0072] The TEE 150 operates upon the data 608. For example, if the data 608 is instructions to move funds, then the TEE 150 contains the business logic to execute a funds transfer transaction.
[0073] The Trust Distributor 147 includes, but is not limited to, all functionality of the RSA ACE Server (the server that validates RSA SecurIDs). In this case, the ACE server authenticates by interrogating the userid 602, SIV 420, and SIP 604. The ACE server returns a Boolean result: success if and only if the userid 602, SIV 420, and SIP 604 are currently valid in accordance to RSA SecurID semantics. The operators of the Trust Distributor 147 (ACE server) apply best practices in their operational duties.
[0074] The following scenario provides further details of the four PSTP steps.
[0075] Step 1: The client 120 downloads r=SHA1(n,t,serverDN) (202), and ea 611 from the TSA 145, where n is a the result of a pseudo-random number generator seeded with 160 bits of entropy, t is the current timestamp in milliseconds, and serverDN is the server's distinguished name. The TSA 145 stores n, t, and serverDN in volatile memory, and can regenerate r upon request.
[0076] Step 2: The Client 120 uploads the following message to the TSA 145:
-
- [0077] AES(k1,(userid∥SIV∥SIP)) 130,
- [0078] HMAC(k2,SHA1(userid∥SIV∥r|SHA1(data))) 132,
- [0079] RSAESOAEP (ea,(k1,k2)) 134.
The SIV 420 is the current value displayed on the user's RSA SecurID token 400, and the SIP 604 is the corresponding password. The Client 120 saves a copy of the message in its non-volatile storage to be used for the client's record keeping.
[0080] Step 2a: The TSA 145 creates a value called “TS”. The TSA assigns the value TS with the current date and timestamp, and keeps TS in its internal memory.
[0081] Step 2b: The TSA 145 forwards the information that it just received from the Client 120 to the Trust Distributor 147. The Trust Distributor 147 uses da 701 to decrypt the Key Management Component 134, thereby discovering k1 601 and k2 609. The Trust Distributor uses k1 601 to decrypt the Authenticator component 130, and then validates information in the Authenticator component 130 using ACE server functionality. If the validation fails, then the Trust Distributor 147 returns a failure message to the TSA 145. Otherwise, the Trust Distributor 147 returns a success code coupled with the decrypted Message Integrity key k2 609. Upon receipt, the TSA 145 stores k2 609 in memory.
[0082] Step 3: The Client 120 downloads a message from the TSA 145 indicating that the Client 120 may proceed. In the case of HTTP interaction, the Client 120 would send the Step 2 message in an HTTP POST which requests the next URL. The Client 120 downloads this URL from the TSA 145, and this download acts as the proceed message.
[0083] Step 4: The Client 120 uploads the data 608. The Client 120 preferably saves a copy of the data 608 in its non-volatile storage to be used for the client's record keeping. The TSA 145 uses the data 608 and the values stored in memory to validate the HMAC result of the Message Integrity component 132. The TSA 145 responds with a PSTP transaction success if and only if validation succeeds.
[0084] Step 4a: The TSA 145 creates a log record which includes the following:
-
- [0085] AES(k1,(userid∥SIV∥SIP)) 130,
- [0086] HMAC(k2,SHA1(userid∥SIV∥r∥SHA1(data))) 132,
- [0087] RSAESOAEP (ea,(k1,k2)) 134,
- [0088] data 608,
- [0089] TS, r.
[0090] Step 4b: The TSA 145 writes the log record to a tamper-evident log. An example of a tamper-evident logging is found in the following literature: B. Schneier and J. Kelsey, Cryptographic Support for Secure Logs on Untrusted Machines, The 7th USENIX Security Symposium Proceedings, pp. 53-62, USENIX Press, January 1998, which is incorporated by reference herein in its entirety.
[0091] Step 4c: The TSA 145 sends a copy of the log record to the TEE 150, and then discards all information pertaining to this PSTP session stored in memory, e.g., n, t, r and TS.
[0092] Step 4d: The TEE 150 extracts the data 608 from the log record and acts upon the data. For example, if the data 608 includes instructions to move funds, then the TEE 150 performs the actual funds movement.
[0093] At a subsequent point in time, suppose a user questions the validity of the PSTP signed data 608. In this case, the TSA 145 may respond to this question by confidentially presenting the following material to an independent, mutually trusted 3rd party judge:
-
- [0094] the log record of the questioned message
- [0095] Information required to demonstrate that the tamper-evident log has not been tampered
- [0096] Information which demonstrates that the log record in question appears in the log
- [0097] da 701
- [0098] SecurID seed 801
- [0099] serial number 802
With one exception, this same judge repeats all validations of Step 2b and Step 4. In addition, this same judge validates that the tamper-evident log has not been tampered. The one exception is that this same judge validates the authentication component using TS from the log record, as opposed to using the current date and time. This validation requires a special tool that is similar to the ACE server.
[0100] If the TEE 150 executes a transaction, then at a later time, the Client 120 may demand that the TSA 145 produce the corresponding log record; and then the parties may use the 3rd party judge for independent validation. Otherwise, the Client 120 may deny the transaction.
[0101] Advantageously, the mechanism described herein allows any, or all, of the Client 120, the TSA 145, the TEE 150, the Trust Distributor 147, and the 3rd party judge to be operated by different parties. In the case of a SecurID credential, the consequential evidence in the log record provides a valid record of an historical event. Collusion between multiple of the above parties would be required in order to obtain log record entries that may be incorrect. For example, the party that executes transactions, the TEE 150, never discovers information contained in the Authenticator component 130; and the TEE 150 does not maintain the tamper-evident log. The TSA 145 which is the party that validates the Message Integrity component 132 and maintains the tamper-evident log, never discovers information in the Authenticator component 130. The Trusted Distributor 147 which is the party that validates the Authenticator component 130 never obtains the data 608 and does not maintain the tamper-evident log.
[0102] One factor that contributes to the overall strength of PSTP security is the relative strength of security of the authentication credential. For example, a SecurID credential provides better authentication than a credit card because it is easier to make an illicit copy of a credit card number than it would be to compromise SecurID security by building a copy of the authentication token. Nevertheless, in some cases, the lower security afforded by a credit card number may provide sufficient security to authenticate the client. The determination of whether or not a credit card number provides sufficient security is a business decision. In this case, one may use a CVV number wherever PSTP requires a SIP; and one may use a credit card number wherever PSTP requires a SIV. A CVV number is an anti-fraud security feature found on many credit cards that is used to verify that the cardholder is in possession of the card. Note that neither the TSA 145 nor the TEE 150 discover the value of the SIV or SIP. In the case of credit card numbers, this property may be important because it allows vendors to securely sell merchandise on a public network such as the Internet, provide a secure historical record of consequential evidence of all transactions, issue receipts for transactions (the copy of the PSTP signature held by the client); yet never discover the value of the credit card number or CVV. That is, the value of the credit card number and CVV would only be known by the Client 120 and the Trust Distributor 147. In this case, the entity selling merchandise may operate the TSA 145 and the TEE 150. Alternatively, for added security, the entity selling the merchandise may operate the TEE 150, and communicate with an independent entity who operates the Trust Distributor 147.
[0103] Based on the forgoing, it can be concluded that the Trusted Parties demonstrate (1) they had sufficient evidence to ensure message authenticity at the time of the event, (2) they logged the event correctly at the time of the event, and (3) the log has not been tampered after the event.
[0104] The invention will be further clarified by the following user case:
Example
[0105] FIG. 5 illustrates an exemplary screen display 300 of a value-bearing transaction entry form. The screen display 300 includes a customer name box 301 for entering a user's name, an origin account box 302 for entering an originating party's account number, a destination account box 303 for entering a destination party's account number, a transaction amount box 304 for entering an amount to transfer to the destination account, a token box 305 for entering an authorization token, a password box 306 for entering a password, and a signature button 307 for digitally signing the transaction. It is to be appreciated that the screen display 300 shown in FIG. 3 is a simplified version of an actual form and is provided for illustrative purposes. Furthermore, it is to be appreciated that various other graphical user interface widgets could be used to implement this screen 300.
[0106] In operation, a user points his or her browser towards a Web-based financial application. The Web-based application then presents a logon prompt. Thereupon, the user logs into the system by presenting his or her authentication credentials. The user then executes facilities presented by the Web-based financial application. Eventually, the user indicates that he or she wants to perform a function that requires added security. For example, the user might decide to wire $10,000 from account 437286 to account 739292.
[0107] In this case, the user would enter the customer's name (e.g., “John Smith”) in the customer name box 301, origin account number (e.g., “437286”) in the origin account box 302, destination account number 739292 in the destination account box 303, transaction amount 10000 in the transaction amount box 304, current token code (634917) 420 into the token box 305, and password in the password box 306. The user would obtain the current token code 420, for example using a SecurId card 400 (commercially available from RSA Security, Inc.), as shown in FIG. 6 . As depicted in FIG. 6 , the SecurID token code 420 is displayed to the user. As is well known in the art, the SecurId card 400 continually generates a series of one-time authentication token codes 420 that can be used to access a server. Heretofore, the SecurId card 400 worked in conjunction with a server to authenticate a user to a network. However, rather than use the SecurID card 400 solely for purposes of network authentication, the SecurID card 400 may be used to establish user authenticity for a transaction.
[0108] To accomplish the transaction the user clicks on the sign button 307 with a mouse device. The user's Web browser combines the information that the user entered into the form with the values r and ea, previously generated by the server and downloaded to the user's web browser along with the form. The browser cryptographically processes the result and uploads that cryptographic result to the server (Step 2). The server replies to the user's browser (Step 3). This step is hidden from the user. The browser uploads the information in the form to the server (Step 4). The server downloads a page to the user indicating whether or not the transaction succeeded.
[0109] A user may repeat the process described above multiple times. Each time the user
[0110] securely transmits a new message and obtains the benefit of message authenticity. On each message the user reuses the same authentication device, e.g., SecurID token 400. However, the token code 420 displayed on the SecurID token would be different for each message.
[0111] This example has the following properties:
-
- [0112] SIV: 6 numeric digits
- [0113] SIP: length not specified, but advised to be at least 7 characters
- [0114] k1: 128 bits of key entropy (examples of 192 or 256 bits also provided)
- [0115] k2: 160 bits of key entropy
[0116] In the example, the originator's client must contribute at least 160 bits of key entropy toward the creation of k2. However, the originator's user only needs to copy 6 characters of information from the Authentication token 420 into the box 305.
[0117] This invention uses technologies and concepts that are known to those skilled in the cryptographic art, including:
[0118] SHA1: ANSI X.9.30:2-1997, Public-key Cryptography for the Financial Services Industry: Part 2: The Secure Hash Algorithm (SHA-1) (revision of X9.30:2-1993).
[0119] HMAC: ANSI X9.71-2000, Keyed Hash Message Authentication Code (MAC).
[0120] 3DES: ANSI X9.52-1998, Cryptography for the Financial Services Industry: Triple Data Encryption Algorithm Modes of Operation
[0121] AES: Federal Information Processing Standards Publication 197, 26-Nov.-01, Advanced Encryption Standard (AES). AES supports key sizes of 128 bits, 192 bits, and 256 bits.
[0122] Public Key Infrastructure (PKI): Menezes et al., Handbook of Applied Cryptography, Boca Raton: CRC Press, 1997, pp.
[0123] Distinguished Name: RFC 1779, Kille, S., “A String Representation of Distinguished Names”, March 1995.
[0124] RSA OAEP: RSA Laboratories. PKCS #1 v.2.1: RSA Cryptography Standard. June 2002.
[0125] RSA Security SecurID card: “RSA SecurID authenticators (also called tokens) allow users to identify themselves to the network and thus gain access to protected resources. Referring to FIG. 7 , starting with a random but user-specific seed value 801, the token generates and displays a unique number every time period, e.g., 60 seconds, (SIV 420). The generated number is valid only for that user and that time period—and only when combined with the user's secret PIN or password (SIP 604). Because of the dynamic nature of the token, a user's electronic identity cannot be easily mimicked, hacked, or hijacked”. RSA Security: http://www.rsasecurity.com/products/securid/brochures/SID BR 1202 lowres.pd f, 22-May-04. The seed 801 is hidden within the SecurID token's 400 memory and security measures prevent its discovery. The serial number 802 is printed on the SecurID token 400, and can be read by anyone in physical possession of the token. The Trust Distributor 147 which may serve in the capacity of an RSA ACE Server has a copy of the unique seed and serial number of each credential. For simplicity, this disclosure assumes that the userid and the serial number are the same. However, in some cases, these values are different and a table exists which defines a one-to-one mapping between them. In other words, when presented with a userid, the table immediately yields the corresponding serial number. This table may potentially be implemented on the Server 150, or the Trust Distributor 147.
[0126] This present invention assumes that a tool exists which operates in a similar manner to the ACE server; however, it allows an historical time to be provided as an input, in addition to the SIV, userid, and possibly the serial number. This tool is used by a 3rd party judge to independently validate consequential evidence of historical events. Unlike the ACE Server, this tool does not guarantee one-time semantics for the SIV, e.g., the tool can validate the same SIV multiple times. Also, the tool does not require the SIV.
[0127] The SecurID mechanism is one possible authentication mechanism for use in conjunction with the present invention. Another example is the credit card number (perhaps along with the CVV number). In this case, the 3rd party judge must determine validity of a credit card number at the time of historical transaction. The validation performed by the 3rd party judge includes, but is not limited to, validation of the start and end validity of the credit card number against the date of the transaction. In addition, the check should validate an historical record of credit card number suspension to determine if the credit card was cancelled by the user or any other authorized party before the date of the transaction.
[0128] To facilitate a clear understanding of the present invention, illustrative examples are provided herein which describe certain aspects of the invention. However, it is to be appreciated that these illustrations are not meant to limit the scope of the invention, and are provided herein to illustrate certain concepts associated with the invention. For example, while the user case example shown herein is described with respect to the financial services industry, it is to be understood that the methods and systems of the present invention may also be suitable in other industries. In general, the present invention may be thought of an alternative to PKI-based digital signature.
[0129] Although illustrative embodiments of the present invention have been described herein with reference to the accompanying drawings, it is to be understood that the invention is not limited to those precise embodiments, and that various other changes and modifications may be affected therein by one skilled in the art without departing from the scope or spirit of the invention.
Claims
What is claimed is:
1. A computer-implemented method for providing message authenticity for a message by an originating user to a recipient's computer, the method comprising the steps of:
accepting, through the recipient's computer, from the originating user:
(i) an encrypted authenticator component comprising authentication data and a user authentication key, wherein the user authentication key is displayed on an external device of the user,
(ii) a message integrity component, and
(iii) an encrypted key management component;
decrypting the key management component, through the recipient's computer, to yield (a) a key which decrypts the user authentication key and (b) a message integrity key, wherein the entropy of the user authentication key is less than the entropy of the message integrity key;
decrypting the authenticator component, through the recipient's computer, using the key which decrypts the user authentication key;
authenticating the user, through the recipient's computer, using the authentication data;
accepting, through the recipient's computer, a message comprising message data from the originating user's computer; and
validating the message integrity component through the recipient's computer using the message integrity key and the message data, thereby validating the message.
2. The method of claim 1, wherein the message integrity key is not derivable from the user authentication key.
3. The method of claim 1, wherein the external device is an authentication token.
4. The method of claim 3, wherein information obtained from the authentication token contributes to the user authentication key exclusively.
5. The method of claim 3, wherein the authentication token is a one-way authentication token.
6. The method of claim 1, wherein the user authentication key includes one or more of a sequence of digits corresponding to those displayed on the external device.
7. The method of claim 6, wherein the external device is not electronically connected to a computer system.
8. The method of claim 6, wherein the number of digits of the sequence of digits is less than ten.
9. The method of claim 8, wherein the entropy of the message integrity key is 80 bits or greater.
10. The method of claim 6, wherein the number of digits of the sequence of digits is less than twenty-one.
11. The method of claim 10, wherein the entropy of the message integrity key is 80 bits or greater.
12. The method of claim 1, wherein the user authentication key is inaccessible to an entity authorized to process a transaction related to the message.
13. The method of claim 1, further including the step of providing consequential evidence, wherein providing consequential evidence includes writing a message to a log record, the message including a transaction information, the authenticator component, the message integrity component, the key management component, and an identifier for the originating user.
14. The method of claim 13, wherein the step of providing consequential evidence further includes consulting the log record for one or more of the transaction information, the authenticator component, the message integrity component, the key management component, and the identifier for the originating user.
15. The method of claim 14, wherein the consulting of the log record is performed to validate the message authenticity of the message included in the log record.
16. The method of claim 15, wherein the log record is sent to a trusted third party to validate the log record.
17. The method of claim 1, further comprising: providing anti-replay protection to the message.
18. The method of claim 17, wherein the message integrity component comprises a unique nonce and the anti-replay protection is provided using the unique nonce.
19. A system for providing message authenticity for a message sent by an originating user to a recipient, comprising:
a computer-readable memory that stores, from the originating user, a message and a user authentication key used for authentication credentials representing the originating user and a message integrity key used for providing message integrity, wherein the user authentication key and the message integrity key are encrypted; and
a processor communicatively coupled to the computer-readable memory, the processor programmed to perform actions by the recipient, comprising:
accepting from the originating user:
(i) an encrypted authenticator component comprising authentication data and a user authentication key which is displayed on an external device of the user,
(ii) a message integrity component, and
(iii) an encrypted key management component;
decrypting the key management component, through the recipient's computer, to yield (a) a key which decrypts the user authentication key and (b) a message integrity key, wherein the entropy of the user authentication key is less than the entropy of the message integrity key;
decrypting the authenticator component using the key which decrypts the user authentication key;
authenticating the user using the authentication data;
accepting a message comprising message data from the originating user's computer; and
validating the message integrity component through the recipient's computer using the message integrity key and the message data, thereby validating the message.
20. The system of claim 19, wherein the processor is further programmed to perform the action of providing anti-replay protection to the message.
21. The system of claim 20, wherein the message integrity component comprises a unique nonce and the anti-replay protection is provided using the unique nonce.
22. A program storage device readable by a machine, tangibly embodying a program of instructions executable on the machine to perform method steps for providing end-to-end message authenticity for a message sent by an originating user to a recipient, the method steps, performed by the recipient, comprising:
accepting from the originating user:
(i) an encrypted authenticator component comprising authentication data and a user authentication key which is displayed on an external device of the user,
(ii) a message integrity component, and
(iii) an encrypted key management component;
decrypting the key management component, through the recipient's computer, to yield (a) a key which decrypts the user authentication key and (b) a message integrity key, wherein the entropy of the user authentication key is less than the entropy of the message integrity key;
decrypting the authenticator component using the key which decrypts the user authentication key;
authenticating the user using the authentication data;
accepting a message comprising message data from the originating user's computer; and
validating the message integrity component through the recipient's computer using the message integrity key and the message data, thereby validating the message.
23. The program storage device of claim 22, wherein the program of instructions further comprise instructions for providing anti-replay protection to the message.
24. The program storage device of claim 23, wherein the message integrity component comprises a unique nonce and the anti-replay protection is provided using the unique nonce.
Patent Citations (577)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3896266(A) | 1975-07-01 | Waterbury | Applicant |
| US3938091(A) | 1976-02-01 | Atalla et al. | Applicant |
| US4321672(A) | 1982-03-01 | Braun et al. | Applicant |
| US4567359(A) | 1986-01-01 | Lockwood | Applicant |
| US4633397(A) | 1986-12-01 | Macco | Applicant |
| US4695880(A) | 1987-09-01 | Johnson et al. | Applicant |
| US4696491(A) | 1987-09-01 | Stenger | Applicant |
| US4713761(A) | 1987-12-01 | Sharpe et al. | Applicant |
| US4725719(A) | 1988-02-01 | Oncken et al. | Applicant |
| US4745468(A) | 1988-05-01 | Von Kohorn | Applicant |
| US4799156(A) | 1989-01-01 | Shavit | Applicant |
| US4801787(A) | 1989-01-01 | Suzuki | Applicant |
| US4823264(A) | 1989-04-01 | Deming | Applicant |
| US4882675(A) | 1989-11-01 | Nichtberger et al. | Applicant |
| US4926255(A) | 1990-05-01 | Von Kohorn | Applicant |
| US4941090(A) | 1990-07-01 | McCarthy | Applicant |
| US4964043(A) | 1990-10-01 | Galvin | Applicant |
| US4992940(A) | 1991-02-01 | Dworkin | Applicant |
| US5016270(A) | 1991-05-01 | Katz | Applicant |
| US5050207(A) | 1991-09-01 | Hitchcock | Applicant |
| US5084816(A) | 1992-01-01 | Boese | Applicant |
| US5117355(A) | 1992-05-01 | McCarthy | Applicant |
| US5157717(A) | 1992-10-01 | Hitchcock | Applicant |
| US5189606(A) | 1993-02-01 | Burns et al. | Applicant |
| US5202826(A) | 1993-04-01 | McCarthy | Applicant |
| US5226079(A) | 1993-07-01 | Holloway | Examiner |
| US5233654(A) | 1993-08-01 | Harvey et al. | Applicant |
| US5235509(A) | 1993-08-01 | Mueller et al. | Applicant |
| US5241594(A) | 1993-08-01 | Kung | Applicant |
| US5265033(A) | 1993-11-01 | Vajk | Applicant |
| US5287268(A) | 1994-02-01 | McCarthy | Applicant |
| US5297026(A) | 1994-03-01 | Hoffman | Applicant |
| US5317683(A) | 1994-05-01 | Hager et al. | Applicant |
| US5321841(A) | 1994-06-01 | East | Applicant |
| US5347580(A) | 1994-09-01 | Molva et al. | Examiner |
| US5351186(A) | 1994-09-01 | Bullock | Applicant |
| US5365589(A) | 1994-11-01 | Gutowitz | Examiner |
| US5381332(A) | 1995-01-01 | Wood | Applicant |
| US5412708(A) | 1995-05-01 | Katz | Applicant |
| US5420405(A) | 1995-05-01 | Chasek | Applicant |
| US5446740(A) | 1995-08-01 | Yien | Applicant |
| US5450134(A) | 1995-09-01 | Legate | Applicant |
| US5450537(A) | 1995-09-01 | Hirai et al. | Applicant |
| US5465206(A) | 1995-11-01 | Hilt et al. | Applicant |
| US5467269(A) | 1995-11-01 | Flaten | Applicant |
| US5473143(A) | 1995-12-01 | Vak | Applicant |
| US5473732(A) | 1995-12-01 | Change | Applicant |
| US5479530(A) | 1995-12-01 | Nair et al. | Applicant |
| US5511117(A) | 1996-04-01 | Zazzera | Applicant |
| US5513102(A) | 1996-04-01 | Auriemma | Applicant |
| US5532920(A) | 1996-07-01 | Hartrick | Applicant |
| US5534855(A) | 1996-07-01 | Shockley et al. | Applicant |
| US5537314(A) | 1996-07-01 | Kanter | Applicant |
| US5537473(A) | 1996-07-01 | Saward | Applicant |
| US5544086(A) | 1996-08-01 | Davis et al. | Applicant |
| US5551021(A) | 1996-08-01 | Harada | Applicant |
| US5557334(A) | 1996-09-01 | Legate | Applicant |
| US5557518(A) | 1996-09-01 | Rosen | Applicant |
| US5560008(A) | 1996-09-01 | Johnson et al. | Applicant |
| US5568489(A) | 1996-10-01 | Yien | Applicant |
| US5570295(A) | 1996-10-01 | Isenberg | Applicant |
| US5570465(A) | 1996-10-01 | Tsakanikas | Applicant |
| US5576951(A) | 1996-11-01 | Lockwood | Applicant |
| US5583778(A) | 1996-12-01 | Wind | Applicant |
| US5590199(A) | 1996-12-01 | Krajewski et al. | Applicant |
| US5592378(A) | 1997-01-01 | Cameron | Applicant |
| US5592560(A) | 1997-01-01 | Deaton et al. | Applicant |
| US5594837(A) | 1997-01-01 | Noyes | Applicant |
| US5598557(A) | 1997-01-01 | Doner | Applicant |
| US5602936(A) | 1997-02-01 | Green et al. | Applicant |
| US5603025(A) | 1997-02-01 | Tabb | Applicant |
| US5604490(A) | 1997-02-01 | Blakely et al. | Applicant |
| US5606496(A) | 1997-02-01 | D'Agostino | Applicant |
| US5611052(A) | 1997-03-01 | Dykstra | Applicant |
| US5621201(A) | 1997-04-01 | Langhans | Applicant |
| US5621789(A) | 1997-04-01 | McCalmont | Applicant |
| US5621812(A) | 1997-04-01 | Deaton et al. | Applicant |
| US5625767(A) | 1997-04-01 | Bartell | Applicant |
| US5634101(A) | 1997-05-01 | Blau | Applicant |
| US5638457(A) | 1997-06-01 | Deaton et al. | Applicant |
| US5640577(A) | 1997-06-01 | Scharmer | Applicant |
| US5642419(A) | 1997-06-01 | Rosen | Applicant |
| US5644493(A) | 1997-07-01 | Motai | Applicant |
| US5653914(A) | 1997-08-01 | Holmes et al. | Applicant |
| US5657383(A) | 1997-08-01 | Gerber | Applicant |
| US5659165(A) | 1997-08-01 | Jennings | Applicant |
| US5664115(A) | 1997-09-01 | Fraser | Applicant |
| US5666493(A) | 1997-09-01 | Wojcik et al. | Applicant |
| US5671285(A) | 1997-09-01 | Newman | Applicant |
| US5675637(A) | 1997-10-01 | Szlam et al. | Applicant |
| US5675662(A) | 1997-10-01 | Deaton et al. | Applicant |
| US5677955(A) | 1997-10-01 | Doggett et al. | Applicant |
| US5678046(A) | 1997-10-01 | Cahill et al. | Applicant |
| US5682524(A) | 1997-10-01 | Freund | Applicant |
| US5684870(A) | 1997-11-01 | Maloney | Applicant |
| US5687322(A) | 1997-11-01 | Deaton et al. | Applicant |
| US5689100(A) | 1997-11-01 | Carrithers et al. | Applicant |
| US5692132(A) | 1997-11-01 | Hogan | Applicant |
| US5699528(A) | 1997-12-01 | Hogan | Applicant |
| US5703344(A) | 1997-12-01 | Bezy et al. | Applicant |
| US5710886(A) | 1998-01-01 | Christensen et al. | Applicant |
| US5710887(A) | 1998-01-01 | Chelliah | Applicant |
| US5710889(A) | 1998-01-01 | Clark et al. | Applicant |
| US5715298(A) | 1998-02-01 | Rogers | Applicant |
| US5715314(A) | 1998-02-01 | Payne | Applicant |
| US5715399(A) | 1998-02-01 | Bezos | Applicant |
| US5715402(A) | 1998-02-01 | Popolo | Applicant |
| US5715450(A) | 1998-02-01 | Ambrose | Applicant |
| US5724424(A) | 1998-03-01 | Gifford | Applicant |
| US5727163(A) | 1998-03-01 | Bezos | Applicant |
| US5734838(A) | 1998-03-01 | Robinson | Applicant |
| US5737414(A) | 1998-04-01 | Walker et al. | Applicant |
| US5740231(A) | 1998-04-01 | Cohn et al. | Applicant |
| US5754840(A) | 1998-05-01 | Rivette | Applicant |
| US5758126(A) | 1998-05-01 | Daniels et al. | Applicant |
| US5758328(A) | 1998-05-01 | Giovannoli | Applicant |
| US5761288(A) | 1998-06-01 | Pinard et al. | Applicant |
| US5761647(A) | 1998-06-01 | Boushy | Applicant |
| US5761661(A) | 1998-06-01 | Coussenns | Applicant |
| US5764789(A) | 1998-06-01 | Pare et al. | Applicant |
| US5765141(A) | 1998-06-01 | Spector | Applicant |
| US5765143(A) | 1998-06-01 | Sheldon | Applicant |
| US5768382(A) | 1998-06-01 | Schneier et al. | Applicant |
| US5774122(A) | 1998-06-01 | Kojima | Applicant |
| US5778178(A) | 1998-07-01 | Arunachalam | Applicant |
| US5784562(A) | 1998-07-01 | Diener | Applicant |
| US5787403(A) | 1998-07-01 | Randle | Applicant |
| US5787404(A) | 1998-07-01 | Fernandez-Holman | Applicant |
| US5790650(A) | 1998-08-01 | Dunn | Applicant |
| US5790785(A) | 1998-08-01 | Klug et al. | Applicant |
| US5793861(A) | 1998-08-01 | Haigh | Applicant |
| US5794178(A) | 1998-08-01 | Caid | Applicant |
| US5794207(A) | 1998-08-01 | Walker | Applicant |
| US5794259(A) | 1998-08-01 | Kikinis | Applicant |
| US5796395(A) | 1998-08-01 | De Hond | Applicant |
| US5797127(A) | 1998-08-01 | Walker et al. | Applicant |
| US5798508(A) | 1998-08-01 | Walker et al. | Applicant |
| US5802498(A) | 1998-09-01 | Comesanas | Applicant |
| US5802502(A) | 1998-09-01 | Gell | Applicant |
| US5805719(A) | 1998-09-01 | Pare et al. | Applicant |
| US5815657(A) | 1998-09-01 | Williams et al. | Applicant |
| US5815683(A) | 1998-09-01 | Vogler | Applicant |
| US5818936(A) | 1998-10-01 | Moshayekhi | Applicant |
| US5819092(A) | 1998-10-01 | Ferguson | Applicant |
| US5819285(A) | 1998-10-01 | Damico | Applicant |
| US5825863(A) | 1998-10-01 | Walker | Applicant |
| US5825870(A) | 1998-10-01 | Miloslavsky | Applicant |
| US5826241(A) | 1998-10-01 | Stein | Applicant |
| US5826245(A) | 1998-10-01 | Sandberg-Diment | Applicant |
| US5826250(A) | 1998-10-01 | Trefler | Applicant |
| US5828734(A) | 1998-10-01 | Katz | Applicant |
| US5828751(A) | 1998-10-01 | Walker et al. | Applicant |
| US5828812(A) | 1998-10-01 | Khan et al. | Applicant |
| US5828833(A) | 1998-10-01 | Belville et al. | Applicant |
| US5832460(A) | 1998-11-01 | Bednar | Applicant |
| US5832476(A) | 1998-11-01 | Tada | Applicant |
| US5835580(A) | 1998-11-01 | Fraser | Applicant |
| US5835603(A) | 1998-11-01 | Coutts | Applicant |
| US5838906(A) | 1998-11-01 | Doyle | Applicant |
| US5842178(A) | 1998-11-01 | Giovannoli | Applicant |
| US5842211(A) | 1998-11-01 | Horadan | Applicant |
| US5844553(A) | 1998-12-01 | Hao | Applicant |
| US5845259(A) | 1998-12-01 | West et al. | Applicant |
| US5845260(A) | 1998-12-01 | Nakano et al. | Applicant |
| US5847709(A) | 1998-12-01 | Card | Applicant |
| US5848400(A) | 1998-12-01 | Chang | Applicant |
| US5848427(A) | 1998-12-01 | Hyodo | Applicant |
| US5852812(A) | 1998-12-01 | Reeder | Applicant |
| US5857079(A) | 1999-01-01 | Claus et al. | Applicant |
| US5862223(A) | 1999-01-01 | Walker | Applicant |
| US5864830(A) | 1999-01-01 | Armetta et al. | Applicant |
| USRE36116(E) | 1999-02-01 | McCarthy | Applicant |
| US5870718(A) | 1999-02-01 | Spector | Applicant |
| US5870725(A) | 1999-02-01 | Belinger et al. | Applicant |
| US5871398(A) | 1999-02-01 | Schneier et al. | Applicant |
| US5873072(A) | 1999-02-01 | Kight | Applicant |
| US5873096(A) | 1999-02-01 | Lim | Applicant |
| US5880769(A) | 1999-03-01 | Nemirofsky | Applicant |
| US5884032(A) | 1999-03-01 | Bateman | Applicant |
| US5884270(A) | 1999-03-01 | Walker et al. | Applicant |
| US5884272(A) | 1999-03-01 | Walker et al. | Applicant |
| US5884274(A) | 1999-03-01 | Walker et al. | Applicant |
| US5884288(A) | 1999-03-01 | Chang | Applicant |
| US5889863(A) | 1999-03-01 | Weber | Applicant |
| US5892900(A) | 1999-04-01 | Ginter et al. | Applicant |
| US5898780(A) | 1999-04-01 | Liu et al. | Applicant |
| US5899982(A) | 1999-05-01 | Randle | Applicant |
| US5903881(A) | 1999-05-01 | Schrader | Applicant |
| US5909486(A) | 1999-06-01 | Walker et al. | Applicant |
| US5910988(A) | 1999-06-01 | Ballard | Applicant |
| US5913202(A) | 1999-06-01 | Motoyama | Applicant |
| US5914472(A) | 1999-06-01 | Foladare et al. | Applicant |
| US5915244(A) | 1999-06-01 | Jack et al. | Applicant |
| US5918214(A) | 1999-06-01 | Perkowski | Applicant |
| US5918217(A) | 1999-06-01 | Maggioncalda | Applicant |
| US5918239(A) | 1999-06-01 | Allen et al. | Applicant |
| US5920847(A) | 1999-07-01 | Kolling et al. | Applicant |
| US5921864(A) | 1999-07-01 | Walker et al. | Applicant |
| US5923763(A) | 1999-07-01 | Walker et al. | Applicant |
| US5926796(A) | 1999-07-01 | Walker et al. | Applicant |
| US5926812(A) | 1999-07-01 | Hilsenrath | Applicant |
| US5930764(A) | 1999-07-01 | Melchione | Applicant |
| US5933816(A) | 1999-08-01 | Zeanah et al. | Applicant |
| US5933817(A) | 1999-08-01 | Hucal | Applicant |
| US5933823(A) | 1999-08-01 | Cullen | Applicant |
| US5933827(A) | 1999-08-01 | Cole et al. | Applicant |
| US5940812(A) | 1999-08-01 | Tengel et al. | Applicant |
| US5943656(A) | 1999-08-01 | Crooks | Applicant |
| US5944824(A) | 1999-08-01 | He | Applicant |
| US5945653(A) | 1999-08-01 | Walker et al. | Applicant |
| US5946388(A) | 1999-08-01 | Walker et al. | Applicant |
| US5947747(A) | 1999-09-01 | Walker et al. | Applicant |
| US5949044(A) | 1999-09-01 | Walker et al. | Applicant |
| US5949875(A) | 1999-09-01 | Walker et al. | Applicant |
| US5950173(A) | 1999-09-01 | Perkowski | Applicant |
| US5950174(A) | 1999-09-01 | Brendzel | Applicant |
| US5950206(A) | 1999-09-01 | Krause | Applicant |
| US5952639(A) | 1999-09-01 | Ohki et al. | Applicant |
| US5952641(A) | 1999-09-01 | Korshun | Applicant |
| US5953710(A) | 1999-09-01 | Fleming | Applicant |
| US5956695(A) | 1999-09-01 | Carrithers et al. | Applicant |
| US5958007(A) | 1999-09-01 | Lee et al. | Applicant |
| US5960411(A) | 1999-09-01 | Hartman et al. | Applicant |
| US5961593(A) | 1999-10-01 | Gabber et al. | Applicant |
| US5963635(A) | 1999-10-01 | Szlam et al. | Applicant |
| US5963925(A) | 1999-10-01 | Kolling et al. | Applicant |
| US5963952(A) | 1999-10-01 | Smith | Applicant |
| US5963953(A) | 1999-10-01 | Cram et al. | Applicant |
| US5966695(A) | 1999-10-01 | Melchione et al. | Applicant |
| US5966699(A) | 1999-10-01 | Zandi | Applicant |
| US5967896(A) | 1999-10-01 | Jorasch et al. | Applicant |
| US5969318(A) | 1999-10-01 | Mackenthun | Applicant |
| US5970143(A) | 1999-10-01 | Schneier et al. | Applicant |
| US5970470(A) | 1999-10-01 | Walker et al. | Applicant |
| US5970478(A) | 1999-10-01 | Walker et al. | Applicant |
| US5970482(A) | 1999-10-01 | Pham | Applicant |
| US5970483(A) | 1999-10-01 | Evans | Applicant |
| US5978467(A) | 1999-11-01 | Walker et al. | Applicant |
| US5983196(A) | 1999-11-01 | Wendkos | Applicant |
| US5987434(A) | 1999-11-01 | Libman | Applicant |
| US5987498(A) | 1999-11-01 | Athing et al. | Applicant |
| US5991736(A) | 1999-11-01 | Ferguson et al. | Applicant |
| US5991738(A) | 1999-11-01 | Ogram | Applicant |
| US5991748(A) | 1999-11-01 | Taskett | Applicant |
| US5991751(A) | 1999-11-01 | Rivette et al. | Applicant |
| US5991780(A) | 1999-11-01 | Rivette | Applicant |
| US5995948(A) | 1999-11-01 | Whitford | Applicant |
| US5995976(A) | 1999-11-01 | Walker et al. | Applicant |
| US5999596(A) | 1999-12-01 | Walker et al. | Applicant |
| US5999907(A) | 1999-12-01 | Donner | Applicant |
| US6000033(A) | 1999-12-01 | Kelly et al. | Applicant |
| US6001016(A) | 1999-12-01 | Walker et al. | Applicant |
| US6003762(A) | 1999-12-01 | Hayashida | Applicant |
| US6005939(A) | 1999-12-01 | Fortenberry et al. | Applicant |
| US6006205(A) | 1999-12-01 | Loeb et al. | Applicant |
| US6006249(A) | 1999-12-01 | Leong | Applicant |
| US6009415(A) | 1999-12-01 | Shurling et al. | Applicant |
| US6009442(A) | 1999-12-01 | Chen et al. | Applicant |
| US6010404(A) | 2000-01-01 | Walker et al. | Applicant |
| US6012088(A) | 2000-01-01 | Li et al. | Applicant |
| US6012983(A) | 2000-01-01 | Walker et al. | Applicant |
| US6014439(A) | 2000-01-01 | Walker et al. | Applicant |
| US6014635(A) | 2000-01-01 | Harris et al. | Applicant |
| US6014636(A) | 2000-01-01 | Reeder | Applicant |
| US6014638(A) | 2000-01-01 | Burge et al. | Applicant |
| US6014641(A) | 2000-01-01 | Loeb et al. | Applicant |
| US6014645(A) | 2000-01-01 | Cunningham | Applicant |
| US6016810(A) | 2000-01-01 | Ravenscroft | Applicant |
| US6018714(A) | 2000-01-01 | Risen, Jr. | Applicant |
| US6018718(A) | 2000-01-01 | Walker et al. | Applicant |
| US6024640(A) | 2000-02-01 | Walker et al. | Applicant |
| US6026398(A) | 2000-02-01 | Brown et al. | Applicant |
| US6026429(A) | 2000-02-01 | Jones et al. | Applicant |
| US6032134(A) | 2000-02-01 | Weissman | Applicant |
| US6032147(A) | 2000-02-01 | Williams et al. | Applicant |
| US6038547(A) | 2000-03-01 | Casto | Applicant |
| US6038552(A) | 2000-03-01 | Fleischl et al. | Applicant |
| US6042006(A) | 2000-03-01 | Van Tilburg et al. | Applicant |
| US6044362(A) | 2000-03-01 | Neely | Applicant |
| US6045039(A) | 2000-04-01 | Stinson et al. | Applicant |
| US6049778(A) | 2000-04-01 | Walker et al. | Applicant |
| US6049782(A) | 2000-04-01 | Gottesman et al. | Applicant |
| US6049835(A) | 2000-04-01 | Gagnon | Applicant |
| US6055637(A) | 2000-04-01 | Hudson et al. | Applicant |
| US6061665(A) | 2000-05-01 | Bahreman | Applicant |
| US6064987(A) | 2000-05-01 | Walker et al. | Applicant |
| US6065120(A) | 2000-05-01 | Laursen et al. | Applicant |
| US6065675(A) | 2000-05-01 | Teicher | Applicant |
| US6070147(A) | 2000-05-01 | Harms et al. | Applicant |
| US6070153(A) | 2000-05-01 | Simpson | Applicant |
| US6070244(A) | 2000-05-01 | Orchier et al. | Applicant |
| US6073105(A) | 2000-06-01 | Sutcliffe et al. | Applicant |
| US6073113(A) | 2000-06-01 | Guinan | Applicant |
| US6075519(A) | 2000-06-01 | Okatani et al. | Applicant |
| US6076072(A) | 2000-06-01 | Libman | Applicant |
| US6081790(A) | 2000-06-01 | Rosen | Applicant |
| US6081810(A) | 2000-06-01 | Rosenzweig et al. | Applicant |
| US6085168(A) | 2000-07-01 | Mori et al. | Applicant |
| US6088444(A) | 2000-07-01 | Walker et al. | Applicant |
| US6088451(A) | 2000-07-01 | He et al. | Applicant |
| US6088683(A) | 2000-07-01 | Jalili | Applicant |
| US6088686(A) | 2000-07-01 | Walker et al. | Applicant |
| US6088700(A) | 2000-07-01 | Larsen et al. | Applicant |
| US6091817(A) | 2000-07-01 | Bertina et al. | Applicant |
| US6092196(A) | 2000-07-01 | Reiche | Applicant |
| US6095412(A) | 2000-08-01 | Bertina et al. | Applicant |
| US6098070(A) | 2000-08-01 | Maxwell | Applicant |
| US6101486(A) | 2000-08-01 | Roberts et al. | Applicant |
| US6104716(A) | 2000-08-01 | Crichton et al. | Applicant |
| US6105012(A) | 2000-08-01 | Chang et al. | Applicant |
| US6105865(A) | 2000-08-01 | Hardesty | Applicant |
| US6111858(A) | 2000-08-01 | Greaves et al. | Applicant |
| US6112181(A) | 2000-08-01 | Shear et al. | Applicant |
| US6115690(A) | 2000-09-01 | Wong | Applicant |
| US6119093(A) | 2000-09-01 | Walker et al. | Applicant |
| US6119099(A) | 2000-09-01 | Walker et al. | Applicant |
| US6119227(A) | 2000-09-01 | Mao | Examiner |
| US6128599(A) | 2000-10-01 | Walker et al. | Applicant |
| US6128602(A) | 2000-10-01 | Northington et al. | Applicant |
| US6131810(A) | 2000-10-01 | Weiss et al. | Applicant |
| US6134549(A) | 2000-10-01 | Regnier et al. | Applicant |
| US6134592(A) | 2000-10-01 | Montulli | Applicant |
| US6135349(A) | 2000-10-01 | Zirkel | Applicant |
| US6138106(A) | 2000-10-01 | Walker et al. | Applicant |
| US6138118(A) | 2000-10-01 | Koppstein et al. | Applicant |
| US6141651(A) | 2000-10-01 | Riley et al. | Applicant |
| US6141666(A) | 2000-10-01 | Tobin | Applicant |
| US6144946(A) | 2000-11-01 | Iwamura | Applicant |
| US6144948(A) | 2000-11-01 | Walker et al. | Applicant |
| US6145086(A) | 2000-11-01 | Bellemore et al. | Applicant |
| US6148293(A) | 2000-11-01 | King | Applicant |
| US6151584(A) | 2000-11-01 | Papierniak et al. | Applicant |
| US6154750(A) | 2000-11-01 | Roberge et al. | Applicant |
| US6154879(A) | 2000-11-01 | Pare et al. | Applicant |
| US6161182(A) | 2000-12-01 | Nadooshan | Applicant |
| US6164533(A) | 2000-12-01 | Barton | Applicant |
| US6170011(B1) | 2001-01-01 | Beck et al. | Applicant |
| US6178511(B1) | 2001-01-01 | Cohen et al. | Applicant |
| US6182052(B1) | 2001-01-01 | Fulton et al. | Applicant |
| US6182142(B1) | 2001-01-01 | Win et al. | Applicant |
| US6182225(B1) | 2001-01-01 | Hagiuda et al. | Applicant |
| US6185242(B1) | 2001-02-01 | Arthur et al. | Applicant |
| US6189029(B1) | 2001-02-01 | Fuerst | Applicant |
| US6195644(B1) | 2001-02-01 | Bowie | Applicant |
| US6199077(B1) | 2001-03-01 | Inala et al. | Applicant |
| US6201948(B1) | 2001-03-01 | Cook et al. | Applicant |
| US6202005(B1) | 2001-03-01 | Mahaffey | Applicant |
| US6202054(B1) | 2001-03-01 | Lawlor et al. | Applicant |
| US6202151(B1) | 2001-03-01 | Musgrave et al. | Applicant |
| US6208978(B1) | 2001-03-01 | Walker et al. | Applicant |
| US6208984(B1) | 2001-03-01 | Rosenthal | Applicant |
| US6216115(B1) | 2001-04-01 | Barrameda et al. | Applicant |
| US6219706(B1) | 2001-04-01 | Fan | Applicant |
| US6222914(B1) | 2001-04-01 | McMullin | Applicant |
| US6226623(B1) | 2001-05-01 | Schein et al. | Applicant |
| US6226679(B1) | 2001-05-01 | Gupta | Applicant |
| US6227447(B1) | 2001-05-01 | Campisano | Applicant |
| US6230148(B1) | 2001-05-01 | Pare et al. | Applicant |
| US6243688(B1) | 2001-06-01 | Kalina | Applicant |
| US6243816(B1) | 2001-06-01 | Fang et al. | Applicant |
| US6246767(B1) | 2001-06-01 | Akins et al. | Examiner |
| US6253327(B1) | 2001-06-01 | Zhang et al. | Applicant |
| US6253328(B1) | 2001-06-01 | Smith, Jr. | Applicant |
| US6260026(B1) | 2001-07-01 | Tomida et al. | Applicant |
| US6266648(B1) | 2001-07-01 | Baker, III | Applicant |
| US6266683(B1) | 2001-07-01 | Yehuda et al. | Applicant |
| US6267292(B1) | 2001-07-01 | Walker et al. | Applicant |
| US6269348(B1) | 2001-07-01 | Pare et al. | Applicant |
| US6275944(B1) | 2001-08-01 | Kao et al. | Applicant |
| US6289322(B1) | 2001-09-01 | Kitchen et al. | Applicant |
| US6298330(B1) | 2001-10-01 | Gardenswartz et al. | Applicant |
| US6298356(B1) | 2001-10-01 | Jawahar et al. | Applicant |
| US6301567(B1) | 2001-10-01 | Leong et al. | Applicant |
| US6308273(B1) | 2001-10-01 | Goertzel et al. | Applicant |
| US6308274(B1) | 2001-10-01 | Swift | Applicant |
| US6311275(B1) | 2001-10-01 | Jin et al. | Applicant |
| US6317838(B1) | 2001-11-01 | Baize | Applicant |
| US6324524(B1) | 2001-11-01 | Lent et al. | Applicant |
| US6327573(B1) | 2001-12-01 | Walker et al. | Applicant |
| US6327578(B1) | 2001-12-01 | Linehan | Applicant |
| US6332192(B1) | 2001-12-01 | Boroditisky et al. | Applicant |
| US6336104(B1) | 2002-01-01 | Walker et al. | Applicant |
| US6343279(B1) | 2002-01-01 | Bissonette et al. | Applicant |
| US6345261(B1) | 2002-02-01 | Feidelson | Applicant |
| US6349242(B2) | 2002-02-01 | Mahaffey | Applicant |
| US6349336(B1) | 2002-02-01 | Sit et al. | Applicant |
| US6353888(B1) | 2002-03-01 | Kakehi et al. | Examiner |
| US6385591(B1) | 2002-05-01 | Mankoff | Applicant |
| US6385652(B1) | 2002-05-01 | Brown et al. | Applicant |
| US6401125(B1) | 2002-06-01 | Makarios et al. | Applicant |
| US6401211(B1) | 2002-06-01 | Brezak, Jr. et al. | Applicant |
| US6408389(B2) | 2002-06-01 | Grawrock et al. | Applicant |
| US6418457(B1) | 2002-07-01 | Schmidt et al. | Applicant |
| US6438594(B1) | 2002-08-01 | Bowman-Amuah | Applicant |
| US6438666(B2) | 2002-08-01 | Cassagnol et al. | Applicant |
| US6449765(B1) | 2002-09-01 | Ballard | Applicant |
| US6453353(B1) | 2002-09-01 | Win et al. | Applicant |
| US6460141(B1) | 2002-10-01 | Olden | Applicant |
| US6493677(B1) | 2002-12-01 | von Rosen et al. | Applicant |
| US6493685(B1) | 2002-12-01 | Ensel et al. | Applicant |
| US6496855(B1) | 2002-12-01 | Hunt et al. | Applicant |
| US6496936(B1) | 2002-12-01 | French et al. | Applicant |
| US6510523(B1) | 2003-01-01 | Perlman et al. | Applicant |
| US6516412(B2) | 2003-02-01 | Wasilewski et al. | Examiner |
| US6526404(B1) | 2003-02-01 | Slater et al. | Applicant |
| US6526508(B2) | 2003-02-01 | Akins et al. | Examiner |
| US6532284(B2) | 2003-03-01 | Walker et al. | Applicant |
| US6535855(B1) | 2003-03-01 | Cahill et al. | Applicant |
| US6535917(B1) | 2003-03-01 | Zamanzadeh et al. | Applicant |
| US6535980(B1) | 2003-03-01 | Kumar et al. | Applicant |
| US6539424(B1) | 2003-03-01 | Dutta | Applicant |
| US6557039(B1) | 2003-04-01 | Leong et al. | Applicant |
| US6574348(B1) | 2003-06-01 | Venkatesan et al. | Applicant |
| US6581040(B1) | 2003-06-01 | Wright et al. | Applicant |
| US6584505(B1) | 2003-06-01 | Howard et al. | Applicant |
| US6584508(B1) | 2003-06-01 | Epstein et al. | Applicant |
| US6589291(B1) | 2003-07-01 | Boag et al. | Applicant |
| US6592044(B1) | 2003-07-01 | Wong et al. | Applicant |
| US6609113(B1) | 2003-08-01 | O'Leary et al. | Applicant |
| US6609125(B1) | 2003-08-01 | Layne et al. | Applicant |
| US6609198(B1) | 2003-08-01 | Wood et al. | Applicant |
| US6609654(B1) | 2003-08-01 | Anderson et al. | Applicant |
| US6618579(B1) | 2003-09-01 | Smith et al. | Applicant |
| US6618806(B1) | 2003-09-01 | Brown et al. | Applicant |
| US6623415(B2) | 2003-09-01 | Gates et al. | Applicant |
| US6633980(B1) | 2003-10-01 | Johnson | Examiner |
| US6668322(B1) | 2003-12-01 | Wood et al. | Applicant |
| US6675261(B2) | 2004-01-01 | Shandony | Applicant |
| US6687222(B1) | 2004-02-01 | Albert et al. | Applicant |
| US6718482(B2) | 2004-04-01 | Sato et al. | Applicant |
| US6718535(B1) | 2004-04-01 | Underwood | Applicant |
| US6725269(B1) | 2004-04-01 | Megiddo | Applicant |
| US6738779(B1) | 2004-05-01 | Shapira | Applicant |
| US6751654(B2) | 2004-06-01 | Massarani et al. | Applicant |
| US6754833(B1) | 2004-06-01 | Black et al. | Applicant |
| US6755341(B1) | 2004-06-01 | Wong et al. | Applicant |
| US6766370(B2) | 2004-07-01 | Glommen et al. | Applicant |
| US6772146(B2) | 2004-08-01 | Khemlani et al. | Applicant |
| US6785810(B1) | 2004-08-01 | Lirov et al. | Applicant |
| US6789115(B1) | 2004-09-01 | Singer et al. | Applicant |
| US6805288(B2) | 2004-10-01 | Routhenstein et al. | Applicant |
| US6807633(B1) | 2004-10-01 | Pavlik | Applicant |
| US6810395(B1) | 2004-10-01 | Bharat | Applicant |
| US6820202(B1) | 2004-11-01 | Wheeler et al. | Applicant |
| US6832202(B1) | 2004-12-01 | Schuyler et al. | Applicant |
| US6856970(B1) | 2005-02-01 | Campbell et al. | Applicant |
| US6892231(B2) | 2005-05-01 | Jager | Applicant |
| US6907566(B1) | 2005-06-01 | McElfresh et al. | Applicant |
| US6915437(B2) | 2005-07-01 | Swander et al. | Examiner |
| US6925481(B2) | 2005-08-01 | Singhal et al. | Applicant |
| US6983421(B1) | 2006-01-01 | Lahti et al. | Applicant |
| US6986046(B1) | 2006-01-01 | Tuvell et al. | Examiner |
| US6992786(B1) | 2006-01-01 | Breding et al. | Applicant |
| US7020696(B1) | 2006-03-01 | Perry et al. | Applicant |
| US7024556(B1) | 2006-04-01 | Hadjinikitas et al. | Examiner |
| US7069433(B1) | 2006-06-01 | Henry et al. | Examiner |
| US7069438(B2) | 2006-06-01 | Balabine et al. | Examiner |
| US7114080(B2) | 2006-09-01 | Rahman et al. | Examiner |
| US7117239(B1) | 2006-10-01 | Hansen | Applicant |
| US7174457(B1) | 2007-02-01 | England et al. | Examiner |
| US7194618(B1) | 2007-03-01 | Suominen | Examiner |
| US7213149(B2) | 2007-05-01 | Mache | Examiner |
| US7231526(B2) | 2007-06-01 | Hon et al. | Examiner |
| US7234059(B1) | 2007-06-01 | Beaver et al. | Examiner |
| US7249108(B1) | 2007-07-01 | Walmsley et al. | Examiner |
| US7281128(B2) | 2007-10-01 | Mikel et al. | Examiner |
| US7290141(B2) | 2007-10-01 | Sengodan et al. | Examiner |
| US7299356(B2) | 2007-11-01 | Mizrah | Examiner |
| US7299364(B2) | 2007-11-01 | Noble et al. | Examiner |
| US7318235(B2) | 2008-01-01 | Grawrock | Examiner |
| US7363495(B2) | 2008-04-01 | Felt et al. | Examiner |
| US7386720(B2) | 2008-06-01 | Sandhu et al. | Examiner |
| US7509495(B2) | 2009-03-01 | Roig | Examiner |
| US7779267(B2) | 2010-08-01 | Chen et al. | Examiner |
| US7818792(B2) | 2010-10-01 | Shamsaasef et al. | Examiner |
| US7877799(B2) | 2011-01-01 | Proudler | Examiner |
| US7900242(B2) | 2011-03-01 | Malinen et al. | Examiner |
| US2001/0012974(A1) | 2001-08-01 | Mahaffey | Applicant |
| US2001/0027474(A1) | 2001-10-01 | Nachman et al. | Applicant |
| US2001/0032184(A1) | 2001-10-01 | Tenembaum | Applicant |
| US2001/0034617(A1) | 2001-10-01 | Kimata | Examiner |
| US2001/0039535(A1) | 2001-11-01 | Tsiounis | Applicant |
| US2001/0047295(A1) | 2001-11-01 | Tenembaum | Applicant |
| US2001/0051917(A1) | 2001-12-01 | Bissonette et al. | Applicant |
| US2001/0054003(A1) | 2001-12-01 | Chien et al. | Applicant |
| US2002/0007313(A1) | 2002-01-01 | Mai et al. | Applicant |
| US2002/0007460(A1) | 2002-01-01 | Azuma | Applicant |
| US2002/0007462(A1) | 2002-01-01 | Omata | Examiner |
| US2002/0010599(A1) | 2002-01-01 | Levison | Applicant |
| US2002/0010668(A1) | 2002-01-01 | Travis et al. | Applicant |
| US2002/0018585(A1) | 2002-02-01 | Kim | Applicant |
| US2002/0019938(A1) | 2002-02-01 | Aarons | Applicant |
| US2002/0023108(A1) | 2002-02-01 | Daswani et al. | Applicant |
| US2002/0032613(A1) | 2002-03-01 | Buettgenbach et al. | Applicant |
| US2002/0032650(A1) | 2002-03-01 | Hauser et al. | Applicant |
| US2002/0059141(A1) | 2002-05-01 | Davies et al. | Applicant |
| US2002/0077978(A1) | 2002-06-01 | O'Leary et al. | Applicant |
| US2002/0078353(A1) | 2002-06-01 | Sandhu et al. | Examiner |
| US2002/0087860(A1) | 2002-07-01 | William Kravitz | Examiner |
| US2002/0095443(A1) | 2002-07-01 | Kovack | Applicant |
| US2002/0099826(A1) | 2002-07-01 | Summers et al. | Applicant |
| US2002/0104006(A1) | 2002-08-01 | Boate et al. | Applicant |
| US2002/0104017(A1) | 2002-08-01 | Stefan | Applicant |
| US2002/0107788(A1) | 2002-08-01 | Cunningham | Applicant |
| US2002/0112157(A1) | 2002-08-01 | Doyle et al. | Examiner |
| US2002/0152163(A1) | 2002-10-01 | Bezos et al. | Applicant |
| US2002/0165949(A1) | 2002-11-01 | Na | Applicant |
| US2002/0174010(A1) | 2002-11-01 | Rice, III | Applicant |
| US2002/0184507(A1) | 2002-12-01 | Makower et al. | Applicant |
| US2002/0188869(A1) | 2002-12-01 | Patrick | Applicant |
| US2002/0191548(A1) | 2002-12-01 | Ylonen et al. | Applicant |
| US2003/0014442(A1) | 2003-01-01 | Shiigi et al. | Applicant |
| US2003/0018915(A1) | 2003-01-01 | Stoll | Applicant |
| US2003/0023880(A1) | 2003-01-01 | Edward et al. | Applicant |
| US2003/0034388(A1) | 2003-02-01 | Routhenstein et al. | Applicant |
| US2003/0037142(A1) | 2003-02-01 | Munger et al. | Applicant |
| US2003/0046587(A1) | 2003-03-01 | Bheemarasetti et al. | Applicant |
| US2003/0046589(A1) | 2003-03-01 | Gregg | Applicant |
| US2003/0051026(A1) | 2003-03-01 | Carter et al. | Applicant |
| US2003/0055871(A1) | 2003-03-01 | Roses | Applicant |
| US2003/0069848(A1) | 2003-04-01 | Larson et al. | Examiner |
| US2003/0070069(A1) | 2003-04-01 | Belapurkar et al. | Applicant |
| US2003/0070084(A1) | 2003-04-01 | Satomaa et al. | Applicant |
| US2003/0074580(A1) | 2003-04-01 | Knouse et al. | Applicant |
| US2003/0079147(A1) | 2003-04-01 | Hsieh et al. | Applicant |
| US2003/0084345(A1) | 2003-05-01 | Bjornestad et al. | Applicant |
| US2003/0084647(A1) | 2003-05-01 | Smith et al. | Applicant |
| US2003/0088552(A1) | 2003-05-01 | Bennett et al. | Applicant |
| US2003/0105952(A1) | 2003-06-01 | Brabson et al. | Examiner |
| US2003/0105981(A1) | 2003-06-01 | Miller et al. | Applicant |
| US2003/0110399(A1) | 2003-06-01 | Rail | Applicant |
| US2003/0115160(A1) | 2003-06-01 | Nowlin et al. | Applicant |
| US2003/0119642(A1) | 2003-06-01 | Gates et al. | Applicant |
| US2003/0149781(A1) | 2003-08-01 | Yared et al. | Examiner |
| US2003/0154403(A1) | 2003-08-01 | Keinsley et al. | Applicant |
| US2003/0159072(A1) | 2003-08-01 | Bellinger et al. | Applicant |
| US2003/0163733(A1) | 2003-08-01 | Barriga-Caceres et al. | Applicant |
| US2003/0177067(A1) | 2003-09-01 | Cowell et al. | Applicant |
| US2003/0191549(A1) | 2003-10-01 | Otsuka et al. | Applicant |
| US2003/0191947(A1) | 2003-10-01 | Stubblefield | Applicant |
| US2003/0194085(A1) | 2003-10-01 | Dillaway | Applicant |
| US2003/0221126(A1) | 2003-11-01 | Berman et al. | Examiner |
| US2004/0031856(A1) | 2004-02-01 | Atsmon et al. | Applicant |
| US2004/0034597(A1) | 2004-02-01 | Durand | Examiner |
| US2004/0039692(A1) | 2004-02-01 | Shields et al. | Applicant |
| US2004/0059952(A1) | 2004-03-01 | Newport et al. | Examiner |
| US2004/0068559(A1) | 2004-04-01 | Shaw | Applicant |
| US2004/0073790(A1) | 2004-04-01 | Ateniese et al. | Examiner |
| US2004/0117409(A1) | 2004-06-01 | Scahill et al. | Applicant |
| US2004/0117623(A1) | 2004-06-01 | Kalogridis et al. | Examiner |
| US2004/0128169(A1) | 2004-07-01 | Lusen | Applicant |
| US2004/0148259(A1) | 2004-07-01 | Reiners et al. | Applicant |
| US2005/0033960(A1) | 2005-02-01 | Vialen et al. | Examiner |
| US2005/0079869(A1) | 2005-04-01 | Khalil et al. | Examiner |
| US2005/0080747(A1) | 2005-04-01 | Anderson et al. | Applicant |
| US2005/0082362(A1) | 2005-04-01 | Anderson et al. | Applicant |
| US2005/0086160(A1) | 2005-04-01 | Wong et al. | Applicant |
| US2005/0086177(A1) | 2005-04-01 | Anderson et al. | Applicant |
| US2005/0149729(A1) | 2005-07-01 | Zimmer et al. | Examiner |
| US2005/0278641(A1) | 2005-12-01 | Mansour et al. | Applicant |
| US2006/0218402(A1) | 2006-09-01 | Kerstens et al. | Examiner |
| DE19731293 | 1999-01-01 | Applicant | |
| EP884877 | 1998-12-01 | Applicant | |
| EP917119 | 1999-05-01 | Applicant | |
| EP1022664 | 2000-07-01 | Applicant | |
| JPH10-187467 | 1998-07-01 | Applicant | |
| JP2005-242976 | 2005-09-01 | Applicant | |
| WO97/43736 | 1997-11-01 | Applicant | |
| WO99/40507(A1) | 1999-08-01 | Applicant | |
| WO99/52051 | 1999-10-01 | Applicant | |
| WO/68858 | 2000-11-01 | Applicant | |
| WO1/18656(A1) | 2001-03-01 | Applicant | |
| WO1/35355 | 2001-05-01 | Applicant | |
| WO1/43084 | 2001-06-01 | Applicant | |
| WO188659 | 2001-11-01 | Applicant | |
| WO2/17082(A1) | 2002-02-01 | Applicant | |
| WO2004/079603 | 2004-09-01 | Applicant |
Non-Patent Literature (78)
- Lawrence C. Paulson; “Verifying the SET Protocol: Overview”; vol. 2629/2003; Springer-Verlag Berlin Heidelberg 2003; pp. 4-14.Examiner
- Lawrence C. Paulson; “SET Cardholder Registration: the Secrecy Proofs”; This work was funded by the epsrc grant GR/R01156/01 Verifying Electronic Commerce Protocols; pp. 1-9.Examiner
- Echarge, Echarge Corporation, www.echarge.com, Dec. 3, 1999.Applicant
- Summary of the At Your Request Architecture, First USA Bank Confidential and Proprietary, Apr. 2, 1999, pp. 1-8.Applicant
- Siebel; Siebel: Ensuring Customer Success, www.siebel.com, Nov. 17, 1999.Applicant
- OMG; Welcome to OMG's CORBA for Beginners page!, www.OMG.co, May 25, 1999.Applicant
- Sun Microsystems, Inc.; Schema for Representing CORBA Objects in an LDAP Directory, May 21, 1999, pp. 1-9.Applicant
- OMG; What Is CORBA?, www.OMG.com, May 25, 1999.Applicant
- Anonymous; CORBA Overview, ARCH2.HTM at PENT21.INFOSYS.TUWIEN.AC.AT, May 25, 1999.Applicant
- Java; Java (TM) Technology in the Real World, java.sun.com, May 21, 1999.Applicant
- Java; Java(TM) Servlet API, java.sun.com, May 21, 1999.Applicant
- Java; Staying in Touch with JNDI, java.sun.com, May 21, 1999.Applicant
- Java; Java(TM) Remote Method Invocation (RMI) Interface, java.sun.com, May 21, 1999.Applicant
- Java; Banking on Java(TM) Technology, java.sun.com; May 21, 1999.Applicant
- Applets, java.sun.com, May 21, 1999.Applicant
- Java; The JDBC(TM) Data Access API, java.sun.com, May 21, 1999.Applicant
- Thomas; Enterprise Javabeans(TM) Technology: Server Component Model for the Java(TM) Platform, java.sun.com, May 2, 1999.Applicant
- Getting Smart With Java: Sun Micro Says American Express to Use Java for Smart Card, ABCnews.com, Printed on Jun. 6, 2000.Applicant
- Bank; Cash, Check,Charge—What's Next?, Seattle Times, Mar. 6, 1995.Applicant
- Vandenengel; Cards on the Internet: Advertising on a $3 Bill, Industry Intelligence, Feb. 1, 1995, pp. 46-48.Applicant
- Strassel; Dutch Software Concern Experiments With Electronic ‘Cash’ in Cyberspace, The Wall Street Journal, Apr. 17, 1995.Applicant
- Kutler; Cash Card Creator Looking Beyond Mondex, Feb. 9, 1995.Applicant
- Post; E-Cash: Can't Live With it, Can't Live Without it, The American Lawyer, Mar. 1, 1995, pp. 116-117.Applicant
- Mitchell; Cyberspace: Crafting Software Å, Business Week, Feb. 27, 1999, pp. 78-86.Applicant
- Kutler; A Different Drummer on the Data Highway, American Banker, Section: No. 91, vol. 160, May 12, 1995, p. 14.Applicant
- Epper; A Player Goes After Big Bucks in Cyberspace, American Banker, vol. 160, No. 86, ISSN: 0002-7561, May 5, 1995, p. 17.Applicant
- Barnham; Network Brings Together Producers and Companies, Document ID: 17347, Feb. 1, 1994.Applicant
- Houlder; OFT Gives the Individual Top Priority: Report Calls for Deregulation of Business Lending, Document ID: 91716, Jun. 8, 1994.Applicant
- Maize; Fannie Mae on the Web, Document ID: 52079, May 8, 1995.Applicant
- Knowles; Improved Internet Security Enabling On-Line Commerce, PCweek, vol. 12, No. 11, ISSN: 0740-1604, Mar. 20, 1995.Applicant
- Anonymous; Aversion Therapy: Banks Overcoming Fear of the 'Net to Develop Safe Internet-Based Payment System W/ Netscape Communicator, Network World, ISSN: 0887-7661, Dec. 12, 1994.Applicant
- Clark; Microsoft, Visa to Jointly Develop PC Electronic-Shopping Software, The Wall Street Journal, Nov. 9, 1994, WSJ B9.Applicant
- Hewlett-Packard Company; Understanding Product Data Management, Hewlett-Packard Company.Applicant
- Getting Started: Specific GE TPN Post Service Use Guidelines, Printed on Apr. 26, 1999.Applicant
- Resource Center: Consolidated Edison Selects GE TPN Post, Printed Apr. 26, 1999.Applicant
- Thomas Publishing Company; Thomasnet, Apr. 26, 1999.Applicant
- Thomas Publishing Company; Solusource: for Engineers by Engineers, Thomas Publishing Company, Apr. 26, 1999.Applicant
- Harris; Harris Infosource, Printed on Apr. 26, 1999.Applicant
- Welcome to Muse, Apr. 26, 1999.Applicant
- Product Data Integration Technologies, Inc., Step Integrating Authors, Printed on Apr. 26, 1999.Applicant
- SBA: Pro-Net, U.S. Small Business Administration Procurement Marketing and Access Network, Last Modified: Apr. 1, 1999.Applicant
- Freemarkets, Printed on Apr. 26, 1999.Applicant
- At Your Request, www.wingspanbank.com, Sep. 28, 1999.Applicant
- Meredith; Internet Bank Moves Closer to Virtual Reality, USA Today, May 5, 1995.Applicant
- Sirbu, et al; Netbill: An Internet Commerce System Optimized for Network Delivered Services, Printed on Feb. 27, 1995.Applicant
- The Check Is in the Email, Information Today, vol. 12, No. 3, ISSN: 8755-6286, Mar. 1995.Applicant
- The Gale Group; G&D America's Multi-Application Smart Card Selected for Combined Payroll and ‘Virtual Banking’ Program in Mexico, Business Wire, Apr. 24, 1998, P241047.Applicant
- Mitchell; Netlink Goes After an Unbanked Niche, Card Technology, ISSN: 1093-1279, Sep. 1999, p. 22.Applicant
- Berry et al.; A Potent New Tool for Selling Database, Business Week, Cover Story, Sep. 5, 1994, pp. 56-62.Applicant
- Shibata; Seventh International Conference on Parallel and Distributed Systems: Workshops, IEEE Computer Society, Jul. 4-7, 2000.Applicant
- Jakobsson et al.; Secure and Lightweight Advertising on the Web, Computer Networks, 31 (1999) 1101-1109.Applicant
- Fujimura et al.; XML Voucher: Generic Voucher Language, Feb. 2003.Applicant
- Jepsen; Soap Cleans Up Interoperability Problems on the Web, IT PTO, Jan./Feb. 2001.Applicant
- Chester; Cross-Platform Integration With XML and Soap, IT PTO Sep./-Oct. 2001.Applicant
- Friedman; Dictionary of Business Terms, Barron's Third Edition, Copyright 2000.Applicant
- Consortium Created to Manage Common Electronic Purse Specifications, http://www.visa.com/AV/news/PRMISC051199.vhtml, Printed Feb. 23, 2001.Applicant
- Smartaxis, How It Works, http://www.smartaxis.com.uk/Seller/Howitworks.html, Printed on Feb. 23, 2001.Applicant
- Bechtel Construction Operations Incorporated Standardizes on Primavera's Expedition Contract Management Software, Business Wire, Jul. 27, 1999.Applicant
- Primavera and Purchasepro.com to Create E-Commerce Marketplace for Construction Industry, Primavera Ships P3, Version 3.0, www.purchasepro.com/, Sep. 21, 1999, pp. 1-3.Applicant
- Primavera Systems, Inc.—How the World Manages Projects, Expedition Contract Control Software, www.primavera.com, Jun. 23, 2005.Applicant
- Civitello JR.; Construction Operations Manual of Policies and Procedures, Third Edition, 2000.Applicant
- Harris; Planning Using Primavera Project Planner P3 Version 3.0, User Guide, Copyright 1999 by Eastvvood Harry Pty Ltd., 1999.Applicant
- Ritz; Total Construction Project Management, McGraw-Hill, 1994.Applicant
- Marchman; Construction Scheduling With Primavera Project Planner, May 25, 1999.Applicant
- Associates National Bank (DE) Credit Card, The Associates, www.theassociates.com/consumer/credit—cards/main.html, Apr. 6, 1999, 6 Pages.Applicant
- Temporary Global Passwords, IBM Corporation, IBM TDB V36, N3, 03-93, Order 93A 60636, Mar. 1, 1993, pp. 451-454.Applicant
- Method of Protecting Data on a Personal Computer, IBM Corporation, TDB 11-85, Order 85A 62426, Nov. 1, 1995, p. 2530.Applicant
- Safe Single-Sign-On Protocol With Minimal Password Exposure no Decryption and Technology Adaptivity, IBM Corporation, TDB 03-95, Order 95A, Mar. 1, 1995, pp. 245-248.Applicant
- Servlet/Applet/HTML Authentication Process With Single Sign-on, IBM Corporation, IBM Order: 00A6004, Jan. 1, 2000.Applicant
- Johnston; Pondering Passport: Do You Trust Microsoft With Your Data?, www.pcworld.com/resource/printable/article/0.aid,63244,00.asp, Sep. 24, 2001.Applicant
- Kormann; Risks of the Passport Single Signon Protocol, Computer Networks, Elsevier Science Press, vol. 33, Sep. 20, 2003, pp. 51-58.Applicant
- Carden, Philip; The New Face of Single Sign-on, Network Computing, http://www.networkcomputing.com, Printed Dec. 29, 2000, 4 Pages.Applicant
- Marlin; Chasing Document Management, Inform, vol. 13, No. 4, Apr. 1999, p. 76-82.Applicant
- Construction Financing to Build Your Own Home, ISBN: 0962864307, Jul. 1990.Applicant
- Radosevich; Is Work Flow Working?, cnn.com, Apr. 6, 1999 at <http://www.cnn.com/tech/computing/9904/06/workflow/ent.idg, p. 1 of 5, Retrieved From the Internet on Nov. 28, 2005.Applicant
- Omware, Inc., Web Pages, Feb. 2000, Retrieved From http://web.archive.org/web20000226033405/www.omware.com/products.html, Retrieved From the Interneet on Nov. 28, 2005.Applicant
- Point for Windows Version 3.X Interface Marketing Guide.pdf, Dec. 8, 1999.Applicant
- Mary C. Lacity, et al.; Mary C. Lacity, et al., The Information Systems Outsourcing Bandwagon, Sloan Management Review, vol. 35, No. 1, Fall 1993, p. 73-86.Applicant