System and method for a token gateway environment

Information

  • Patent Grant
  • 12132837
  • Patent Number
    12,132,837
  • Date Filed
    Thursday, January 12, 2023
    2 years ago
  • Date Issued
    Tuesday, October 29, 2024
    3 months ago
  • Inventors
    • Jain; Alpa Modi (Laguna Niguel, CA, US)
    • Soni; Praveen Kumar (Costa Mesa, CA, US)
    • Elst; Frederic Vander
  • Original Assignees
  • Examiners
    • Chao; Michael W
    Agents
    • Knobbe, Martens Olson & Bear, LLP
Abstract
Embodiments include a method for providing tokens which includes: receiving from a user system an encrypted data packet including user credentials and a request for an authentication token to access protected resources; extracting the user's security information; transmitting a data packet to a security and access management system, where the data packet includes the user's security information and a request for user validation; receiving, from the security and access management system, user validation and additional data; generating a thin token and a fat token; storing the thin token in association with the fat token; transmitting the thin token to the user system; receiving, from the user system, a request to access protected resources from a protected resource system, the request including the thin token; validating the received thin token; accessing the fat token associated with the thin token; and transmitting the fat token to the protected resource system.
Description
BACKGROUND

The disclosure relates to a token gateway environment for providing more efficient and more secure authorization to parties accessing protected resources.


SUMMARY OF THE DISCLOSURE

Various systems, methods, and devices are disclosed for providing a token gateway environment for providing authorization to parties accessing protected resources. The systems, methods, and devices of the disclosure each have several innovative aspects, no single one of which is solely responsible for the desirable attributes disclosed herein.


In one embodiment, a system for providing tokens to facilitate authentication and access to protected resources is disclosed. The system includes: a token gateway computing system in electronic communication with a third party user computing system; at least one security and access management computing system; a token management computing system; and a protected resource computing system, wherein the token gateway computing system is configured to: receive, from the third party user computing system, an encrypted data packet including user credentials of a third party user and a request for an authentication token to access one or more protected resources from the protected resource computing system; decrypt and parse the received encrypted data packet to extract the third party user's security information and to determine a type associated with each of the one or more protected resources requested; transmit an encrypted data packet to the at least one security and access management computing system based on the determined type, wherein the encrypted data packet includes the third party user's security information and a request for user validation; receive, from the at least one security and access management computing system, validation of the third party user, and private data; generate a thin token; generate a fat token using the private data; store the thin token in association with the fat token in the token management computing system; transmit the thin token to the third party user computing system; receive, from the third party user computing system, a request to access one or more protected resources from the protected resource computing system, the request comprising the thin token; validate the received thin token; access the fat token associated with the thin token in the token management computing system; and transmit the fat token to the protected resource computing system.


In another embodiment, a computer-implemented method for providing tokens to facilitate authentication and access to protected resources is disclosed. The computer-implemented method comprising, as implemented by one or more computing devices within a token gateway system configured with specific executable instructions receiving, from a third party user computing system, an encrypted data packet including user credentials of a third party user and a request for an authentication token to access one or more protected resources from a protected resource computing system; decrypting and parsing the received encrypted data packet to extract the third party user's security information and to determine a type associated with each of the one or more protected resources requested; transmitting an encrypted data packet to at least one security and access management computing system based on the determined type, wherein the encrypted data packet includes the third party user's security information and a request for user validation; receiving, from the at least one security and access management computing system, validation of the third party user, and private data; generating a thin token; generating a fat token using the private data; storing the thin token in association with the fat token in the token management computing system; transmitting the thin token to the third party user computing system; receiving, from the third party user computing system, a request to access one or more protected resources from the protected resource computing system, the request comprising the thin token; validating the received thin token; accessing the fat token associated with the thin token in a token management computing system; and transmitting the fat token to the protected resource computing system.


In a further embodiment, a non-transitory computer storage medium storing computer-executable instructions is disclosed. The computer-executable instructions, when executed by a processor, can cause the processor to at least: receive, from a third party user computing system, an encrypted data packet including user credentials of a third party user and a request for an authentication token to access one or more protected resources from a protected resource computing system; decrypt and parse the received encrypted data packet to extract the third party user's security information and to determine a type associated with each of the one or more protected resources requested; transmit an encrypted data packet to at least one security and access management computing system based on the determined type, wherein the encrypted data packet includes the third party user's security information and a request for user validation; receive, from the at least one security and access management computing system, validation of the third party user, and private data; generate a thin token; generate a fat token using the private data; store the thin token in association with the fat token in the token management computing system; transmit the thin token to the third party user computing system; receive, from the third party user computing system, a request to access one or more protected resources from the protected resource computing system, the request comprising the thin token; validate the received thin token; access the fat token associated with the thin token in a token management computing system; and transmit the fat token to the protected resource computing system.





BRIEF DESCRIPTION OF DRAWINGS

The foregoing aspects and many of the attendant advantages of this disclosure will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings. The accompanying drawings, which are incorporated in, and constitute a part of, this specification, illustrate embodiments of the disclosure.


Throughout the drawings, reference numbers are re-used to indicate correspondence between referenced elements. The drawings are provided to illustrate embodiments of the subject matter described herein and not to limit the scope thereof. Specific embodiments will be described with reference to the following drawings.



FIG. 1 is an overall system diagram depicting one embodiment of a token gateway environment.



FIG. 2 is a block diagram illustrating an embodiment of information flow within the token gateway environment.



FIG. 3 is a block diagram illustrating an embodiment of a process of initiating of token generation.



FIG. 4 is a block diagram illustrating an embodiment of a process for generating tokens.



FIG. 5 is a block diagram illustrating an embodiment of a process for accessing authorization to protected resources.



FIGS. 6A and 6B are block diagrams illustrating embodiments of token data structures.



FIGS. 7A, 7B, 7C and 7D are block diagrams illustrating embodiments of token headers.



FIG. 8 is a general system diagram illustrating an embodiment of a computing system.





DESCRIPTION OF VARIOUS EMBODIMENTS

Embodiments of the disclosure will now be described with reference to the accompanying figures. The terminology used in the description presented herein is not intended to be interpreted in any limited or restrictive manner, simply because it is being utilized in conjunction with a detailed description of embodiments of the disclosure. Furthermore, embodiments of the disclosure may include several novel features, no single one of which is solely responsible for its desirable attributes or which is essential to practicing the embodiments of the disclosure herein described. For purposes of this disclosure, certain aspects, advantages, and novel features of various embodiments are described herein. It is to be understood that not necessarily all such advantages may be achieved in accordance with any particular embodiment. Thus, for example, those skilled in the art will recognize that one embodiment may be carried out in a manner that achieves one advantage or group of advantages as taught herein without necessarily achieving other advantages as may be taught or suggested herein.


I. Overview

Features are described for embodiments of a token gateway environment. The token gateway environment helps to provide more efficient and/or more secure authorization to third parties accessing protected resources. In some embodiments, the environment enables trusted users of third parties to obtain limited access to protected resources such as, for example, secure data files. A requesting user of a third party may request a token to use for later accessing a protected resource. The requesting user sends an electronic request to the token gateway environment with his/her credentials, and then the token gateway environment validates the credentials with a security and access management environment using a standard open protocol such as OAuth 2.0. OAuth 2.0 is an authorization framework that enables applications to obtain limited access to user accounts. It works by delegating user authentication to the service that hosts the user account, and authorizing third-party applications to access the user account. OAuth 2.0 provides authorization flows for web, desktop applications and mobile devices.


If the requesting user's credentials are validated, two levels of tokens are generated by the token gateway environment. A first level token, referred to herein as a thin token, and a second level token, referred to herein as a fat token, are both generated. The thin token includes a minimal or smaller set of information associated with the requesting user that is used in secure authorization flows such as OAuth 2.0 to validate the access token or to provide information to decide whether to grant the requesting user access to the protected resource. The fat token includes additional details associated with the requesting user which may be internal and specific to the protected resources which may include information that cannot be shared with the third party for security or confidentiality reasons. Thus, the thin token is provided to the third party application, but the information in the fat token is not made available to the third party application.


When the requesting user then attempts to access the protected resources, the token gateway validates the user using the previously issued thin token and sends a token to the resource provider system to indicate that the user has been authenticated. However, rather than sending the standard thin token, the token gateway instead sends the corresponding fat token which includes the user's authentication information but also includes the internal and specific information retrieved from the security and access management system which may be too sensitive to have sent in any token directly to the third party user system. The standard secure authorization flow is not interrupted as a token is still sent to the resource provider system, but the thin token has been replaced with a more robust and data rich fat token.


II. System

The environment may include a gateway system in communication with one or more third party environments requesting authorization to access one or more protected resources, where such resources may include, for example, resources including applications and reports on various backend servers or mainframe systems. The gateway system may also be in communication with one or more security and access management environments. The security and access management environments may include user profile repositories. The gateway system may also be in communication with a token management environment, including a token provider repository system. The token provider repository system may include various repositories for storing the different tokens of the token gateway system.



FIG. 1 is an overall system diagram depicting one embodiment of a token gateway environment 100 for providing more efficient and/or more secure authorization to parties accessing protected resources. The environment 100 shown in FIG. 1 includes third party environments 106A and 106B, gateway 170, security and access management environments 104A and 104B, token management environment 102, and resource provider systems 171 storing protected resources 172. In one embodiment, the systems may communicate via one or more networks, which may include one or more of a local area network, a wide area network, the Internet, or a cloud-computing network, implemented via a wired, wireless, or combination of wired and wireless communication links.


A. Example Third Party Environments

The token gateway environment 100 shown in FIG. 1 includes third party environments 106A and 1068. The third party environments 106A and 106B respectively include users associated with third parties 162A and 162B, as well as the associated one or more computing systems 164A and 164B. The one or more computing systems may include computer devices whether they be a personal computer, server computer, laptop computer, or tablet; personal digital assistants (PDAs) such as a Palm-based device or Windows CE device; smart phones such as cellular phones; a wireless device such as a wireless email device or other device capable of communicating wireless with a computer network; or any other type of network device that may communicate over a network and process electronic transactions. While only two such computing systems are shown in FIG. 1, it is recognized that there could be several other computing systems in various embodiments.


Some examples of third parties include organizations that have requested products or services from one or more of the resource provider systems 171. The third party may be any entity using a computing system to request resources. For example third parties may include financial institutions, mortgage lenders, landlords, and the like, wishing to access protected credit information associated with one or more of consumers, borrowers, potential tenants, and the like. As another example, the third party organization may include medical providers, insurance companies, pharmacies, and the like, wishing to access protected health record data associated with patients. It is recognized that the token gateway environment 100 may provide validation of users to be able access a variety of protected resources.


The connection between a computing system and an online organization may be, for example, a connection between a client computer and a website server over a network. One or more servers may communicate with one or more client computers across a network. The network, for example, can include a private network, such as a LAN, or interconnections to the online organizations over a communications network, such as the Internet or World Wide Web or any other network that is capable of communicating digital data, such as a wireless or cellular network. Each computing system may connect to any online organization over the network using data protocols, such as HTTP, HTTPS and the like.


In one embodiment, the respective computing systems 164A and 1648 communicate with the gateway 170 over a network to request authorization on behalf of the third parties 162A and 1628 to access one or more of protected resources 172 on resource provider systems 171.


B. Gateway

The token gateway environment 100 shown in FIG. 1 includes a gateway 170. The gateway 170 communicates with each of the third party environments 106A and 106B, security and access management environments 104A and 1048, token management environment 102, and the resource provider systems 171.


In some embodiments, the gateway 170 manages communications to enable third party applications 106A, 106B and the like to provide information to resource provider systems 171 to obtain limited access to protected resources 172. The illustrated gateway 170 communicates with security and access management platforms 104A, 1048 and the like, facilitates a first level of authentication of the requesting users at third parties by generating a first token, and also generates a second token including additional information to provide information that can be used by the resource provider systems 171 to determine access to the protected resources 172.


An example embodiment of a computing system for the gateway 170 is illustrated in FIG. 8, and described further below.


By providing the token generation, the gateway 170 acts as the perimeter security for the protected resources 172, authenticating the third party users through the appropriate systems, and allowing only authenticated third party users to move to the next level of potentially accessing the protected resources. Additionally, by separating the authentication and access tokens, proprietary information about the protected resources is not provided to any of the third parties.


C. Example Security and Access Management Environments

The token gateway environment 100 shown in FIG. 1 includes security and access management environments 104A and 104B. The security and access management environments 104A and 104B respectively include administrators 148A and 148B, with associated computing systems 146A and 146B. The security and access management environments 104A and 104B also respectively include user profile repositories 150A and 150B. While only two such environments are shown in FIG. 1, it is recognized that there could be several others in various embodiments.


Some example security and access management environments 104A and 104B include identity and access management platforms such as for example Okta, Centify, Microsoft Azure, RSA SecurID, OneLogin, LDAP, and the like.


Each of the illustrated security and access management environments also include repositories a user profile repository 132 or 134. The user profile repository includes a data store configured to store information regarding user information and associated permissions for users associated with third parties and which can be used for accessing various protected resources. The third parties may be organizations or groups, and users may be associated with such organizations and groups. The user profile repository may also include additional information about the user such as, for example, which products he/she may have access to, what levels of access, or about the systems providing the products, such as, for example, secure IP information, security information, and the like.


While one database is included in each of the security and access management environments of the embodiment of FIG. 1, it is recognized that one or more of the databases may be combined, divided, and/or deleted. In addition, subsets of data from one database may be stored in another database as a duplicate copy or as the sole copy. Further, portions or all of one or more of the databases may be stored in a cloud, remote from the security and access management environments 104A or 1048, and/or stored in a distributed system.


When a user at a third party 162A or 1628 requests authentication and access to a protected resource 172 from the gateway 170, the gateway 170 communicates with the appropriate one or more of the security and access management environments 104A, 104B, depending on the service that hosts the appropriate account for the third party user and the type of protected resource requested, to delegate the user authentication to the appropriate platform. The appropriate security and access management environments 104A, 104B then utilize the respective user profile repositories 150A, 1508 to authenticate the third party requesting user.


D. Token Management Environment

The token gateway environment 100 shown in FIG. 1 includes a token management environment 102. The token management environment 102 includes a token provider repository system 130, which includes one or more of thin token repository 132 and fat token repository 134. Although there are two repositories illustrated in FIG. 1, in various embodiments, the thin token repository 132 and fat token repository 134 may be the same repository, such as a single cache.


Each of the token repositories 132 and 134 includes a data store configured to store a local copy of the tokens. In one embodiment, the thin and fat tokens may be stored in a key-value cache scheme, where the thin token may represent the key, and the fat token may represent the associated value, and only the key is provided to the third party user after authentication, by providing the thin token. In some embodiments, the thin token may be associated with two or more fat tokens.


While two separate databases are included in the embodiment of FIG. 1, it is recognized that one or more of the databases may be combined, divided, and/or deleted. In addition, subsets of data from one database may be stored in another database as a duplicate copy or as the sole copy. Further, portions or all of one or more of the databases may be stored in a cloud, stored remote from the gateway 170, and/or stored in a distributed system. The


The token management environment may have modules for generating tokens, revoking access, deleting and/or flushing tokens, and so forth.


E. Resource Provider Systems

The token gateway environment 100 shown in FIG. 1 includes resource provider systems 171 controlling protected resources 172. Some example resource provider systems 171 include for example back-end servers and/or mainframe systems of various data provider entities, such as for example, providers of credit data or credit reports, or repositories for storing health data.


III. Example Information Flow

As described with reference to FIG. 1, the token gateway environment 100 can receive a request from a third party computing system 164A or 164B, and generate a thin token and a fat token to facilitate authentication of the requesting user from a third party to access one or more of the protected resources 172 on resource provider systems 171. FIG. 2 illustrates an example embodiment of information flow within the token gateway environment. The example data flow diagram 200 can involve one or more third party environments 106A or 1068, a gateway 170, a token management environment 102, and one or more security access management environments 104A or 1048.


