Patent Grant
11995649
There are instances in which a user may want to mask his or her credentials when performing a transaction. For example, a consumer may want to protect his or her sensitive account information as much as practically possible to deter fraud, which can cause significant losses in time and money for consumers, merchants, and banks. Unauthorized individuals may commit fraud by obtaining credentials without the credential holder's permission, and conducting transactions or withdrawals using those credentials. Thus, secure methods and systems for masking credentials for transactions in a safe and efficient manner are needed.
Token systems can be used to protect credentials by not exposing the credentials when transactions are conducted. In such systems, a token can be used instead of a real credential to conduct a transaction. If the token is obtained by an unauthorized person, the credential is not obtained thereby protecting the underlying account associated with the credential. In such token systems, a token validation cryptogram can be used with the token, and may provide proof that the token is to be used in a particular way (e.g., only for e-commerce transactions). The token validation cryptogram can be validated by a remote server thereby authorizing the use of the token for a given transaction.
While such token systems are effective, there are some situations in which the token and the token validation cryptogram cannot be used. For example, a token might be 19 digits long and a token validation cryptogram may be 5-10 digits long. In the case of a one-dimensional bar code, for example, it is not possible to include all of the information needed for a token transaction in the one-dimensional bar code.
In addition, only a limited number of tokens may be available, making it impossible for a single credential to have multiple associated tokens, especially if each can only be used a limited amount of times for purposes of ensuring security. For example, a token often must have a header that corresponds to the underlying credential (e.g., a multi-digit BIN number identifying the issuing bank), as well as a valid check digit to ensure the token can be processed correctly by existing credential processing systems. Thus, only a limited number of digits (as well as combinations of numbers) are available in the remaining space to be used by both tokens and credentials.
Embodiments of the invention address this and other problems, individually and collectively.
According to some embodiments of the invention, a first token (e.g., a subtoken) is received by a first server computer. The first token includes a first header and an obfuscated portion. The first header routes the first token to the first server computer. The first server computer uses the obfuscated portion of the first token to produce a second token (e.g., a primary token) and data associated with the second token. The second token includes a second header and a middle portion. The second header is associated with an authorizing entity.
According to one embodiment of the invention, the first server then retrieves a credential associated with the second token. The credential includes the second header and a center portion. The center portion of the credential is different than the middle portion of the second token. The credential is subsequently used to authorize a transaction.
According to another embodiment of the invention, the first server instead sends the second token to a second server computer. The second server computer retrieves the credential associated with the second token. The credential includes the second header and the center portion. The center portion of the credential is different than the middle portion of the second token. The credential is subsequently used to authorize the transaction.
According to some embodiments of the invention, a server computer receives a request for a first token from a communication device. The request includes a second token and data associated with the second token. The second token includes a second header and a middle portion. The second header is associated with an authorizing entity. The server computer generates an obfuscated portion using the second token and the data associated with the second token. The server computer generates the first token includes a first header and the obfuscated portion. The first header is associated with the server computer. The server computer sends the first token to the mobile device.
Embodiments of the invention are further directed to a server computer comprising a processor and a memory element. The memory element can comprise code, executable by the processor, for implementing the above described methods.
These and other embodiments of the invention are described in further detail below.
According to one embodiment of the invention, a subtoken corresponding to a primary token is generated. The primary token corresponds to a credential. The credential may be, for example, a primary account number (PAN) corresponding to a payment account. The subtoken may be a temporary, one-time use subtoken based on a primary token associated with the credential that allows a user to conduct a transaction from his or her account, while still providing security for the user's sensitive data. The subtoken may contain a header and an obfuscated portion. The header of the subtoken routes the subtoken to the entity issuing the subtoken for translation into the primary token. The obfuscated portion acts as a pointer to the primary token and data associated with the primary token. A same check digit may be included in the subtoken, the primary token, and the credential, in order to ensure that the transaction is not improperly denied.
Before discussing specific embodiments and examples, some descriptions of terms used herein are provided below.
An “application provider” may be an entity that can provide a service or application. An example of an application provider is a digital wallet provider.
An “authorization request message” may be a message to request authorization for a transaction. An authorization request message according to some embodiments may comply with (International Organization of Standardization) ISO 8583, which is a standard for systems that exchange electronic transaction information associated with a payment made by a consumer using a payment device or payment account. The authorization request message may include an issuer account identifier that may be associated with a payment device or payment account. An authorization request message may also comprise additional data elements corresponding to “identification information” including, by way of example only: a service code, a CVV (card verification value), a dCVV (dynamic card verification value), an expiration date, a PIN number, etc. An authorization request message may also comprise “transaction information,” such as any information associated with a current transaction, such as the transaction amount, merchant identifier, merchant location, etc., as well as any other information that may be utilized in determining whether to identify and/or authorize a transaction.
An “authorization response message” may be a message reply to an authorization request message. The authorization response message may include, by way of example only, one or more of the following status indicators: Approval—transaction was approved; Decline—transaction was not approved; or Call Center—response pending more information, merchant must call the toll-free authorization phone number. The authorization response message may also include an authorization code, which may be a code that a credit card issuing bank returns in response to an authorization request message in an electronic message (either directly or through the payment processing network) to the merchant's access device (e.g. POS equipment) that indicates approval of the transaction. The code may serve as proof of authorization. As noted above, in some embodiments, a payment processing network may generate or forward the authorization response message to the merchant.
An “authorizing entity” may be an entity that authorizes a request. Examples of an authorizing entity may be an issuer, a governmental agency, a document repository, an access administrator, etc.
A “bar code” may be an optical machine readable representation of data. Bar codes may represent data by varying widths and spacing of parallel lines, and may be linear or one-dimensional. Bar codes may be scanned by optical scanners called bar code readers. In one embodiment, bar code readers may be comprised in communication devices (e.g., smart phones).
A “check digit” may be a digit used for error detection in identification numbers (e.g., credentials, tokens, etc.). The check digit can consist of a single digit or more than one digit, and may be computed using an algorithm applied to the other digits in the identification number. A check digit may be present anywhere within an identification number. In one embodiment, the check digit is the last digit in an identification number.
A “communication device” may comprise any suitable electronic device that may be operated by a user, which may also provide remote communication capabilities to a network. Examples of remote communication capabilities include using a mobile phone (wireless) network, wireless data network (e.g., 3G, 4G or similar networks), Wi-Fi, Wi-Max, or any other communication medium that may provide access to a network such as the Internet or a private network. Examples of communication devices include mobile phones (e.g., cellular phones), PDAs, tablet computers, net books, laptop computers, personal music players, handheld specialized readers, watches, fitness bands, ankle bracelets, rings, earrings, etc., as well as automobiles with remote communication capabilities. A communication device may comprise any suitable hardware and software for performing such functions, and may also include multiple devices or components (e.g., when a device has remote access to a network by tethering to another device—i.e., using the other device as a modem—both devices taken together may be considered a single communication device).
A “credential” may comprise any evidence of authority, rights, or entitlement to privileges. For example, access credentials may comprise permissions to access certain tangible or intangible assets, such as a building or a file. In another example, payment credentials may include any suitable information associated with and/or identifying an account (e.g., a payment account and/or a payment device associated with the account). Such information may be directly related to the account or may be derived from information related to the account. Examples of account information may include an “account identifier” such as a PAN (primary account number or “account number”), a token, a subtoken, a gift card number or code, a prepaid card number or code, a user name, an expiration date, a CVV (card verification value), a dCW (dynamic card verification value), a CVV2 (card verification value 2), a CVC3 card verification value, etc. An example of a PAN is a 16-digit number, such as “4147 0900 0000 1234”. In some embodiments, credentials may be considered sensitive information.
A “digital wallet” can include an electronic application or device that allows an individual to conduct electronic commerce transactions. A digital wallet may store user profile information, payment credentials, bank account information, one or more digital wallet identifiers, and/or the like, and can be used in a variety of transactions, such as but not limited to eCommerce, social networks, money transfer/personal payments, mobile commerce, proximity payments, gaming, and/or the like for retail purchases, digital goods purchases, utility payments, purchasing games or gaming credits from gaming websites or systems, transferring funds between users, and/or the like. A digital wallet may be designed to streamline the purchase and payment process. A digital wallet may allow the user to load one or more payment cards onto the digital wallet so as to make a payment without having to enter an account number or present a physical card. A digital wallet may also store transaction records (e.g., electronic receipts).
A “header” may be the beginning portion or first portion of an identification number (e.g., a credential, a token, etc.). A header may comprise any number of letters, numbers, and/or symbols. For example, a header of a payment credential may be up to the first 9 digits of the account number. A header of a payment credential may be used to route an authorization request message to a particular entity (e.g., a transaction processing computer, an authorizing entity computer, etc.).
An “issuer” may typically refer to a business entity (e.g., a bank) that maintains an account for a user. An issuer may also issue payment credentials stored on communications devices.
A “primary token” may include a token that is a substitute identifier for a credential or account identifier. In other words, a primary token may have a direct correlation or association with a credential, such as a PAN, and may be considered a high value token.
“Provisioning” may include a process of providing data for use. For example, provisioning may include providing, delivering, or enabling a token on a communication device. Provisioning may be completed by any entity within or external to the transaction system. For example, in some embodiments, tokens may be provisioned by an issuer or a transaction processing network onto a mobile device. The provisioned tokens may have corresponding token data stored and maintained in a token vault or token registry. In some embodiments, a token vault or token registry may generate a token that may then be provisioned or delivered to a device. In some embodiments, an issuer may specify a token range from which token generation and provisioning can occur. Further, in some embodiments, an issuer may generate and notify a token vault of a token value and provide the token record information (e.g., token attributes) for storage in the token vault.
A “resource provider” may be an entity that can provide a resource such as goods, services, information, and/or access. Examples of a resource provider include merchants, access devices, secure data access points, etc. A “merchant” may typically be an entity that engages in transactions and can sell goods or services, or provide access to goods or services.
A “server computer” may include a powerful computer or cluster of computers. For example, a server computer can be a large mainframe, a minicomputer cluster, or a group of servers functioning as a unit. In one example, the server computer may be a database server coupled to a Web server. The server computer may comprise one or more computational apparatuses and may use any of a variety of computing structures, arrangements, and compilations for servicing the requests from one or more client computers.
A “subtoken” may include a token that is a substitute identifier for a primary token or another subtoken. It may have the same or different form as the token or subtoken from which it originates. A subtoken, for example, may be the same number of digits as the token with which it is associated, and also like the real account number associated with the token. The subtoken may be linked to a credential via at least a primary token. Because the subtoken may not be directly linked to the credential, it may be considered a low value token.
A “token” may include a substitute identifier for some information. For example, an access token may be a substitute or subordinate identifier for an access credential. In another example, a payment token may include an identifier for a payment account that is a substitute for an account identifier, such as a primary account number (PAN). For instance, a token may include a series of alphanumeric characters that may be used as a substitute for an original account identifier. For example, a token “4900 0000 0000 0001” may be used in place of a PAN “4147 0900 0000 1234.” In some embodiments, a token may be “format preserving” and may have a numeric format that conforms to the account identifiers used in existing payment processing networks (e.g., ISO 8583 financial transaction message format). In some embodiments, a token may be used in place of a PAN to initiate, authorize, settle or resolve a payment transaction. The token may also be used to represent the original credential in other systems where the original credential would typically be provided. In some embodiments, a token value may be generated such that the recovery of the original PAN or other account identifier from the token value may not be computationally derived. Further, in some embodiments, the token format may be configured to allow the entity receiving the token to identify it as a token and recognize the entity that issued the token. A token may include a primary token or a subtoken.
A “token validation cryptogram” may be a cryptogram that can be used to verify the use of a token. In some cases, the token validation cryptogram can be generated by an encryption key such as a limited use key. In some embodiments, the token validation cryptogram may be generated based upon data surrounding the transaction including the time of the transaction, the tokens used to conduct the transaction, and/or the mode of presentment. In some cases, the token validation cryptogram may be dependent on the transaction initiation method and type of application used to initiate the transaction. The token validation cryptogram may be used to ensure a token is being used in the designated transaction channel. For example, a token that is limited to NFC transactions only may be associated with a NFC token validation cryptogram algorithm and if the received token validation cryptogram is not validated with the NFC transaction application, the transaction may be declined. Accordingly, the token validation cryptogram allows for further transaction validation and control and provides for a number of security benefits.
I. Systems
For simplicity of illustration, a certain number of components are shown in
A user may operate communication device 110 to request a subtoken based on a primary token associated with a credential. Once generated, the subtoken may be used by the user of communication device 110 as a substitute for the primary token in conducting transactions.
Communication device 110 may be any device suitable to carry out a financial transaction or any other additional related actions. Communication device 110 may include a memory that may store a mobile wallet application or payment application. The application may be provisioned with account information to enable each mobile device to conduct transactions. Communication device 110 may also include a secure element that can be implemented in either hardware and/or software, which may store sensitive account or personal information. Communication device 110 may communicate over a communication network with one or more entities, including application provider computer 120 and resource provider computer 130.
The application provider computer 120 may be operated by or associated with an application provider. The application provider may be an entity that provides an application to a mobile device for use by a user. In some embodiments, the application provider can be a digital wallet provider that provides a digital wallet or payment application to a mobile device. The application provider computer 120 may maintain one or more digital wallets for each user, and each digital wallet may be associated with payment data for one or more payment accounts. Examples of digital wallets may include Visa Checkout™ or Google™ Wallet, etc.
The application provider computer 120 may comprise a server computer to facilitate the provisioning process. The server computer may include a processor and a computer readable medium coupled to the processor, the computer readable medium comprising code, executable by the processor. The server computer may send and receive over-the-air (OTA) messages to a digital wallet application stored on the communication device 110.
The resource provider computer 130 may be configured to receive transaction data from an access device. Resource provider computer 130 may enable a resource provider such as a merchant to engage in transactions, sell goods or services, or provide access to goods or services to the consumer. The resource provider computer 130 may accept multiple forms of payment and may use multiple tools to conduct different types of transactions. For example, the resource provider computer 130 may communicate with, include, or be an access device at a physical store operated by the merchant for in-person transactions. The resource provider computer 130 may also enable the merchant to sell goods and/or services via a website, and may accept payments over the Internet.
The transport computer 140 is typically a system for an entity (e.g., a bank) that has a business relationship with a particular resource provider (e.g., merchant) or other entity. The transport computer 140 may route the authorization request for a transaction to the authorizing entity computer 160 via transaction processing computer 150. The transport computer 140 may comprise a server computer. The server computer may include a processor and a computer readable medium coupled to the processor, the computer readable medium comprising code, executable by the processor.
The transaction processing computer 150 may be associated with one or more payment service providers. The transaction processing computer 150 may include any entity that provides provisioning or personalization services. For example, the transaction processing computer 150 may maintain a personalization database with user information, and the transaction processing computer 150 may be configured to communicate with one or more authorizing entity computers 160 to determine personalized payment data for users. The transaction processing computer 150, via a provisioning service module, may provide provisioning services to the application provider computer 120, in which the application provider computer 120 may utilize an application programming interface (API) to communicate with the transaction processing computer 150.
The transaction processing computer 150 may comprise a server computer. The server computer may include a processor and a computer readable medium coupled to the processor, the computer readable medium comprising code, executable by the processor.
The authorizing entity computer 160 is typically run by a business entity (e.g., a bank) that may have issued a payment (credit/debit) card, account numbers or payment tokens used for the transactions. Some systems can perform both authorizing entity computer 160 and transport computer 140 functions. When a transaction involves a payment account associated with the authorizing entity computer 160, the authorizing entity computer 160 may verify the account and respond with an authorization response message to the transport computer 140 that may be forwarded to the corresponding access device and the consumer device if applicable.
The authorizing entity computer 160 may comprise a server computer. The server computer may include a processor and a computer readable medium coupled to the processor, the computer readable medium comprising code, executable by the processor. In some embodiments, the authorizing entity computer 160 may communicate with the transaction processing computer 150 to conduct transactions.
At a later time (e.g., at the end of the day), a clearing and settlement process can occur between the transport computer 140, the transaction processing computer 150, and the authorizing entity computer 160.
Contactless interface 208 may include one or more specialized RF transceivers (e.g., near field communication (NFC) transceivers) to interact with a contactless reader of an access device to conduct a transaction (e.g., payment transaction, access transaction, information exchange, etc.). In secure element based implementations, only a secure element (not shown) may have access to contactless interface 208. In some embodiments, contactless interface 208 can be accessed by the mobile OS 220 using specialized card emulation APIs 222 without requiring the use of a secure element. In some embodiments, display 207 can also be part of contactless interface 208, and is used, for example, to perform transactions using bar codes, QR codes, etc.
Memory 202 can be implemented using any combination of any number of non-volatile memories (e.g., flash memory) and volatile memories (e.g., DRAM, SRAM), or any other non-transitory storage medium, or a combination thereof media. Memory 202 may store an operating system (OS) 220 and an application environment 210 where one or more applications reside including application 212 to be executed by processor 205. In some embodiments, OS 220 may implement a set of card emulation APIs 222 that can be invoked by application 212 to access contactless interface 208 to interact with an access device.
Application 212 can include an application that uses, accesses, and/or stores sensitive information or tokens. For example, application 212 can include a digital wallet or payment application that uses tokens and/or payment credentials to conduct transactions via communication device 200. In some embodiments, access to application 212 by a user can be protected by user authentication data such as a password, passcode, PIN, etc. For example, when a user attempts to launch or execute application 212, the user may be requested to enter valid user authentication data before the user can access application 212. Application 212 may include a download manager 218, a cryptography module 214, a token data store 216, and a bar code generation module 217. In some embodiments, one or more of these components can be provided by another application or component that is not part of application 212.
Download manager 218 can be programmed to provide functionalities to communicate with an application provider associated with application 212 to download information via the application provider. Download manager 218 working in conjunction with the processor 205 may request or otherwise manage the acquisition and/or storage of credentials and/or tokens. For example, download manager 218 working in conjunction with the processor 205 may request and obtain credentials and/or tokens via the application provider associated with application 212, and store the credentials and/or tokens in token data store 216. In some embodiments, the credentials and/or tokens provided by the application provider can be received in an encrypted form. For example, the credentials and/or tokens can be encrypted with a session key generated by a server computer. Download manager 218 working in conjunction with the processor 205 may also receive, from the application provider, the session key in an encrypted form, and store the encrypted session key in token data store 216.
Cryptography module 214 working in conjunction with the processor 205 may provide cryptographic functionalities for application 212. For example, cryptography module 214 may implement and perform encryption/decryption operations for application 212 using encryption algorithms such as DES, AES, TDES, or the like, and/or hash functions such as SHA, or the like. For example, when application 212 accesses token data store 216 to retrieve and use the credentials and/or stored therein (e.g., to conduct a transaction), application 212 may invoke cryptography module 214 to decrypt the session key that is used to encrypt the stored credentials and/or tokens, and then decrypt the underlying information using the decrypted session key. The decrypted credentials and/or tokens can then be used by application 212.
Bar code generation module 217 working in conjunction with the processor 205 may generate bar codes of credentials or tokens to be displayed on display 207 of communication device 200. The bar code may be scanned by an access device at a resource provider to conduct a transaction using the credential or token, as described further herein.
Processor 301 may include one or more microprocessors to execute program components for performing the token request functions 330 of application provider computer 300. Network interface 302 can be configured to connect to one or more communication networks to allow application provider computer 300 to communicate with other entities such as a communication device operated by a user, a transaction processing computer, etc. Computer readable medium 306 may include the same or different components as memory 202 of
Registration module 310 may work in conjunction with the processor 301 to register users with application provider computer 300. For example, a user can be registered with the application provider by providing registration module 310 with user identifying information to identify the user, device information such as a device identifier associated with the user's communication device on which an application associated with the application provider is installed, account or token information such as an account identifier associated with the user's account, etc. In some embodiments, a user may set up user authentication data (e.g., password, passcode, PIN, etc.) using the registration module 310 and the processor 301. The user authentication data can be used by application provider computer 300 to authenticate the user when the application on the user's communication device communicates with application provider computer 300. Registration module 310 may work in conjunction with the processor 301 to also allow a user to change or update the user authentication data. The registration information can be stored in a database 303. In some embodiments, the registration process can be carried out when the user first downloads the application for installation on the user's communication device, or when the user first launches and executes the application.
Token request module 308 is programmed to process requests for tokens received from the application installed on a user's communication device. In some embodiments, upon receiving a request from the application on the user's communication device, token request module 308 in conjunction with the processor 301 may authenticate the user and/or the communication device by verifying the user authentication data and device identifier of the communication device against the previously registered information stored in database 303. Token request module 308 working in conjunction with the processor 301 may then request the token from a server computer (e.g., a token server or a transaction processing computer) for use on the communication device. When token request module 308 receives the token from the server computer, token request module 308 working in conjunction with the processor 301 may send the token to the application executing on the communication device. In some embodiments, token request module 308 working in conjunction with the processor 301 may also track which token is provided to a particular communication device by storing this information in database 303. Thus, database 303 may include a mapping between a communication device and the token provisioned to that communication device.
Cryptography engine 322 (which may work with a separate data processor in the HSM 320) may provide cryptographic functionalities for application provider computer 300. In some embodiments, cryptography engine 322 can be implemented in HSM 320, which is a specialized hardware component used to perform cryptographic operations and manage cryptographic keys. Cryptography engine 322 may be programmed to implement and perform encryption/decryption operations for application provider computer 300 using encryption algorithms such as such as AES, DES, TDES, or other suitable encryption algorithms using cryptographic keys of any length (e.g., 56-bit, 128-bit, 169-bit, 192-bit, 256-bit, etc.). In some embodiments, cryptography engine 322 can also be programmed to perform hash calculations using hash functions such as secure hash algorithm (SHA), or the like. For example, when application provider computer 300 receives a session key used for encrypting credentials from a server computer, application provider computer 300 may invoke cryptography engine 322 to encrypt the session key, such that session key can be provided to the application on the communication device in an encrypted form. In some embodiments, the session key can be encrypted using a hash value that is computed over the user authentication data associated with the user requesting the credential.
Processor 401 may include one or more microprocessors to execute program components for performing the token management functions 430 of transaction processing computer 400. Network interface 402 may be configured to connect to one or more communication networks to allow transaction processing computer 400 to communicate with other entities such as a communication device operated by a user, an application provider computer or a token request computer, resource provider computer (e.g., merchant computer), transport computer (e.g., acquirer computer), authorizing entity computer (e.g., issuer computer), etc. Computer readable medium 406 may be as described with respect to computer readable medium 306 of
Requestor registration module 408 may, in conjunction with the processor 401, register a token requestor entity (e.g., application provider) with the database 403, and to generate a token requestor identifier (ID) for the registered entity. Each registered entity can use their respective token requestor ID as part of a token service request to facilitate identification and validation of the entity. In some embodiments, a token requestor entity may provide token requestor information to the requestor registration module 408 such as an entity name, contact information, an entity type (e.g., merchant, wallet provider, payment service provider, issuer, payment enabler, acquirer, etc.). In some embodiments in which the token is transaction related, the token requestor information may also include token presentment modes (e.g., scan, contactless, e-commerce, etc.), token type (e.g., primary token, subtoken, payment identifier, static/dynamic, payment/non-payment), integration and connectivity parameters, and services subscribed (e.g., token request, authentication and verification, life-cycle management, etc.) and any other relevant information for the onboarding process.
User registration module 410 may, in conjunction with the processor 401, perform registration of users and accounts of the users. In some embodiments, transaction processing computer 400 may allow authorized entities to register consumer accounts (e.g., payment or financial accounts) with the network token system on behalf of the users. For example, a registered token requestor may provide a token requestor ID (e.g., received at the time of registration from the requestor registration module 408), an account identifier or other sensitive information or sensitive information identifier for which a token can substitute, a consumer name and contact information, device identifier of the consumer's communication device, a token type, and any other relevant information for individual account registration or bulk account registration. In some embodiments, user registration module 410 working in conjunction with the processor 401 may store the account details and sensitive information in database 403 for all successful activation and registration requests. In some embodiment, an authorized entity may also unregister users and accounts by providing the necessary information to transaction processing computer 400.
Token generation module 412 can be programmed to generate and/or provide a token that is associated with sensitive data (e.g., account information or a primary token). For example, the token generation module 412 may generate a primary token that can be used as a substitute for a real account identifier (e.g., a Primary Account Number (PAN) of an account), and maintain a stored association (e.g., mapping) between the primary token and the PAN, such that a token exchange module 416 is able to “translate” the primary token back to the original PAN. In some embodiments, the primary token is mathematically derived from the original PAN. In other embodiments, the primary token is randomly generated with respect to the original PAN, and is simply linked to it in a data table. Regardless of how the primary token is generated from the PAN and vice versa, the use of a primary token instead of a real account identifier during a transaction can provide enhanced security. In some embodiments, the primary token and/or information regarding the primary token may be stored in a token vault.
In some embodiments, the token generation module 412 may also generate subtokens based on primary tokens. A subtoken may be associated with the same user as the primary token. The subtoken can be used as a substitute for the primary token. Further, the token generation module 412 can maintain a stored association (e.g., mapping) between the subtoken and the primary token, such that the token exchange module 416 is able to “translate” the subtoken back to the primary token, and in some embodiments, the primary token back to the original credential. In some embodiments, the subtoken is mathematically derived from the primary token. In other embodiments, the subtoken is randomly generated with respect to the primary token, and is simply linked to it in a data table. The subtoken may be, for example, a one-time use or limited use token. The use of a subtoken instead of a primary token during a transaction can provide even further enhanced security, as the subtoken is not directly associated with a credential. In some embodiments, the subtoken and/or information regarding the subtoken may be stored in a token vault.
In some embodiments, token generation module 412 may be programmed to receive a token requestor ID and an account identifier or sensitive information identifier. In some embodiments, token generation module 412 may also be programmed to receive optional information such as a user name, a user address and zip code, a requested token or sensitive information type (e.g., primary token, subtoken, static, dynamic, non-payment, etc.), device identifier, and/or suitable information. In some embodiments, token generation module 412 may be programmed to generate a response with the requested token or requested sensitive information, a token expiration date associated with the token, and/or a token assurance level associated with the token. In some embodiments, token generation module 412 may be programmed to validate the token requestor ID and maintain the correlation between the token, the sensitive information, primary token or account identifier being substituted by the token, and the associated token requestor. In some embodiments, token generation module 412 may be programmed to determine if a token already exists in the database 403 for a token request before generating a new token. In some embodiments, if a token cannot be provisioned, the token response may include a corresponding reason code. In some embodiments, token generation module 412 may also be programmed to provide an interface to the token requestors to submit a bulk token request file.
In some embodiments, the token may be generated on the fly using API calls. For example, when a request is received to tokenize an account identifier or a primary token, token generation module 412 may determine a token range to assign the token. The token range may be assigned based on whether the issuer is provisioning the token (e.g., issuer assigned token range) or the transaction processing network is provisioning the token on behalf of the issuer (e.g., transaction processing network assigned token range). As an example, if the transaction processing network assigned token range includes “442400000-442400250,” then “4424000000005382” may be assigned as a token value.
Verification and authentication module 414 may, in conjunction with the processor 401, execute a consumer verification and authentication process, and determine a token assurance level based on the outcome of the verification and authentication process. For example, the verification and authentication module 414, working in conjunction with the processor 401, can perform consumer authentication and verification through a configured authentication scheme. In some embodiments, the authentication scheme may include verification of the account identifier, verification values, the expiration date, and/or a delivery channel identifier based on the customer information stored in a database associated with the transaction processing network. In some embodiments, the authentication scheme may include direct verification of the consumer by the issuer using consumer tokens for their online banking system.
In some embodiments, user registration, token generation, and verification and authentication may be performed as part of processing a single token request process. In some embodiments, for bulk requests, user registration and token generation may be performed by processing a bulk file from the token requestor. In such embodiments, consumer verification and authentication may be performed in a separate step. In some embodiments, the token requestor can request that the authentication and verification process be performed independently multiple times for a particular account to reflect any changes to the levels of assurance for the token over time.
Token exchange and routing module 416 may, in conjunction with the processor 401, process requests for any underlying sensitive information (e.g., an account number or a primary token number) associated with a given token. For example, a transaction processing network, acquirer, issuer, etc. may issue a request for a token exchange during processing of a transaction. Token exchange and routing module 416 may, in conjunction with the processor 401, validate that the requesting entity is entitled to make a request for a token exchange. In some embodiments, token exchange and routing module 416 may, in conjunction with the processor 401, validate the account identifier (or other sensitive information) to token mapping and presentment mode based on the transaction timestamp and the token expiration timestamp. Token exchange and routing module 416 may, in conjunction with the processor 401, retrieve the account identifier or primary token (or other sensitive information) from token registry 404, and provide it along with the assurance level to the requesting entity. In some embodiments, if the account identifier (or other sensitive information) to token mapping is not valid for the transaction timestamp and presentment mode, an error message may be provided.
Token life-cycle management module 418 may, in conjunction with the processor 401, perform life-cycle operations on the tokens managed by transaction processing computer 400. Life-cycle operations may include canceling a token, activating or deactivating a token, updating token attributes, renewing a token with a new expiration date, etc. In some embodiments, a token requestor entity may provide a token requestor ID, a token number, a life-cycle operation identifier and one or more token attributes to transaction processing computer 400 to perform the requested life-cycle operation on a given token. Token life-cycle management module 418 may verify the token requestor ID and the token association based on information in database 403. Token life-cycle management module 418 may, in conjunction with the processor 401, perform the requested life-cycle operation on a given token, and update the corresponding associations in database 403. Examples of life-cycle operation may include a token activation operation to activate an inactive, suspended, or temporarily locked token and its associations; a token de-activation operation to temporarily lock or suspend a token; a cancel token operation to permanently mark a token and its associations as deleted to prevent any future transactions, etc. In some embodiments, a deleted token may be used during returns/chargebacks if the same token was used to submit the corresponding original transactions.
According to some embodiments, transaction processing computer 400 may include an HSM 420 to perform secure functions such as encryption and decryption operations and generation of cryptographic keys used for the encryption and decryption operations. HSM 420 may be similar to HSM 320 of
Although transaction processing computer 400 and application provider computer 300 have been described with a HSM implementing only some of their functions, it should be understood that other functionalities of the respective computers (e.g., token generation) can be implemented inside an HSM as well. Furthermore, some or all of the respective HSM functionalities can also be implemented outside of a HSM.
II. Methods
A method according to the embodiments of the invention can be described with respect to
At step S502, the communication device 110 requests that a subtoken be generated based on a primary token, and optionally, conducts an enrollment process with application provider computer 120. The request includes an identification of the primary token and any relevant data associated with the primary token (e.g., a limited use key, derivation data, a token validation cryptogram, etc.). The token may comprise a header, a middle portion, and a check digit. The header may be associated with an authorizing entity that issued the token and/or issued the credential underlying the primary token. In one embodiment, the header is up to 9 digits, the middle portion is 9 or more digits, and the check digit is 1 digit, resulting in a 19 digit token.
The communication device 110 may communicate with the application provider computer 120 over a communication network. The enrollment process may be conducted prior to a request (e.g., a transaction or access request) by the communication device 110. The request and/or enrollment process may enable a subtoken to be provisioned on communication device 110. At step S504, the application provider computer 120 forwards the request for the subtoken to the transaction processing computer 150.
At step S506, the transaction processing computer 150 generates an obfuscated portion using the primary token and the data associated with the primary token. The obfuscated portion may be, for example, a random or mathematically derived value that is encrypted or stored in a look-up table in association with the primary token and the data. The obfuscated portion may serve as a pointer to the token and the data in the look-up table, or may be decrypted to obtain the token and the data. In one embodiment, the obfuscated portion comprises nine or more characters (e.g., digits).
For a particular header, the transaction processing computer 150 may ensure that the obfuscated portion that is generated will not be a duplicate of any other obfuscated portion that may have been generated, but not yet invalidated. In other words, in the case of a one-time use subtoken, the transaction processing computer 150 may ensure that there is not already another subtoken with the same header and obfuscated portion that has not yet been used for a transaction.
At step S508, the transaction processing computer 150 generates a subtoken associated with the primary token. The subtoken includes a header, the obfuscated portion, and the same check digit as the token. The header may be associated with the transaction processing computer 150, such that when the subtoken is used to conduct a transaction, the subtoken is routed to the proper transaction processing computer 150 for translation into the primary token and/or credential. In one embodiment, the header is up to 9 digits, the obfuscated portion is 9 or more digits, and the check digit is 1 digit, resulting in a 19 digit subtoken.
In one embodiment, the subtoken is the same length as the primary token. The subtoken may have associated limits or conditions on its use. For example, the subtoken may be designated as a limited use or one-time use subtoken. Other limitations or conditions may relate to the amount of the transaction, the types of resource providers that can use the subtoken, and the like.
At step S510, the transaction processing computer 150 sends the subtoken to the application provider computer 120. At step S512, the application provider computer 120 provides the subtoken to the communication device 110 (e.g., provisions the subtoken on the communication device 110).
At step S514, the communication device 110 optionally generates a bar code using the subtoken. The bar code is a representation of the subtoken that may be scanned by resource providers or access devices, for example, and may be used to initiate transactions, as described further herein. Although described with respect to a bar code, it is contemplated that any other scannable or interpretable code may be generated using the token (e.g., a QR code).
In this example, the bar code may only contain the subtoken without additional associated data. It may not have additional information such as a separate token validation cryptogram that might otherwise be used to help verify the subtoken. Bar codes, and in particular, one-dimensional bar codes, cannot carry large amounts of information. As will be apparent from the description herein, embodiments of the invention can provide for the benefits of a secure tokenization system, even though a bar code that is initially used to conduct a transaction cannot carry all of the data that might be needed in a typical token transaction.
At step S620, in one embodiment, communication device 110 displays a bar code representing a subtoken to initiate a payment transaction with a resource provider computer 130. The bar code may be displayed, for example, by an application residing on communication device 110. In other embodiments, other scannable and/or interpretable codes may be provided by the communication device 110 (e.g., a QR code). In still other embodiments, the subtoken may be provided to the resource provider computer 130 via a contactless interface. At step S622, resource provider computer 130 uses a bar code scanner to scan the bar code displayed on communication device 110 and extract the subtoken from the bar code by interpreting the bar code. The subtoken may include a header, an obfuscated portion, and a check digit.
At step S624, the resource provider computer 130 generates an authorization request message with the subtoken from the bar code and other transaction information (e.g., payment amount, resource provider ID, etc.). At step S626, the resource provider computer 130 transmits the authorization request message to a transport computer 140. The transport computer 140 performs routine processing checks and passes the authorization request message to the transaction processing computer 150 at step S628. The authorization request message may be routed to the transaction processing computer 150 by the header of the subtoken in one embodiment (i.e., the header of the subtoken may be a pointer to the transaction processing computer 150).
At step S630, after the transaction processing computer 150 receives the authorization request message, the transaction processing computer 150 can evaluate the subtoken to determine if it is being used under any previously established limitations or conditions. For example, if the subtoken is for one-time use, the transaction processing computer 150 can verify that this is the first and only time the subtoken has been used for a transaction. Other data in the authorization request message such as a resource provider ID (e.g., a merchant ID) and/or a transaction amount may also be evaluated against conditions for use that may be stored by the transaction processing computer 150. As an illustration, the subtoken may only be useable at a particular type of merchant (e.g., grocery stores) and/or may have a transaction limit, such as $500 associated with it. If these conditions are not satisfied, then the transaction may be declined by the transaction processing computer 150. The transaction processing computer 150 may then generate and send an authorization response message back to the resource provider computer 130 that ultimately informs the user of communication device 110 that the transaction was denied.
If the subtoken satisfies all conditions of use, then the transaction processing computer 150 can then use the obfuscated portion of the subtoken to produce an underlying primary token and data associated with the primary token. In some embodiments, the obfuscated portion may be used as a pointer to the primary token and the data in a look-up table. In other embodiments, the obfuscated portion may be decrypted or otherwise mathematically manipulated to obtain the primary token and the data associated with the primary token. The data associated with the primary token may include, for example, a limited use key and other derivation data. The primary token may include a header, a middle portion, and the same check digit as the subtoken. The header of the primary token may be associated with an authorizing entity.
In some cases, the limited use key may be used to generate a token validation cryptogram and may normally accompany the primary token when conducting a transaction. The limited use key may be periodically changed at the transaction processing computer 150 (e.g., every five days, every five transactions, or after a set cumulative transaction amount) so that any token validation cryptograms generated therefrom are also of limited use. This improves transaction security, because if the token validation cryptogram and the primary token are obtained by an unauthorized person, that person would only be able to use the token validation cryptogram and the primary token for a short period of time.
As is apparent from this process flow, the transaction processing computer 150 can generate the data (e.g., a separate token validation cryptogram) that would otherwise be necessary to conduct a token-based transaction even though the initial way of providing data from the communication device 110 to the resource provider computer 130 can only carry limited data (e.g., through the use of a one-dimensional bar code).
Note that the primary token, limited use key, and token validation cryptogram may also be stored on the communication device 110 or another device operated by the user. As described herein, the primary token and the token validation cryptogram may be transmitted by the communication device 110 in situations where there is an adequate mechanism for transferring data between the communication device 110 and the resource provider computer 130. For instance, if the communication device 110 and the resource provider computer 130 can communicate via NFC, Bluetooth, Wi-Fi, or multi-dimensional codes (e.g., multi-dimensional bar codes), then the primary token and the token validation cryptogram generated from the limited use key on the communication device 110 may be used instead of the subtoken.
At step S632, the transaction processing computer 150 retrieves a credential associated with the token through a look-up table. The credential includes a header, a center portion, and the same check digit as the token and subtoken. The same check digit is used between the credential, the token, and the subtoken in order to prevent immediate error detection by the transaction processing computer 150 or other parties to the transaction, such as the acquirer or issuer. The header of the credential may also be associated with an authorizing entity, and may be the same header as the token. At least the center portion of the credential is different than the middle portion of the token, such that the same value is not used for both the credential and the token.
At step S634, the transaction processing computer updates the authorization request message with the credential. At step S636, the transaction processing computer transmits the authorization request message with the credential to the authorizing entity computer 160. At step S638, the authorizing entity computer 160 makes an authorization decision using the credential and generates an authorization response message. For example, the authorizing entity computer 160 may determine if the account associated with the credential in the authorization request message has sufficient funds or credit, and may also determine if the transaction exceeds a predetermined fraud threshold. At step S640, the authorizing entity computer 160 sends the authorization response message with the credential to the transaction processing computer 150.
At step S642, the transaction processing computer 150 retrieves the primary token associated with the credential. At step S644, the transaction processing computer 150 retrieves the subtoken associated with the primary token. At step S646, the transaction processing computer 150 updates the authorization response message to include the subtoken. At this point, if the transaction has been authorized, the transaction processing computer 150 may invalidate the subtoken if it is a one-time use subtoken.
At step S648, the transaction processing computer 150 sends the authorization response message including the subtoken to the transport computer 140. At step S650, the transport computer 140 sends the authorization response message including the subtoken to the resource provider computer 130. The resource provider computer 130 will then store the subtoken in its records instead of the credential or primary token. No sensitive data associated with the user of communication device 110 is exposed to the resource provider computer 130 in the above-noted process. At step S652, the resource provider computer 130 provides communication device 110 (or a user of communication device 110) with an indication of whether the transaction was authorized or denied.
At a later point in time, a clearing and settlement process can occur between the transport computer 140, the transaction processing computer 150, and the authorizing entity computer 160. The resource provider computer 130 may first provide a file with the subtoken and the associated transaction data to the transport computer 140. The transport computer 140 may then transmit any clearing and settlement messages to the transaction processing computer 150 using the subtoken. The subtoken may then be converted to the credential as described above in the authorization process to facilitate the exchange of messages and the transfer of funds between the transport computer 140 and the authorizing entity computer 160.
Although described with respect to
Additionally or alternatively, it is contemplated that one or more of steps S630-S646 may be performed by the authorizing entity computer 160, instead of the transaction processing computer 150. For example, the authorizing entity computer 160 may instead receive an authorization request message containing the primary token from transaction processing computer 150 at step S636, and may thereafter retrieve the credential associated with the primary token itself. This embodiment may be implemented in instances in which the authorizing entity computer 160 issues the primary token instead of the transaction processing computer 150, for example.
While the example above describes subtokens generated from a primary token, embodiments are not so limited. For example, it may be possible for the user of communication device 110 to create a one-time use token directly from a credential associated with their account. During a purchase, the user would use the one-time use token.
Also, while the above example describes the presentation of a subtoken by a communication device 110 to a resource provider computer 130, in other embodiments, the subtoken may be present in the form of a one-dimensional bar code or just a number that is 20 digits or less, for example, that might be printed on a card of a piece of paper.
Embodiments of the invention may provide a number of advantages. The invention enables users to easily obtain subtokens, such as one-time use subtokens for each transaction, maximizing security for the underlying account. The number of entities across a transaction system having access to a credential or a high value token (i.e., a token directly related to a credential) is minimized. This can ensure security of the transaction as no sensitive data is exposed to the resource provider or merchant, from whom fraud can originate. Further, because the subtoken can be for one-time use, the subtoken number can change for each and every transaction. Thus, if the subtoken number is improperly obtained once during a transaction, it can never be used again to perform a transaction on the underlying account.
Another advantage of embodiments of the invention is that the use of the subtoken, without an additional token validation cryptogram, can be used in situations where the ability to transfer larger amounts of data are not available. Even though additional data such as a token validation cryptogram is not used in the initial transfer of data from the user, embodiments of the invention can still benefit from the transaction security and convenience of token-based processing systems.
Generating subtokens associated with an original token that may be distributed to authorized entities can be applied outside of financial transaction contexts as well. For example, embodiments of the invention may be utilized to designate certain access privileges to an individual who may provide a subtoken in order to be granted access.
A computer system may be used to implement any of the entities or components described above. The subsystems of the computer system may be interconnected via a system bus. Additional subsystems such as a printer, keyboard, fixed disk (or other memory comprising computer readable media), monitor, which is coupled to display adapter, and others may be used. Peripherals and input/output (I/O) devices, which couple to an I/O controller (which can be a processor or other suitable controller), can be connected to the computer system by any number of means known in the art, such as a serial port. For example, a serial port or external interface can be used to connect the computer apparatus to a wide area network such as the Internet, a mouse input device, or a scanner. The interconnection via system bus allows the central processor to communicate with each subsystem and to control the execution of instructions from system memory or the fixed disk, as well as the exchange of information between subsystems. The system memory and/or the fixed disk may embody a computer readable medium. In some embodiments, the monitor may be a touch sensitive display screen.
A computer system can include a plurality of the same components or subsystems, e.g., connected together by an external interface or by an internal interface. In some embodiments, computer systems, subsystem, or apparatuses can communicate over a network. In such instances, one computer can be considered a client and another computer a server, where each can be part of a same computer system. A client and a server can each include multiple systems, subsystems, or components.
It should be understood that any of the embodiments of the present invention can be implemented in the form of control logic using hardware (e.g. an application specific integrated circuit or field programmable gate array) and/or using computer software with a generally programmable processor in a modular or integrated manner. As used herein, a processor includes a single-core processor, multi-core processor on a same integrated chip, or multiple processing units on a single circuit board or networked. Based on the disclosure and teachings provided herein, a person of ordinary skill in the art will know and appreciate other ways and/or methods to implement embodiments of the present invention using hardware and a combination of hardware and software.
Any of the software components or functions described in this application may be implemented as software code to be executed by a processor using any suitable computer language such as, for example, Java, C, C++, C#, Objective-C, Swift, or scripting language such as Perl or Python using, for example, conventional or object-oriented techniques. The software code may be stored as a series of instructions or commands on a computer readable medium for storage and/or transmission, suitable media include random access memory (RAM), a read only memory (ROM), a magnetic medium such as a hard-drive or a floppy disk, or an optical medium such as a compact disk (CD) or DVD (digital versatile disk), flash memory, and the like. The computer readable medium may be any combination of such storage or transmission devices.
Such programs may also be encoded and transmitted using carrier signals adapted for transmission via wired, optical, and/or wireless networks conforming to a variety of protocols, including the Internet. As such, a computer readable medium according to an embodiment of the present invention may be created using a data signal encoded with such programs. Computer readable media encoded with the program code may be packaged with a compatible device or provided separately from other devices (e.g., via Internet download). Any such computer readable medium may reside on or within a single computer product (e.g. a hard drive, a CD, or an entire computer system), and may be present on or within different computer products within a system or network. A computer system may include a monitor, printer, or other suitable display for providing any of the results mentioned herein to a user.
The above description is illustrative and is not restrictive. Many variations of the invention will become apparent to those skilled in the art upon review of the disclosure. The scope of the invention should, therefore, be determined not with reference to the above description, but instead should be determined with reference to the pending claims along with their full scope or equivalents. For example, although specific functions and methods have been described with respect to transaction processing computer 150 in
One or more features from any embodiment may be combined with one or more features of any other embodiment without departing from the scope of the invention.
A recitation of “a”, “an” or “the” is intended to mean “one or more” unless specifically indicated to the contrary.
All patents, patent applications, publications, and descriptions mentioned above are herein incorporated by reference in their entirety for all purposes. None is admitted to be prior art.
This is a continuation application of U.S. application Ser. No. 15/158,926, filed May 19, 2016, the entire contents of which are incorporated herein by reference for all purposes.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5280527 | Gullman et al. | Jan 1994 | A |
| 5613012 | Hoffman et al. | Mar 1997 | A |
| 5781438 | Lee et al. | Jul 1998 | A |
| 5883810 | Franklin et al. | Mar 1999 | A |
| 5930767 | Reber et al. | Jul 1999 | A |
| 5953710 | Fleming | Sep 1999 | A |
| 5956699 | Wong et al. | Sep 1999 | A |
| 6000832 | Franklin et al. | Dec 1999 | A |
| 6014635 | Harris et al. | Jan 2000 | A |
| 6044360 | Picciallo | Mar 2000 | A |
| 6163771 | Walker et al. | Dec 2000 | A |
| 6227447 | Campisano | May 2001 | B1 |
| 6236981 | Hill | May 2001 | B1 |
| 6267292 | Walker et al. | Jul 2001 | B1 |
| 6327578 | Linehan | Dec 2001 | B1 |
| 6341724 | Campisano | Jan 2002 | B2 |
| 6385596 | Wiser et al. | May 2002 | B1 |
| 6422462 | Cohen | Jul 2002 | B1 |
| 6425523 | Shem-Ur et al. | Jul 2002 | B1 |
| 6453301 | Niwa | Sep 2002 | B1 |
| 6592044 | Wong et al. | Jul 2003 | B1 |
| 6636833 | Flitcroft et al. | Oct 2003 | B1 |
| 6748367 | Lee | Jun 2004 | B1 |
| 6805287 | Bishop et al. | Oct 2004 | B2 |
| 6879965 | Fung et al. | Apr 2005 | B2 |
| 6891953 | DeMello et al. | May 2005 | B1 |
| 6901387 | Wells et al. | May 2005 | B2 |
| 6931382 | Laage et al. | Aug 2005 | B2 |
| 6938019 | Uzo | Aug 2005 | B1 |
| 6941285 | Sarcanin | Sep 2005 | B2 |
| 6980670 | Hoffman et al. | Dec 2005 | B1 |
| 6990470 | Hogan et al. | Jan 2006 | B2 |
| 6991157 | Bishop et al. | Jan 2006 | B2 |
| 7051929 | Li | May 2006 | B2 |
| 7069249 | Stolfo et al. | Jun 2006 | B2 |
| 7103576 | Mann, III et al. | Sep 2006 | B2 |
| 7113930 | Eccles et al. | Sep 2006 | B2 |
| 7136835 | Flitcroft et al. | Nov 2006 | B1 |
| 7177835 | Walker et al. | Feb 2007 | B1 |
| 7177848 | Hogan et al. | Feb 2007 | B2 |
| 7194437 | Britto et al. | Mar 2007 | B1 |
| 7209561 | Shankar et al. | Apr 2007 | B1 |
| 7264154 | Harris | Sep 2007 | B2 |
| 7287692 | Patel et al. | Oct 2007 | B1 |
| 7292999 | Hobson et al. | Nov 2007 | B2 |
| 7350230 | Forrest | Mar 2008 | B2 |
| 7353382 | Labrou et al. | Apr 2008 | B2 |
| 7379919 | Hogan et al. | May 2008 | B2 |
| RE40444 | Linehan | Jul 2008 | E |
| 7415443 | Hobson et al. | Aug 2008 | B2 |
| 7444676 | Asghari-Kamrani et al. | Oct 2008 | B1 |
| 7469151 | Khan et al. | Dec 2008 | B2 |
| 7548889 | Bhambri et al. | Jun 2009 | B2 |
| 7567934 | Flitcroft et al. | Jul 2009 | B2 |
| 7567936 | Peckover et al. | Jul 2009 | B1 |
| 7571139 | Giordano et al. | Aug 2009 | B1 |
| 7571142 | Flitcroft et al. | Aug 2009 | B1 |
| 7580898 | Brown et al. | Aug 2009 | B2 |
| 7584153 | Brown et al. | Sep 2009 | B2 |
| 7593896 | Flitcroft et al. | Sep 2009 | B1 |
| 7606560 | Labrou et al. | Oct 2009 | B2 |
| 7627531 | Breck et al. | Dec 2009 | B2 |
| 7627895 | Gifford et al. | Dec 2009 | B2 |
| 7650314 | Saunders | Jan 2010 | B1 |
| 7685037 | Reiners et al. | Mar 2010 | B2 |
| 7702578 | Fung et al. | Apr 2010 | B2 |
| 7707120 | Dominguez et al. | Apr 2010 | B2 |
| 7712655 | Wong | May 2010 | B2 |
| 7734527 | Uzo | Jun 2010 | B2 |
| 7753265 | Harris | Jul 2010 | B2 |
| 7770789 | Oder, II et al. | Aug 2010 | B2 |
| 7784685 | Hopkins, III | Aug 2010 | B1 |
| 7793851 | Mullen | Sep 2010 | B2 |
| 7801826 | Labrou et al. | Sep 2010 | B2 |
| 7805376 | Smith | Sep 2010 | B2 |
| 7805378 | Berardi et al. | Sep 2010 | B2 |
| 7818264 | Hammad | Oct 2010 | B2 |
| 7828220 | Mullen | Nov 2010 | B2 |
| 7835960 | Breck et al. | Nov 2010 | B2 |
| 7841523 | Oder, II et al. | Nov 2010 | B2 |
| 7841539 | Hewton | Nov 2010 | B2 |
| 7844550 | Walker et al. | Nov 2010 | B2 |
| 7848980 | Carlson | Dec 2010 | B2 |
| 7849020 | Johnson | Dec 2010 | B2 |
| 7853529 | Walker et al. | Dec 2010 | B1 |
| 7853995 | Chow et al. | Dec 2010 | B2 |
| 7865414 | Fung et al. | Jan 2011 | B2 |
| 7873579 | Hobson et al. | Jan 2011 | B2 |
| 7873580 | Hobson et al. | Jan 2011 | B2 |
| 7890393 | Talbert et al. | Feb 2011 | B2 |
| 7891563 | Oder, II et al. | Feb 2011 | B2 |
| 7896238 | Fein et al. | Mar 2011 | B2 |
| 7908216 | Davis et al. | Mar 2011 | B1 |
| 7922082 | Muscato | Apr 2011 | B2 |
| 7931195 | Mullen | Apr 2011 | B2 |
| 7937324 | Patterson | May 2011 | B2 |
| 7938318 | Fein et al. | May 2011 | B2 |
| 7954705 | Mullen | Jun 2011 | B2 |
| 7959076 | Hopkins, III | Jun 2011 | B1 |
| 7996288 | Stolfo | Aug 2011 | B1 |
| 8025223 | Saunders et al. | Sep 2011 | B2 |
| 8046256 | Chien et al. | Oct 2011 | B2 |
| 8060448 | Jones | Nov 2011 | B2 |
| 8060449 | Zhu | Nov 2011 | B1 |
| 8074877 | Mullen et al. | Dec 2011 | B2 |
| 8074879 | Harris | Dec 2011 | B2 |
| 8082210 | Hansen et al. | Dec 2011 | B2 |
| 8095113 | Kean et al. | Jan 2012 | B2 |
| 8104679 | Brown | Jan 2012 | B2 |
| RE43157 | Bishop et al. | Feb 2012 | E |
| 8109436 | Hopkins, III | Feb 2012 | B1 |
| 8121942 | Carlson et al. | Feb 2012 | B2 |
| 8121956 | Carlson et al. | Feb 2012 | B2 |
| 8126449 | Beenau et al. | Feb 2012 | B2 |
| 8132723 | Hogg et al. | Mar 2012 | B2 |
| 8171525 | Pelly et al. | May 2012 | B1 |
| 8175973 | Davis et al. | May 2012 | B2 |
| 8190523 | Patterson | May 2012 | B2 |
| 8196813 | Vadhri | Jun 2012 | B2 |
| 8205791 | Randazza et al. | Jun 2012 | B2 |
| 8219489 | Patterson | Jul 2012 | B2 |
| 8224702 | Mengerink et al. | Jul 2012 | B2 |
| 8225385 | Chow et al. | Jul 2012 | B2 |
| 8229852 | Carlson | Jul 2012 | B2 |
| 8265993 | Chien et al. | Sep 2012 | B2 |
| 8280777 | Mengerink et al. | Oct 2012 | B2 |
| 8281991 | Wentker et al. | Oct 2012 | B2 |
| 8328095 | Oder, II et al. | Dec 2012 | B2 |
| 8336088 | Raj et al. | Dec 2012 | B2 |
| 8346666 | Lindelsee et al. | Jan 2013 | B2 |
| 8376225 | Hopkins, III | Feb 2013 | B1 |
| 8380177 | Laracey | Feb 2013 | B2 |
| 8387873 | Saunders et al. | Mar 2013 | B2 |
| 8401539 | Beenau et al. | Mar 2013 | B2 |
| 8401898 | Chien et al. | Mar 2013 | B2 |
| 8402555 | Grecia | Mar 2013 | B2 |
| 8403211 | Brooks et al. | Mar 2013 | B2 |
| 8412623 | Moon et al. | Apr 2013 | B2 |
| 8412837 | Emigh et al. | Apr 2013 | B1 |
| 8417642 | Oren | Apr 2013 | B2 |
| 8433116 | Butler et al. | Apr 2013 | B2 |
| 8447699 | Batada et al. | May 2013 | B2 |
| 8453223 | Svigals et al. | May 2013 | B2 |
| 8453925 | Fisher et al. | Jun 2013 | B2 |
| 8458487 | Palgon et al. | Jun 2013 | B1 |
| 8484134 | Hobson et al. | Jul 2013 | B2 |
| 8485437 | Mullen et al. | Jul 2013 | B2 |
| 8494959 | Hathaway et al. | Jul 2013 | B2 |
| 8498908 | Mengerink et al. | Jul 2013 | B2 |
| 8504475 | Brand et al. | Aug 2013 | B2 |
| 8504478 | Saunders et al. | Aug 2013 | B2 |
| 8510816 | Quach et al. | Aug 2013 | B2 |
| 8528067 | Hurry et al. | Sep 2013 | B2 |
| 8533860 | Grecia | Sep 2013 | B1 |
| 8538845 | Liberty | Sep 2013 | B2 |
| 8555079 | Shablygin et al. | Oct 2013 | B2 |
| 8566168 | Bierbaum et al. | Oct 2013 | B1 |
| 8567670 | Stanfield et al. | Oct 2013 | B2 |
| 8571939 | Lindsey et al. | Oct 2013 | B2 |
| 8577336 | Mechaley, Jr. | Nov 2013 | B2 |
| 8577803 | Chatterjee et al. | Nov 2013 | B2 |
| 8577813 | Weiss | Nov 2013 | B2 |
| 8578176 | Mattsson | Nov 2013 | B2 |
| 8583494 | Fisher | Nov 2013 | B2 |
| 8584251 | McGuire et al. | Nov 2013 | B2 |
| 8589237 | Fisher | Nov 2013 | B2 |
| 8589271 | Evans | Nov 2013 | B2 |
| 8589291 | Carlson et al. | Nov 2013 | B2 |
| 8595098 | Starai et al. | Nov 2013 | B2 |
| 8595812 | Bomar et al. | Nov 2013 | B2 |
| 8595850 | Spies et al. | Nov 2013 | B2 |
| 8606638 | Dragt | Dec 2013 | B2 |
| 8606700 | Carlson et al. | Dec 2013 | B2 |
| 8606720 | Baker et al. | Dec 2013 | B1 |
| 8615468 | Varadarajan | Dec 2013 | B2 |
| 8620754 | Fisher | Dec 2013 | B2 |
| 8635157 | Smith et al. | Jan 2014 | B2 |
| 8646059 | von Behren et al. | Feb 2014 | B1 |
| 8651374 | Brabson et al. | Feb 2014 | B2 |
| 8656180 | Shablygin et al. | Feb 2014 | B2 |
| 8751391 | Freund | Jun 2014 | B2 |
| 8751642 | Vargas et al. | Jun 2014 | B2 |
| 8762263 | Gauthier et al. | Jun 2014 | B2 |
| 8793186 | Patterson | Jul 2014 | B2 |
| 8838982 | Carlson et al. | Sep 2014 | B2 |
| 8856539 | Weiss | Oct 2014 | B2 |
| 8887308 | Grecia | Nov 2014 | B2 |
| 9065643 | Hurry et al. | Jun 2015 | B2 |
| 9070129 | Sheets et al. | Jun 2015 | B2 |
| 9100826 | Weiss | Aug 2015 | B2 |
| 9160741 | Wentker et al. | Oct 2015 | B2 |
| 9229964 | Stevelinck | Jan 2016 | B2 |
| 9245267 | Singh | Jan 2016 | B2 |
| 9249241 | Dai et al. | Feb 2016 | B2 |
| 9256871 | Anderson et al. | Feb 2016 | B2 |
| 9280765 | Hammad | Mar 2016 | B2 |
| 9530137 | Weiss | Dec 2016 | B2 |
| 9600817 | Bondesen et al. | Mar 2017 | B2 |
| 9646303 | Karpenko et al. | May 2017 | B2 |
| 9680942 | Dimmick | Jun 2017 | B2 |
| 11250424 | Wong | Feb 2022 | B2 |
| 20010029485 | Brody et al. | Oct 2001 | A1 |
| 20010034720 | Armes | Oct 2001 | A1 |
| 20010054003 | Chien et al. | Dec 2001 | A1 |
| 20020007320 | Hogan et al. | Jan 2002 | A1 |
| 20020016749 | Borecki et al. | Feb 2002 | A1 |
| 20020029193 | Ranjan et al. | Mar 2002 | A1 |
| 20020035548 | Hogan et al. | Mar 2002 | A1 |
| 20020073045 | Rubin et al. | Jun 2002 | A1 |
| 20020116341 | Hogan et al. | Aug 2002 | A1 |
| 20020133467 | Hobson et al. | Sep 2002 | A1 |
| 20020147913 | Lun Yip | Oct 2002 | A1 |
| 20030028481 | Flitcroft et al. | Feb 2003 | A1 |
| 20030130955 | Hawthorne | Jul 2003 | A1 |
| 20030191709 | Elston et al. | Oct 2003 | A1 |
| 20030191945 | Keech | Oct 2003 | A1 |
| 20040010462 | Moon et al. | Jan 2004 | A1 |
| 20040050928 | Bishop et al. | Mar 2004 | A1 |
| 20040059682 | Hasumi et al. | Mar 2004 | A1 |
| 20040093281 | Silverstein et al. | May 2004 | A1 |
| 20040139008 | Mascavage, III | Jul 2004 | A1 |
| 20040143532 | Lee | Jul 2004 | A1 |
| 20040158532 | Breck et al. | Aug 2004 | A1 |
| 20040210449 | Breck et al. | Oct 2004 | A1 |
| 20040210498 | Freund | Oct 2004 | A1 |
| 20040232225 | Bishop et al. | Nov 2004 | A1 |
| 20040236632 | Maritzen et al. | Nov 2004 | A1 |
| 20040260646 | Berardi et al. | Dec 2004 | A1 |
| 20050037735 | Coutts | Feb 2005 | A1 |
| 20050080730 | Sorrentino | Apr 2005 | A1 |
| 20050081039 | Lee et al. | Apr 2005 | A1 |
| 20050108178 | York | May 2005 | A1 |
| 20050199709 | Linlor | Sep 2005 | A1 |
| 20050246293 | Ong | Nov 2005 | A1 |
| 20050269401 | Spitzer et al. | Dec 2005 | A1 |
| 20050269402 | Spitzer et al. | Dec 2005 | A1 |
| 20060235795 | Johnson et al. | Oct 2006 | A1 |
| 20060237528 | Bishop et al. | Oct 2006 | A1 |
| 20060278704 | Saunders et al. | Dec 2006 | A1 |
| 20070107044 | Yuen et al. | May 2007 | A1 |
| 20070129955 | Dalmia et al. | Jun 2007 | A1 |
| 20070136193 | Starr | Jun 2007 | A1 |
| 20070136211 | Brown et al. | Jun 2007 | A1 |
| 20070170247 | Friedman | Jul 2007 | A1 |
| 20070179885 | Bird et al. | Aug 2007 | A1 |
| 20070208671 | Brown et al. | Sep 2007 | A1 |
| 20070245414 | Chan et al. | Oct 2007 | A1 |
| 20070288377 | Shaked | Dec 2007 | A1 |
| 20070291995 | Rivera | Dec 2007 | A1 |
| 20080015988 | Brown et al. | Jan 2008 | A1 |
| 20080029607 | Mullen | Feb 2008 | A1 |
| 20080035738 | Mullen | Feb 2008 | A1 |
| 20080052226 | Agarwal et al. | Feb 2008 | A1 |
| 20080054068 | Mullen | Mar 2008 | A1 |
| 20080054079 | Mullen | Mar 2008 | A1 |
| 20080054081 | Mullen | Mar 2008 | A1 |
| 20080065554 | Hogan et al. | Mar 2008 | A1 |
| 20080065555 | Mullen | Mar 2008 | A1 |
| 20080201264 | Brown et al. | Aug 2008 | A1 |
| 20080201265 | Hewton | Aug 2008 | A1 |
| 20080228646 | Myers et al. | Sep 2008 | A1 |
| 20080243702 | Hart et al. | Oct 2008 | A1 |
| 20080245855 | Fein et al. | Oct 2008 | A1 |
| 20080245861 | Fein et al. | Oct 2008 | A1 |
| 20080283591 | Oder, II et al. | Nov 2008 | A1 |
| 20080302869 | Mullen | Dec 2008 | A1 |
| 20080302876 | Mullen | Dec 2008 | A1 |
| 20080313264 | Pestoni | Dec 2008 | A1 |
| 20090006262 | Brown et al. | Jan 2009 | A1 |
| 20090010488 | Matsuoka et al. | Jan 2009 | A1 |
| 20090037333 | Flitcroft et al. | Feb 2009 | A1 |
| 20090037388 | Cooper et al. | Feb 2009 | A1 |
| 20090043702 | Bennett | Feb 2009 | A1 |
| 20090048953 | Hazel et al. | Feb 2009 | A1 |
| 20090048971 | Hathaway et al. | Feb 2009 | A1 |
| 20090106112 | Dalmia et al. | Apr 2009 | A1 |
| 20090106160 | Skowronek | Apr 2009 | A1 |
| 20090134217 | Flitcroft et al. | May 2009 | A1 |
| 20090157555 | Biffle et al. | Jun 2009 | A1 |
| 20090159673 | Mullen et al. | Jun 2009 | A1 |
| 20090159700 | Mullen et al. | Jun 2009 | A1 |
| 20090159707 | Mullen et al. | Jun 2009 | A1 |
| 20090173782 | Muscato | Jul 2009 | A1 |
| 20090200371 | Kean et al. | Aug 2009 | A1 |
| 20090248583 | Chhabra | Oct 2009 | A1 |
| 20090276347 | Kargman | Nov 2009 | A1 |
| 20090281948 | Carlson | Nov 2009 | A1 |
| 20090294527 | Brabson et al. | Dec 2009 | A1 |
| 20090307139 | Mardikar et al. | Dec 2009 | A1 |
| 20090308921 | Mullen | Dec 2009 | A1 |
| 20090327131 | Beenau et al. | Dec 2009 | A1 |
| 20100008535 | Abulafia et al. | Jan 2010 | A1 |
| 20100088237 | Wankmueller | Apr 2010 | A1 |
| 20100094755 | Kloster | Apr 2010 | A1 |
| 20100106644 | Annan et al. | Apr 2010 | A1 |
| 20100120408 | Beenau et al. | May 2010 | A1 |
| 20100133334 | Vadhri | Jun 2010 | A1 |
| 20100138347 | Chen | Jun 2010 | A1 |
| 20100145860 | Pelegero | Jun 2010 | A1 |
| 20100161433 | White | Jun 2010 | A1 |
| 20100185545 | Royyuru et al. | Jul 2010 | A1 |
| 20100211505 | Saunders et al. | Aug 2010 | A1 |
| 20100223186 | Hogan et al. | Sep 2010 | A1 |
| 20100228668 | Hogan et al. | Sep 2010 | A1 |
| 20100235284 | Moore | Sep 2010 | A1 |
| 20100258620 | Torreyson et al. | Oct 2010 | A1 |
| 20100291904 | Musfeldt et al. | Nov 2010 | A1 |
| 20100299267 | Faith et al. | Nov 2010 | A1 |
| 20100306076 | Taveau et al. | Dec 2010 | A1 |
| 20100325041 | Berardi et al. | Dec 2010 | A1 |
| 20110010292 | Giordano et al. | Jan 2011 | A1 |
| 20110016047 | Wu et al. | Jan 2011 | A1 |
| 20110016320 | Bergsten et al. | Jan 2011 | A1 |
| 20110040640 | Erikson | Feb 2011 | A1 |
| 20110047076 | Carlson et al. | Feb 2011 | A1 |
| 20110083018 | Kesanupalli et al. | Apr 2011 | A1 |
| 20110087596 | Dorsey | Apr 2011 | A1 |
| 20110093397 | Carlson et al. | Apr 2011 | A1 |
| 20110125597 | Oder, II et al. | May 2011 | A1 |
| 20110153437 | Archer et al. | Jun 2011 | A1 |
| 20110153498 | Makhotin et al. | Jun 2011 | A1 |
| 20110154466 | Harper et al. | Jun 2011 | A1 |
| 20110161233 | Tieken | Jun 2011 | A1 |
| 20110178926 | Lindelsee et al. | Jul 2011 | A1 |
| 20110191244 | Dai | Aug 2011 | A1 |
| 20110191248 | Bishop et al. | Aug 2011 | A1 |
| 20110238511 | Park et al. | Sep 2011 | A1 |
| 20110238573 | Varadarajan | Sep 2011 | A1 |
| 20110246317 | Coppinger | Oct 2011 | A1 |
| 20110258111 | Raj et al. | Oct 2011 | A1 |
| 20110272471 | Mullen | Nov 2011 | A1 |
| 20110272478 | Mullen | Nov 2011 | A1 |
| 20110276380 | Mullen et al. | Nov 2011 | A1 |
| 20110276381 | Mullen et al. | Nov 2011 | A1 |
| 20110276424 | Mullen | Nov 2011 | A1 |
| 20110276425 | Mullen | Nov 2011 | A1 |
| 20110295745 | White et al. | Dec 2011 | A1 |
| 20110302081 | Saunders et al. | Dec 2011 | A1 |
| 20120023567 | Hammad | Jan 2012 | A1 |
| 20120028609 | Hruska | Feb 2012 | A1 |
| 20120030047 | Fuentes et al. | Feb 2012 | A1 |
| 20120035998 | Chien et al. | Feb 2012 | A1 |
| 20120041881 | Basu et al. | Feb 2012 | A1 |
| 20120047237 | Arvidsson et al. | Feb 2012 | A1 |
| 20120066078 | Kingston et al. | Mar 2012 | A1 |
| 20120072350 | Goldthwaite et al. | Mar 2012 | A1 |
| 20120078735 | Bauer et al. | Mar 2012 | A1 |
| 20120078798 | Downing et al. | Mar 2012 | A1 |
| 20120078799 | Jackson et al. | Mar 2012 | A1 |
| 20120095852 | Bauer et al. | Apr 2012 | A1 |
| 20120095865 | Doherty et al. | Apr 2012 | A1 |
| 20120116902 | Cardina et al. | May 2012 | A1 |
| 20120123882 | Carlson et al. | May 2012 | A1 |
| 20120123940 | Killian et al. | May 2012 | A1 |
| 20120129514 | Beenau et al. | May 2012 | A1 |
| 20120143754 | Patel | Jun 2012 | A1 |
| 20120143767 | Abadir | Jun 2012 | A1 |
| 20120143772 | Abadir | Jun 2012 | A1 |
| 20120158580 | Eram et al. | Jun 2012 | A1 |
| 20120158593 | Garfinkle et al. | Jun 2012 | A1 |
| 20120173431 | Ritchie et al. | Jul 2012 | A1 |
| 20120185386 | Salama et al. | Jul 2012 | A1 |
| 20120197807 | Schlesser et al. | Aug 2012 | A1 |
| 20120203664 | Torossian et al. | Aug 2012 | A1 |
| 20120203666 | Torossian et al. | Aug 2012 | A1 |
| 20120215688 | Musser et al. | Aug 2012 | A1 |
| 20120215696 | Salonen | Aug 2012 | A1 |
| 20120221421 | Hammad | Aug 2012 | A1 |
| 20120226582 | Hammad | Sep 2012 | A1 |
| 20120231844 | Coppinger | Sep 2012 | A1 |
| 20120233004 | Bercaw | Sep 2012 | A1 |
| 20120246070 | Vadhri | Sep 2012 | A1 |
| 20120246071 | Jain et al. | Sep 2012 | A1 |
| 20120246079 | Wilson et al. | Sep 2012 | A1 |
| 20120259782 | Hammad | Oct 2012 | A1 |
| 20120265631 | Cronic et al. | Oct 2012 | A1 |
| 20120271770 | Harris et al. | Oct 2012 | A1 |
| 20120297446 | Webb et al. | Nov 2012 | A1 |
| 20120300932 | Cambridge et al. | Nov 2012 | A1 |
| 20120303503 | Cambridge et al. | Nov 2012 | A1 |
| 20120303961 | Kean et al. | Nov 2012 | A1 |
| 20120304273 | Bailey et al. | Nov 2012 | A1 |
| 20120310725 | Chien et al. | Dec 2012 | A1 |
| 20120310831 | Harris et al. | Dec 2012 | A1 |
| 20120316992 | Oborne | Dec 2012 | A1 |
| 20120317035 | Royyuru et al. | Dec 2012 | A1 |
| 20120317036 | Bower et al. | Dec 2012 | A1 |
| 20130017784 | Fisher | Jan 2013 | A1 |
| 20130018757 | Anderson et al. | Jan 2013 | A1 |
| 20130019098 | Gupta et al. | Jan 2013 | A1 |
| 20130031006 | McCullagh et al. | Jan 2013 | A1 |
| 20130048714 | Sharma et al. | Feb 2013 | A1 |
| 20130054337 | Brendell et al. | Feb 2013 | A1 |
| 20130054466 | Muscato | Feb 2013 | A1 |
| 20130054474 | Yeager | Feb 2013 | A1 |
| 20130081122 | Svigals et al. | Mar 2013 | A1 |
| 20130091028 | Oder, II et al. | Apr 2013 | A1 |
| 20130110658 | Lyman et al. | May 2013 | A1 |
| 20130111599 | Gargiulo | May 2013 | A1 |
| 20130117185 | Collison et al. | May 2013 | A1 |
| 20130124290 | Fisher | May 2013 | A1 |
| 20130124291 | Fisher | May 2013 | A1 |
| 20130124364 | Mittal | May 2013 | A1 |
| 20130138525 | Bercaw | May 2013 | A1 |
| 20130144888 | Faith et al. | Jun 2013 | A1 |
| 20130145148 | Shablygin et al. | Jun 2013 | A1 |
| 20130145172 | Shablygin et al. | Jun 2013 | A1 |
| 20130159178 | Colon et al. | Jun 2013 | A1 |
| 20130159184 | Thaw | Jun 2013 | A1 |
| 20130166402 | Parento et al. | Jun 2013 | A1 |
| 20130166456 | Zhang et al. | Jun 2013 | A1 |
| 20130173736 | Krzeminski et al. | Jul 2013 | A1 |
| 20130185202 | Goldthwaite et al. | Jul 2013 | A1 |
| 20130191227 | Pasa et al. | Jul 2013 | A1 |
| 20130191286 | Cronic et al. | Jul 2013 | A1 |
| 20130191289 | Cronic et al. | Jul 2013 | A1 |
| 20130198071 | Jurss | Aug 2013 | A1 |
| 20130198080 | Anderson et al. | Aug 2013 | A1 |
| 20130200146 | Moghadam | Aug 2013 | A1 |
| 20130204787 | Dubois | Aug 2013 | A1 |
| 20130204793 | Kerridge et al. | Aug 2013 | A1 |
| 20130212007 | Mattsson et al. | Aug 2013 | A1 |
| 20130212017 | Bangia | Aug 2013 | A1 |
| 20130212019 | Mattsson et al. | Aug 2013 | A1 |
| 20130212024 | Mattsson et al. | Aug 2013 | A1 |
| 20130212026 | Powell et al. | Aug 2013 | A1 |
| 20130212666 | Mattsson et al. | Aug 2013 | A1 |
| 20130218698 | Moon et al. | Aug 2013 | A1 |
| 20130218769 | Pourfallah et al. | Aug 2013 | A1 |
| 20130226799 | Raj | Aug 2013 | A1 |
| 20130226802 | Hammad et al. | Aug 2013 | A1 |
| 20130226813 | Voltz | Aug 2013 | A1 |
| 20130246199 | Carlson | Sep 2013 | A1 |
| 20130246202 | Tobin | Sep 2013 | A1 |
| 20130246203 | Laracey | Sep 2013 | A1 |
| 20130246258 | Dessert | Sep 2013 | A1 |
| 20130246259 | Dessert | Sep 2013 | A1 |
| 20130246261 | Purves et al. | Sep 2013 | A1 |
| 20130246267 | Tobin | Sep 2013 | A1 |
| 20130254028 | Salci | Sep 2013 | A1 |
| 20130254052 | Royyuru et al. | Sep 2013 | A1 |
| 20130254102 | Royyuru | Sep 2013 | A1 |
| 20130254117 | von Mueller et al. | Sep 2013 | A1 |
| 20130262296 | Thomas et al. | Oct 2013 | A1 |
| 20130262302 | Lettow et al. | Oct 2013 | A1 |
| 20130262315 | Hruska | Oct 2013 | A1 |
| 20130262316 | Hruska | Oct 2013 | A1 |
| 20130262317 | Collinge et al. | Oct 2013 | A1 |
| 20130275300 | Killian et al. | Oct 2013 | A1 |
| 20130275307 | Khan | Oct 2013 | A1 |
| 20130275308 | Paraskeva et al. | Oct 2013 | A1 |
| 20130282502 | Jooste | Oct 2013 | A1 |
| 20130282575 | Mullen et al. | Oct 2013 | A1 |
| 20130282588 | Hruska | Oct 2013 | A1 |
| 20130297501 | Monk et al. | Nov 2013 | A1 |
| 20130297504 | Nwokolo et al. | Nov 2013 | A1 |
| 20130297508 | Belamant | Nov 2013 | A1 |
| 20130304649 | Cronic et al. | Nov 2013 | A1 |
| 20130308778 | Fosmark et al. | Nov 2013 | A1 |
| 20130311382 | Fosmark et al. | Nov 2013 | A1 |
| 20130317982 | Mengerink et al. | Nov 2013 | A1 |
| 20130332344 | Weber | Dec 2013 | A1 |
| 20130339253 | Sincai | Dec 2013 | A1 |
| 20130346305 | Mendes | Dec 2013 | A1 |
| 20130346314 | Mogollon et al. | Dec 2013 | A1 |
| 20130346320 | Jin et al. | Dec 2013 | A1 |
| 20140007213 | Sanin et al. | Jan 2014 | A1 |
| 20140013106 | Redpath | Jan 2014 | A1 |
| 20140013114 | Redpath | Jan 2014 | A1 |
| 20140013452 | Aissi et al. | Jan 2014 | A1 |
| 20140019352 | Shrivastava | Jan 2014 | A1 |
| 20140025581 | Calman | Jan 2014 | A1 |
| 20140025585 | Calman | Jan 2014 | A1 |
| 20140025958 | Calman | Jan 2014 | A1 |
| 20140032417 | Mattsson | Jan 2014 | A1 |
| 20140032418 | Weber | Jan 2014 | A1 |
| 20140040137 | Carlson et al. | Feb 2014 | A1 |
| 20140040139 | Brudnicki et al. | Feb 2014 | A1 |
| 20140040144 | Plomske et al. | Feb 2014 | A1 |
| 20140040145 | Ozvat et al. | Feb 2014 | A1 |
| 20140040148 | Ozvat et al. | Feb 2014 | A1 |
| 20140040628 | Fort et al. | Feb 2014 | A1 |
| 20140041018 | Bomar et al. | Feb 2014 | A1 |
| 20140046853 | Spies et al. | Feb 2014 | A1 |
| 20140047551 | Nagasundaram et al. | Feb 2014 | A1 |
| 20140052532 | Tsai et al. | Feb 2014 | A1 |
| 20140052620 | Rogers et al. | Feb 2014 | A1 |
| 20140052637 | Jooste et al. | Feb 2014 | A1 |
| 20140068706 | Aissi | Mar 2014 | A1 |
| 20140074637 | Hammad | Mar 2014 | A1 |
| 20140108172 | Weber et al. | Apr 2014 | A1 |
| 20140114857 | Griggs et al. | Apr 2014 | A1 |
| 20140143137 | Carlson | May 2014 | A1 |
| 20140164243 | Aabye et al. | Jun 2014 | A1 |
| 20140188586 | Carpenter et al. | Jul 2014 | A1 |
| 20140249945 | Gauthier et al. | Sep 2014 | A1 |
| 20140294701 | Dai et al. | Oct 2014 | A1 |
| 20140297534 | Patterson | Oct 2014 | A1 |
| 20140310183 | Weber | Oct 2014 | A1 |
| 20140324690 | Allen et al. | Oct 2014 | A1 |
| 20140330721 | Wang | Nov 2014 | A1 |
| 20140330722 | Laxminarayanan et al. | Nov 2014 | A1 |
| 20140331265 | Mozell et al. | Nov 2014 | A1 |
| 20140337236 | Wong et al. | Nov 2014 | A1 |
| 20140344153 | Raj et al. | Nov 2014 | A1 |
| 20140372308 | Sheets | Dec 2014 | A1 |
| 20150019443 | Sheets et al. | Jan 2015 | A1 |
| 20150032625 | Dill et al. | Jan 2015 | A1 |
| 20150032626 | Dill et al. | Jan 2015 | A1 |
| 20150032627 | Dill et al. | Jan 2015 | A1 |
| 20150046338 | Laxminarayanan et al. | Feb 2015 | A1 |
| 20150046339 | Wong et al. | Feb 2015 | A1 |
| 20150052064 | Karpenko et al. | Feb 2015 | A1 |
| 20150081544 | Schulz et al. | Mar 2015 | A1 |
| 20150088756 | Makhotin et al. | Mar 2015 | A1 |
| 20150095367 | Mattsson | Apr 2015 | A1 |
| 20150106239 | Gaddam et al. | Apr 2015 | A1 |
| 20150112870 | Nagasundaram et al. | Apr 2015 | A1 |
| 20150112871 | Kumnick | Apr 2015 | A1 |
| 20150120472 | Aabye et al. | Apr 2015 | A1 |
| 20150127529 | Makhotin et al. | May 2015 | A1 |
| 20150127547 | Powell et al. | May 2015 | A1 |
| 20150140960 | Powell et al. | May 2015 | A1 |
| 20150142673 | Nelsen et al. | May 2015 | A1 |
| 20150161597 | Subramanian et al. | Jun 2015 | A1 |
| 20150178724 | Ngo et al. | Jun 2015 | A1 |
| 20150178819 | Kassemi et al. | Jun 2015 | A1 |
| 20150180836 | Wong et al. | Jun 2015 | A1 |
| 20150186864 | Jones et al. | Jul 2015 | A1 |
| 20150193222 | Pirzadeh et al. | Jul 2015 | A1 |
| 20150195133 | Sheets et al. | Jul 2015 | A1 |
| 20150199679 | Palanisamy et al. | Jul 2015 | A1 |
| 20150199689 | Kumnick et al. | Jul 2015 | A1 |
| 20150220917 | Aabye et al. | Aug 2015 | A1 |
| 20150235211 | Hurry et al. | Aug 2015 | A1 |
| 20150254652 | Bondesen et al. | Sep 2015 | A1 |
| 20150269566 | Gaddam et al. | Sep 2015 | A1 |
| 20150278799 | Palanisamy | Oct 2015 | A1 |
| 20150287037 | Salmon et al. | Oct 2015 | A1 |
| 20150312038 | Palanisamy | Oct 2015 | A1 |
| 20150319158 | Kumnick | Nov 2015 | A1 |
| 20150324736 | Sheets et al. | Nov 2015 | A1 |
| 20150332262 | Lingappa | Nov 2015 | A1 |
| 20150356560 | Shastry et al. | Dec 2015 | A1 |
| 20150363781 | Badenhorst | Dec 2015 | A1 |
| 20160028550 | Gaddam et al. | Jan 2016 | A1 |
| 20160036790 | Shastry et al. | Feb 2016 | A1 |
| 20160042263 | Gaddam et al. | Feb 2016 | A1 |
| 20160065370 | Le Saint et al. | Mar 2016 | A1 |
| 20160092696 | Guglani et al. | Mar 2016 | A1 |
| 20160092872 | Prakash et al. | Mar 2016 | A1 |
| 20160092874 | O'Regan et al. | Mar 2016 | A1 |
| 20160103675 | Aabye et al. | Apr 2016 | A1 |
| 20160119296 | Laxminarayanan et al. | Apr 2016 | A1 |
| 20160125397 | Strydom et al. | May 2016 | A1 |
| 20160132878 | O'Regan et al. | May 2016 | A1 |
| 20160140545 | Flurscheim et al. | May 2016 | A1 |
| 20160148197 | Dimmick | May 2016 | A1 |
| 20160148212 | Dimmick | May 2016 | A1 |
| 20160171479 | Prakash et al. | Jun 2016 | A1 |
| 20160173483 | Wong et al. | Jun 2016 | A1 |
| 20160197725 | Hammad | Jul 2016 | A1 |
| 20160210628 | McGuire | Jul 2016 | A1 |
| 20160217461 | Gaddam et al. | Jul 2016 | A1 |
| 20160218875 | Le Saint et al. | Jul 2016 | A1 |
| 20160224976 | Basu et al. | Aug 2016 | A1 |
| 20160224977 | Sabba et al. | Aug 2016 | A1 |
| 20160232527 | Patterson | Aug 2016 | A1 |
| 20160239842 | Cash | Aug 2016 | A1 |
| 20160269391 | Gaddam et al. | Sep 2016 | A1 |
| 20160308995 | Youdale et al. | Oct 2016 | A1 |
| 20170046696 | Powell et al. | Feb 2017 | A1 |
| 20170076288 | Awasthi | Mar 2017 | A1 |
| 20170103387 | Weber | Apr 2017 | A1 |
| 20170109745 | Al-Bedaiwi et al. | Apr 2017 | A1 |
| 20170148013 | Rajurkar et al. | May 2017 | A1 |
| 20170163617 | Laxminarayanan et al. | Jun 2017 | A1 |
| 20170163629 | Law et al. | Jun 2017 | A1 |
| 20170186001 | Reed et al. | Jun 2017 | A1 |
| 20170200156 | Karpenko et al. | Jul 2017 | A1 |
| 20170200165 | Laxminarayanan et al. | Jul 2017 | A1 |
| 20170201520 | Chandoor et al. | Jul 2017 | A1 |
| 20170220818 | Nagasundaram et al. | Aug 2017 | A1 |
| 20170221054 | Flurscheim et al. | Aug 2017 | A1 |
| 20170221056 | Karpenko et al. | Aug 2017 | A1 |
| 20170228723 | Taylor et al. | Aug 2017 | A1 |
| 20170228728 | Sullivan | Aug 2017 | A1 |
| 20170236113 | Chitalia et al. | Aug 2017 | A1 |
| 20170293914 | Girish et al. | Oct 2017 | A1 |
| 20170295155 | Wong | Oct 2017 | A1 |
| 20170337549 | Wong | Nov 2017 | A1 |
| 20170364903 | Lopez | Dec 2017 | A1 |
| 20170364914 | Howard | Dec 2017 | A1 |
| 20170373852 | Cassin et al. | Dec 2017 | A1 |
| 20180006821 | Kinagi | Jan 2018 | A1 |
| 20180075081 | Chipman | Mar 2018 | A1 |
| 20180247303 | Raj et al. | Aug 2018 | A1 |
| 20180262334 | Hammad | Sep 2018 | A1 |
| 20180268399 | Spector et al. | Sep 2018 | A1 |
| 20180268405 | Lopez | Sep 2018 | A1 |
| 20180285875 | Law et al. | Oct 2018 | A1 |
| 20180324184 | Kaja et al. | Nov 2018 | A1 |
| 20180324584 | Lopez | Nov 2018 | A1 |
| 20190020478 | Girish et al. | Jan 2019 | A1 |
| 20190066069 | Faith et al. | Feb 2019 | A1 |
| 20190147439 | Wang et al. | May 2019 | A1 |
| Number | Date | Country |
|---|---|---|
| 103270524 | Aug 2013 | CN |
| 105580038 | May 2016 | CN |
| 1028401 | Aug 2000 | EP |
| 2156397 | Feb 2010 | EP |
| 20110006732 | Jan 2011 | KR |
| 0014648 | Mar 2000 | WO |
| 01035304 | May 2001 | WO |
| 0135304 | May 2002 | WO |
| 2004042536 | May 2004 | WO |
| 2004051585 | Jun 2004 | WO |
| 2005001751 | Jan 2005 | WO |
| 2006113834 | Oct 2006 | WO |
| 2009032523 | Mar 2009 | WO |
| 2010078522 | Jul 2010 | WO |
| 2012068078 | May 2012 | WO |
| 2012098556 | Jul 2012 | WO |
| 2012142370 | Oct 2012 | WO |
| 2012167941 | Dec 2012 | WO |
| 2013048538 | Apr 2013 | WO |
| 2013056104 | Apr 2013 | WO |
| 2013119914 | Aug 2013 | WO |
| 2013179271 | Dec 2013 | WO |
| 2017184121 | Oct 2017 | WO |
| 2017192122 | Nov 2017 | WO |
| 2017201301 | Nov 2017 | WO |
| Entry |
|---|
| “Petition for Inter Partes Review of U.S. Pat. No. 8,533,860 Challenging Claims 1-30 Under 35 U.S.C. § 312 and 37 C.F.R. § 42.104”, USPTO Patent Trial and Appeal Board, IPR 2016-00600, Feb. 17, 2016, 65 pages. |
| U.S. Appl. No. 15/158,926 , Final Office Action, dated Jul. 31, 2020, 17 pages. |
| U.S. Appl. No. 15/158,926 , Non-Final Office Action, dated May 20, 2021, 11 pages. |
| U.S. Appl. No. 15/158,926 , Non-Final Office Action, dated Dec. 23, 2019, 12 pages. |
| U.S. Appl. No. 15/158,926 , Notice of Allowance, dated Oct. 6, 2021, 6 pages. |
| U.S. Appl. No. 16/311,144 , “U.S. Patent Application No.”, Encryption Key Exchange Process Using Access Device, filed Dec. 18, 2018, 83 pages. |
| U.S. Appl. No. 16/347,175 , “U.S. Patent Application No.”, Access Identifier Provisioning to Application, filed May 2, 2019. |
| U.S. Appl. No. 16/415,360 , “U.S. Patent Application No.”, Method and System for Access Token Processing, filed May 17, 2019, 37 pages. |
| U.S. Appl. No. 16/444,339 , “U.S. Patent Application No.”, Recurring Token Transactions, filed Jun. 18, 2019, 36 pages. |
| U.S. Appl. No. 16/448,777 , “US Patent Application No.”, Secure Remote Transaction Framework Using Dynamic Secure Checkout Element, filed Jun. 21, 2019, 46 pages. |
| IN201847045903 , “First Examination Report”, dated Jul. 26, 2021, 7 pages. |
| Application No. PCT/US2017/033353 , International Preliminary Report on Patentability, dated Nov. 29, 2018, 10 pages. |
| Application No. PCT/US2017/033353 , International Search Report and Written Opinion, dated Aug. 29, 2017, 13 pages. |
| Application No. CN201780029156.4 , Office Action, dated Dec. 2, 2022, 29 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20220129885 A1 | Apr 2022 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 15158926 | May 2016 | US |
| Child | 17571313 | US |