At (1), a requesting user from a third party provides credentials and requests an authorization token to be used to access one or more protected resources. One or more third party computing systems can send a request to the gateway to obtain a token to get validation to access one or more of the protected resources. The request can include the requesting user's security information such as, for example, one or more of the user's username and password on one or more security and access management environments, the user's email addresses (for example, “username1@email.com” and “username2@anotheremail.com”), zip codes associated with the user's addresses (for example, the user's address in the past 2 years), the user's phone numbers (for example, the user's work phone and home phone numbers), and the like. The request may be in an XML format, although other formats such as, for example, txt or HTML are also possible. The gateway 170 can parse the request to extract the user's security information.


At (2), the gateway can communicate the request to one or more security and access management environment(s) for authenticating the requesting user based on the user's security information, and based on the type of protected resources for which access is requested. The appropriate security and access management environment(s) then verify the third party user's credentials. If the credentials are validated, validation is confirmed with the gateway, and the flow moves to (3). However, if the credentials are not validated, then the flow is interrupted.


If the credentials are validated by one or more of the security and access management platform(s), then, at (3), the gateway receives the validation.


At (4), the gateway then generates two tokens—a thin token and a fat token and stores them in a memory, such as for example a cache. The structure of both tokens may be based on JavaScript Object Notation (“JSON”) Web Token (“JWT”) and OAuth 2.0 authorization standards, but it is recognized that other structures and standards may be used.


JSON is a text format that is completely language independent but uses conventions that are similar to the C-family of languages, including C, C++, C #, Java, JavaScript, Perl, Python, and many others. JSON is built on two structures: (1) a collection of name/value pairs. In various languages, this is realized as an object, record, struct, dictionary, hash table, keyed list, or associative array, and (2) an ordered list of values. It makes sense that a data format that is interchangeable with programming languages also be based on these structures. In JSON: An object is an unordered set of name/value pairs and begins with { (left brace) and ends with} (right brace). Each name is followed by : (colon) and the name/value pairs are separated by , (comma). A value can be a string in double quotes, or a number, or true or false or null, or an object or an array. These structures can be nested. A string is a sequence of zero or more Unicode characters, wrapped in double quotes, using backslash escapes. A character is represented as a single character string. A number is very much like a C or Java number, except that the octal and hexadecimal formats are not used. Whitespace can be inserted between any pair of tokens.


OAuth 2.0 is an open protocol to allow secure authorization in a simple and standard method from web, mobile and desktop applications.


Both of the tokens may be encrypted. The thin token may be used as a key to the cache, whereas the fat token may be regarded as the data structure in the cache. In some embodiments, the thin token may be associated with one or more fat tokens. In some embodiments, the information stored in the thin token may include the minimal or smaller set of information required by the third party to validate the user's access to one or more of the protected resources. The fat token may store details internal to the protected resources, including, for example, user information, IP restriction, time of day values, product information, mainframe details, and the like. In some embodiments, a fat token may include one or more separate payloads for details obtained from one or more security and access management platforms. In other embodiments, a separate fat token may be created for capturing the details obtained from each of the security and access management platforms.


At (5), the gateway provides the thin token to the third party requester. This thin token may act as the equivalent of validation of the requested to then access one or more of the protected resources.


At (6), with a valid thin token, the requesting user at the third party can make a request to access one or more of the protected resources. The request may immediately follow the authorization request, or it may be some time after the authorization request. The access request is received by the gateway.


At (7), the gateway validates the thin token received, and, based on the validated thin token, accesses the associated fat token. As described above, the thin token may be regarded as the key which points to the appropriate location in the cache where the associated fat token is stored. The gateway may then retrieve the fat token for the requesting user and the protected resource requested.


At (8), the gateway swaps the thin token received from the third party for the fat token retrieved from the repository, and sends the fat token to the requested resource provider system 171 to confirm that the requesting user is authenticated such as via an API call. This way, the third party never receives additional information regarding the protected resources which may include details on specific IP address or mainframe details used by the resource provider system, or other sensitive or confidential information. Also, the resource provider system 171 does not need to communicate with the security and access management platforms again following initial authentication.


IV. Gateway Environment Processes


FIGS. 3, 4, and 5 are flowcharts illustrating various embodiments of processes that execute within the token gateway environment. In some embodiments, the processes are performed by the gateway 170 and/or other components of the token gateway environment 100. However, it is recognized that other components of other systems (not shown) may perform one or more of the processes. For ease of explanation, the following describes the services as performed by the gateway 170. The example scenarios are intended to illustrate, but not to limit, various aspects of the computing environment. In some embodiments, the processes can vary from the illustrated flowcharts, with some blocks omitted and other added.


A. Token Generation Initiation Process



FIG. 3 is a block diagram illustrating an embodiment of a process of initiation of token generation.


In block 302, the gateway receives user identity information from a third party system. User identity information may include security information, for example, one or more of the user's username and password on one or more security and access management environments, the user's email addresses (for example, “username1@email.com” and “username2@anotheremail.com”), zip codes associated with the user's addresses (for example, the user's address in the past 2 years), the user's phone numbers (for example, the user's work phone and home phone numbers), and the like. The request may be in an XML format, although other formats such as, for example, txt or HTML are also possible.


In block 304, the gateway receives a data packet storing the user credentials. In some embodiments, the gateway may first verify that the request is coming from a valid, trusted application. After the request is confirmed to be from a valid and trusted application, the gateway generates an encrypted message including portions of the user identity information to send to one or more of the security and access management platforms. Some example security and access management platforms include identity and access management platforms such as for example Okta, Centify, Microsoft Azure, RSA SecurID, OneLogin, LDAP, and the like.


The security and access management platform(s) process the user credentials to determine whether the user credentials are valid, and send a response back to the gateway.


In block 306, the gateway receives the one or more response(s) from the security and access management platform(s).


At block 308, the gateway determines if the security and access management platform(s) have verified the user credentials.


If the credentials were not validated, then, in block 310, the gateway generates and sends an encrypted data packet to the requesting user at the third party computing system denying authentication of the third party. In various scenarios, the third party environment may have rules regarding the number of attempts for authentication requests. Depending on such rules, the requesting user may then attempt to provide other credentials, and the flow may restart at block 302. Otherwise, the flow may end at block 310.


If the credentials were validated by the security and access management platform(s), then, in block 312, the gateway initiates the generation of tokens. One example embodiment of a process for token generation is shown in FIG. 4, and described in detail below.


B. Token Generation Process



FIG. 4 is a block diagram illustrating an embodiment of a process for token generation.


In some embodiments, the example process for token generation illustrated in FIG. 4 may be performed after the example process for token generation initiation illustrated in FIG. 3 is performed.


Following validation of credentials by one or more of the security and access management platforms, in block 402, the gateway generates a thin token and one or more fat tokens. As described above, the thin token includes a minimal or smaller set of information to send to the resource provider systems 171 to indicate that the user has been validated. The fat token may include additional details which are internal and specific to the protected resources.


After the tokens are generated, in block 404, the gateway stores the thin token and one or more fat tokens in association with one another. As described above, in one embodiment, the thin token is a key which points to the appropriate location in the cache where the associated fat token is stored. In various embodiments, for data security purposes, one or more of encoding, encryption, hashing, salting, and the like may be applied to the tokens.


In block 406, the gateway generates an encrypted data packet to provide the thin token to the third party computing system.


C. Access Authorization to Protected Resources Process



FIG. 5 is a block diagram illustrating an embodiment of a process for access authorization to protected resources.


In block 510, the gateway receives an encrypted data packet from a third party computing system including a thin token and a request to access a protected resource. In some embodiments, block 510 may immediately follow block 406. In other embodiments, block 510 may occur sometime after block 406 is completed.


In block 512, the gateway extracts the thin token from the encrypted data packet received, and validates the thin token. In some embodiments, the extraction may be done using a JavaScript policy. Example details of an embodiment of the structure are provided in more detail below. The validation may include making sure that the thin token is signed, verified, its claims are not null, and that it has not expired.


After the thin token is validated, in block 514, the gateway accesses the fat token associated with the thin token, and generates an encrypted data packet to provide the fat token to the requested protected resource. In some embodiments, this accessing of the fat token includes extracting the JTI claim (described below) from the thin token. As described above, the fat token may include product information and other user information regarding, and used by, the resource provider systems 171 to provide the protected resource(s).


In block 516, the gateway receives confirmation that the fat token was received by the resource provider systems 171.


V. Token Headers and Data Structures


FIGS. 6A and 6B are block diagrams illustrating embodiments of token data structures.


A. Thin Token



FIG. 6A is a block diagram illustrating an example embodiment of a thin token data structure.


The following table provides more details about the data included in the header of the example embodiment of the thin token structure illustrated in FIG. 6A:















Property
Description
Datatype
Example







alg
Identifies the
String
“RS256”



digital signature





used




kid
Identifies the
String
“AJjS1rPB7I80GZ82nclJVOBAwWpwe5XhjaSJe



public-key used

GRdwipF1”



to verify the





access_token.




typ
Type for the
String
“JWT”



token, defaulted





to “JWT”.





Specifies that this





is a JWT token









The following table provides more details about the data included in the payload of the example embodiment of the thin token structure illustrated in FIG. 6A:















Property
Description
Datatype
Example







Sub
Username in
String
“abc@xyz.com”



security and





access





management





platform




Email
Email id of the user
String
“abc@xyz.com”


FirstName
First name of the user
String
“John”


Iss
Issuer of the token
String
“Credit Data Provider”


LastName
Last name of the
String
“Doe”



user




Exp
The time at which
Integer
“1500462376”



the access token





expires, in Unix





time (seconds)




Iat
The time at which
Integer
“1500455176”



the token was





issued in Unix





time (seconds)




jti
Unique identifier
String
“d277ff94-4c9f-4dcb-a4ad-



for the access

59b56fbe41f0”



token. This is a





Unique User





Identifier (“UUID”).









The identifier value may be assigned in a manner that ensures that there is a negligible probability that the same value will be accidentally assigned to a different data object.


B. Fat Token



FIG. 6B is a block diagram illustrating an example embodiment of a fat token data structure.


The following table provides more details about the data included in the header of the example embodiment of the fat token structure illustrated in FIG. 6B:















Property
Description
Datatype
Example







alg
Identifies the digital
String
“RS256”



signature used




kid
Identifies the public-
String
“AJjS1rPB7I80GZ82nclJVOBAwWpwe5XhjaSJeG



key used to verify

RdwipF1”



the access_token.




typ
Type for the token,
string
“JWT”



defaulted to “JWT”.





Specifies that this is





a JWT token.









The following table provides more details about the data included in the payload of the example embodiment of the fat token structure illustrated in FIG. 6B:















Property
Description
Datatype
Example







Sub
The username in security
String
“abc@xyz.com”



and access management





platform




Email
Email id of the user
String
“abc@xyz.com”


FirstName
The first name of the user
String
“John”


Iss
Issuer of the token
String
“Credit Data Provider”


LastName
The last name of the user
string
“Doe”


Exp
The time at which the access
Integer
“1500462376”



token expires, this is in Unix





time (seconds)




lat
The time at which the token
Integer
“1500455176”



was issued in Unix time





(seconds)




UserProduct
The product name in security
String
“Developer Portal non-prod”



and access management





platform




UserProduct
These are the product
JSON
“UserProductOptions”:


Options
options associated with the
Array
{“ProductOption”:



product in the UserProduct

[



claim

{“Name”:“CEMS MARS User





ID”, “value”:“experian”},





{“Name”:“CEMS Account





Number”, “value”:“”},





{“Name”:“CEMS MARS





Password”, “value”:“experian”},





{“Name”:“CEMS Client ID”, “value”:“”},





{“Name”:“CEMS Source IP”, “value”:“”}





]}


UserExtraInfo
Any custom information
JSON




requested by the users and
Array




administrators of the





protected resources









It is recognized that the user information may include user information from one or more security and access management systems. In other embodiments, there may be multiple fat tokens associated with each thin token.


C. Token Headers



FIGS. 7A, 7B, 7C and 7D are block diagrams illustrating embodiments of token headers.


1. Thin Token



FIG. 7A is a block diagram illustrating an embodiment of parameters of a header used in the process of a requesting user at a third party sending a request to access a protected resource after having received a thin token from the gateway. As seen in FIG. 7A, the header includes a parameter Client_id, a string which provides the client identification, a parameter Client_secret, a string which provides the client secret, which may in some examples be an encrypted key, and a parameter Content_type, a string which provides the payload type, such as for example JSON. In some embodiments, the payload may include the requesting user's username and password, for example.


The response sent back from the gateway to the requesting user may include an indication of the time the token has issued, time at which it will expire, the type of token, and finally the issuer of the token.


2. Refresh Process



FIG. 7B is a block diagram illustrating an embodiment of parameters of a header used in a refresh process of a third party user obtaining an updated thin token or a new access token.


As seen in FIG. 7B, the header includes the parameters Client_id, Client_secret and Content_type, which are similar to the parameters described above in FIG. 7A. In addition, the header for a refresh request additionally includes a parameter Grant_type, which is a string with the value “refresh_token” for example. Finally, the header also includes a parameter Refresh_token, which is the fresh token received by the gateway.


The process for the refresh would involve the third party user sending the refresh token request to the gateway, the gateway validating the Client_id and Client_secret, generating a refresh thin token (which could be the same token as previously generated but with updated parameters for the expiry time, for example), caching the refresh token in association with the previously generated fat token, and sending the refreshed token back to the third party user.


In some embodiments, the refresh token process may only refresh active thin tokens but could also update one or more fat tokens. For example, after being generated, the thin tokens may generally expire in 24 hours; however, a given thin token may only be active for 30 minutes. Thus, the refresh process may only refresh the thin token in those 30 minutes. However, the fat token may be refreshed after the 24 hours, when the thin token expires or it may be deleted entirely such that a new fat token may be generated using any security and access management environment 104A/104B updated information when the next thin token is generated.


3. Revoke Process



FIG. 7C is a block diagram illustrating an embodiment of parameters of a header used in the process of revoking a third party user's thin token (original or refreshed).


This process may be invoked, for example, when the third party user needs to log out of a given application, or out of their computing system. The third party may be an individual working at an organization, and the organization's administrator may also decide to log the individual out. For example, the third party administrator may wish to cut off access to protected resources for a terminated employee. In another example, the administrator may wish to end access for the entire organization.


As seen in FIG. 7C, the header includes the parameters Client_id and Client_secret, which are similar to the parameters described above in FIG. 7A. In addition, the header for a revoke token additionally includes a parameter Token, which identifies which token should be revoked, such as a unique identifier for the token such as the UUID. The identifier value may be assigned in a manner that ensures that there is a negligible probability that the same value will be accidentally assigned to a different data object. Finally, the header also includes a parameter Token_type, which is a string that has values of original, refresh, or JTI, for example.


When a requesting user decides to, or is made to log out, which would signal that the third party user hits the endpoint of their token valid time, the gateway again validates the Client_id and Client_secret. Then, depending on whether the token type is original or refresh, the gateway revokes the appropriate token only. At the same time, the gateway creates a new cache called for example “blacklistToken_Cache,” which would persist the blacklisted token. The expiry time of the cache will be the same as the refresh token expiry time. If the token type is JTI, then the gateway revokes all original and refresh tokens, or JTI tokens. This may cause the third party to be entirely logged out of an application, for example.


In various embodiments, the revoke process may be invoked by a specific application on a third party user computing system, in which case the revocation of the thin token would cause the user to be logged out of the specific applications. In other embodiments, the administrator of the third party environment may wish to revoke thin tokens for all users at once such as for example revoking all tokens with a specific client identifier—and the revoke process may be used for that as well.


4. Product Token



FIG. 7D is a block diagram illustrating an embodiment of parameters of a header of a product token.


The illustrated token includes a product identifier such as a name or unique ID and then an indication of which security and access management provider handles the user authentication for the product.


VI. Example Applications

In one example, an employee of Bank X wants to get credit report of consumer Y. The employee of Bank X also wants to get a fraud score for consumer Y. The employee tries to log in to Bank X's application providing credit reports and fraud score from the employee's tablet using a username and password. Gateway 170 receives from the employee of Bank X the employee's username and password, along with a request for these two types of resources.


Gateway 170 then determines the employee's security information, and then contacts security and access management environment 104A to determine if the employee of Bank X is authenticated and has correct privilege for accessing a credit report of consumer Y. Gateway 170 also contacts security and access management environment 104B to determine if the employee of Bank X is authenticated and has correct privilege for getting a fraud score for consumer Y.


After security and access management environment 104A and security and access management environment 104B confirm that the employee of Bank X is authenticated to access both credit reports and fraud scores regarding consumer Y, then gateway 170 creates a single thin token for the employee, and a fat token for each of the employee's requests (credit report for consumer Y and fraud score for consumer Y) using data from the security and access management environment 104A and security and access management environment 104B. The gateway also stores the thin token in association with the two fat tokens in the token repository in a key-value cache scheme. Though in other embodiments, the fat token includes data from both security and access management environment 104A and security and access management environment 104B.


Then the gateway 170 sends the thin token back to the employee's tablet. Then, the employee sends a request for accessing the resources back to the gateway 170, after which, the gateway 170 validates the thin token and then retrieves the appropriate fat tokens associated with it, and forwards the fat tokens (which include private data from the security and access management environment 104A and security and access management environment 104B) to the resource provider systems 171, in this case, a credit report provider system, and a fraud analytics provider system. The resource provider systems then send confirmation of receipt to the gateway.


VII. Example System Implementation and Architecture

In some embodiments, any of the systems, servers, or components referenced herein including the token provider repository system 130, the gateway 170, the computing systems 146A, 146B, 164A, 164B, the resource provider systems 171 may take the form of a computing system as shown in FIG. 8 which illustrates a block diagram of an embodiment of a computing device 800. The computing device 800 may include, for example, one or more personal computers that is IBM, Macintosh, or Linux/Unix compatible or a server or workstation. In one embodiment, the computing device 800 comprises a server, a laptop computer, a smart phone, a personal digital assistant, a tablet, or a desktop computer, for example. In one embodiment, the illustrated computing device 800 includes one or more central processing unit (CPU) 802, which may each include a conventional or proprietary microprocessor. The computing device 800 further includes one or more memory 806, such as random access memory (RAM) for temporary storage of information, one or more read only memory (ROM) for permanent storage of information, and one or more mass storage device 810, such as a hard drive, diskette, solid state drive, or optical media storage device. The computing device 800 may also include a token module 808 which performs one or more of the processed discussed herein. Typically, the components of the computing device 800 are connected to the computer using a standard based bus system. In different embodiments, the standard based bus system could be implemented in Peripheral Component Interconnect (PCI), Microchannel, Small Computer System Interface (SCSI), Industrial Standard Architecture (ISA) and Extended ISA (EISA) architectures, for example. In addition, the functionality provided for in the components and modules of computing device 800 may be combined into fewer components and modules or further separated into additional components and modules.


The computing device 800 is generally controlled and coordinated by operating system software, such as Windows XP, Windows Vista, Windows 7, Windows 8, Windows 10, Windows Server, Unix, Linux, SunOS, Solaris, Blackberry OS, or other compatible operating systems. In Macintosh systems, the operating system may be any available operating system, such as iOS or MAC OS X. In other embodiments, the computing device 800 may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface, such as a graphical user interface (GUI), among other things.


The illustrated computing device 800 may include one or more commonly available input/output (I/O) devices and interfaces 804, such as a keyboard, mouse, touchpad, and printer. In one embodiment, the I/O devices and interfaces 804 include one or more display devices, such as a monitor, that allows the visual presentation of data to a user. More particularly, a display device provides for the presentation of GUIs, application software data, reports, benchmarking data, metrics, and/or multimedia presentations, for example. The computing device 800 may also include one or more multimedia devices 812, such as speakers, video cards, graphics accelerators, and microphones, for example.


In the embodiment of FIG. 8, the I/O devices and interfaces 804 provide a communication interface to various external devices. In the embodiment of FIG. 8, the computing device 800 is electronically coupled to one or more networks, which comprise one or more of a LAN, WAN, and/or the Internet, for example, via a wired, wireless, or combination of wired and wireless, communication link. The networks communicate with various computing devices and/or other electronic devices via wired or wireless communication links, such as the ERP data sources.


In some embodiments, information may be provided to the computing device 800 over a network from one or more data sources. The data sources may include one or more internal and/or external data sources. In some embodiments, one or more of the databases or data sources may be implemented using a relational database, such as Sybase, Oracle, CodeBase, PostgreSQL, and Microsoft® SQL Server as well as other types of databases such as, for example, a flat file database, an entity-relationship database, an object-oriented database, a non-relational database, and/or a record-based database.


In general, the word “module,” as used herein, refers to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, Lua, C, C #, or C++. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC, Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software modules configured for execution on computing devices may be provided on a computer readable medium, such as a compact disc, digital video disc, flash drive, or any other tangible medium. Such software code may be stored, partially or fully, on a memory device of the executing computing device, such as the computing device 800, for execution by the computing device. Software instructions may be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. The modules described herein are preferably implemented as software modules, but may be represented in hardware or firmware. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage.


In the example of FIG. 8, the modules 808 and 814 may be configured for execution by the CPU 802 to perform any or all of the processes discussed herein. Depending on the embodiment, certain processes, or in the processes, or groups of processes discussed herein may be performed by multiple devices, such as multiple computing systems similar to computing device 800.


VIII. Additional Embodiments

Each of the processes, methods, and algorithms described in the preceding sections may be embodied in, and fully or partially automated by, code modules executed by one or more computer systems or computer processors comprising computer hardware. The code modules may be stored on any type of non-transitory computer-readable medium or computer storage device, such as hard drives, solid state memory, optical disc, and/or the like. The systems and modules may also be transmitted as generated data signals (for example, as part of a carrier wave or other analog or digital propagated signal) on a variety of computer-readable transmission mediums, including wireless-based and wired/cable-based mediums, and may take a variety of forms (for example, as part of a single or multiplexed analog signal, or as multiple discrete digital packets or frames). The processes and algorithms may be implemented partially or wholly in application-specific circuitry. The results of the disclosed processes and process steps may be stored, persistently or otherwise, in any type of non-transitory computer storage such as, for example, volatile or non-volatile storage.


The various features and processes described above may be used independently of one another, or may be combined in various ways. All possible combinations and sub-combinations are intended to fall within the scope of this disclosure. In addition, certain method or process blocks may be omitted in some implementations. The methods and processes described herein are also not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate. For example, described blocks or states may be performed in an order other than that specifically disclosed, or multiple blocks or states may be combined in a single block or state. The example blocks or states may be performed in serial, in parallel, or in some other manner. Blocks or states may be added to or removed from the disclosed example embodiments. The example systems and components described herein may be configured differently than described. For example, elements may be added to, removed from, or rearranged compared to the disclosed example embodiments.


Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.


As used herein, the terms “determine” or “determining” encompass a wide variety of actions. For example, “determining” may include calculating, computing, processing, deriving, generating, obtaining, looking up (for example, looking up in a table, a database or another data structure), ascertaining and the like via a hardware element without user intervention. Also, “determining” may include receiving (for example, receiving information), accessing (for example, accessing data in a memory) and the like via a hardware element without user intervention. Also, “determining” may include resolving, selecting, choosing, establishing, and the like via a hardware element without user intervention.


As used herein, the terms “provide” or “providing” encompass a wide variety of actions. For example, “providing” may include storing a value in a location of a storage device for subsequent retrieval, transmitting a value directly to the recipient via at least one wired or wireless communication medium, transmitting or storing a reference to a value, and the like. “Providing” may also include encoding, decoding, encrypting, decrypting, validating, verifying, and the like via a hardware element.


As used herein, the term “message” encompasses a wide variety of formats for communicating (for example, transmitting or receiving) information. A message may include a machine readable aggregation of information such as an XML document, fixed field message, comma separated message, or the like. A message may, in some implementations, include a signal utilized to transmit one or more representations of the information. While recited in the singular, it will be understood that a message may be composed, transmitted, stored, received, etc. in multiple parts.


As used herein “receive” or “receiving” may include specific algorithms for obtaining information. For example, receiving may include transmitting a request message for the information. The request message may be transmitted via a network as described above. The request message may be transmitted according to one or more well-defined, machine readable standards which are known in the art. The request message may be stateful in which case the requesting device and the device to which the request was transmitted maintain a state between requests. The request message may be a stateless request in which case the state information for the request is contained within the messages exchanged between the requesting device and the device serving the request. One example of such state information includes a unique token that can be generated by either the requesting or serving device and included in messages exchanged. For example, the response message may include the state information to indicate what request message caused the serving device to transmit the response message.


As used herein “generate” or “generating” may include specific algorithms for creating information based on or using other input information. Generating may include retrieving the input information such as from memory or as provided input parameters to the hardware performing the generating. Once obtained, the generating may include combining the input information. The combination may be performed through specific circuitry configured to provide an output indicating the result of the generating. The combination may be dynamically performed such as through dynamic selection of execution paths based on, for example, the input information, device operational characteristics (for example, hardware resources available, power level, power source, memory levels, network connectivity, bandwidth, and the like). Generating may also include storing the generated information in a memory location. The memory location may be identified as part of the request message that initiates the generating. In some implementations, the generating may return location information identifying where the generated information can be accessed. The location information may include a memory location, network locate, file system location, or the like.


As used herein, “activate” or “activating” may refer to causing or triggering a mechanical, electronic, or electro-mechanical state change to a device. Activation of a device may cause the device, or a feature associated therewith, to change from a first state to a second state. In some implementations, activation may include changing a characteristic from a first state to a second state such as, for example, changing the viewing state of a lens of stereoscopic viewing glasses. Activating may include generating a control message indicating the desired state change and providing the control message to the device to cause the device to change state.


Any process descriptions, elements, or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those skilled in the art.


All of the methods and processes described above may be embodied in, and partially or fully automated via, software code modules executed by one or more general purpose computers. For example, the methods described herein may be performed by the computing system and/or any other suitable computing device. The methods may be executed on the computing devices in response to execution of software instructions or other executable code read from a tangible computer readable medium. A tangible computer readable medium is a data storage device that can store data that is readable by a computer system. Examples of computer readable mediums include read-only memory, random-access memory, other volatile or non-volatile memory devices, CD-ROMs, magnetic tape, flash drives, and optical data storage devices.


It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are to be understood as being among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure. The foregoing description details certain embodiments. It will be appreciated, however, that no matter how detailed the foregoing appears in text, the systems and methods can be practiced in many ways. As is also stated above, it should be noted that the use of particular terminology when describing certain features or aspects of the systems and methods should not be taken to imply that the terminology is being re-defined herein to be restricted to including any specific characteristics of the features or aspects of the systems and methods with which that terminology is associated.

Claims
  • 1. A system for providing tokens to facilitate authentication and access to protected resources, the system comprising: a token gateway computing system in electronic communication with a user computing system, at least one access management computing system, and a protected resource computing system, wherein the token gateway computing system is configured to: receive, from the user computing system, a first data packet including user credentials of a user and a request for an authentication token to access one or more protected resources from the protected resource computing system;transmit a second data packet to the at least one access management computing system based on a type associated with the one or more protected resources requested;receive, from the at least one access management computing system, validation of the user, and private data;generate a first token;generate a second token using the private data, wherein the second token comprises a first portion of the first token and additional data, and wherein the first token and the second token are based on a JavaScript Object Notation (JSON) web token standard;transmit the first token to the user computing system;receive, from the user computing system, a request to access one or more protected resources from the protected resource computing system, the request comprising the first token;validate the received first token; andtransmit the second token to the protected resource computing system.
  • 2. The system of claim 1, wherein the first token is a thin token and the second token is a fat token.
  • 3. The system of claim 1, wherein the first portion of the first token comprises a payload.
  • 4. The system of claim 1, wherein the first token and second token headers each include a public key and a type associated with the token.
  • 5. The system of claim 1, wherein the first portion of the first token includes at least a username, an email, a first name, an issuer of the token, a last name, an expiry time, an issue time, and a unique identifier.
  • 6. The system of claim 1, wherein the additional data in the second token include details regarding the protected resources.
  • 7. The system of claim 6, wherein the additional data includes: a product name of a protected resource as identified in the at least one access management computing system;product options associated with the product name; andadditional custom information requested by users and administrators of the protected resource computing system.
  • 8. A computer-implemented method for providing tokens to facilitate authentication and access to protected resources, the computer-implemented method comprising, as implemented by one or more computing devices within a token gateway system configured with specific executable instructions: receiving, from a user computing system, a first data packet including user credentials of a user and a request for an authentication token to access one or more protected resources from a protected resource computing system;transmitting a second data packet to at least one access management computing system based on a type associated with the one or more protected resources requested;receiving, from the at least one access management computing system, validation of the user, and private data;generating a first token;generating a second token using the private data, wherein the second token comprises a first portion of the first token and additional data, and wherein the first token and the second token are based on a JavaScript Object Notation (JSON) web token standard;transmitting the first token to the user computing system;receiving, from the user computing system, a request to access one or more protected resources from the protected resource computing system, the request comprising the first token;validating the received first token; andtransmitting the second token to the protected resource computing system.
  • 9. The computer-implemented method of claim 8, wherein the first token and second token headers each include a public key and a type associated with the token.
  • 10. The computer-implemented method of claim 8, wherein the additional data in the second token include details regarding the protected resources.
  • 11. The computer-implemented method of claim 10, wherein the additional data includes: a product name of a protected resource as identified in the at least one access management computing system;product options associated with the product name; andadditional custom information requested by users and administrators of the protected resource computing system.
  • 12. The computer-implemented method of claim 8, wherein the first token is a thin token and the second token is a fat token.
  • 13. The computer-implemented method of claim 8, wherein the first portion of the first token comprises a payload.
  • 14. A non-transitory computer storage medium storing computer-executable instructions that, when executed by a processor, cause the processor to at least: receive, from a user computing system, a first data packet including user credentials of a user and a request for an authentication token to access one or more protected resources from a protected resource computing system;transmit a second data packet to at least one access management computing system based on a type associated with the one or more protected resources requested;receive, from the at least one access management computing system, validation of the user, and private data;generate a first token;generate a second token using the private data, wherein the second token comprises a first portion of the first token and additional data, and wherein the first token and the second token are based on a JavaScript Object Notation (JSON) web token standard;transmit the first token to the user computing system;receive, from the user computing system, a request to access one or more protected resources from the protected resource computing system, the request comprising the first token;validate the received first token; andtransmit the second token to the protected resource computing system.
  • 15. The non-transitory computer storage medium of claim 14, wherein the first token includes a key pointing to the second token.
  • 16. The non-transitory computer storage medium of claim 14, wherein the computer-executable instructions, when executed by the processor, cause the processor to additionally: receive, from the user computing system, a request for a refreshed first token;validate a header within the request;generate a refreshed first token;store the refreshed token in association with the first token; andsend the refreshed token back to the user computing system.
  • 17. The non-transitory computer storage medium of claim 16, wherein the first token includes an expiry date.
  • 18. The non-transitory computer storage medium of claim 17, wherein the refreshed token includes a different expiry date than the expiry date of the first token.
  • 19. The non-transitory computer storage medium of claim 18, wherein the computer-executable instructions, when executed by the processor, cause the processor to additionally: receive, from the user computing system, a request for revoking the first token;validate a header within the request;revoke the first token; andalter the stored first token.
  • 20. The non-transitory computer storage medium of claim 14, wherein the first portion of the first token comprises a payload.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 17/123,568 filed Dec. 16, 2020 and titled “SYSTEM AND METHOD FOR A TOKEN GATEWAY ENVIRONMENT,” which is a continuation of U.S. patent application Ser. No. 16/051,339, filed Jul. 31, 2018 and titled “SYSTEM AND METHOD FOR A TOKEN GATEWAY ENVIRONMENT,” which claims priority to U.S. Provisional Patent Application No. 62/688,887 filed on Jun. 22, 2018 and titled “SYSTEM AND METHOD FOR A TOKEN GATEWAY ENVIRONMENT.” The entire content of the above referenced applications are hereby expressly incorporated herein by reference in their entirety.

US Referenced Citations (1367)
Number Name Date Kind
3752904 Waterbury Aug 1973 A
4795890 Goldman Jan 1989 A
4891503 Jewell Jan 1990 A
4977595 Ohta et al. Dec 1990 A
4989141 Lyons et al. Jan 1991 A
5095480 Fenner Mar 1992 A
5126936 Champion et al. Jun 1992 A
5351293 Michener et al. Sep 1994 A
5490258 Fenner Feb 1996 A
5590038 Pitroda Dec 1996 A
5640577 Scharmer Jun 1997 A
5659725 Levy et al. Aug 1997 A
5659731 Gustafson Aug 1997 A
5715314 Payne et al. Feb 1998 A
5719941 Swift et al. Feb 1998 A
5748098 Grace May 1998 A
5754632 Smith May 1998 A
5828840 Cowan et al. Oct 1998 A
5832068 Smith Nov 1998 A
5842224 Fenner Nov 1998 A
5844218 Kawan et al. Dec 1998 A
5860136 Fenner Jan 1999 A
5866889 Weiss et al. Feb 1999 A
5881131 Farris et al. Mar 1999 A
5903830 Joao et al. May 1999 A
5913196 Talmor et al. Jun 1999 A
5956693 Geerlings Sep 1999 A
5966695 Melchione et al. Oct 1999 A
5999596 Walker et al. Dec 1999 A
6021397 Jones et al. Feb 2000 A
6021943 Chastain Feb 2000 A
6026440 Shrader et al. Feb 2000 A
6038551 Barlow et al. Mar 2000 A
6055570 Nielsen Apr 2000 A
6069941 Byrd et al. May 2000 A
6072894 Payne Jun 2000 A
6073106 Rozen et al. Jun 2000 A
6073140 Morgan et al. Jun 2000 A
6084704 Button et al. Jul 2000 A
6085242 Chandra Jul 2000 A
6119103 Basch et al. Sep 2000 A
6128602 Northington et al. Oct 2000 A
6157707 Baulier et al. Dec 2000 A
6161139 Win et al. Dec 2000 A
6182068 Culliss Jan 2001 B1
6182219 Feldbau et al. Jan 2001 B1
6182229 Nielsen Jan 2001 B1
6196460 Shin Mar 2001 B1
6233588 Marchoili et al. May 2001 B1
6247000 Hawkins et al. Jun 2001 B1
6253202 Gilmour Jun 2001 B1
6254000 Degen et al. Jul 2001 B1
6263447 French et al. Jul 2001 B1
6269369 Robertson Jul 2001 B1
6282658 French et al. Aug 2001 B2
6292795 Peters et al. Sep 2001 B1
6311169 Duhon Oct 2001 B2
6321339 French et al. Nov 2001 B1
6327578 Linehan Dec 2001 B1
6343279 Bissonette et al. Jan 2002 B1
6356937 Montville et al. Mar 2002 B1
6397212 Biffar May 2002 B1
6453353 Win et al. Sep 2002 B1
6457012 Jatkowski Sep 2002 B1
6463533 Calamera et al. Oct 2002 B1
6473740 Cockril et al. Oct 2002 B2
6496936 French et al. Dec 2002 B1
6510415 Talmor et al. Jan 2003 B1
6523021 Monberg et al. Feb 2003 B1
6523041 Morgan et al. Feb 2003 B1
6539377 Culliss Mar 2003 B1
6564210 Korda et al. May 2003 B1
6571334 Feldbau et al. May 2003 B1
6574736 Andrews Jun 2003 B1
6581059 Barrett et al. Jun 2003 B1
6601173 Mohler Jul 2003 B1
6607136 Atsmon et al. Aug 2003 B1
6622131 Brown et al. Sep 2003 B1
6629245 Stone et al. Sep 2003 B1
6647383 August et al. Nov 2003 B1
6654786 Fox et al. Nov 2003 B1
6658393 Basch et al. Dec 2003 B1
6679425 Sheppard et al. Jan 2004 B1
6714944 Shapiro et al. Mar 2004 B1
6725381 Smith et al. Apr 2004 B1
6734886 Hagan et al. May 2004 B1
6750985 Rhoads Jun 2004 B2
6754665 Futagami et al. Jun 2004 B1
6766327 Morgan, Jr. et al. Jul 2004 B2
6766946 Iida et al. Jul 2004 B2
6782379 Lee Aug 2004 B2
6795812 Lent et al. Sep 2004 B1
6796497 Benkert et al. Sep 2004 B2
6804346 Mewhinney Oct 2004 B1
6805287 Bishop et al. Oct 2004 B2
6816850 Culliss Nov 2004 B2
6816871 Lee Nov 2004 B2
6823319 Lynch et al. Nov 2004 B1
6829711 Kwok et al. Dec 2004 B1
6845448 Chaganti et al. Jan 2005 B1
6857073 French et al. Feb 2005 B2
6871287 Ellingson Mar 2005 B1
6892307 Wood et al. May 2005 B1
6900731 Kreiner et al. May 2005 B2
6907408 Angel Jun 2005 B2
6908030 Rajasekaran et al. Jun 2005 B2
6910624 Natsuno Jun 2005 B1
6920435 Hoffman et al. Jul 2005 B2
6928487 Eggebraaten et al. Aug 2005 B2
6934714 Meinig Aug 2005 B2
6934849 Kramer et al. Aug 2005 B2
6934858 Woodhill Aug 2005 B2
6947989 Gullotta et al. Sep 2005 B2
6950807 Brock Sep 2005 B2
6950809 Dahan et al. Sep 2005 B2
6950858 Ogami Sep 2005 B2
6965881 Brickell et al. Nov 2005 B1
6968319 Remington et al. Nov 2005 B1
6973462 Dattero et al. Dec 2005 B2
6983381 Jerdonek Jan 2006 B2
6985887 Sunstein et al. Jan 2006 B1
6986461 Geoghegan et al. Jan 2006 B1
6988085 Hedy Jan 2006 B2
6993596 Hinton et al. Jan 2006 B2
6999941 Agarwal Feb 2006 B1
7016907 Boreham et al. Mar 2006 B2
7028013 Saeki Apr 2006 B2
7028052 Chapman et al. Apr 2006 B2
7039607 Watarai et al. May 2006 B2
7043476 Robson May 2006 B2
7058817 Ellmore Jun 2006 B1
7059531 Beenau et al. Jun 2006 B2
7062475 Szabo et al. Jun 2006 B1
7076462 Nelson et al. Jul 2006 B1
7085727 VanOrman Aug 2006 B2
7089584 Sharma Aug 2006 B1
7107241 Pinto Sep 2006 B1
7117172 Black Oct 2006 B1
7121471 Beenau et al. Oct 2006 B2
7124144 Christianson et al. Oct 2006 B2
7154375 Beenau et al. Dec 2006 B2
7155739 Bari et al. Dec 2006 B2
7174454 Roskind Feb 2007 B2
7177846 Moenickheim et al. Feb 2007 B2
7194416 Provost et al. Mar 2007 B1
7200602 Jonas Apr 2007 B2
7203653 McIntosh Apr 2007 B1
7209895 Kundtz et al. Apr 2007 B2
7219107 Beringer May 2007 B2
7222369 Vering et al. May 2007 B2
7225464 Satyavolu et al. May 2007 B2
7231657 Honarvar et al. Jun 2007 B2
7234156 French et al. Jun 2007 B2
7234160 Vogel et al. Jun 2007 B2
7237267 Rayes et al. Jun 2007 B2
7240199 Tomkow Jul 2007 B2
7240363 Ellingson Jul 2007 B1
7243369 Bhat et al. Jul 2007 B2
7246067 Austin et al. Jul 2007 B2
7246740 Swift et al. Jul 2007 B2
7249096 Lasater et al. Jul 2007 B1
7249113 Continelli et al. Jul 2007 B1
7251347 Smith Jul 2007 B2
7263497 Wiser et al. Aug 2007 B1
7289971 O'Neil et al. Oct 2007 B1
7303120 Beenau et al. Dec 2007 B2
7310611 Shibuya et al. Dec 2007 B2
7314167 Kiliccote Jan 2008 B1
7328233 Salim et al. Feb 2008 B2
7330871 Barber Feb 2008 B2
7333635 Tsantes et al. Feb 2008 B2
7337468 Metzger Feb 2008 B2
7340042 Cluff et al. Mar 2008 B2
7340679 Botscheck et al. Mar 2008 B2
7343149 Benco Mar 2008 B2
7343295 Pomerance Mar 2008 B2
7356503 Johnson et al. Apr 2008 B1
7356506 Watson et al. Apr 2008 B2
7356516 Richey et al. Apr 2008 B2
7370044 Mulhern et al. May 2008 B2
7370351 Ramachandran et al. May 2008 B1
7383988 Slonecker, Jr. Jun 2008 B2
7386448 Poss et al. Jun 2008 B1
7389913 Starrs Jun 2008 B2
7403942 Bayliss Jul 2008 B1
7421732 Costa-Requena et al. Sep 2008 B2
7433864 Malik Oct 2008 B2
7437679 Uemura et al. Oct 2008 B2
7438226 Helsper et al. Oct 2008 B2
7444414 Foster et al. Oct 2008 B2
7444518 Dharmarajan et al. Oct 2008 B1
7451113 Kasower Nov 2008 B1
7458508 Shao et al. Dec 2008 B1
7460857 Roach, Jr. Dec 2008 B2
7467401 Cicchitto Dec 2008 B2
7478157 Bohrer et al. Jan 2009 B2
7480631 Merced et al. Jan 2009 B1
7490356 Lieblich et al. Feb 2009 B2
7503489 Heffez Mar 2009 B2
7509117 Yum Mar 2009 B2
7509278 Jones Mar 2009 B2
7512221 Toms Mar 2009 B2
7519558 Ballard et al. Apr 2009 B2
7526796 Lulich et al. Apr 2009 B2
7529698 Joao May 2009 B2
7530097 Casco-Arias et al. May 2009 B2
7542993 Satterfield et al. Jun 2009 B2
7543739 Brown et al. Jun 2009 B2
7546271 Chmielewski et al. Jun 2009 B1
7548886 Kirkland et al. Jun 2009 B2
7552080 Willard et al. Jun 2009 B1
7552123 Wade et al. Jun 2009 B2
7552467 Lindsay Jun 2009 B2
7555459 Dhar et al. Jun 2009 B2
7562184 Henmi et al. Jul 2009 B2
7562814 Shao et al. Jul 2009 B1
7566002 Love et al. Jul 2009 B2
7571473 Boydstun et al. Aug 2009 B1
7575157 Barnhardt et al. Aug 2009 B2
7577665 Ramer et al. Aug 2009 B2
7577934 Anonsen et al. Aug 2009 B2
7580884 Cook Aug 2009 B2
7581112 Brown et al. Aug 2009 B2
7584126 White Sep 2009 B1
7584146 Duhon Sep 2009 B1
7587366 Grim, III et al. Sep 2009 B2
7587368 Felsher Sep 2009 B2
7603701 Gaucas Oct 2009 B2
7606401 Hoffman et al. Oct 2009 B2
7606725 Robertson et al. Oct 2009 B2
7610216 May et al. Oct 2009 B1
7613600 Krane Nov 2009 B2
7620596 Knudson et al. Nov 2009 B2
7623844 Herrmann et al. Nov 2009 B2
7630932 Danaher et al. Dec 2009 B2
7634737 Beringer et al. Dec 2009 B2
7636941 Blinn et al. Dec 2009 B2
7641113 Alvarez et al. Jan 2010 B1
7647344 Skurtovich, Jr. et al. Jan 2010 B2
7653592 Flaxman et al. Jan 2010 B1
7653600 Gustin Jan 2010 B2
7653688 Bittner Jan 2010 B2
7657431 Hayakawa Feb 2010 B2
7660989 Tomkow Feb 2010 B2
7672833 Blume et al. Mar 2010 B2
7676834 Camaisa et al. Mar 2010 B2
7685096 Margolus et al. Mar 2010 B2
7685209 Norton et al. Mar 2010 B1
7685279 Miltonberger et al. Mar 2010 B2
7686214 Shao et al. Mar 2010 B1
7689487 Britto et al. Mar 2010 B1
7689505 Kasower Mar 2010 B2
7689563 Jacobson Mar 2010 B1
7690032 Peirce Mar 2010 B1
7698214 Lindgren Apr 2010 B1
7698217 Phillips et al. Apr 2010 B1
7698445 Fitzpatrick et al. Apr 2010 B2
7698558 Tomkow Apr 2010 B2
7707271 Rudkin et al. Apr 2010 B2
7707624 Tomkow Apr 2010 B2
7708190 Brandt et al. May 2010 B2
7711635 Steele et al. May 2010 B2
7725385 Royer et al. May 2010 B2
7730078 Schwabe et al. Jun 2010 B2
7739139 Robertson et al. Jun 2010 B2
7747494 Kothari et al. Jun 2010 B1
7747520 Livermore et al. Jun 2010 B2
7747521 Serio Jun 2010 B2
7747542 Morley et al. Jun 2010 B2
7761384 Madhogarhia Jul 2010 B2
7761568 Levi et al. Jul 2010 B1
7765166 Beringer et al. Jul 2010 B2
7765311 Itabashi et al. Jul 2010 B2
7769696 Yoda Aug 2010 B2
7769697 Fieschi et al. Aug 2010 B2
7769998 Lynch et al. Aug 2010 B2
7774270 MacCloskey Aug 2010 B1
7788040 Haskell et al. Aug 2010 B2
7792715 Kasower Sep 2010 B1
7792725 Booraem et al. Sep 2010 B2
7793835 Coggeshall et al. Sep 2010 B1
7797725 Lunt et al. Sep 2010 B2
7801828 Candella et al. Sep 2010 B2
7801956 Cumberbatch et al. Sep 2010 B1
7802104 Dickinson Sep 2010 B2
7810036 Bales et al. Oct 2010 B2
7818228 Coulter Oct 2010 B1
7827115 Weller et al. Nov 2010 B2
7841004 Balducci et al. Nov 2010 B1
7841008 Cole et al. Nov 2010 B1
7844520 Franklin Nov 2010 B1
7849014 Erikson Dec 2010 B2
7849624 Holt et al. Dec 2010 B2
7853493 DeBie et al. Dec 2010 B2
7853533 Eisen Dec 2010 B2
7853984 Antell et al. Dec 2010 B2
7865557 Tomkow Jan 2011 B2
7865958 Lieblich et al. Jan 2011 B2
7870078 Clark et al. Jan 2011 B2
7877304 Coulter Jan 2011 B1
7877784 Chow et al. Jan 2011 B2
7880728 de los Reyes et al. Feb 2011 B2
7886008 Tomkow et al. Feb 2011 B2
7908242 Achanta Mar 2011 B1
7909246 Hogg et al. Mar 2011 B2
7912865 Akerman et al. Mar 2011 B2
7930285 Abraham et al. Apr 2011 B2
7930411 Hayward Apr 2011 B1
7941324 Sholtis May 2011 B1
7957266 Kodialam et al. Jun 2011 B2
7958046 Doerner et al. Jun 2011 B2
7966192 Pagliari et al. Jun 2011 B2
7966372 Tomkow Jun 2011 B1
7970679 Kasower Jun 2011 B2
7975299 Balducci et al. Jul 2011 B1
7979908 Millwee Jul 2011 B2
7983932 Kane Jul 2011 B2
7983979 Holland, IV Jul 2011 B2
7991688 Phelan et al. Aug 2011 B2
8001153 Skurtovich, Jr. et al. Aug 2011 B2
8001235 Russ et al. Aug 2011 B2
8005155 Lee et al. Aug 2011 B1
8011582 Ghafarzadeh Sep 2011 B2
8032932 Speyer et al. Oct 2011 B2
8037097 Guo et al. Oct 2011 B2
8041956 White et al. Oct 2011 B1
8055904 Cato et al. Nov 2011 B1
8060424 Kasower Nov 2011 B2
8060916 Bajaj et al. Nov 2011 B2
8065233 Lee et al. Nov 2011 B2
8073785 Candella et al. Dec 2011 B1
8078453 Shaw Dec 2011 B2
8078524 Crawford et al. Dec 2011 B2
8078881 Liu Dec 2011 B1
8079070 Camaisa et al. Dec 2011 B2
8099341 Varghese Jan 2012 B2
8104679 Brown Jan 2012 B2
8116731 Buhrmann et al. Feb 2012 B2
8116751 Aaron Feb 2012 B2
8127982 Casey et al. Mar 2012 B1
8127986 Taylor et al. Mar 2012 B1
8131777 McCullouch Mar 2012 B2
8144368 Rodriguez et al. Mar 2012 B2
8151327 Eisen Apr 2012 B2
8161104 Tomkow Apr 2012 B2
8172132 Love et al. May 2012 B2
8175889 Girulat et al. May 2012 B1
8185747 Wood et al. May 2012 B2
8190513 Felger May 2012 B2
8195549 Kasower Jun 2012 B2
8209389 Tomkow Jun 2012 B2
8219771 Le Neel Jul 2012 B2
8219822 Camaisa et al. Jul 2012 B2
8224723 Bosch et al. Jul 2012 B2
8224913 Tomkow Jul 2012 B2
8225395 Atwood et al. Jul 2012 B2
8229810 Butera et al. Jul 2012 B2
8229844 Felger Jul 2012 B2
8234498 Britti et al. Jul 2012 B2
8239677 Colson Aug 2012 B2
8239929 Kwan et al. Aug 2012 B2
8241369 Stevens Aug 2012 B2
8244629 Lewis et al. Aug 2012 B2
8244848 Narayanan et al. Aug 2012 B1
8255452 Piliouras Aug 2012 B2
8255971 Webb et al. Aug 2012 B1
8255978 Dick Aug 2012 B2
8260706 Freishtat et al. Sep 2012 B2
8261334 Hazlehurst et al. Sep 2012 B2
8266065 Dilip et al. Sep 2012 B2
8275845 Tomkow Sep 2012 B2
8280348 Snyder et al. Oct 2012 B2
8281372 Vidal Oct 2012 B1
8285613 Coulter Oct 2012 B1
8285656 Chang et al. Oct 2012 B1
8291218 Garcia et al. Oct 2012 B2
8291477 Lunt Oct 2012 B2
8295898 Ashfield et al. Oct 2012 B2
8296562 Williams et al. Oct 2012 B2
8302164 Lunt Oct 2012 B2
8312033 McMillan Nov 2012 B1
8315940 Winbom et al. Nov 2012 B2
8327429 Speyer et al. Dec 2012 B2
8359278 Domenikos et al. Jan 2013 B2
8359393 Metzger Jan 2013 B2
8374634 Dankar et al. Feb 2013 B2
8374973 Herbrich et al. Feb 2013 B2
8406736 Das et al. Mar 2013 B2
8423648 Ferguson et al. Apr 2013 B2
8442886 Haggerty et al. May 2013 B1
8442910 Morris et al. May 2013 B2
8443202 White et al. May 2013 B2
8447016 Kugler et al. May 2013 B1
8456293 Trundle et al. Jun 2013 B1
8464939 Taylor et al. Jun 2013 B1
8468090 Lesandro et al. Jun 2013 B2
8468198 Tomkow Jun 2013 B2
8468199 Tomkow Jun 2013 B2
8478674 Kapczynski et al. Jul 2013 B1
8478981 Khan et al. Jul 2013 B2
8484186 Kapczynski et al. Jul 2013 B1
8484706 Tomkow Jul 2013 B2
8504628 Tomkow Aug 2013 B2
8515828 Wolf et al. Aug 2013 B1
8515844 Kasower Aug 2013 B2
8527357 Ganesan Sep 2013 B1
8527417 Telle et al. Sep 2013 B2
8527773 Metzger Sep 2013 B1
8528078 Camaisa et al. Sep 2013 B2
8533118 Weller et al. Sep 2013 B2
8533791 Samuelsson et al. Sep 2013 B2
8549590 de Villiers Prichard et al. Oct 2013 B1
8560381 Green et al. Oct 2013 B2
8572391 Golan et al. Oct 2013 B2
8578496 Krishnappa Nov 2013 B1
8588748 Buhrman et al. Nov 2013 B2
8600886 Ramavarjula et al. Dec 2013 B2
8601602 Zheng Dec 2013 B1
8606234 Pei et al. Dec 2013 B2
8606694 Campbell et al. Dec 2013 B2
8620942 Hoffman et al. Dec 2013 B1
8630938 Cheng et al. Jan 2014 B2
8645275 Seifert et al. Feb 2014 B2
8646051 Paden et al. Feb 2014 B2
8656504 Lurey et al. Feb 2014 B2
8671115 Skurtovich, Jr. et al. Mar 2014 B2
8688543 Dominquez Apr 2014 B2
8689311 Blinn et al. Apr 2014 B2
8695105 Mahendrakar et al. Apr 2014 B2
8700515 Duckworth et al. Apr 2014 B2
8701199 Dotan et al. Apr 2014 B1
8705718 Baniak et al. Apr 2014 B2
8706599 Koenig et al. Apr 2014 B1
8713651 Stibel Apr 2014 B1
8725613 Celka et al. May 2014 B1
8738934 Lurey et al. May 2014 B2
8744956 DiChiara et al. Jun 2014 B1
8751388 Chapa Jun 2014 B1
8762287 Morley et al. Jun 2014 B2
8768914 Scriffignano et al. Jul 2014 B2
8769614 Knox et al. Jul 2014 B1
8781882 Arboletti et al. Jul 2014 B1
8781953 Kasower Jul 2014 B2
8781975 Bennett et al. Jul 2014 B2
8782154 Tomkow Jul 2014 B2
8782217 Arone et al. Jul 2014 B1
8782753 Lunt Jul 2014 B2
8793166 Mizhen Jul 2014 B2
8793509 Nelson et al. Jul 2014 B1
8793777 Colson Jul 2014 B2
8800005 Lunt Aug 2014 B2
8806584 Lunt Aug 2014 B2
8818888 Kapczynski et al. Aug 2014 B1
8819793 Gottschalk, Jr. Aug 2014 B2
8826371 Webb et al. Sep 2014 B2
8826393 Eisen Sep 2014 B2
8831564 Ferguson et al. Sep 2014 B2
8839394 Dennis et al. Sep 2014 B2
8856894 Dean et al. Oct 2014 B1
8862514 Eisen Oct 2014 B2
8868932 Lurey et al. Oct 2014 B2
D717332 Nies et al. Nov 2014 S
8931058 DiChiara et al. Jan 2015 B2
8938399 Herman Jan 2015 B1
8954459 McMillan et al. Feb 2015 B1
8972400 Kapczynski et al. Mar 2015 B1
9010627 Prasad et al. Apr 2015 B1
9043886 Srinivasan et al. May 2015 B2
9047473 Samuelsson et al. Jun 2015 B2
9100400 Lunt Aug 2015 B2
9106691 Burger et al. Aug 2015 B1
9124606 Metzger Sep 2015 B2
9147042 Haller et al. Sep 2015 B1
9147117 Madhu et al. Sep 2015 B1
9154482 Dudziak et al. Oct 2015 B2
9158903 Metzger Oct 2015 B2
9185123 Dennis et al. Nov 2015 B2
9195984 Spector et al. Nov 2015 B1
9195985 Domenica et al. Nov 2015 B2
9196004 Eisen Nov 2015 B2
9203819 Fenton et al. Dec 2015 B2
9215223 Kirsch Dec 2015 B2
9235728 Gottschalk, Jr. et al. Jan 2016 B2
9246899 Durney et al. Jan 2016 B1
9256624 Skurtovich, Jr. et al. Feb 2016 B2
9269085 Webb et al. Feb 2016 B2
9294476 Lurey et al. Mar 2016 B1
9344413 Kirsch May 2016 B2
9361597 Britton et al. Jun 2016 B2
9380057 Knauss Jun 2016 B2
9390384 Eisen Jul 2016 B2
9391971 Lunt Jul 2016 B2
9412141 Prichard et al. Aug 2016 B2
9420448 Dankar et al. Aug 2016 B2
9462044 Preibisch et al. Oct 2016 B1
9465786 Lurey et al. Oct 2016 B2
9467445 Egan et al. Oct 2016 B2
9491160 Livesay et al. Nov 2016 B2
9578014 Sondhi et al. Feb 2017 B2
9600651 Ryan et al. Mar 2017 B1
9607336 Dean et al. Mar 2017 B1
9626680 Ryan et al. Apr 2017 B1
9633322 Burger Apr 2017 B1
9641521 Egan et al. May 2017 B2
9665854 Burger et al. May 2017 B1
9684905 Haller et al. Jun 2017 B1
9697521 Webb et al. Jul 2017 B2
9706402 Kueh Jul 2017 B2
9710523 Skurtovich, Jr. et al. Jul 2017 B2
9721147 Kapczynski Aug 2017 B1
9734501 Durney et al. Aug 2017 B2
9754256 Britton et al. Sep 2017 B2
9754311 Eisen Sep 2017 B2
9760885 Ramalingam et al. Sep 2017 B1
9779392 Prasad et al. Oct 2017 B1
9818121 Snyder et al. Nov 2017 B2
9843582 Mahendrakar et al. Dec 2017 B2
9876796 Egan et al. Jan 2018 B2
9892389 Domenica et al. Feb 2018 B2
10075446 McMillan et al. Sep 2018 B2
10089679 Eisen Oct 2018 B2
10097551 Chan et al. Oct 2018 B2
10115079 Burger et al. Oct 2018 B1
10169761 Burger Jan 2019 B1
10200277 Sreeramoju et al. Feb 2019 B2
10277569 Barbour Apr 2019 B1
10284548 Williams et al. May 2019 B2
10356079 Lurey et al. Jul 2019 B2
10373240 Ross et al. Aug 2019 B1
10380565 Prasad Aug 2019 B1
10395053 Samid Aug 2019 B2
10438308 Prichard et al. Oct 2019 B2
10453159 Kapczynski Oct 2019 B2
10616196 Khitrenovich et al. Apr 2020 B1
10637646 Krishnamacharya et al. Apr 2020 B2
10652227 Spektor et al. May 2020 B2
10664936 Chapa et al. May 2020 B2
10685336 Burger et al. Jun 2020 B1
10719873 Dean et al. Jul 2020 B1
10740762 Burger Aug 2020 B2
10742541 Kim et al. Aug 2020 B2
10771463 Berezin et al. Sep 2020 B2
10783542 Walz et al. Sep 2020 B2
10798093 Kaliski, Jr. et al. Oct 2020 B2
10798096 Touati et al. Oct 2020 B2
10863359 Talwar Dec 2020 B2
10891618 Kinch et al. Jan 2021 B2
10911234 Jain et al. Feb 2021 B2
10999298 Eisen May 2021 B2
11012240 Kirsch May 2021 B1
11074641 Ross et al. Jul 2021 B1
11095643 Huffman et al. Aug 2021 B2
11115224 Scofield Sep 2021 B1
11120519 Kapczynski Sep 2021 B2
11128464 Loladia Sep 2021 B1
11146676 Sena, Jr. et al. Oct 2021 B2
11157872 McMillan et al. Oct 2021 B2
11164178 Anderson et al. Nov 2021 B2
11164271 Chapa et al. Nov 2021 B2
11178128 Poschel et al. Nov 2021 B2
11206246 Krishnamacharya Dec 2021 B2
11232413 Burger et al. Jan 2022 B1
11277439 Knopf Mar 2022 B2
11288677 Burger Mar 2022 B1
11290255 Krishnamacharya et al. Mar 2022 B2
11310227 Hamburg et al. Apr 2022 B2
11356460 Bondugula et al. Jun 2022 B2
11361317 Billman et al. Jun 2022 B2
11363015 Yeddula et al. Jun 2022 B2
11431729 Bloomquist et al. Aug 2022 B2
11449630 Talwar Sep 2022 B2
11470069 Gillespie Oct 2022 B2
11526884 Chilaka et al. Dec 2022 B2
11532030 Smith Dec 2022 B1
11544363 Deore et al. Jan 2023 B2
11551226 Kumar Jan 2023 B2
11587150 Ross et al. Feb 2023 B1
11588639 Jain et al. Feb 2023 B2
11651095 Gupta et al. May 2023 B2
11762975 Allen Sep 2023 B2
11765145 Krishnamacharya Sep 2023 B2
11769112 McMillan et al. Sep 2023 B2
11775979 Burger Oct 2023 B1
11784791 Krishnamacharya et al. Oct 2023 B2
11790473 Chapa et al. Oct 2023 B2
11803929 Kapczynski Oct 2023 B1
12003540 Sharifi Mehr Jun 2024 B1
20010029482 Tealdi et al. Oct 2001 A1
20010039532 Coleman, Jr. et al. Nov 2001 A1
20010042785 Walker et al. Nov 2001 A1
20010044729 Pomerance Nov 2001 A1
20010044756 Watkins et al. Nov 2001 A1
20010049274 Degraeve Dec 2001 A1
20020004736 Roundtree et al. Jan 2002 A1
20020013827 Edstrom et al. Jan 2002 A1
20020013899 Faul Jan 2002 A1
20020026519 Itabashi et al. Feb 2002 A1
20020026575 Wheeler et al. Feb 2002 A1
20020032635 Harris et al. Mar 2002 A1
20020033846 Balasubramanian et al. Mar 2002 A1
20020045154 Wood et al. Apr 2002 A1
20020052754 Joyce et al. May 2002 A1
20020059201 Work May 2002 A1
20020059521 Tasler May 2002 A1
20020069122 Yun et al. Jun 2002 A1
20020077964 Brody et al. Jun 2002 A1
20020087460 Hornung Jul 2002 A1
20020091544 Middeljans et al. Jul 2002 A1
20020091635 Dilip et al. Jul 2002 A1
20020099635 Guiragosian Jul 2002 A1
20020103933 Garon et al. Aug 2002 A1
20020111816 Lortscher et al. Aug 2002 A1
20020116247 Tucker et al. Aug 2002 A1
20020120537 Morea et al. Aug 2002 A1
20020120757 Sutherland et al. Aug 2002 A1
20020120846 Stewart et al. Aug 2002 A1
20020128962 Kasower Sep 2002 A1
20020133365 Grey et al. Sep 2002 A1
20020133462 Shteyn Sep 2002 A1
20020138470 Zhou Sep 2002 A1
20020143943 Lee et al. Oct 2002 A1
20020147801 Gullotta et al. Oct 2002 A1
20020157029 French et al. Oct 2002 A1
20020164004 Tamura et al. Nov 2002 A1
20020169747 Chapman et al. Nov 2002 A1
20020173994 Ferguson, III Nov 2002 A1
20020174048 Dheer et al. Nov 2002 A1
20020184509 Scheidt et al. Dec 2002 A1
20020198800 Shamrakov Dec 2002 A1
20020198806 Blagg et al. Dec 2002 A1
20020198824 Cook Dec 2002 A1
20020198830 Randell et al. Dec 2002 A1
20030002671 Inchalik et al. Jan 2003 A1
20030009418 Green et al. Jan 2003 A1
20030009426 Ruiz-Sanchez Jan 2003 A1
20030023531 Fergusson Jan 2003 A1
20030036995 Lazerson Feb 2003 A1
20030041031 Hedy Feb 2003 A1
20030046311 Baidya et al. Mar 2003 A1
20030046554 Leydier et al. Mar 2003 A1
20030048904 Wang et al. Mar 2003 A1
20030061163 Durfield Mar 2003 A1
20030069839 Whittington et al. Apr 2003 A1
20030069943 Bahrs et al. Apr 2003 A1
20030097342 Whittingtom May 2003 A1
20030097380 Mulhern et al. May 2003 A1
20030097573 Wheeler et al. May 2003 A1
20030105710 Barbara et al. Jun 2003 A1
20030105733 Boreham Jun 2003 A1
20030105742 Boreham et al. Jun 2003 A1
20030115133 Bian Jun 2003 A1
20030115151 Wheeler et al. Jun 2003 A1
20030131102 Umbreit Jul 2003 A1
20030154162 Danaher et al. Aug 2003 A1
20030158960 Engberg Aug 2003 A1
20030163513 Schaeck et al. Aug 2003 A1
20030163733 Barriga-Caceres et al. Aug 2003 A1
20030171942 Gaito Sep 2003 A1
20030177028 Cooper et al. Sep 2003 A1
20030182214 Taylor Sep 2003 A1
20030187837 Culliss Oct 2003 A1
20030188193 Venkataramappa Oct 2003 A1
20030195859 Lawrence Oct 2003 A1
20030200447 Sjoblom Oct 2003 A1
20030204429 Botscheck et al. Oct 2003 A1
20030204752 Garrison Oct 2003 A1
20030208412 Hillestad et al. Nov 2003 A1
20030217094 Andrews et al. Nov 2003 A1
20030220858 Lam et al. Nov 2003 A1
20040002878 Hinton Jan 2004 A1
20040006488 Fitall et al. Jan 2004 A1
20040010458 Friedman Jan 2004 A1
20040010698 Rolfe Jan 2004 A1
20040015714 Abraham et al. Jan 2004 A1
20040015715 Brown Jan 2004 A1
20040019549 Gulbrandsen Jan 2004 A1
20040019799 Vering et al. Jan 2004 A1
20040024671 Freund Feb 2004 A1
20040024709 Yu et al. Feb 2004 A1
20040029601 O'Neill et al. Feb 2004 A1
20040030649 Nelson et al. Feb 2004 A1
20040039586 Garvey et al. Feb 2004 A1
20040044628 Mathew et al. Mar 2004 A1
20040044673 Brady et al. Mar 2004 A1
20040044739 Ziegler Mar 2004 A1
20040078324 Lonnberg et al. Apr 2004 A1
20040083159 Crosby et al. Apr 2004 A1
20040088237 Moenickheim et al. May 2004 A1
20040088255 Zielke et al. May 2004 A1
20040107250 Marciano Jun 2004 A1
20040110119 Riconda et al. Jun 2004 A1
20040111359 Hudock Jun 2004 A1
20040111375 Johnson Jun 2004 A1
20040117302 Weichert et al. Jun 2004 A1
20040122681 Ruvolo et al. Jun 2004 A1
20040122696 Beringer Jun 2004 A1
20040122720 Mikalsen et al. Jun 2004 A1
20040128150 Lundegren Jul 2004 A1
20040128156 Beringer et al. Jul 2004 A1
20040133440 Carolan et al. Jul 2004 A1
20040133441 Brady et al. Jul 2004 A1
20040133509 McCoy et al. Jul 2004 A1
20040133513 McCoy et al. Jul 2004 A1
20040133515 McCoy et al. Jul 2004 A1
20040138994 DeFrancesco et al. Jul 2004 A1
20040139009 Kozee et al. Jul 2004 A1
20040139010 McMichael et al. Jul 2004 A1
20040139011 Kozee et al. Jul 2004 A1
20040141005 Banatwala et al. Jul 2004 A1
20040143546 Wood et al. Jul 2004 A1
20040143596 Sirkin Jul 2004 A1
20040153521 Kogo Aug 2004 A1
20040158523 Dort Aug 2004 A1
20040158723 Root Aug 2004 A1
20040159700 Khan et al. Aug 2004 A1
20040167793 Masuoka et al. Aug 2004 A1
20040167834 Koskinen et al. Aug 2004 A1
20040193891 Ollila Sep 2004 A1
20040199789 Shaw et al. Oct 2004 A1
20040210661 Thompson Oct 2004 A1
20040220865 Lozowski et al. Nov 2004 A1
20040220918 Scriffignano et al. Nov 2004 A1
20040225643 Alpha et al. Nov 2004 A1
20040230527 Hansen et al. Nov 2004 A1
20040243514 Wankmueller Dec 2004 A1
20040243518 Clifton et al. Dec 2004 A1
20040243588 Tanner et al. Dec 2004 A1
20040243832 Wilf et al. Dec 2004 A1
20040249789 Kapoor et al. Dec 2004 A1
20040249811 Shostack Dec 2004 A1
20040250085 Tattan et al. Dec 2004 A1
20040250107 Guo Dec 2004 A1
20040254935 Chagoly et al. Dec 2004 A1
20040255127 Arnouse Dec 2004 A1
20040267714 Frid et al. Dec 2004 A1
20050005168 Dick Jan 2005 A1
20050010513 Duckworth et al. Jan 2005 A1
20050021476 Candella et al. Jan 2005 A1
20050021551 Silva et al. Jan 2005 A1
20050027983 Klawon Feb 2005 A1
20050027995 Menschik et al. Feb 2005 A1
20050055231 Lee Mar 2005 A1
20050058262 Timmins et al. Mar 2005 A1
20050060332 Bernstein et al. Mar 2005 A1
20050071328 Lawrence Mar 2005 A1
20050075985 Cartmell Apr 2005 A1
20050086126 Patterson Apr 2005 A1
20050086297 Hinks Apr 2005 A1
20050091164 Varble Apr 2005 A1
20050097017 Hanratty May 2005 A1
20050097039 Kulcsar et al. May 2005 A1
20050097320 Golan et al. May 2005 A1
20050102180 Gailey et al. May 2005 A1
20050105719 Huda May 2005 A1
20050108396 Bittner May 2005 A1
20050108631 Amorin et al. May 2005 A1
20050114335 Wesinger, Jr. et al. May 2005 A1
20050114344 Wesinger, Jr. et al. May 2005 A1
20050114345 Wesinger, Jr. et al. May 2005 A1
20050117535 Mahonen Jun 2005 A1
20050119978 Ates Jun 2005 A1
20050125291 Demkiw Grayson et al. Jun 2005 A1
20050125397 Gross et al. Jun 2005 A1
20050125686 Brandt Jun 2005 A1
20050137899 Davies et al. Jun 2005 A1
20050138391 Mandalia et al. Jun 2005 A1
20050138553 Ballard et al. Jun 2005 A1
20050138648 Ahmed et al. Jun 2005 A1
20050144133 Hoffman et al. Jun 2005 A1
20050144452 Lynch et al. Jun 2005 A1
20050154664 Guy et al. Jul 2005 A1
20050154665 Kerr Jul 2005 A1
20050154769 Eckart et al. Jul 2005 A1
20050166262 Beattie et al. Jul 2005 A1
20050171884 Arnott Aug 2005 A1
20050181765 Mark Aug 2005 A1
20050208461 Krebs et al. Sep 2005 A1
20050216434 Haveliwala et al. Sep 2005 A1
20050216582 Toomey et al. Sep 2005 A1
20050216953 Ellingson Sep 2005 A1
20050216955 Wilkins et al. Sep 2005 A1
20050226224 Lee et al. Oct 2005 A1
20050240578 Biederman et al. Oct 2005 A1
20050256809 Sadri Nov 2005 A1
20050267840 Holm-Blagg et al. Dec 2005 A1
20050273431 Abel et al. Dec 2005 A1
20050288998 Verma et al. Dec 2005 A1
20060004623 Jasti Jan 2006 A1
20060004626 Holmen et al. Jan 2006 A1
20060010072 Eisen Jan 2006 A1
20060010391 Uemura et al. Jan 2006 A1
20060010487 Fierer et al. Jan 2006 A1
20060016107 Davis Jan 2006 A1
20060032909 Seegar Feb 2006 A1
20060036543 Blagg et al. Feb 2006 A1
20060036748 Nusbaum et al. Feb 2006 A1
20060036870 Dasari et al. Feb 2006 A1
20060041464 Powers et al. Feb 2006 A1
20060041670 Musseleck et al. Feb 2006 A1
20060059110 Madhok et al. Mar 2006 A1
20060059362 Paden et al. Mar 2006 A1
20060069635 Ram et al. Mar 2006 A1
20060074986 Mallalieu et al. Apr 2006 A1
20060074991 Lussier et al. Apr 2006 A1
20060079211 Degraeve Apr 2006 A1
20060080230 Freiberg Apr 2006 A1
20060080251 Fried et al. Apr 2006 A1
20060080263 Willis et al. Apr 2006 A1
20060085361 Hoerle et al. Apr 2006 A1
20060101508 Taylor May 2006 A1
20060129419 Flaxer et al. Jun 2006 A1
20060129481 Bhatt et al. Jun 2006 A1
20060129533 Purvis Jun 2006 A1
20060131390 Kim Jun 2006 A1
20060136595 Satyavolu Jun 2006 A1
20060140460 Coutts Jun 2006 A1
20060155573 Hartunian Jul 2006 A1
20060155780 Sakairi et al. Jul 2006 A1
20060161435 Atef et al. Jul 2006 A1
20060161554 Lucovsky et al. Jul 2006 A1
20060173776 Shalley et al. Aug 2006 A1
20060173792 Glass Aug 2006 A1
20060178971 Owen et al. Aug 2006 A1
20060179050 Giang et al. Aug 2006 A1
20060184585 Grear et al. Aug 2006 A1
20060195351 Bayburtian Aug 2006 A1
20060204051 Holland, IV Sep 2006 A1
20060212407 Lyon Sep 2006 A1
20060218407 Toms Sep 2006 A1
20060229943 Mathias et al. Oct 2006 A1
20060229961 Lyftogt et al. Oct 2006 A1
20060235935 Ng Oct 2006 A1
20060239512 Petrillo Oct 2006 A1
20060253294 Martti et al. Nov 2006 A1
20060253358 Delgrosso et al. Nov 2006 A1
20060256729 Chen et al. Nov 2006 A1
20060262929 Vatanen et al. Nov 2006 A1
20060265243 Racho et al. Nov 2006 A1
20060271456 Romain et al. Nov 2006 A1
20060271457 Romain et al. Nov 2006 A1
20060271633 Adler Nov 2006 A1
20060277089 Hubbard et al. Dec 2006 A1
20060282429 Hernandez-Sherrington et al. Dec 2006 A1
20060282660 Varghese et al. Dec 2006 A1
20060282819 Graham et al. Dec 2006 A1
20060287764 Kraft Dec 2006 A1
20060287765 Kraft Dec 2006 A1
20060287766 Kraft Dec 2006 A1
20060287767 Kraft Dec 2006 A1
20060288090 Kraft Dec 2006 A1
20060294199 Bertholf Dec 2006 A1
20070005508 Chiang Jan 2007 A1
20070005984 Florencio et al. Jan 2007 A1
20070022141 Singleton et al. Jan 2007 A1
20070027816 Writer Feb 2007 A1
20070032240 Finnegan et al. Feb 2007 A1
20070038568 Greene et al. Feb 2007 A1
20070043577 Kasower Feb 2007 A1
20070047714 Baniak et al. Mar 2007 A1
20070055672 Stevens Mar 2007 A1
20070055785 Stevens Mar 2007 A1
20070060367 Heler Mar 2007 A1
20070067297 Kublickis Mar 2007 A1
20070072190 Aggarwal Mar 2007 A1
20070073889 Morris Mar 2007 A1
20070078908 Rohatgi et al. Apr 2007 A1
20070078985 Shao et al. Apr 2007 A1
20070083460 Bachenheimer Apr 2007 A1
20070083463 Kraft Apr 2007 A1
20070093234 Willis et al. Apr 2007 A1
20070094142 Russell et al. Apr 2007 A1
20070094230 Subramaniam et al. Apr 2007 A1
20070094241 M. Blackwell et al. Apr 2007 A1
20070106904 Russell et al. Apr 2007 A1
20070112667 Rucker May 2007 A1
20070112668 Celano et al. May 2007 A1
20070121843 Atazky et al. May 2007 A1
20070124256 Crooks et al. May 2007 A1
20070143825 Goffin Jun 2007 A1
20070156692 Rosewarne Jul 2007 A1
20070156758 Adiga Jul 2007 A1
20070162307 Austin et al. Jul 2007 A1
20070174186 Hokland Jul 2007 A1
20070174448 Ahuja et al. Jul 2007 A1
20070174903 Greff Jul 2007 A1
20070192121 Routson et al. Aug 2007 A1
20070192853 Shraim et al. Aug 2007 A1
20070198432 Pitroda et al. Aug 2007 A1
20070198433 McGee et al. Aug 2007 A1
20070204338 Aiello et al. Aug 2007 A1
20070205266 Carr et al. Sep 2007 A1
20070206515 Andreasen et al. Sep 2007 A1
20070220604 Long Sep 2007 A1
20070226122 Burrell et al. Sep 2007 A1
20070240206 Wu et al. Oct 2007 A1
20070244807 Andringa et al. Oct 2007 A1
20070245245 Blue et al. Oct 2007 A1
20070250441 Paulsen et al. Oct 2007 A1
20070250459 Schwarz et al. Oct 2007 A1
20070261108 Lee et al. Nov 2007 A1
20070261114 Pomerantsev Nov 2007 A1
20070266439 Kraft Nov 2007 A1
20070282743 Lovelett Dec 2007 A1
20070282959 Stern Dec 2007 A1
20070288355 Roland et al. Dec 2007 A1
20070288360 Seeklus Dec 2007 A1
20070294195 Curry et al. Dec 2007 A1
20080010203 Grant Jan 2008 A1
20080010206 Coleman Jan 2008 A1
20080010687 Gonen et al. Jan 2008 A1
20080025208 Chan Jan 2008 A1
20080028446 Burgoyne Jan 2008 A1
20080033742 Bernasconi Feb 2008 A1
20080033956 Saha et al. Feb 2008 A1
20080040610 Fergusson Feb 2008 A1
20080040717 Hobson Feb 2008 A1
20080047017 Renaud Feb 2008 A1
20080052182 Marshall Feb 2008 A1
20080052244 Tsuei et al. Feb 2008 A1
20080059364 Tidwell et al. Mar 2008 A1
20080066188 Kwak Mar 2008 A1
20080072316 Chang et al. Mar 2008 A1
20080077526 Arumugam Mar 2008 A1
20080082536 Schwabe et al. Apr 2008 A1
20080083021 Doane et al. Apr 2008 A1
20080086431 Robinson et al. Apr 2008 A1
20080091530 Egnatios et al. Apr 2008 A1
20080103800 Domenikos et al. May 2008 A1
20080103972 Lanc May 2008 A1
20080104672 Lunde et al. May 2008 A1
20080104674 Sherkin et al. May 2008 A1
20080109422 Dedhia May 2008 A1
20080109875 Kraft May 2008 A1
20080114670 Friesen May 2008 A1
20080115191 Kim et al. May 2008 A1
20080115226 Welingkar et al. May 2008 A1
20080120196 Reed et al. May 2008 A1
20080120400 Keller et al. May 2008 A1
20080120569 Mann et al. May 2008 A1
20080120617 Keller et al. May 2008 A1
20080120716 Hall et al. May 2008 A1
20080126233 Hogan May 2008 A1
20080141346 Kay et al. Jun 2008 A1
20080148368 Zurko et al. Jun 2008 A1
20080154758 Schattmaier et al. Jun 2008 A1
20080155686 McNair Jun 2008 A1
20080162317 Banaugh et al. Jul 2008 A1
20080162350 Allen-Rouman et al. Jul 2008 A1
20080162383 Kraft Jul 2008 A1
20080175360 Schwarz et al. Jul 2008 A1
20080183480 Carlson et al. Jul 2008 A1
20080183585 Vianello Jul 2008 A1
20080195548 Chu et al. Aug 2008 A1
20080201401 Pugh et al. Aug 2008 A1
20080205655 Wilkins et al. Aug 2008 A1
20080208726 Tsantes et al. Aug 2008 A1
20080208735 Balet et al. Aug 2008 A1
20080208752 Gottlieb et al. Aug 2008 A1
20080208873 Boehmer Aug 2008 A1
20080212845 Lund Sep 2008 A1
20080215427 Kawada et al. Sep 2008 A1
20080216156 Kosaka Sep 2008 A1
20080222706 Renaud et al. Sep 2008 A1
20080222722 Navratil et al. Sep 2008 A1
20080229415 Kapoor et al. Sep 2008 A1
20080249869 Angell et al. Oct 2008 A1
20080255992 Lin Oct 2008 A1
20080256613 Grover Oct 2008 A1
20080263058 Peden Oct 2008 A1
20080270295 Lent et al. Oct 2008 A1
20080270299 Peng Oct 2008 A1
20080281621 Shan et al. Nov 2008 A1
20080281737 Fajardo Nov 2008 A1
20080288283 Baldwin, Jr. et al. Nov 2008 A1
20080288299 Schultz Nov 2008 A1
20080288405 John Nov 2008 A1
20080301016 Durvasula et al. Dec 2008 A1
20080306750 Wunder et al. Dec 2008 A1
20080314977 Domenica et al. Dec 2008 A1
20080319889 Hammad Dec 2008 A1
20090006230 Lyda et al. Jan 2009 A1
20090018986 Alcorn et al. Jan 2009 A1
20090031426 Dal Lago et al. Jan 2009 A1
20090037332 Cheung et al. Feb 2009 A1
20090043691 Kasower Feb 2009 A1
20090055298 Foll Feb 2009 A1
20090055322 Bykov et al. Feb 2009 A1
20090055894 Lorsch Feb 2009 A1
20090064297 Selgas et al. Mar 2009 A1
20090089128 Tkatch et al. Apr 2009 A1
20090094237 Churi et al. Apr 2009 A1
20090094674 Schwartz et al. Apr 2009 A1
20090100047 Jones et al. Apr 2009 A1
20090106141 Becker Apr 2009 A1
20090106150 Pelegero et al. Apr 2009 A1
20090106846 Dupray et al. Apr 2009 A1
20090119299 Rhodes May 2009 A1
20090125369 Kloostra et al. May 2009 A1
20090125972 Hinton et al. May 2009 A1
20090132347 Anderson et al. May 2009 A1
20090138335 Lieberman May 2009 A1
20090138895 Dumas et al. May 2009 A1
20090144166 Dickelman Jun 2009 A1
20090150166 Leite et al. Jun 2009 A1
20090150238 Marsh et al. Jun 2009 A1
20090157564 Cross Jun 2009 A1
20090157693 Palahnuk Jun 2009 A1
20090158030 Rasti Jun 2009 A1
20090164232 Chmielewski et al. Jun 2009 A1
20090164380 Brown Jun 2009 A1
20090169019 Bauchot et al. Jul 2009 A1
20090172788 Veldula et al. Jul 2009 A1
20090172795 Ritari et al. Jul 2009 A1
20090177529 Hadi Jul 2009 A1
20090177562 Peace et al. Jul 2009 A1
20090183259 Rinek et al. Jul 2009 A1
20090199264 Lang Aug 2009 A1
20090199294 Schneider Aug 2009 A1
20090204514 Bhogal et al. Aug 2009 A1
20090204599 Morris et al. Aug 2009 A1
20090210241 Calloway Aug 2009 A1
20090210347 Sarcanin Aug 2009 A1
20090210807 Xiao et al. Aug 2009 A1
20090215431 Koraichi Aug 2009 A1
20090216640 Masi Aug 2009 A1
20090222449 Hom et al. Sep 2009 A1
20090228918 Rolff et al. Sep 2009 A1
20090234665 Conkel Sep 2009 A1
20090234775 Whitney et al. Sep 2009 A1
20090234876 Schigel et al. Sep 2009 A1
20090240624 James et al. Sep 2009 A1
20090247122 Fitzgerald et al. Oct 2009 A1
20090252134 Schlicht et al. Oct 2009 A1
20090254375 Martinez et al. Oct 2009 A1
20090254476 Sharma et al. Oct 2009 A1
20090254572 Redlich et al. Oct 2009 A1
20090254656 Vignisson et al. Oct 2009 A1
20090254971 Herz et al. Oct 2009 A1
20090260064 Mcdowell et al. Oct 2009 A1
20090271847 Karjala et al. Oct 2009 A1
20090276269 Yee et al. Nov 2009 A1
20090307778 Mardikar Dec 2009 A1
20090313134 Faith et al. Dec 2009 A1
20090313562 Appleyard et al. Dec 2009 A1
20090319638 Faith et al. Dec 2009 A1
20090327270 Teevan et al. Dec 2009 A1
20090328173 Jakobson et al. Dec 2009 A1
20100011428 Atwood et al. Jan 2010 A1
20100030578 Siddique et al. Feb 2010 A1
20100030677 Melik-Aslanian et al. Feb 2010 A1
20100042542 Rose et al. Feb 2010 A1
20100043055 Baumgart Feb 2010 A1
20100049803 Ogilvie et al. Feb 2010 A1
20100057560 Skudlark et al. Mar 2010 A1
20100058404 Rouse Mar 2010 A1
20100063942 Arnott et al. Mar 2010 A1
20100063993 Higgins et al. Mar 2010 A1
20100076836 Giordano et al. Mar 2010 A1
20100077351 Kaulgud et al. Mar 2010 A1
20100077483 Stolfo et al. Mar 2010 A1
20100083371 Bennetts et al. Apr 2010 A1
20100088233 Tattan et al. Apr 2010 A1
20100094768 Miltonberger Apr 2010 A1
20100094910 Bayliss Apr 2010 A1
20100100945 Ozzie et al. Apr 2010 A1
20100114744 Gonen May 2010 A1
20100114776 Weller et al. May 2010 A1
20100121767 Coulter et al. May 2010 A1
20100122305 Moloney May 2010 A1
20100122324 Welingkar et al. May 2010 A1
20100122333 Noe et al. May 2010 A1
20100130172 Vendrow et al. May 2010 A1
20100136956 Drachev et al. Jun 2010 A1
20100138298 Fitzherald et al. Jun 2010 A1
20100145836 Baker et al. Jun 2010 A1
20100153278 Farsedakis Jun 2010 A1
20100153290 Duggan Jun 2010 A1
20100161816 Kraft et al. Jun 2010 A1
20100169159 Rose et al. Jul 2010 A1
20100174638 Debie et al. Jul 2010 A1
20100174813 Hildreth et al. Jul 2010 A1
20100175119 Vitaletti Jul 2010 A1
20100179906 Hawkes Jul 2010 A1
20100185546 Pollard Jul 2010 A1
20100205076 Parson et al. Aug 2010 A1
20100205662 Ibrahim et al. Aug 2010 A1
20100211445 Bodington Aug 2010 A1
20100211636 Starkenburg et al. Aug 2010 A1
20100212004 Fu Aug 2010 A1
20100217837 Ansari et al. Aug 2010 A1
20100217969 Tomkow Aug 2010 A1
20100223192 Levine et al. Sep 2010 A1
20100229245 Singhal Sep 2010 A1
20100241493 Onischuk Sep 2010 A1
20100241535 Nightengale et al. Sep 2010 A1
20100250338 Banerjee et al. Sep 2010 A1
20100250410 Song et al. Sep 2010 A1
20100250411 Ogrodski Sep 2010 A1
20100250955 Trevithick et al. Sep 2010 A1
20100257102 Perlman Oct 2010 A1
20100258623 Beemer et al. Oct 2010 A1
20100262932 Pan Oct 2010 A1
20100280914 Carlson Nov 2010 A1
20100281020 Drubner Nov 2010 A1
20100287541 Saunders et al. Nov 2010 A1
20100293049 Maher et al. Nov 2010 A1
20100293050 Maher et al. Nov 2010 A1
20100293058 Maher et al. Nov 2010 A1
20100293090 Domenikos et al. Nov 2010 A1
20100299262 Handler Nov 2010 A1
20100325442 Petrone et al. Dec 2010 A1
20100325694 Bhagavatula et al. Dec 2010 A1
20100332393 Weller et al. Dec 2010 A1
20110004498 Readshaw Jan 2011 A1
20110016533 Zeigler et al. Jan 2011 A1
20110023115 Wright Jan 2011 A1
20110029388 Kendall et al. Feb 2011 A1
20110040736 Kalaboukis Feb 2011 A1
20110071950 Ivanovic Mar 2011 A1
20110082768 Eisen Apr 2011 A1
20110083181 Nazarov Apr 2011 A1
20110113084 Ramnani May 2011 A1
20110119155 Hammad et al. May 2011 A1
20110126024 Beatson et al. May 2011 A1
20110126275 Anderson et al. May 2011 A1
20110131096 Frew et al. Jun 2011 A1
20110131123 Griffin et al. Jun 2011 A1
20110137760 Rudie et al. Jun 2011 A1
20110142213 Baniak et al. Jun 2011 A1
20110145899 Cao et al. Jun 2011 A1
20110148625 Velusamy Jun 2011 A1
20110161218 Swift Jun 2011 A1
20110166988 Coulter Jul 2011 A1
20110167011 Paltenghe et al. Jul 2011 A1
20110173681 Qureshi et al. Jul 2011 A1
20110179139 Starkenburg et al. Jul 2011 A1
20110184780 Alderson et al. Jul 2011 A1
20110184838 Winters et al. Jul 2011 A1
20110188387 Das et al. Aug 2011 A1
20110196791 Dominguez Aug 2011 A1
20110208601 Ferguson et al. Aug 2011 A1
20110211445 Chen Sep 2011 A1
20110260832 Ross et al. Oct 2011 A1
20110264566 Brown Oct 2011 A1
20110270754 Kelly et al. Nov 2011 A1
20110289094 Fisher Nov 2011 A1
20110307397 Benmbarek Dec 2011 A1
20110307957 Barcelo et al. Dec 2011 A1
20120011158 Avner et al. Jan 2012 A1
20120016948 Sinha Jan 2012 A1
20120018506 Hammad et al. Jan 2012 A1
20120030216 Churi et al. Feb 2012 A1
20120030771 Pierson et al. Feb 2012 A1
20120047219 Feng et al. Feb 2012 A1
20120047423 Tomkow Feb 2012 A1
20120054592 Jaffe et al. Mar 2012 A1
20120072382 Pearson et al. Mar 2012 A1
20120079585 Chan et al. Mar 2012 A1
20120084866 Stolfo Apr 2012 A1
20120089438 Tavares et al. Apr 2012 A1
20120108274 Acebo Ruiz et al. May 2012 A1
20120110467 Blake et al. May 2012 A1
20120110677 Abendroth et al. May 2012 A1
20120117629 Miyazawa et al. May 2012 A1
20120124498 Santoro et al. May 2012 A1
20120130898 Snyder et al. May 2012 A1
20120136763 Megdal et al. May 2012 A1
20120151045 Anakata et al. Jun 2012 A1
20120173339 Flynt et al. Jul 2012 A1
20120173563 Griffin et al. Jul 2012 A1
20120191610 Prasad Jul 2012 A1
20120215682 Lent et al. Aug 2012 A1
20120215719 Verlander Aug 2012 A1
20120216125 Pierce Aug 2012 A1
20120235897 Hirota Sep 2012 A1
20120239497 Nuzzi Sep 2012 A1
20120246060 Conyack, Jr. et al. Sep 2012 A1
20120246730 Raad Sep 2012 A1
20120253852 Pourfallah et al. Oct 2012 A1
20120290660 Rao et al. Nov 2012 A1
20120297484 Srivastava Nov 2012 A1
20120323717 Kirsch Dec 2012 A1
20120331557 Washington Dec 2012 A1
20130004033 Trugenberger et al. Jan 2013 A1
20130006843 Tralvex Jan 2013 A1
20130018811 Britti et al. Jan 2013 A1
20130031109 Roulson et al. Jan 2013 A1
20130031624 Britti et al. Jan 2013 A1
20130041701 Roth Feb 2013 A1
20130066775 Milam Mar 2013 A1
20130080467 Carson et al. Mar 2013 A1
20130085804 Leff et al. Apr 2013 A1
20130085939 Colak et al. Apr 2013 A1
20130086186 Tomkow Apr 2013 A1
20130086654 Tomkow Apr 2013 A1
20130110678 Vigier et al. May 2013 A1
20130117087 Coppinger May 2013 A1
20130117387 Tomkow May 2013 A1
20130125010 Strandell May 2013 A1
20130132151 Stibel et al. May 2013 A1
20130139229 Fried et al. May 2013 A1
20130173449 Ng et al. Jul 2013 A1
20130179955 Bekker et al. Jul 2013 A1
20130198525 Spies et al. Aug 2013 A1
20130205135 Lutz Aug 2013 A1
20130212661 Neafsey et al. Aug 2013 A1
20130246150 Ovick et al. Sep 2013 A1
20130246273 Ovick et al. Sep 2013 A1
20130246528 Ogura Sep 2013 A1
20130254008 Ovick et al. Sep 2013 A1
20130254096 Serio et al. Sep 2013 A1
20130268333 Ovick et al. Oct 2013 A1
20130271272 Dhesi et al. Oct 2013 A1
20130275762 Tomkow Oct 2013 A1
20130279676 Baniak et al. Oct 2013 A1
20130282461 Ovick et al. Oct 2013 A1
20130290097 Balestrieri et al. Oct 2013 A1
20130293363 Plymouth Nov 2013 A1
20130298238 Shah et al. Nov 2013 A1
20130318569 Canning et al. Nov 2013 A1
20130332342 Kasower Dec 2013 A1
20130339217 Breslow et al. Dec 2013 A1
20130339249 Weller et al. Dec 2013 A1
20130346331 Giovannetti et al. Dec 2013 A1
20140012733 Vidal Jan 2014 A1
20140013396 Field-Eliot et al. Jan 2014 A1
20140025475 Burke Jan 2014 A1
20140032723 Nema Jan 2014 A1
20140033280 Nimashakavi et al. Jan 2014 A1
20140040051 Ovick et al. Feb 2014 A1
20140040135 Ovick et al. Feb 2014 A1
20140046872 Arnott et al. Feb 2014 A1
20140051464 Ryan et al. Feb 2014 A1
20140061302 Hammad Mar 2014 A1
20140089167 Kasower Mar 2014 A1
20140110477 Hammad Apr 2014 A1
20140162611 Mezhibovsky et al. Jun 2014 A1
20140164112 Kala Jun 2014 A1
20140164398 Smith et al. Jun 2014 A1
20140164519 Shah Jun 2014 A1
20140201100 Rellas et al. Jul 2014 A1
20140258083 Achanta et al. Sep 2014 A1
20140279467 Chapa et al. Sep 2014 A1
20140280945 Lunt Sep 2014 A1
20140283123 Lonstein et al. Sep 2014 A1
20140289812 Wang et al. Sep 2014 A1
20140298485 Gardner Oct 2014 A1
20140317023 Kim Oct 2014 A1
20140317716 Chao et al. Oct 2014 A1
20140331282 Tkachev Nov 2014 A1
20140365653 Matoba Dec 2014 A1
20140379600 Chapa et al. Dec 2014 A1
20150067341 Deen et al. Mar 2015 A1
20150089569 Sondhi et al. Mar 2015 A1
20150128237 Lund May 2015 A1
20150142595 Acuña-Rohter May 2015 A1
20150150106 Lund May 2015 A1
20150161228 Davies Jun 2015 A1
20150180870 Zhang et al. Jun 2015 A1
20150199667 Fernando et al. Jul 2015 A1
20150199668 Fernando et al. Jul 2015 A1
20150229512 Dutti et al. Aug 2015 A1
20150249655 Lunt Sep 2015 A1
20150254658 Bondesen et al. Sep 2015 A1
20150278277 Agrawal et al. Oct 2015 A1
20150350186 Chan et al. Dec 2015 A1
20160005020 Fernando et al. Jan 2016 A1
20160027008 John Jan 2016 A1
20160050198 Thibadeau, Sr. et al. Feb 2016 A1
20160065563 Broadbent et al. Mar 2016 A1
20160070758 Thomson et al. Mar 2016 A1
20160087957 Shah Mar 2016 A1
20160088465 Golla Mar 2016 A1
20160142532 Bostick May 2016 A1
20160164878 Nakano Jun 2016 A1
20160217444 Martin Jul 2016 A1
20160217445 Martin Jul 2016 A1
20160226879 Chan et al. Aug 2016 A1
20160275476 Artman et al. Sep 2016 A1
20160283740 Roundtree Sep 2016 A1
20160294612 Ravinoothala et al. Oct 2016 A1
20160337369 Sanso Nov 2016 A1
20170061436 Liu et al. Mar 2017 A1
20170111336 Davis Apr 2017 A1
20170140386 Kolkowitz et al. May 2017 A1
20170163532 Tubaltsev et al. Jun 2017 A1
20170186012 McNeal Jun 2017 A1
20170200223 Kasower Jul 2017 A1
20170324749 Bhargava et al. Nov 2017 A1
20170331832 Lander et al. Nov 2017 A1
20170337549 Wong Nov 2017 A1
20170337557 Durney et al. Nov 2017 A1
20170357971 Pitz et al. Dec 2017 A1
20180041336 Keshava et al. Feb 2018 A1
20180046856 Kapczynski Feb 2018 A1
20180077142 Thakkar Mar 2018 A1
20180083915 Medam et al. Mar 2018 A1
20180097828 Coskun Apr 2018 A1
20180145967 Matsugashita May 2018 A1
20180184288 De Lorenzo et al. Jun 2018 A1
20180227292 Golshan et al. Aug 2018 A1
20180232433 Kanvinde Aug 2018 A1
20180285549 Sonkar et al. Oct 2018 A1
20180337914 Mohamad Abdul et al. Nov 2018 A1
20180343265 McMillan et al. Nov 2018 A1
20180351852 Boucadair et al. Dec 2018 A1
20180365690 Ovick et al. Dec 2018 A1
20180375791 Kaladgi et al. Dec 2018 A1
20190073676 Wang Mar 2019 A1
20190095516 Srinivasan et al. Mar 2019 A1
20190164173 Liu et al. May 2019 A1
20190208040 Boucadair et al. Jul 2019 A1
20190228173 Gupta et al. Jul 2019 A1
20190228178 Sharma et al. Jul 2019 A1
20190259030 Burger Aug 2019 A1
20190260594 Singhal Aug 2019 A1
20190268797 Pang et al. Aug 2019 A1
20190273809 Boucadair et al. Sep 2019 A1
20190306157 Lores Oct 2019 A1
20190349360 Yeddula et al. Nov 2019 A1
20200007316 Krishnamacharya et al. Jan 2020 A1
20200104834 Pontious et al. Apr 2020 A1
20200118127 Miller et al. Apr 2020 A1
20200120004 Kohout et al. Apr 2020 A1
20200120015 Boucadair et al. Apr 2020 A1
20200137080 Bloomquist et al. Apr 2020 A1
20200145324 Wei et al. May 2020 A1
20200160472 Kapczynski May 2020 A1
20200162443 Poschel et al. May 2020 A1
20200205002 Talwar Jun 2020 A1
20200210466 Yin et al. Jul 2020 A1
20200228321 Krishnamacharya et al. Jul 2020 A1
20200293684 Harris et al. Sep 2020 A1
20200304501 Fan Sep 2020 A1
20200314088 Feijoo et al. Oct 2020 A1
20200320511 Anderson et al. Oct 2020 A1
20200334349 Billman et al. Oct 2020 A1
20200342557 Chapa et al. Oct 2020 A1
20200372535 Walz et al. Nov 2020 A1
20200380112 Allen Dec 2020 A1
20200380509 Billman et al. Dec 2020 A1
20200394331 Talwar Dec 2020 A1
20200403992 Huffman et al. Dec 2020 A1
20210012312 Bradstreet Jan 2021 A1
20210092115 Bhattacharyya Mar 2021 A1
20210117969 Chilaka et al. Apr 2021 A1
20210144131 Krishnamacharya May 2021 A1
20210203667 Bondugula et al. Jul 2021 A1
20210240808 sadhwani et al. Aug 2021 A1
20210241120 Chen et al. Aug 2021 A1
20210282018 Talwar et al. Sep 2021 A1
20210288948 Joffe et al. Sep 2021 A1
20220027853 McMillan et al. Jan 2022 A1
20220027891 Anderson et al. Jan 2022 A1
20220044343 Chapa et al. Feb 2022 A1
20220070169 Cano et al. Mar 2022 A1
20220109578 Kirsch Apr 2022 A1
20220173887 Krishnamacharya et al. Jun 2022 A1
20220182487 Sharma et al. Jun 2022 A1
20220239665 Bondugula et al. Jul 2022 A1
20220261461 Bondugula et al. Aug 2022 A1
20220279067 Sena, Jr. et al. Sep 2022 A1
20220345460 Alden et al. Oct 2022 A1
20230239295 Cano et al. Jul 2023 A1
20230254404 Sharma et al. Aug 2023 A1
20230259648 Gupta et al. Aug 2023 A1
20230376585 Allen Nov 2023 A1
Foreign Referenced Citations (77)
Number Date Country
2017397325 Aug 2018 AU
2018291152 Nov 2021 AU
3 076 931 Oct 2020 CA
3 052 415 Jul 2021 CA
2 896 503 Aug 2021 CA
104877993 Sep 2015 CN
1 028 401 Aug 2000 EP
1 239 378 Sep 2002 EP
1 301 887 Apr 2003 EP
1 850 278 Oct 2007 EP
2 425 583 Mar 2012 EP
2 074 513 Feb 2016 EP
2 939 364 Jun 2020 EP
3 577 850 Jul 2021 EP
3 862 897 Aug 2021 EP
4 060 941 Sep 2022 EP
2 811 070 Mar 2021 ES
2 518 099 Mar 2015 GB
201917040928 Nov 2019 IN
2005-135431 May 2005 JP
2005-208945 Aug 2005 JP
4202314 Dec 2008 JP
2012-113696 Jun 2012 JP
10-2000-0063313 Nov 2000 KR
10-2002-0039203 May 2002 KR
10-2007-0081504 Aug 2007 KR
I256569 Jun 2006 TW
WO 99054803 Oct 1999 WO
WO 99060481 Nov 1999 WO
WO 00030045 May 2000 WO
WO 01009752 Feb 2001 WO
WO 01009792 Feb 2001 WO
WO 01010090 Feb 2001 WO
WO 01084281 Nov 2001 WO
WO 02011025 Feb 2002 WO
WO 02029636 Apr 2002 WO
WO 03073711 Sep 2003 WO
WO 2004031986 Apr 2004 WO
WO 2004049654 Jun 2004 WO
WO 2005033979 Apr 2005 WO
WO 2006019752 Feb 2006 WO
WO 2006050278 May 2006 WO
WO 2006069199 Jun 2006 WO
WO 2006099081 Sep 2006 WO
WO 2007001394 Jan 2007 WO
WO 2007050156 May 2007 WO
WO 2008042614 Apr 2008 WO
WO 2008054849 May 2008 WO
WO 2009064694 May 2009 WO
WO 2009102391 Aug 2009 WO
WO 2009108901 Sep 2009 WO
WO 2009117468 Sep 2009 WO
WO 2010001406 Jan 2010 WO
WO 2010062537 Jun 2010 WO
WO 2010077989 Jul 2010 WO
WO 2010150251 Dec 2010 WO
WO 2011005876 Jan 2011 WO
WO 2011014878 Feb 2011 WO
WO 2012054646 Apr 2012 WO
WO 2013126281 Aug 2013 WO
WO 2013140410 Sep 2013 WO
WO 2014008079 Jan 2014 WO
WO 2014150987 Sep 2014 WO
WO 2015038520 Mar 2015 WO
WO 2018129373 Jul 2018 WO
WO 2018191638 Oct 2018 WO
WO 2018199992 Nov 2018 WO
WO 2019006144 Jan 2019 WO
WO 2019152592 Aug 2019 WO
WO 2019209857 Oct 2019 WO
WO 2019245998 Dec 2019 WO
WO 2020206305 Oct 2020 WO
WO 2021011308 Jan 2021 WO
WO 2021067446 Apr 2021 WO
WO 2021097090 May 2021 WO
WO 2021138263 Jul 2021 WO
WO 2021155053 Aug 2021 WO
Non-Patent Literature Citations (144)
Entry
U.S. Appl. No. 12/705,489, filed Feb. 12, 2010, Bargoli et al.
U.S. Appl. No. 12/705,511, filed Feb. 12, 2010, Bargoli et al.
Aad et al., “NRC Data Collection and the Privacy by Design Principles”, IEEE, Nov. 2010, pp. 5.
Actuate, “Delivering Enterprise Information for Corporate Portals”, White Paper, 2004, pp. 1-7.
“Aggregate and Analyze Social Media Content: Gain Faster and Broader Insight to Market Sentiment,” SAP Partner, Mantis Technology Group, Apr. 2011, pp. 4.
Aharony et al., “Social Area Networks: Data Networking of the People, by the People, for the People,” 2009 International Conference on Computational Science and Engineering, May 2009, pp. 1148-1155.
Aktas et al., “Personalizing PageRank Based on Domain Profiles”, WEBKDD workshop: Webmining and Web Usage Analysis, Aug. 22, 2004, pp. 83-90.
Aktas et al., “Using Hyperlink Features to Personalize Web Search”, WEBKDD workshop: Webmining and Web Usage Analysis, Aug. 2004.
“Arizona Company Has Found Key in Stopping ID Theft,” PR Newswire, New York, Aug. 10, 2005 http://proquest.umi.com/pqdweb?did=880104711&SID=1&Fmt=3&clientId=19649&RQT=309&Vname=PQD.
ABC News Now:Money Matters, as broadcasted Nov. 15, 2005 with guest Todd Davis (CEO of Lifelock), pp. 6.
Anonymous, “Credit-Report Disputes Await Electronic Resolution,” Credit Card News, Chicago, Jan. 15, 1993, vol. 5, No. 19, p. 5.
Anonymous, “MBNA Offers Resolution of Credit Card Disputes,” Hempstead, Feb. 2002, vol. 68, No. 2, p. 47.
Anonymous, “Feedback”, Credit Management, ABI/INFORM Global, Sep. 2006, pp. 6.
Bacon, Chris, “OAuth id_token missing information on refresh #1141”, <https://github.com/googleapis/google-api-dotnet-client/issues/1141>, Jan. 1, 2018, pp. 9.
Bielski, Lauren, “Will you Spend to Thwart ID Theft?” ABA Banking Journal, Apr. 2005, pp. 54, 56-57, 60.
Bluecava, “What We Do”, http://www.bluecava.com/what-we-do/, printed Nov. 5, 2012 in 3 pages.
Buxfer, http://www.buxfer.com/ printed Feb. 5, 2014 in 1 page.
Check, http://check.me/ printed Feb. 5, 2014 in 3 pages.
Cheng, Fred, “Security Attack Safe Mobile and Cloud-based One-time Password Tokens Using Rubbing Encryption Algorithm”, Monet, 2011, vol. 16, pp. 304-336.
Chores & Allowances, “Do Kids Have Credit Reports?” Oct. 15, 2007, http://choresandallowances.blogspot.com/2007/10/do-kids-have-credit-reports.html, pp. 5.
Comlounge.net, “plonesocial.auth.rpx” http://web.archive.org/web/20101026041841/http://comlounge.net/rpx as captured Oct. 26, 2010 in 9 pages.
“Consumers Gain Immediate and Full Access to Credit Score Used by Majority of U.S. Lenders”, PR Newswire, ProQuest Copy, Mar. 19, 2001, p. 1.
“CreditCheck Monitoring Services,” Dec. 11, 2000, p. 1, lines 21-23.
Cullen, Terri; “The Wall Street Journal Complete Identity Theft Guidebook: How to Protect Yourself from the Most Pervasive Crime in America”; Chapter 3, pp. 59-79; Jul. 10, 2007.
“D&B Corporate Family Linkage”, D&B Internet Access for U.S. Contract Customers, https://www.dnb.com/ecomp/help/linkage.htm as printed Dec. 17, 2009, pp. 1.
Day, Jo and Kevin; “ID-ology: A Planner's Guide to Identity Theft”; Journal of Financial Planning: Tech Talk; pp. 36-38; Sep. 2004.
Equifax, “InstaTouch ID: Separate Fact from Friction.” http://equifax.uberflip.com/i/791148-mobile-consumer-identity-service-product-sheet/1, 2016, pp. 2.
Equifax; “Equifax Credit Watch”; https://web.archive.org/web/20070627135447/https://www.econsumer.equifax.co.uk/consumer/uk/sitepage.ehtml?forward=gb_esn_detail, dated Jun. 27, 2007 on www.archive.org in 2 pages.
Ettorre, “Paul Kahn on Exceptional Marketing,” Management Review, vol. 83, No. 11, Nov. 1994, pp. 48-51.
Facebook, “Facebook helps you connect and share with the people in your life,” www.facebook.com printed Nov. 16, 2010 in 1 page.
Familysecure.com, “Frequently Asked Questions”, http://www.familysecure.com/FAQ.aspx as archived Jul. 15, 2007 in 3 pages.
FamilySecure.com; “Identity Theft Protection for the Whole Family | FamilySecure.com” http://www.familysecure.com/, as retrieved on Nov. 5, 2009.
Fenner, Peter, “Mobile Address Management and Billing for Personal Communications”, 1st International Conference on Universal Personal Communications, 1992, ICUPC '92 Proceedings, pp. 253-257.
“Fictitious Business Name Records”, Westlaw Database Directory, http://directory.westlaw.com/scope/default.asp?db=FBN-ALL&RS-W . . . &VR=2.0 as printed Dec. 17, 2009, pp. 5.
Fisher, Joseph, “Access to Fair Credit Reports: Current Practices and Proposed Legislation,” American Business Law Journal, Fall 1981, vol. 19, No. 3, p. 319.
Franks et al., “HTTP Authentication: Basic and Digest Access Authentication”, Network Working Group, Standards Track, Jun. 1999, pp. 34.
“Fraud Alert | Learn How”. Fight Identity Theft. http://www.fightidentitytheft.com/flag.html, accessed on Nov. 5, 2009.
Gibbs, Adrienne; “Protecting Your Children from Identity Theft,” Nov. 25, 2008, http://www.creditcards.com/credit-card-news/identity-ID-theft-and-kids-children-1282.php, pp. 4.
Gordon et al., “Identity Fraud: A Critical National and Global Threat,” LexisNexis, Oct. 28, 2003, pp. 1-48.
Gordon et al., “Using Identity Authentication and Eligibility Assessment to Mitigate the Risk of Improper Payments”, LexisNexis, Jan. 28, 2008, pp. 18. https://risk.lexisnexis.com/-/media/files/government/white-paper/identity_authentication-pdf.pdf.
Haglund, Christoffer, “Two-Factor Authentication with a Mobile Phone”, Fox Technologies, Uppsala, Department of Information Technology, Nov. 2, 2007, pp. 62.
Harrington et al., “iOS 4 In Action”, Chapter 17, Local and Push Notification Services, Manning Publications Co., Jun. 2011, pp. 347-353.
Herzberg, Amir, “Payments and Banking with Mobile Personal Devices,” Communications of the ACM, May 2003, vol. 46, No. 5, pp. 53-58.
Hoofnagle, Chris Jay, “Identity Theft: Making the Known Unknowns Known,” Harvard Journal of Law & Technology, Fall 2007, vol. 21, No. 1, pp. 98-122.
ID Analytics, “ID Analytics® Consumer Notification Service” printed Apr. 16, 2013 in 2 pages.
ID Theft Assist, “Do You Know Where Your Child's Credit Is?”, Nov. 26, 2007, http://www.idtheftassist.com/pages/story14, pp. 3.
“ID Thieves These Days Want Your Number, Not Your Name”, The Columbus Dispatch, Columbus, Ohio, http://www.dispatch.com/content/stories/business/2014/08/03/id-thieves-these-days-want-your-number-not-your-name.html, Aug. 3, 2014 in 2 pages.
Identity Theft Resource Center; Fact Sheet 120 A—To Order a Credit Report for a Child; Fact Sheets, Victim Resources; Apr. 30, 2007.
“Identity Thieves Beware: Lifelock Introduces Nation's First Guaranteed Proactive Solution to Identity Theft Protection,” PR Newswire, New York, Jun. 13, 2005 http://proquest.umi.com/pqdweb?did=852869731&sid=1&Fmt=3&clientId=19649&RQT=309&Vname=PQD.
Ideon, Credit-Card Registry that Bellyflopped this Year, Is Drawing some Bottom-Fishers, The Wall Street Journal, Aug. 21, 1995, pp. C2.
Information Brokers of America, “Information Brokers of America Child Identity Theft Protection” http://web.archive.org/web/20080706135451/http://iboainfo.com/child-order.html as archived Jul. 6, 2008 in 1 page.
Information Brokers of America, “Safeguard Your Child's Credit”, http://web.archive.org/web/20071215210406/http://www.iboainfo.com/child-id-protect.html as archived Dec. 15, 2007 in 1 page.
Intelius, “People Search—Updated Daily, Accurate and Fast!” http://www.intelius.com/people-search.html?=&gclid=CJqZIZP7paUCFYK5KgodbCUJJQ printed Nov. 16, 2010 in 1 page.
Iovation, Device Identification & Device Fingerprinting, http://www.iovation.com/risk-management/device-identification printed Nov. 5, 2012 in 6 pages.
Jones et al., “JSON Web Signature (JWS)”, Internet Engineering Task Force (IETF), ISSN: 2070-1721, Standards Track, May 2015, pp. 59.
Khan, Muhammad Khurram, PhD., “An Efficient and Secure Remote Mutual Authentication Scheme with Smart Cards” IEEE International Symposium on Biometrics & Security Technologies (ISBAST), Apr. 23-24, 2008, pp. 1-6.
Lanubile, et al., “Evaluating Empirical Models for the Detection of High-Risk Components: Some Lessons Learned”, 20th Annual Software Engineering Workshop, Nov. 29-30, 1995, Greenbelt, Maryland, pp. 1-6.
Lee, W.A.; “Experian, on Deal Hunt, Nets Identity Theft Insurer”, American Banker: The Financial Services Daily, Jun. 4, 2003, New York, NY, 1 page.
Lefebvre et al., “A Robust Soft Hash Algorithm for Digital Image Signature”, International Conference on Image Processing 2:11 (ICIP), vol. 3, Oct. 2003, pp. 495-498.
Leskovec, Jure, “Social Media Analytics: Tracking, Modeling and Predicting the Flow of Information through Networks”, WWW 2011—Tutorial, Mar. 28-Apr. 1, 2011, Hyderabad, India, pp. 277-278.
Letter to Donald A. Robert from Carolyn B. Maloney, dated Oct. 31, 2007, pp. 2.
Letter to Donald A. Robert from Senator Charles E. Schumer, dated Oct. 11, 2007, pp. 2.
Letter to Harry C. Gambill from Carolyn B. Maloney, dated Oct. 31, 2007, pp. 2.
Letter to Harry C. Gambill from Senator Charles E. Schumer, dated Oct. 11, 2007, pp. 2.
Letter to Richard F. Smith from Carolyn B. Maloney, dated Oct. 31, 2007, pp. 2.
Letter to Richard F. Smith from Senator Charles E. Schumer, dated Oct. 11, 2007, pp. 2.
Li et al., “Automatic Verbal Information Verification for User Authentication”, IEEE Transactions on Speech and Audio Processing, vol. 8, No. 5, Sep. 2000, pp. 585-596.
LifeLock, “How LifeLock Works,” http://www.lifelock.com/lifelock-for-people printed Mar. 14, 2008 in 1 page.
LifeLock, “LifeLock Launches First ID Theft Prevention Program for the Protection of Children,” Press Release, Oct. 14, 2005, http://www.lifelock.com/about-us/press-room/2005-press-releases/lifelock-protection-for-children.
LifeLock; “How Can LifeLock Protect My Kids and Family?” http://www.lifelock.com/lifelock-for-people/how-we-do-it/how-can-lifelock-protect-my-kids-and-family printed Mar. 14, 2008 in 1 page.
LifeLock, “Personal Identity Theft Protection & Identity Theft Products,” http://www.lifelock.com/lifelock-for-people, accessed Nov. 5, 2007.
LifeLock, Various Pages, www.lifelock.com/, Jan. 9, 2007, pp. 49.
Lobo, Jude, “MySAP.com Enterprise Portal Cookbook,” SAP Technical Delivery, Feb. 2002, vol. 1, pp. 1-13.
Lodderstedt et al., “OAuth 2.0 token Revocation”, Internet Engineering Task Force (IETF), Standards Track, Aug. 2013, pp. 11.
Magid, Lawrence, J., Business Tools: When Selecting an ASP Ensure Data Mobility, Los Angeles Times, Los Angeles, CA, Feb. 26, 2001, vol. C, Issue 4, pp. 3.
Manilla, http://www.manilla.com/how-it-works/ printed Feb. 5, 2014 in 1 page.
Meyers et al., “Using Your Social Networking Accounts To Log Into NPR.org,” NPR.org, Jun. 24, 2010, http://web.archive.org/web/20100627034054/http://www.npr.org/blogs/inside/2010/06/24/128079309/using-your-social-networking-accounts-to-log-into-npr-org in 3 pages.
Micarelli et al., “Personalized Search on the World Wide Web,” The Adaptive Web, LNCS 4321, 2007, pp. 195-230.
Microsoft, “Expand the Reach of Your Business,” Microsoft Business Solutions, 2004, in 16 pages.
Mint.com, http://www.mint.com/how-it-works/ printed Feb. 5, 2013 in 2 pages.
Mvelopes, http://www.mvelopes.com/ printed Feb. 5, 2014 in 2 pages.
My Call Credit http://www.mycallcredit.com/products.asp?product=ALR dated Dec. 10, 2005 on www.archive.org.
My Call Credit http://www.mycallcredit.com/rewrite.asp?display=faq dated Dec. 10, 2005 on www.archive.org.
My ID Alerts, “Why ID Alerts” http://www.myidalerts.com/why-id-alerts.jsps printed Apr. 3, 2012 in 2 pages.
My ID Alerts, “How it Works” http://www.myidalerts.com/how-it-works.jsps printed Apr. 3, 2012 in 3 pages.
“Name Availability Records”, Westlaw Database Directory, http://directory.westlaw.com/scope/default.asp?db=NA-ALL&RS=W . . . &VR=2.0 as printed Dec. 17, 2009, pp. 5.
National Alert Registry Launches RegisteredOffendersList.org to Provide Information on Registered Sex Offenders, May 16, 2005, pp. 2, http://www.prweb.com/printer/240437.htm accessed on Oct. 18, 2011.
National Alert Registry Offers Free Child Safety “Safe From Harm” DVD and Child Identification Kit, Oct. 24, 2006. pp. 2, http://www.prleap.com/pr/53170 accessed on Oct. 18, 2011.
National Alert Registry website titled, “Does a sexual offender live in your neighborhood”, Oct. 22, 2006, pp. 2, http://web.archive.org/wb/20061022204835/http://www.nationallertregistry.com/ accessed on Oct. 13, 2011.
Next Card: About Us, http://web.cba.neu.edu/˜awatson/NextCardCase/NextCardAboutUs.htm printed Oct. 23, 2009 in 10 pages.
Ogg, Erica, “Apple Cracks Down on UDID Use”, http://gigaom.com/apple/apple-cracks-down-on-udid-use/ printed Nov. 5, 2012 in 5 Pages.
Pagano, et al., “Information Sharing in Credit Markets,” Dec. 1993, The Journal of Finance, vol. 48, No. 5, pp. 1693-1718.
Partnoy, Frank, Rethinking Regulation of Credit Rating Agencies: An Institutional Investor Perspective, Council of Institutional Investors, Apr. 2009, pp. 21.
Paustian, Chuck, “Every Cardholder a King Customers get the Full Treatment at Issuers' Web Sites,” Card Marketing, New York, Mar. 2001, vol. 5, No. 3, pp. 4.
People Finders, http://www.peoplefinders.com/?CMP=Google&utm_source=google&utm_medium=cpc printed Nov. 16, 2010 in 1 page.
People Lookup, “Your Source for Locating Anyone!” www.peoplelookup.com/people-search.html printed Nov. 16, 2010 in 1 page.
People Search, “The Leading Premium People Search Site on the Web,” http://www.peoplesearch.com printed Nov. 16, 2010 in 2 pages.
PersonalCapital.com, http://www.personalcapital.com/how-it-works printed Feb. 5, 2014 in 5 pages.
Phinisee, Tamarind, “Banks, FTC Step Up Efforts to Address Identity Theft”, San Antonio Business Journal; San Antonio, Jul. 5, 2002, vol. 16, No. 24, pp. 5.
Press Release—“Helping Families Protect Against Identity Theft—Experian Announces FamilySecure.com; Parents and guardians are alerted for signs of potential identity theft for them and their children; product features an industry-leading $2 million guarantee”; PR Newswire; Irvine, CA; Oct. 1, 2007.
Privacy Rights Clearinghouse, “Identity Theft: What to do if it Happens to You,” http://web.archive.org/web/19990218180542/http://privacyrights.org/fs/fs17a.htm printed Feb. 18, 1999.
Ramaswamy, Vinita M., Identity-Theft Toolkit, The CPA Journal, Oct. 1, 2006, vol. 76, Issue 10, pp. 66-70.
Rawe, Julie; “Identity Thieves”, Time Bonus Section, Inside Business, Feb. 2002, pp. 2.
Roth, Andrew, “CheckFree to Introduce E-Mail Billing Serving,” American Banker, New York, Mar. 13, 2001, vol. 166, No. 49, pp. 3.
Sakimura et al., “OpenID Connect Core 1.0 Incorporating Errata Set 1”, <https://openid.net/specs/openid-connect-core-1_0.html>, Nov. 8, 2014, pp. 78.
SAS, “SAS® Information Delivery Portal”, Fact Sheet, 2008, in 4 pages.
Scholastic Inc.:Parent's Request for Information http://web.archive.org/web/20070210091055/http://www.scholastic.com/inforequest/index.htm as archived Feb. 10, 2007 in 1 page.
Scholastic Inc.:Privacy Policy http://web.archive.org/web/20070127214753/http://www.scholastic.com/privacy.htm as archived Jan. 27, 2007 in 3 pages.
Securities and Futures Commission, “Guideline on Anti-Money Laundering and Counter-Terrorist Financing”, Jul. 2012, pp. 135.
Singletary, Michelle, “The Littlest Victims of ID Theft”, The Washington Post, The Color of Money, Oct. 4, 2007.
Sun, Hung-Min, “An Efficient Remote Use Authentication Scheme Using Smart Cards”, IEEE Transactions on Consumer Electronics, Nov. 2000, vol. 46, No. 4, pp. 958-961.
Target, “Free Credit Monitoring and Identity Theft Protection with Experian's ProtectMyID Now Available”, Jan. 13, 2014, pp. 2. http://corporate.target.com.
TheMorningCall.Com, “Cheap Ways to Foil Identity Theft,” www.mcall.com/business/columnists/all-karp.5920748jul01,0 . . . , published Jul. 1, 2007.
“TransUnion—Child Identity Theft Inquiry”, TransUnion, http://www.transunion.com/corporate/personal/fraudIdentityTheft/fraudPrevention/childIDInquiry.page as printed Nov. 5, 2009 in 4 pages.
Truston, “Checking if your Child is an ID Theft Victim can be Stressful,” as posted by Michelle Pastor on Jan. 22, 2007 at http://www.mytruston.com/blog/credit/checking_if_your_child_is_an_id_theft_vi.html.
US Legal, Description, http://www.uslegalforms.com/us/US-00708-LTR.htm printed Sep. 4, 2007 in 2 pages.
Vamosi, Robert, “How to Handle ID Fraud's Youngest Victims,” Nov. 21, 2008, http://news.cnet.com/8301-10789_3-10105303-57.html.
Waggoner, Darren J., “Having a Global Identity Crisis,” Collections & Credit Risk, Aug. 2001, vol. vol. 6, No. 8, pp. 6.
Wang et al., “User Identification Based on Finger-vein Patterns for Consumer Electronics Devices”, IEEE Transactions on Consumer Electronics, May 2010, vol. 56, No. 2, pp. 799-804.
Weaver et al., “Federated, Secure Trust Networks for Distributed Healthcare IT Services”, IEEE International Conference on Industrial Informatics, 2003. INDIN 2003. Proceedings, 2003, pp. 162-169.
WhatIs.com, “Risk-Based Authentication (RBA)”, https://web.archive.org/web/20121025033106/http://whatis.techtarget.com/definition/risk-based-authentication-RBA, Oct. 23, 2012, pp. 1.
Willems et al., “On the Security and Privacy of Interac e-Transfers”, School of Electrical Engineering and Computer Science, Faculty of Engineering, University of Ottawa, Extended Version, Dec. 10, 2019, pp. 47.
Yahoo! Search, “People Search,” http://people.yahoo/com printed Nov. 16, 2010 in 1 page.
Yodlee | Money Center, https://yodleemoneycenter.com/ printed Feb. 5, 2014 in 2 pages.
You Need A Budget, http://www.youneedabudget.com/features printed Feb. 5, 2014 in 3 pages.
Official Communication in Australian Patent Application No. 2014318966, dated Apr. 6, 2019.
Official Communication in Australian Patent Application No. 2019261724, dated Sep. 1, 2020.
Official Communication in Canadian Patent Application No. 2,923,697, dated Oct. 9, 2019.
Extended European Search Report for Application No. EP14843372.5, dated May 2, 2017.
Official Communication in European Application No. EP14843372.5 dated Nov. 29, 2018.
Extended European Search Report for Application No. EP19203040.1, dated Jan. 29, 2020.
Extended European Search Report for Application No. EP21183630.9, dated Oct. 15, 2021.
International Search Report and Written Opinion for Application No. PCT/US2014/054713, dated Dec. 15, 2014.
International Preliminary Report on Patentability in Application No. PCT/US2014/054713, dated Mar. 24, 2016.
Official Communication in Australian Patent Application No. 2006306790, dated Apr. 29, 2010.
Official Communication in Australian Patent Application No. 2006306790, dated May 19, 2011.
International Search Report and Written Opinion for Application No. PCT/US2006/028006, dated Jul. 27, 2007.
International Preliminary Report on Patentability in Application No. PCT/US2006/028006, dated Apr. 23, 2008.
International Search Report and Written Opinion for Application No. PCT/US2019/037547, dated Oct. 4, 2019.
International Preliminary Report on Patentability in Application No. PCT/US2019/037547, dated Dec. 30, 2020.
International Search Report and Written Opinion for Application No. PCT/US2021/015566, dated May 11, 2021.
International Preliminary Report on Patentability in Application No. PCT/US2021/015566, dated Aug. 11, 2022.
Dekleva, Sasha, “Electronic Commerce: A Half-Empty Glass?” Communications of the Association for Information Systems, Jun. 2000, vol. 3, Article 18, pp. 101.
Official Communication in Australian Patent Application No. 2021204354, dated Jun. 29, 2022.
Related Publications (1)
Number Date Country
20230421376 A1 Dec 2023 US
Provisional Applications (1)
Number Date Country
62688887 Jun 2018 US
Continuations (2)
Number Date Country
Parent 17123568 Dec 2020 US
Child 18153587 US
Parent 16051339 Jul 2018 US
Child 17123568 US