Patent Grant
10664843
Systems for providing dynamic values involve shared secrets, which cause predictability problems. For example, a conventional system includes an authentication server and a user device. A user of the user device can attempt to access an account managed by the authentication server. The user device generates a dynamic value based on a shared secret. The user device then sends the dynamic value to the authentication server. The authentication server uses the same shared secret to validate that the dynamic value is authentic. If the dynamic value is successfully authenticated, the authentication server allows the user device to access the account.
This shared secret is problematic, as it is either static, or dynamic but not random. As a result, the shared secret is at risk of being deduced or predicted by an outsider. Additionally, the authentication server has the burden of distributing a shared secret to each user device, as well as storing a shared secret for each user device. Similarly, before being able to participate in the system, each user device in the system is configured to incorporate the shared secret and utilize the dynamic value.
Embodiments of the invention address these and other problems individually and collectively. For example, embodiments enable a central server computer to generate a verification value and then provide the verification value to a user device (or resource provider computer). The user device can then submit the verification value during a transaction, and the central server computer can validate that the submitted verification value is authentic.
As a result, embodiments do not require that the user device and central server computer have a shared secret. This means that shared secrets do not have to be distributed, and the user device does not have to be configured to store or use a shared secret. Additionally, the verification value can be random.
Embodiments of the invention also allow the verification value to be generated based on a dynamic data element. The central server computer can provide the verification value to the user device, and can forgo storing the verification value. Instead, the central server computer can store the dynamic data element. When the verification value is used for a transaction, the central server computer can validate the verification value by regenerating the verification value based on the stored dynamic data element. Forgoing storage of the verification value improves security, as the verification value is less vulnerable to hacking and compromise. In some embodiments, the dynamic data element can be smaller than the verification value. Accordingly, storing the dynamic data element instead of the verification value reduces the central server computer's data storage burden.
One embodiment of the invention is directed to a method. The method comprises receiving, by a second computer, a request for a verification value associated with a transaction from a first computer. The request includes a token and a token requestor identifier. The method further includes generating a dynamic data element and storing a record. The record can include the dynamic data element, the token, and the token requestor identifier. The method also includes generating a first verification value based on the dynamic data element and the token, providing the first verification value to the first computer, and receiving a request to validate the first verification value from a third computer. The request includes the first verification value, the token, and the token requestor identifier. The method also comprises identifying the record including the dynamic data element based on the token and the token requestor identifier, and generating a second verification value based on the dynamic data element, the token, and the token requestor identifier. The second computer determines that the second verification value matches the first verification value, and provides a value credential associated with the token to the third computer.
Another embodiment of the invention is directed to a second computer configured to perform the above-described method.
Another embodiment of the invention is directed to a method comprising receiving, by a third computer, an authorization request message for a transaction from a first computer. The authorization request message includes a token, a token requestor identifier, and a first verification value. The method also includes sending the token, the token requestor identifier, and the first verification value to a second computer. The second computer identifies a dynamic data element based on the token and the token requestor identifier, and generates a second verification value based on the dynamic data element, the token, and the token requestor identifier. The second computer also determines that the second verification value matches the first verification value. The method further includes receiving a value credential associated with the token from the second computer, and sending the authorization request message and the value credential to an authorizing entity computer. The authorizing entity computer then authorizes the transaction based on the value credential.
Another embodiment of the invention is directed to a third computer configured to perform the above-described method.
Further details regarding embodiments of the invention can be found in the Detailed Description and the Figures.
Embodiments of the present invention are directed to using a verification value to authenticate the use of a token for a transaction. For example, an access token can represent a set of access credentials, but the access token may only be accepted for a transaction if accompanied by an authentic verification value. Similarly, a payment token can represent a set of payment credentials, but the payment token may only be accepted for a transaction if accompanied by an authentic verification value.
A central token provider can generate a verification value for a certain payment token and token requestor. Embodiments allow the verification value to be generated based on the token, a dynamic data element, a token expiration date, a token requestor ID, and/or any other suitable information.
The input dynamic data element can also be generated by the token provider. The dynamic data element can be a unique hexadecimal value, a random number, a counter value, a timestamp, and/or any other dynamic information. As a result, the verification value can have a dynamic input, such that the verification value is also a dynamic value.
While the verification value can be provided to a token requestor for use in a transaction, the dynamic data element is not shared. Instead it can be stored and kept private by the token provider. The algorithm used to generate the dynamic data element can also be kept secret, as can the algorithm for generating the verification value. As a result, the token provider may be the only entity capable of generating an authentic dynamic data element and/or verification value. For example, even if a fraudster intercepts a verification value, the fraudster cannot determine how to produce another authentic verification value. The fraudster may not even be able to determine the format or size of the dynamic data element, let alone generate a valid dynamic data element.
Further, the verification value is not stored by the token provider. However, the token provider can still authenticate a verification value using the stored dynamic data element. For example, a merchant may submit a payment token, a token requestor ID, a verification value, and/or any other suitable information for a transaction. The token provider can then identify a stored dynamic data element associated with the received verification value (e.g., based on the payment token, token requestor ID, etc.). Then, the token provider may regenerate the verification value based on the identified dynamic data element, the received payment token, the received token requestor ID, and/or other suitable information. If the regenerated verification value matches the received verification value, the received verification value can be considered valid, and the transaction can proceed. For example, the token provider may detokenize the payment token and provide the associated payment credentials.
Embodiments of the invention also allow token domain restrictions to be placed on a specific use of the payment token via the verification value and the dynamic data element. One or more token domain controls may be associated with the verification value and indicated in a stored record that is associated with the verification value (e.g., a record that includes the dynamic data element). As a result, when the verification value is being validated, the token domain controls can also be identified and checked. If the attempted transaction does not adhere to the assigned token domain controls, the transaction can be denied. Thus, the approved scenarios for which the payment token is valid can be further specified and controlled.
Embodiments of the invention provide a number of advantages. For example, in embodiments of the invention, the use of a verification value for authenticating a payment token can be implemented without having to store the verification value. For example, instead of storing the verification value, the token provider computer can store a dynamic data element used as input for the verification value. As a result, sensitive information that can be used to overcome security barriers (e.g., the verification value) is not stored, but an incoming verification value can still be validated by re-creating the verification value with the stored dynamic data element. Thus, security is improved because sensitive information is not stored or vulnerable.
Further, embodiments of the invention decrease the amount of storage capacity needed at a central token provider. This can be seen by contrasting with alternative embodiments where a cryptogram can be generated for each transaction by encrypting transaction-related information. In this case, the cryptogram can be submitted with the token for a transaction, and the cryptogram can be validated by regenerating the cryptogram with the same input information and encryption keys. However, this involves storing a cryptogram and/or multiple encryption keys for each token transaction, as well as passing a cryptogram in authorization request messages. In some embodiments, a cryptogram may be a large string of data, such as a string of 40 characters. Storing cryptograms and/or specific keys for each transaction can create a need for a large storage database. In contrast, embodiments of the invention allow the central token provider to store as little as a dynamic data element for each transaction. A dynamic data element can be 1-5 characters, or any other suitable length. Additionally, encryption keys can be derived from a master key (e.g., instead of storing each key). Thus, the amount of stored data can be reduced.
Embodiments of the invention further improve security through an improved verification value. The dynamic data element and verification value can be generated at a central token provider computer. The verification value then can be provided to a token requestor. When the verification value is used for a transaction, the token provider computer may be asked to validate the verification value. Accordingly, the same entity (e.g., the token provider computer) can both generate the verification value and validate the verification. As a result, the token provider computer may not have to share a secret with any other entities.
In contrast, in some conventional systems, a user device may generate the verification value, and the token provider computer may validate the verification value. For this to work, the user device and verification value may keep a shared secret, such as a shared encryption key and/or a shared algorithm for generating a verification value. Shared information is typically, to some extent, static and/or predictable. For example, a user device may use a dynamic data element such as a time of day or counter to generate the verification value. The token provider computer can then re-create and validate the verification value using the same time of day or counter. While this creates a dynamic verification value, the verification value is not random. A fraudster might, in theory, be able to determine the shared secret or pattern, and then be able to create an authentic verification value.
As mentioned above, embodiments of the invention do not require the use of shared secrets or patterns. For example, the dynamic data element that is used as an input for generating the verification value in embodiments of the invention can be completely random, as this value need not be distributed to various devices in a distributed system.
Another advantage is that the algorithm and/or encryption keys used to generate the verification value can also be changed, random, or otherwise unpredictable. For example, a verification value can be made dynamic and unpredictable by changing one or more factors, including the input information (e.g., using a dynamic data element as input), the algorithm for generating the verification value, and/or the encryption keys used in the algorithm. Embodiments of the invention allow one or more of these factors to be dynamic and unpredictable. For example, in some embodiments, static information can be used as input data, but the algorithm can vary from transaction to transaction. In other embodiments, the encryption keys can vary, while the algorithm and input data can be static or predictable. In other embodiments, two or more of the input data, algorithm, and keys can be dynamic. Thus, embodiments provide a number of new techniques for generating an unpredictable verification value.
Embodiments of the invention advantageously provide all of this functionality without requiring merchants or acquirers to make any system changes. For example, the verification value can be formatted as a Card Verification Value 2 (CVV2) or Card Verification Value (CVV) value, such that it can be included in an existing field in an authorization request message. Thus, the merchant can accept and send the verification value without adjusting data fields. In contrast, other forms of payment token control often involve updates to each entity in a transaction network. For example, a token cryptogram may be too large (e.g., too many characters) to enter into a merchant checkout page or to include in an authorization request message, so system changes and updates may be needed to accommodate a token cryptogram. It is difficult and inefficient to change systemic protocols and structures at this level, as many different entities are involved.
Prior to discussing specific embodiments of the invention, some terms may be described in detail.
A “credential” may be any suitable information that serves as reliable evidence of worth, ownership, identity, or authority. A credential may be a string of numbers, letters, or any other suitable characters that may be present or contained in any object or document that can serve as confirmation.
A “value credential” may be information associated with worth. Examples of a value credential include payment credentials, information needed to obtain a promotional offer, etc.
“Payment credentials” may include any suitable information associated with an account (e.g., a payment account and/or 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 payment credentials may include a PAN (primary account number or “account number”), user name, and an expiration date. An example of a PAN is a 16-digit number, such as “4147 0900 0000 1234.” In some embodiments, payment credentials can also include verification values such as CVV (card verification value), dCVV (dynamic card verification value), CVV2 (card verification value 2), CVC3 card verification values, dCVV2 (dynamic card verification value 2), and/or other verification values described below.
A “token” may be a substitute value for a credential. A token may be a string of numbers, letters, or any other suitable characters. Examples of tokens include payment tokens, access tokens, personal identification tokens, etc.
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 example, 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 transaction 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 or 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.
“Tokenization” is a process by which data is replaced with substitute data. For example, a payment account identifier (e.g., a primary account number (PAN)) may be tokenized by replacing the primary account identifier with a substitute number (e.g. a token) that may be associated with the payment account identifier. Further, tokenization may be applied to any other information that may be replaced with a substitute value (i.e., token). Tokenization may be used to enhance transaction efficiency, improve transaction security, increase service transparency, or to provide a method for third-party enablement.
A “token provider” or “token service system” can include a system that services payment tokens. In some embodiments, a token provider can facilitate requesting, determining (e.g., generating) and/or issuing tokens, as well as maintaining an established mapping of tokens to primary account numbers (PANs) in a repository (e.g. token vault). A token provider may include or be in communication with a token vault where the generated tokens are stored. The token provider may support token processing of payment transactions submitted using tokens by de-tokenizing the token to obtain the actual PAN. In some embodiments, a token service system may include a tokenization computer alone, or in combination with other computers such as a transaction processing network computer. Various entities of a tokenization ecosystem may assume the roles of the token provider. For example, payment networks and issuers or their agents may become the token provider by implementing the token services according to embodiments of the present invention.
A “token domain” may indicate an area and/or circumstance in which a token can be used. Examples of the token domain may include, but are not limited to, payment channels (e.g., e-commerce, physical point of sale, etc.), POS entry modes (e.g., contactless, magnetic stripe, etc.), and merchant identifiers to uniquely identify where the token can be used. A set of parameters may be established as part of token issuance by the token service provider that may allow for enforcing appropriate usage of the token in payment transactions. The parameters may include token domain controls which may control or restrict the token domains for which a token can be used. For example, the token domain controls may restrict the use of the token with particular presentment modes, such as contactless or e-commerce presentment modes. In some embodiments, the token domain controls may restrict the use of the token at a particular merchant that can be uniquely identified. Some exemplary token domain controls may require the verification of the presence of a token cryptogram or a verification value that is unique to a given transaction. In some embodiments, a token domain can be associated with a token requestor.
“Token expiry date” may refer to the expiration date/time of the token. The token expiry date may be passed among the entities of the tokenization ecosystem during transaction processing to ensure interoperability. The token expiration date may be a numeric value (e.g. a 4-digit numeric value). In some embodiments, the token expiry date can be expressed as an time duration as measured from the time of issuance.
A “token requestor” may include an entity that requests a token. A token requestor may also request verification data (e.g., a verification value) associated with a token. Example token requestors can include a mobile device, a user computer, a resource provider computer, an enabler computer, and/or any other suitable entity. A token requestor may be identified by a “token requestor identifier.” A token requestor identifier may be a set of letters, numbers, or any other suitable characters for identifying a token requestor. A token requestor identifier may be assigned to the token requestor by a token service system.
A “dynamic data element” may include a value that can vary across different scenarios. For example, a dynamic data element may be a first value for a first transaction, and a second value for a second transaction. A dynamic data element may be one or more numbers, letters, or any other suitable characters. An example of a dynamic data element is a unique code, such as a unique hexadecimal value or a unique cryptographic code. A unique hexadecimal value can be a randomly generated value. Additional examples include a random number, an application transaction counter (ATC), a unique transaction number, a timestamp, a transaction amount, etc. The dynamic data element can include any suitable number of characters, such as 5 digits.
A “verification value” may include information for authentication. For example, a verification value may be associated with a specific token, and a verification value may demonstrate authentic use of a token. A verification value may include one or more numbers, letters, or any other suitable characters. A verification value can be generated dynamically, and thus can be a dynamic value that changes for each token transaction. In some embodiments, a verification value may be valid for a single transaction, or for multiple transactions. In some embodiments, a verification value may be generated based on one or more dynamic inputs and/or one or more static inputs. For example, a verification value can be generated using a dynamic data element, a token, a token expiration date, a token requestor identifier, and/or any other suitable information. An example of a verification value is a dCVV2.
As used herein, a “dynamic card verification value 2” (sometimes referred to as a “device verification value” or a “dCVV2”), may be a changing verification value. A dCVV2 can be an identifier associated with a payment account. For example, a dCVV2 can be a verification value submitted with a payment token or payment credentials of a payment account. In some embodiments, a dCVV2 may be 3, 4, 5 or more characters in length. In some embodiments, a dCVV2 can be generated based on one or more data elements. The inputs for a dCVV2 can include transaction-specific information and transaction-agnostic information. For example, a dCVV2 can be generated using one or more dynamic data elements, payment data (e.g., a token, a token expiry date, etc.), transaction data associated with a current transaction (e.g., a transaction amount, a transaction identifier, an acquirer bank identification number (BIN), a token requestor ID, etc.), one or more cryptographic keys, a cryptogram, a digital signature, a hash value (e.g., based on transaction data), and/or any other suitable information.
An “authorization request message” may be an electronic message that requests authorization for a transaction. In some embodiments, it is sent to a transaction processing computer and/or an issuer of a payment card to request authorization for a transaction. An authorization request message according to some embodiments may comply with ISO 8583, which is a standard for systems that exchange electronic transaction information associated with a payment made by a user 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), a PAN (primary account number or “account number”), a payment token, a user name, an expiration date, 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, acquirer bank identification number (BIN), card acceptor ID, information identifying items being purchased, 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 that responds to an authorization request. In some cases, it may be an electronic message reply to an authorization request message generated by an issuing financial institution or a transaction processing computer. 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 transaction processing computer) 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 transaction processing computer may generate or forward the authorization response message to the merchant.
As used herein, a “mobile device” may comprise any suitable electronic device that may be transported and 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), a technology for radio wireless local area networking of devices based on the IEEE 802.11 standards (i.e., WI-FI), a family of wireless broadband communication standards based on the IEEE 802.16 set of standards (i.e., WI-MAX), or any other communication medium that may provide access to a network such as the Internet or a private network. Examples of mobile devices include mobile phones (e.g. cellular phones), PDAs, tablet computers, net books, laptop computers, personal music players, hand-held specialized readers, etc. Further examples of mobile devices include wearable devices, such as smart watches, fitness bands, ankle bracelets, rings, earrings, etc., as well as automobiles with remote communication capabilities. A mobile 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 mobile device).
A “server computer” may include a powerful computer or cluster of computers. For example, the 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 be coupled to a database and may include any hardware, software, other logic, or combination of the preceding for servicing the requests from one or more client computers.
Messages between the computers, networks, and devices may be transmitted using a secure communications protocol such as, but not limited to, File Transfer Protocol (FTP); HyperText Transfer Protocol (HTTP); Secure Hypertext Transfer Protocol (HTTPS), Secure Socket Layer (SSL), ISO (e.g., ISO 8583) and/or the like.
The user device 120 may be any suitable device associated with the user 110. In some embodiments, the user device 120 may be a mobile device, a payment device, or a desktop computer.
The user 110 may be able to use the user device 120 to interact with the resource provider computer 130. For example, the user device 120 may be able to access a website or other information associated with the resource provider computer 130. In some embodiments, the user 110 can utilize the user device 120 for purchasing goods and/or services from the resource provider over the internet.
The user device 120 may store or have access to certain types of user information. For example, the user device 120 may store payment credentials such as a PAN, an address, a CVV, and an expiration date. The user device 120 may store personal information such as a name, address, email address, phone number, or any other suitable user 110 identification information. In some embodiments, the user device 120 may also store a payment token. Some or all of this data may be securely stored via hardware (e.g., a secure element) or software (e.g., host card emulation or other encryption techniques). The user device 120 may be able to use payment credentials and/or payment tokens for transactions. For example, the user device 120 may be able to transmit payment credentials and/or payment tokens over-the-air to the resource provider computer 130 during internet transactions and/or in-app transactions. Also, the user device 120 may be able to transmit (e.g., via near-field communication (NFC), a wireless technology standard for exchanging data between devices over short distances using short-wavelength radio waves (i.e., BLUETOOTH), radio frequency (RF), Quick Response (QR) code, etc.) payment credentials and/or payment tokens to an access device (e.g., a POS terminal) during in-person transactions.
The resource provider computer 130 may be associated with a resource provider, which 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.
The resource provider may accept multiple forms of payment and may use multiple tools to conduct different types of transactions. For example, the resource provider may sell goods and/or services via a website, and may accept payments over the Internet. Also, the resource provider may operate a physical store and use an access device for in-person transactions.
An example of the resource provider computer 130, according to some embodiments of the invention, is shown in
The computer readable medium 130D may comprise a token request module 130E, a verification data request module 130F, a transaction processing module 130G, and any other suitable software module. The computer readable medium 130D may also comprise code, executable by the processor 130A for implementing a method comprising sending, by a first computer, to a second computer, a request for a verification value associated with a transaction, the request including a token and a token requestor identifier, wherein the second computer generates a dynamic data element and a first verification value, and wherein the second computer stores a record including the dynamic data element, the token, and the token requestor identifier; receiving the first verification value from the second computer; and sending an authorization request message to a third computer for a transaction, the authorization request message including the first verification value, the token, and the token requestor identifier, and transaction data, wherein the third computer sends the verification value to the second computer, wherein the second computer generates a second verification value based on the dynamic data element, the token, and the token requestor identifier, wherein the second computer determines that the second verification value matches the first verification value, and wherein the second computer provides, to the third computer, a value credential associated with the token.
The token request module 130E may comprise code that causes the processor 130A to obtain a token. For example, the token request module 130E may contain logic that causes the processor 130A to send a token request message to the token provider computer 170. The token request message may include the user's payment credentials, a token requestor ID associated with the resource provider, and any other suitable information. The token request module 130E may also include instructions for associating a received token with the user 110 and storing the received token in the token database 130C.
The verification data request module 130F may comprise code that causes the processor 130A to obtain verification data. For example, the transaction data request module 130F may contain logic that causes the processor 130A to send a verification data request message to the token provider computer 170. The verification data message may include the user's payment token (e.g., stored in the token database 130C), a corresponding token expiration date, a token requestor ID associated with the resource provider, and any other suitable information. In some embodiments, there may be two different token requestor IDs associated with the resource provider. For example, a first token requestor ID may be used for requesting a payment token, while a second token requestor ID may be used for requesting a verification value.
In some embodiments, a verification data request message may include the user's payment credentials in addition to or instead of the payment token. The transaction data request module 130F may also include instructions for requesting verification data (e.g., a verification value) when a transaction has been initiated, and instructions for providing the verification value for inclusion in an authorization request message.
The transaction processing module 130G may comprise code that causes the processor 130A to process transactions. For example, the transaction processing module 130G may contain logic that causes the processor 130A to receive a transaction request from the user 110 for purchasing one or more goods or services. The transaction processing module 130G may include instructions for initiating a transaction authorization process, and for finalizing a transaction so that goods and/or services can be released. The transaction processing module 130G may, in conjunction with the processor 130A, submit an authorization request message including a payment token, a token expiration date, a token requestor ID, a verification value, and/or any other suitable information. The transaction processing module 130G may also include instructions for generating transaction receipts and storing transaction records (e.g., including transaction data, user information, a payment token, a verification value, etc.) in a transaction database.
In some embodiments, the resource provider computer 130 may encrypt the payment token, the token expiration date, the verification value, and/or any other suitable information sent in an authorization request message. For example, the resource provider computer 130 may encrypt the data with a public key associated with the transaction processing computer 150 or the token provider computer 170, which can in turn decrypt the data with a corresponding private key upon receipt of the authorization request message. In other embodiments, a symmetric key shared between two or more of the entities in the system may be used to encrypt and decrypt data and messages. Embodiments allow any other information and messages to be encrypted, such as communications between the resource provider computer 130 and token provider computer 170 related to payment tokens and verification values.
Referring back to
The transaction processing computer 150 may be disposed between the transport computer 140 and the authorizing entity computer 160. The transaction processing computer 150 may include data processing subsystems, networks, and operations used to support and deliver authorization services, exception file services, and clearing and settlement services. For example, the transaction processing computer 150 may comprise a server coupled to a network interface (e.g., by an external communication interface), and databases of information. The transaction processing computer 150 may be representative of a transaction processing network. An exemplary transaction processing network may include VISANET. Transaction processing networks such as VISANET are able to process credit card transactions, debit card transactions, and other types of commercial transactions. VISANET, in particular, includes a VIP system (Visa Integrated Payments system) which processes authorization requests and a Base II system which performs clearing and settlement services. The transaction processing computer 150 may use any suitable wired or wireless network, including the Internet.
An example of the transaction processing computer 150, according to some embodiments of the invention, is shown in
The computer readable medium 150D may comprise a transaction processing module 150E, a token processing module 150F, and any other suitable software module. The computer readable medium 150D may also comprise code, executable by the processor 150A for implementing a method comprising receiving, by a third computer, from a first computer, an authorization request message for a transaction, the authorization request message including a token, a token requestor identifier, and a first verification value; sending, by the third computer, the token, the token requestor identifier, and the first verification value to a second computer, wherein the second computer identifies a dynamic data element based on the token and the token requestor identifier, wherein the second computer generates a second verification value based on the dynamic data element, the token, and the token requestor identifier, and wherein the second computer determines that the second verification value matches the first verification value; receiving, by the third computer, from the second computer, a value credential associated with the token; and sending, by the third computer, the authorization request message and the value credential to an authorizing entity computer, wherein the authorizing entity computer authorizes the transaction based on the value credential.
The transaction processing module 150E may comprise code that causes the processor 150A to process transactions. For example, the transaction processing module 150E may contain logic that causes the processor 150A to analyze transaction risk, and to forward, authorize, or reject authorization request messages for payment transactions. The transaction processing module 150E may also include instructions for storing transaction records in the transaction database 150C. For example, the transaction database 150C may include a record of each completed transaction that includes transaction details (e.g. items purchased, amount, timestamp, a transaction identifier), resource provider information, user 110 information (e.g. a name, a phone number and/or other contact information, a payment token, an expiration date, etc.), and/or any other suitable information.
The token processing module 150F may comprise code that causes the processor 150A to process tokens. For example, the token processing module 150F may contain logic that causes the processor 150A to detokenize a payment token in an authorization request message. For example, the token processing module 150F may receive a payment token from the transport computer 140 and send the payment token to the tokenization computer 170 in order to request and obtain corresponding payment credentials.
In some embodiments, the token processing module 150F may include instructions for recognizing a payment token in an authorization request message that may be accompanied by a verification value. For example, payment tokens that can be used with a verification value (e.g., instead of a cryptogram) may be flagged, formatted in a distinct way, or otherwise recognizable.
Referring back to
The transaction processing computer 150, the transport computer 140, and the authorizing entity computer 160 may operate suitable routing tables to route authorization request messages and/or authorization response messages using payment credentials, merchant identifiers, or other account identifiers.
The token provider computer 170 may provide tokenization services. For example, the token provider computer 170 may be able to provide a payment token that represents a PAN and/or other payment credentials. For example, a token request message may be sent to the token provider computer 170, and the token provider computer 170 may then generate and/or associate a payment token with payment credentials in the token request message.
In some embodiments, the token provider computer 170 may also provide verification data or any other suitable information. For example, for a certain transaction, the token provider computer 170 may be able to generate a verification value for use with a payment token. The token provider computer 170 may be able to provide such information to the resource provider computer 130, the user device 120, and/or any other suitable entity.
In some embodiments, the token provider computer 170 may be associated with or combined with the transaction processing computer 150, the authorizing entity computer 160, the transport computer 140, or any other suitable entity. For example, in embodiments, tokenization services may be provided by the authorizing entity computer 160, the transaction processing computer 150, the transport computer 140, a third-party service provider, or any other suitable entity. Thus, the token provider computer 170 may be incorporated as a part of another entity in the system 100. In some embodiments, as shown in
An example of the token provider computer 170, according to some embodiments of the invention, is shown in
The computer readable medium 170D may comprise a tokenization module 170E, a detokenization module 170F, a verification data generation module 170G, a verification data validation module 17011, and any other suitable software module. The computer readable medium 170D may also comprise code, executable by the processor 170A for implementing a method comprising receiving, by a second computer, from a first computer, a request for a verification value associated with a transaction, the request including a token and a token requestor identifier; generating, by the second computer, a dynamic data element; storing, by the second computer, a record including the dynamic data element, the token, and the token requestor identifier; generating, by the second computer, a first verification value based on the root security value and the token; providing, by the second computer, the first verification value to the first computer; receiving, by the second computer, from a third computer, a request to validate the first verification value, the request including the first verification value, the token, and the token requestor identifier; identifying, by the second computer, the record including the dynamic data element based on the token and the token requestor identifier; generating, by the second computer, a second verification value based on the dynamic data element, the token, and the token requestor identifier; determining, by the second computer, that the second verification value matches the first verification value; and providing, by the second computer, to the third computer, a value credential associated with the token.
The tokenization module 170E may comprise code that causes the processor 170A to provide payment tokens. For example, the tokenization module 170E may contain logic that causes the processor 170A to generate a payment token and/or associate the payment token with a set of payment credentials. A token record may then be stored in the token record database 170C indicating that the payment token is associated with certain set of payment credentials, a certain user 110, and/or a certain resource provider (e.g., via a certain token requestor ID). In some embodiments, a static token (e.g., a token that can be used for multiple transactions) can be provided to a resource provider.
The detokenization module 170F may comprise code that causes the processor 170A to detokenize payment tokens. For example, the detokenization module 170F may contain logic that causes the processor 170A to identify a token record associated with a payment token in the token record database 170C. A set of payment credentials associated with the payment token (as indicated in the token record) can then be identified. In some embodiments, the detokenization module 170F may include instructions to detokenize a payment token in response to a detokenization request message (e.g., received from the transaction processing computer 150 or any other suitable entity). In some embodiments, the detokenization module 170F may include instructions to withhold detokenized payment credentials until a verification value is validated.
The verification data generation module 170G may comprise code that causes the processor 170A to generate verification data for a transaction. For example, the verification data generation module 170G may contain logic that causes the processor 170A to generate a verification value, a dynamic data element, and/or any other suitable verification data. The verification data generation module 170G may also include instructions for providing generated verification data to a requestor.
In some embodiments, a verification value may be cryptographically generated based on a payment token, a token expiration date, a dynamic data element, and/or a token requestor ID. In other embodiments, a verification value may also or alternatively be generated based on an acquirer BIN, a CVV key, one or more additional cryptographic keys, and/or any other suitable information. An example method for generating a verification value is described below with respect to
In some embodiments, the verification value may not be stored by the token provider computer 170. For example, the token provider computer 170 may store the payment token and/or token expiration date in the token record database 170C, but the token provider computer 170 may not store the verification value in the token record database 170C. In some embodiments, the verification value may be a one-time use value that is valid for one transaction. Accordingly, a unique verification value may be provided for each verification value request.
In some embodiments, a verification value may be formatted for inclusion in an authorization request message. For example, the verification value may be a string of 3, 4, or 5 digits, such that it can be placed in an existing field of an authorization request message. In some embodiments, the verification value can be a dCVV2.
As mentioned above, the verification data generation module 170G may also comprise code that causes the processor 170A to generate a dynamic data element. A dynamic data element may be used as an input when generating the verification value. In some embodiments, the dynamic data element may be different for each verification value and/or transaction. As a result, each verification value generated with a dynamic data element as an input may be unique.
In some embodiments, a dynamic data element may be a unique hexadecimal value (e.g., a 5-digit hex code). In other embodiments, a dynamic data element can be a random number, an ATC, or any other suitable value.
If utilized, an ATC can initially be set by the token provider computer 170 to a predetermined value. Thereafter, the ATC can be incremented with each transaction. Alternately, the ATC may be decremented from its initial predetermined value with each transaction. The ATC may be a value of any suitable length.
In some embodiments, an ATC be used as an input for generating a unique hexadecimal value. For example, a unique hexadecimal value can be created by encrypting and/or hashing an ATC.
In some embodiments, the verification data generation module 170G may include instructions for storing a dynamic data element used for generating a verification value. The dynamic data element may be associated with the token, token expiration date, and/or token requestor ID and stored in the token record database 170C. The stored dynamic data element (along with other information associated with and stored with the dynamic data element) can be referred to as a dynamic data element record or a verification value record (even if the verification value is not stored). This dynamic data element can be included as part of a payment token record.
Accordingly, even if a verification value is not stored, the verification value can be re-created based on the stored dynamic data element and other corresponding information. In some embodiments, the dynamic data element may not be provided to the token requestor, and may be kept private and secret at the token provider computer 170.
The verification data generation module 170G may include instructions for associating a verification value with token domain controls. As a result, when a token is used for a transaction and the corresponding verification value is being validated, domain controls associated with the verification value can be checked. A verification value can be associated with one or more token domain controls, and these domain controls can be indicated in a dynamic data element record. As a result, the domain controls can be stored without having to store the verification value. When a verification value is used for a transaction, the domain controls can be identified along with the dynamic data element during a validation process for the verification value.
As an example, a verification value can be linked to a certain token requestor ID, thereby indicating that only a certain token requestor can use the verification value and payment token. Additionally, a verification value can be associated with a limited time window (e.g., 1 minute, 10 minutes, 1 hour, etc.) during which a verification value is valid. Accordingly, the verification value can expire after being issued. Additional domain controls include restricting the transaction to a certain transaction mode (e.g., in-person transactions or internet-based transactions), a merchant ID, an acquirer BIN, a maximum transaction amount, an allowed range of transaction locations, and/or any other suitable domain restrictions.
The verification data validation module 170H may comprise code that causes the processor 170A to validate verification data for a transaction. For example, the verification data validation module 170H may contain logic that causes the processor 170A to determine whether a verification value is authentic and being used within assigned token domain controls.
In some embodiments, the token provider computer 170 may receive a payment token, a token expiration date, a verification value, a token requestor ID, and/or any other suitable information that has been submitted in an authorization request message by a resource provider computer 130. The verification data validation module 170H may include instructions for using the received data and/or stored data to validate the use of the token and verification value.
In some embodiments, the verification data validation module 170H may, in conjunction with the processor 170A, identify a dynamic data element associated with the verification value. The dynamic data element may be stored in a dynamic data element record in the token record database 170C, and the dynamic data element may be identified based on a token, a token expiration date, a token requestor ID, an acquirer BIN, and/or any other suitable information that is both stored in the token record database 170C and received via the authorization request message.
In some embodiments, the token provider computer 170 can identify a dynamic data element record based only on the payment token and/or token expiration date. For example, the token provider computer 170 may only issue one verification value at a time for a given payment token. Accordingly, the token provider computer 170 may be able to identify the single valid dynamic data element record based solely on the payment token (e.g., without the token requestor ID, ATC, etc.). In other embodiments, the token provider computer 170 can issue multiple verification values for a given payment token, but each associated dynamic data element record can be uniquely identified based on a payment token and an ATC. In further embodiments, the token requestor ID may be used as a tag for a dynamic data element record, and thus the token requestor ID can be used to identify the dynamic data element record (e.g., in conjunction with the payment token, token expiration date, and/or ATC).
The verification data validation module 170H may then, in conjunction with the processor 170A, regenerate the verification value based on the identified dynamic data element and the received token, the received token expiration date, the received token requestor ID, and/or any other suitable information. The regenerated verification value can be compared with the received verification value. If the values match, the received verification value may be considered authentic and validated.
The verification data validation module 170H may include instructions for checking that any domain controls associated with the verification value (e.g., as indicated in the token record database) are not being violated by the current transaction. As a result, the token provider computer 170 can ensure that the payment token is being used within allowed domains.
Further, the verification data validation module 170H may include instructions to initiate detokenization of a payment token if certain criteria are met. For example, if a verification value is validated and token domain restrictions are met, a set of payment credentials associated with the payment token can be retrieved and provided.
It will be apparent to one of ordinary still in the art that the first encryption key 520, the second encryption key 526, the third encryption key 530 and the fourth encryption key 534 may take any suitable value. In an embodiment of the present invention, the first encryption key 520, the second encryption key 526, and the fourth encryption key 534 can be equivalent and of a different value from the third encryption key 530. Other permutations of the encryption key values utilized in the methodology of
In a preferred embodiment, the first encryption key 520, the second encryption key 526, the third encryption key 530, and the fourth encryption key 534 take the value of unique keys derived from data existing at the token provider computer 170. For example, each unique key can be derived from a master derivation key. Further, a CVV key (e.g., a key used to create a CVV based on an account number and/or an expiration date) can also be used to create the verification value.
A second evaluation can then be performed again beginning with the most significant digit of Block G 536 and examining each sequential nibble. If a nibble contains a hexadecimal value ranging from ten (A) to fifteen (F), inclusive, that value may be extracted 310. The extracted value can then be decimalized by subtracting the hexadecimal value A from the extracted value resulting in a decimalized value ranging from zero to five 315. This decimalized value can then be concatenated on the right to the right most value of the holding string 320.
Once all nibbles in Block G have been twice examined as described, the three most-significant (i.e. leftmost) nibbles of the holding string may be extracted 325. This 3-digit value can be the verification value for the transaction. Other numbers of bits (e.g., 1 bit, 2 bits, 4 bits, 5 bits, 6 bits, etc.) may be extracted from the twice-examined nibble string to generate the verification value for a transaction. Furthermore, different nibbles, such as the rightmost nibbles, may be used as the verification value for a transaction. The three leftmost nibbles, however, represent a preferred embodiment.
Once generated, the verification value can be provided to the token requestor 330. The verification value can be entered into an existing data field for a transaction, such as a CVV data field or any other suitable data field.
A method 500 according to embodiments of the invention can be described with respect to
The various messages described below may use any suitable form of communication. In some embodiments, a request or response may be in an electronic message format, such as an e-mail, a short messaging service (SMS) message, a multimedia messaging service (MMS) message, a hypertext transfer protocol (HTTP) request message, a transmission control protocol (TCP) packet, or a web form submission. The request or response may be directed to any suitable location, such as an e-mail address, a telephone number, an internet protocol (IP) address, or a uniform resource locator (URL). In some embodiments, a request or response may comprise a mix of different message types, such as both email and SMS messages.
At step S502, a user may cause a user device 521 to provide payment credentials to a resource provider computer 531. For example, the user may provide payment credentials for a transaction, or during an account registration process. In other embodiments, the user may provide a payment token.
As an example, the user may input (e.g., manually type) the payment credentials into a checkout webpage of an ecommerce website for an internet transaction. Alternatively, the user may provide payment credentials for an in-person transaction by presenting the user device 521 or a payment card to an access device, such that the user device 521 can transmit the payment credentials over-the-air to the access device.
As described in steps S504-S508, the resource provider computer 531 may obtain a payment token to represent the payment credentials. For example, the resource provider computer 531 may want to store the user's payment information (e.g., for use in future transactions), but may only store payment tokens.
At step S504, the resource provider computer 531 may send a token request message to the token provider computer 570. The token request message may include the user's payment credentials (e.g., a PAN, expiration date, CVV, name, address, etc.). The token request message may also include information associated with the resource provider computer 531, such as a token requestor ID, a merchant ID, a physical address or IP address, an acquirer BIN, and/or any other suitable information.
At step S506, the token provider computer 570 may receive the user's payment credentials from the resource provider computer 531, and the token provider computer 570 may generate a payment token and/or token expiration date for the payment credentials. The token provider computer 570 may store a record of the payment token and token expiration date in a token record database, the record indicating that the payment token is associated with the payment credentials.
In some embodiments, the payment token may be a static token that can be used for multiple transactions. Additionally, in some embodiments, the payment token may only be provided to the resource provider computer 531 and not any other token requestor. In this case, a domain control may be assigned to the payment token specifying that only the resource provider computer 531 is authorized to use the payment token for a transaction. The payment token may only be considered valid if accompanied by an approved token requestor ID or other identifier associated with the resource provider computer 531.
In other embodiments, the payment token may be provided to and used by multiple token requestors. In this case, there may be multiple token requestor IDs associated with the payment token in the token record database.
At step S508, the token provider computer 570 may send a token response message back to the resource provider computer 531. The token response message may include the payment token, token expiration date, token requestor ID, and/or any other suitable information.
At step S510, the resource provider computer 531 may store the payment token and token expiration date (e.g., in a token database or user database). The payment token may be associated with a user account, a user device 521 identifier, or otherwise associated with the user. As a result, the payment token can be identified and utilized for future transactions between the user and resource provider. Thus, the resource provider computer 531 can be a card-on-file merchant that stores a payment token instead of a PAN.
At a later time, the user may desire to initiate a transaction via the user device 521. For example, the user may use the user device 521 to access a merchant website associated with the resource provider computer 531. At step S512, the user may select one or more goods or services at the website, and then initiate a checkout process. Alternatively, the user may approach a merchant POS terminal for an in-person transaction, and the user may present the user device 521 or a payment card for the transaction.
At step S514, the resource provider computer 531 may identify the payment token and/or token expiration date associated with the user and/or user device 521. For example, the payment token may be identified based on a user account, user device identifier, a user name and address, or any other suitable information.
Before submitting an authorization request message for the transaction, the resource provider computer 531 may obtain a verification value for use with the payment token for this transaction. At step S516, the resource provider computer 531 may send a verification value request message to the token provider computer 570. The verification value request message may include the payment token, the token expiration date, and/or any other suitable user information or payment information. The verification value request message may also include information about the resource provider computer 531, such as a token requestor ID, a merchant ID, an IP address or physical address, an acquirer BIN, and/or any other suitable information.
In some embodiments, the token request and verification value request can be combined into one request. For example, if the resource provider computer 531 is not a card-on-file merchant, it may not store the user's payment token, and thus may obtain both the payment token and verification value at the same time.
At step S518, the token provider computer 570 may identify the token record in the token record database based on the payment token, token expiration date, token requestor ID, acquirer BIN, and/or any other suitable information in the verification value request message. The token provider computer 570 may authenticate the request, for example, by verifying that the information in the request is valid.
The token provider computer 570 may then generate a dynamic data element. The dynamic data element may be a unique hexadecimal value, a random value, an ATC, a timestamp, or any other suitable value. In some embodiments, the dynamic data element may include 5 or more digits.
The token provider computer 570 may also generate a verification value. The verification value may be generated based on the dynamic data element, the payment token, the token expiration date, the token requestor ID, an acquirer BIN, one or more cryptographic keys, and/or any other suitable information. In some embodiments, the verification value can have one or more static inputs (e.g., a payment token, an expiration date, and a token requestor ID) and one or more dynamic inputs (e.g., a unique hex value, an ATC, a timestamp, and a transaction amount). The verification value may be a unique value (e.g., as a result of being generated based on the dynamic data element). An example algorithm for generating a verification value is described above with respect to
The token provider computer 570 may store the dynamic data element (e.g., in a token record or a dynamic data element record). The stored dynamic data element may be associated with the payment token, token expiration date, token requestor ID, acquirer BIN, a certain timeframe, and/or any other suitable information. Some or all of this corresponding information can be used as tags for later identifying the dynamic data element. For example, the dynamic data element can be identified for validating a transaction based on transaction information (e.g., payment token, token expiration date, token requestor ID, acquirer BIN, and/or any other suitable information) received in an authorization request message.
In some embodiments, the token provider computer 570 does not store the verification value. However, token provider computer 570 may be able to re-create the verification value based on the dynamic data element, the payment token, the token expiration date, the token requestor ID, one or more cryptographic keys associated with the payment token, an acquirer BIN, and/or any other information used to generate the original verification value. In some embodiments, some or all of this information may be stored. For example, the dynamic data element can be stored as described above, and the dynamic data element can be identified and used to validate the verification value when the verification value is received during a transaction. In some embodiments, some or all of this information may not be stored, and instead the verification value can be regenerated based on information received with the payment token for a transaction.
The cryptographic keys can be stored or generated based on a master derivation key. The token provider computer 570 may also associate one or more domain controls with the verification value in order to place constraints on the use of the verification value. This can be accomplished by storing the domain controls in the token record database along with the dynamic data element (e.g., in a token record or a dynamic data element record). As a result, when the dynamic data element is identified for a transaction (as described above), the domain controls for the transaction can also be identified. In further embodiments, the domains of a current transaction (e.g., an in-person transaction at a certain merchant) can be used to identify the correct dynamic data element. Thus, domain controls associated with the verification value can be stored even when the verification value is not stored.
As an example of a domain control, the verification value may be associated with a context-specific use. This can include associating the verification value with the resource provider computer's token requestor ID and/or the transport computer's acquirer BIN, such that the verification value can only be used for a transaction when accompanied by the token requestor ID and/or the acquirer BIN. The verification value may also be associated with a limited lifespan (e.g., only valid for a certain period of time), a certain payment mode (e.g., internet-based transactions or in-person transactions), a maximum transaction amount, an actual transaction amount, and/or any other suitable token domain.
At step S520, the token provider computer 570 may send a verification value response message back to the resource provider computer 531. The verification value response message may include the verification value, the payment token, the token expiration date, and/or any other suitable information. In some embodiments, the token response message may not include the dynamic data element. In other embodiments, the token response message may not include a first dynamic data element (e.g., a unique hexadecimal value), but the token response may include a second dynamic data element (e.g., an ATC). Thus, a random value can be kept secret and stored, while an ATC can be sent to the resource provider computer 531.
At step S522, the resource provider computer 531 may generate an authorization request message for the transaction. The authorization request message may include the payment token, token expiration date, the verification value, the resource provider computer's token requestor ID, transaction information (e.g., information about selected goods or services, a transaction amount, a merchant ID), an acquirer BIN, an ATC (e.g., if received from the token provider computer 570), and/or any other suitable information.
In some embodiments, the payment information may be included in existing authorization request message fields. For example, the payment token may be placed in an existing PAN field, the verification value may be placed in an existing CVV2 field, and/or the token expiration date may be placed in an existing PAN expiration date field. Additionally, the payment token, verification value, and any other suitable information may be encrypted using any suitable encryption technique (e.g., using a public key associated with the token provider computer 570 or transaction processing computer 550).
At step S524, the resource provider computer 530 may send the authorization request message to the transport computer 540. At step S526, the transport computer 540 may forward the authorization request message to the transaction processing computer 550. The transaction processing computer 550 may then interact with the token provider computer 570 in order to detokenize the payment token.
At step S528, the transaction processing computer 550 may send a detokenization request message to the token provider computer 570. The detokenization request message may include information from the authorization request message, such as the payment token, the token expiration date, the verification value, the token requestor ID, a transaction ID, an acquirer BIN, an ATC, and/or any other suitable information.
At step S530, the token provider computer 570 may validate the verification value. For example, the token provider computer 570 may identify a token record (and/or a dynamic data element record) in the token vault based on the payment token, the token expiration date, the token requestor ID, the acquirer BIN, the ATC, and/or any other suitable information. The token record and/or the dynamic data element record may include a dynamic data element.
The token provider computer 570 may regenerate the verification value based on information found in the token record (or dynamic data element record) and/or information received in the authorization request message. For example, inputs used for generating a second verification value can include the dynamic data element from the token record, as well as the payment token, token expiration date, token requestor ID, acquirer BIN, and/or ATC from the authorization request message.
The token provider computer 570 may then compare the verification value received in the authorization request message with the newly regenerated verification value. If the two verification values match, the received verification value can be considered valid and authentically associated with the payment token.
The token provider computer 570 may also identify one or more domain controls associated with the verification value (e.g., as indicated in the token record or dynamic data element record). The token provider computer 570 may determine whether the current authorization request message violates any domain controls. For example, the token provider computer 570 can determine whether the payment token and verification value are being used within an allowed timeframe, being used for a transaction underneath a maximum threshold value, being submitted by an allowed merchant, token requestor, and/or acquirer, and otherwise check for approved usage conditions.
The token provider computer 570 may also determine whether the received ATC matches an expected value. For example, the token provider computer 570 may have stored an ATC used to generate the verification value, and the token provider computer 570 may expect to receive that same ATC in the next detokenization request associated with the payment token and/or token requestor ID.
In some embodiments, if the verification value is validated and the domain controls are met, the token provider computer 570 may proceed to detokenize the payment token. At step S532, the token provider computer 570 may identify the PAN and/or other payment credentials associated with the payment token. For example, the payment credentials may be stored in the token record.
At step S534, the token provider computer 570 can send a detokenization response message back to the transaction processing computer 550. The detokenization response message may include the payment credentials, the payment token, a transaction ID, and/or any other suitable information. The token provider computer 570 may also increase or change an ATC to the next incremental value.
At step S536, the transaction processing computer 550 can add the payment credentials to the authorization request message. In some embodiments, the transaction processing computer 550 may also remove the payment token, token expiration date, verification value, and/or any other suitable information from the authorization request message.
At step S538, the transaction processing computer 550 may forward the augmented authorization request message to the authorizing entity computer 560.
At step S540, the authorizing entity computer 560 may receive the authorization request message and determine whether the transaction is authorized. For example, the issuer computer 160 may determine whether an account associated with the payment credentials has sufficient funds, as well as perform risk analysis.
At step S542, the authorizing entity computer 560 may then send an authorization response message back to the transaction processing computer 550 that indicates whether the transaction is authorized.
At step S544, the transaction processing computer 550 may replace the PAN and other sensitive payment credentials in the authorization response message with the payment token, the token expiration date, and/or any other suitable information. In some embodiments, the transaction processing computer 550 may query the token provider computer 570 for the payment token.
At step S546, the transaction processing computer 550 may forward the authorization response message to the transport computer 540. At step S548, the transport computer 540 may forward the authorization response message to the resource provider computer 531.
At step S550, the resource provider computer 531 may release the purchased goods and/or services. Additionally, the resource provider computer 531 may inform the user device 120 that the transaction was successfully authorized. For example, the resource provider computer 531 may display a transaction success window on a website or email a transaction receipt. Settlement can happen at a later time (e.g., in a batch settlement process).
Embodiments of the invention include a number of alternatives to the above-described system and method. For example, in some embodiments, a verification value can be generated further based on transaction information. Additionally, in some embodiments, an ecommerce enabler can perform some transaction processing and token management functionality on behalf of the resource provider computer. Also, in some embodiments, entities other than the resource provider computer can request and utilize a payment token and verification value. Some of the scenarios will now be briefly described below.
As described above with respect to step S518, the verification value can be generated based on the dynamic data element, the payment token, the token expiration date, the token requestor ID, and/or any other suitable information. In further embodiments, information related to the transaction can also be used as inputs for generating the verification value. For example, at step S516, the resource provider computer 531 may add a transaction amount, information about selected goods or services, a transaction ID, and/or any other suitable information to the verification value request message. The token provider computer 570 can optionally use this additional information when generating the verification value (instead of or in addition to the above-described inputs). Additionally, token domain controls can be assigned based on this transaction information (e.g., a maximum transaction amount, a set of goods or services for which a verification value can be used, etc.).
As a result, the verification value can be linked with a specific transaction. For example, at step S530, the token provider computer 570 may regenerate the verification value further based on the transaction information (e.g., a transaction amount, information about selected goods or services, a transaction ID), which may have been sent via the authorization request message. If the same transaction information is not provided in the authorization request message, the verification value may be regenerated incorrectly.
In other embodiments, the verification value may be requested before the transaction is actually initiated. For example, the verification value request message at step S516 may be sent before the transaction is initiated at step S512. As a result, the verification value may be ready for use when the transaction is initiated, such that transaction processing can occur more quickly. In this scenario, the transaction information may not yet be available at step S518, and thus may not be used to generate the verification value.
As mentioned above, embodiments of the invention also allow for other entities to request payment tokens and verification values. In some embodiments, any entity that can request and/or use a token can also request and/or use a verification value.
For example, a user device may be able to request a payment token and/or verification value from the token provider computer. When sending a payment token request and/or token verification request, the user device may include additional information such as a digital wallet identifier, a user device identifier, and/or any other suitable information.
A user device may also be able to locally store the information and use it for transactions. A user device may be able to use a payment token and verification value for in-person transactions by transmitting the data (e.g., via NFC) to a nearby access device (e.g., a Point of Sale device) for a transaction. A user device may also be able to use a payment token and verification value for over-the-air transactions (e.g., by inputting the data into a merchant checkout webpage).
Accordingly, in some embodiments, a payment token and verification value can be requested and utilized by a number of entities. An entity that sends a token request message (or a verification value request message) may be referred to as a “first computer.” Accordingly, a resource provider computer, a user device, and an ecommerce enabler computer can be considered examples of a first computer. In some embodiments, an entity that provides a payment token and/or a verification value may be referred to as a “second computer.” Accordingly, the token provider computer can be considered an example of a second computer. In some embodiments, during a transaction, a separate “third computer” may request detokenization and/or token validation. A transaction processing computer can be considered an example of a third computer.
In a further embodiment, the tokenization services may be provided by the transaction processing computer, or another suitable entity. Accordingly, detokenization and validation steps in S530 and S532 can be performed by the transaction processing computer, and the messages sent in steps S528 and S534 may no longer take place.
Also, in some embodiments, other entities can query the token provider computer for detokenization. For example, instead of the transaction processing computer, the authorizing entity computer or the transport computer can send the detokenization request message at step S528.
In some embodiments, additional entities and computers may be added to the system. For example,
In the system 600, the user 610 may select and purchase a good or service from the resource provider computer 630 through a third-party webpage (e.g., instead of a merchant website provided by the resource provider computer). For example, the resource provider's goods may be shown on a content publisher computer 622 webpage, and an enabler computer 625 may facilitate purchasing the goods directly from the listing on the content publisher computer 622 webpage (e.g., without being redirected to a resource provider webpage).
In such a scenario, a content publisher computer 622 may be associated with a website provider, mobile application provider, social network provider (e.g., TWITTER or FACEBOOK), or any other suitable entity which may provide content to the user device 620 (e.g., via a website or mobile application).
An enabler computer 625 may be associated with an ecommerce enabler that can provide transaction enabling services. For example, the enabler computer 625 may facilitate ecommerce transactions for the resource provider. Exemplary ecommerce enablers include STRIPE, BRAINTREE, and TWOTAPP. In some embodiments, the enabler computer 625 may provide internet commerce functionality to a resource provider website. In some embodiments, the enabler computer 625 may allow the resource provider to conduct ecommerce transactions through a third-party mobile application or website, such as through content published by the content publisher computer 622. For example, the resource provider computer 630 may post information about a product to a social network site (e.g., provided by the content publisher computer 622). An enabler computer 625 application or service may be integrated into content published by the content publisher computer 622 such that the user 610 can purchase the product immediately from product post, instead of being redirected to the merchant's website. For example, the user 610 may select a “buy now” icon which is hosted by the enabler computer 625 within the content publisher's content, and a purchase process may be initiated (e.g., the content publisher computer 622 may inform the enabler computer 625 that a transaction was requested).
In this scenario, the enabler computer 625 may collect a user's payment credentials, obtain a payment token from the token provider computer 670, and/or obtain a verification value associated with the payment credentials on behalf of the resource provider computer 630. The enabler computer 625 may use its own token requestor ID for requesting token information and submitting transactions, or it may use a token requestor ID associated with the resource provider computer 630. In some embodiments, the enabler computer 625 may locally store a payment token associated with the user 110 on behalf of the resource provider computer 630.
Additionally, the enabler computer 625 can submit an authorization request message to the transport computer 640 (or the resource provider computer 630) and otherwise process the transaction on behalf of the resource provider computer 630. In some embodiments, the resource provider computer 630 may have registered with the enabler computer 625 beforehand and provided information for processing the transaction (e.g., an acquirer BIN, a merchant ID, information about goods and services, etc.). Further, in other embodiments, the enabler computer 625 can provide information about the payment token, verification value, and transaction to the resource provider computer 630, and the resource provider computer 630 can then generate and submit the authorization request message.
The enabler computer 625 may also receive the authorization response message on behalf of the resource provider computer 630. The enabler computer 625 can then inform the resource provider computer 630 that goods can be released, and inform the user device 620 (e.g., via the content publisher computer 622) that the transaction was successfully authorized.
In some embodiments, the enabler computer 625 may provide information about the transaction to the resource provider computer 630, and then the resource provider computer 630 may itself submit the authorization request message for the transaction. In this scenario, the enabler computer 625 may provide information about the goods or services selected for purchase, a payment token, and/or any other suitable information. The enabler computer 625 may also request a verification value for the transaction, and then provide the verification value to the resource provider computer 630.
This can cause a conflict of token requestor IDs used with a verification value. For example, the enabler computer's token requestor ID may be used to obtain the verification value from the token provider computer 670, while the resource provider computer's token requestor ID may be submitted in an authorization request message for the transaction. In other words, the token provider computer 670 may receive a first token requestor ID during the verification value request message, and then receive a different second token requestor ID in the detokenization request message. This token requestor ID discrepancy may be grounds for rejecting the transaction.
In some embodiments, in order to allow this use-case to proceed without rejecting the transaction, the validation of a verification value may take place without using the token requestor ID. The verification value can instead be validated based on other information and domain controls (e.g., as described above). Accordingly, in some embodiments, a payment token transaction may be approved even if a second token requestor ID received with a verification value in an authorization request message does not match a first token requestor ID used to obtain the verification value.
As mentioned above, embodiments of the invention also apply to scenarios outside of payment transactions. For example, the user may have access credentials for accessing a restricted physical space (e.g., a building, venue, or event space) or restricted information (e.g., a secure online database, a personal account).
The user's access credentials can be tokenized. For example, the resource provider computer may provide access to a restricted area or secure information. The resource provider computer can interact with the token provider computer for obtaining an access token associated with the access credentials, similar to the above description of obtaining a payment token associated with payment credentials. The resource provider computer can locally store the access token associated with the user.
Then, when the user wishes to gain access, the resource provider computer can obtain a verification value to submit with the access token. The access token and verification value can be sent to the authorizing entity computer that can determine whether or not to grant access. Also, a transaction processing computer can detokenize the access token, so that the access credentials can be sent to the authorizing entity computer.
Accordingly, access credentials can similarly be protected by use of an access token, and the access token can be similarly authenticated via a verification value. Embodiments equally apply to other suitable account scenarios where account credentials of any suitable sort can be tokenized for protection.
Embodiments of the invention have a number of advantages. For example, in embodiments of the invention, a payment token can be used to replace payment credentials, thereby improving transaction security. If a payment token is stolen or otherwise compromised, it can be canceled and reissued without having to change the actual payment credentials. Also, in some embodiments, the payment token can only be used for one payment channel (e.g., one merchant), so cancelling the payment token does not interrupt transactions for other payment channels (e.g., other merchants that have different payment tokens that represent the same payment credentials).
Embodiments of the invention also advantageously provide a verification value for a transaction. In some embodiments, a payment token is not accepted unless accompanied by an authentic verification value. As a result, transaction security and token control are improved, as each transaction can be individually pre-approved, and individually verified before being authorized.
Embodiments further advantageously use a centrally-generated dynamic data element as an input when generating a verification value. In some embodiments, while the verification value is provided to a token requestor, the dynamic data element can be stored and kept secret. Further, the algorithm for generating the dynamic data element can also be kept secret, since it is stored at a secure central computer and not distributed. This can lead to a verification value that is unique and that cannot be forged. For example, a fraudster cannot guess any secret dynamic data elements stored at the token provider computer, so a fraudster cannot guess or re-create any valid verification values. If the fraudster were to use some random value (instead of an authentic dynamic data element) as an input for creating a fraudulent verification value, the fraudulent verification value would be rejected because there would not be an associated dynamic data element stored at the token provider computer. In other words, the fraudulent verification value would be not be verifiable when submitted for a transaction.
Embodiments further provide an improved verification value. Since the same entity (e.g., the token provider computer) can both generate the verification value and validate the verification, there may be no need to share a secret with any other entities. As a result, the building blocks for the verification value (e.g., dynamic data elements used as input, the generation algorithm, and/or the encryption keys) can be truly random and unpredictable. Thus, the verification value can be dynamic, random, and unpredictable.
Further, embodiments allow a verification value to be used without having to store the verification value (i.e., no need to store sensitive security information). Instead, a dynamic data element used as input for the verification value can be stored. Additionally, embodiments can decrease the amount of storage capacity needed at a central token provider. For example, instead of storing a large cryptogram or multiple encryption keys, a smaller dynamic data element can be stored, and specific keys can be derived when needed.
Embodiments of the invention can also advantageously place unique and varying domain controls on different payment tokens and verification values. Since the dynamic data element and other information associated with the verification value can be centrally stored at the token provider computer, any suitable domain controls can be linked with a specific verification value at the token provider computer. As a result, even if the verification value is not stored at the token provider computer, domain controls can still be applied to the verification value. For example, when a verification value is received for a transaction, a token record and/or dynamic data element record associated with the verification value can be identified, and the record can include domain controls associated with the verification value.
This means that a verification value cannot be used by a malicious party for an unapproved transaction, even if the verification value is compromised. For example, a fraudster may attempt to use a compromised payment token and verification value for a fraudulent transaction. However, if the transaction does not conform to the assigned domain controls (e.g., taking place at an allowed merchant or within an allowed time frame, under a certain maximum transaction amount, submitted with the correct token requestor ID, etc.), the transaction can be denied.
In some embodiments, each verification value can be generated and provided individually. Accordingly, domain controls can be tailored and assigned for each intended transaction. For example, the token provider computer can assign token domain controls based on the identity of the token requestor, the intended transaction amount (or maximum limit), the intended merchant, and/or any other suitable transaction parameters. As a result, each transaction can be individually controlled and limited.
Embodiments of the invention can also advantageously introduce these methods for controlling payment tokens through verification values and dynamic data elements without requiring the merchant computer, acquirer computer, or issuer computer to make any changes. For example, the payment token and verification value can be submitted according to normal authorization procedures. The verification value can be sent in an existing “CVV” field in an authorization request message without making any formatting or procedural changes, as the verification value can have the same format as a CVV value. In contrast, merchant and acquirer system updates would be needed in order to accommodate token cryptograms for online transactions. Token cryptograms typically are not formatted similarly to any other values that are already used (and can be omitted) during transaction processing. Additional fields would be needed for the authorization request message and for merchant checkout webpages, and additional protocols would be needed to accept and send token cryptograms.
Further, in some embodiments, a merchant (or other token requestor) may not need to make changes to support verification value generation. For example, a merchant may not have to manage a secure data storage to protect encryption keys and cryptogram-generation algorithms. Instead, verification values can be obtained from a central entity (e.g., a token provider computer).
A computer system will now be described that may be used to implement any of the entities or components described herein. Subsystems in the computer system are interconnected via a system bus. Additional subsystems include a printer, a keyboard, a fixed disk, and a monitor which can be coupled to a display adapter. Peripherals and input/output (I/O) devices, which can couple to an I/O 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.
As described, the inventive service may involve implementing one or more functions, processes, operations or method steps. In some embodiments, the functions, processes, operations or method steps may be implemented as a result of the execution of a set of instructions or software code by a suitably-programmed computing device, microprocessor, data processor, or the like. The set of instructions or software code may be stored in a memory or other form of data storage element which is accessed by the computing device, microprocessor, etc. In other embodiments, the functions, processes, operations or method steps may be implemented by firmware or a dedicated processor, integrated circuit, etc.
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++ or Perl 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, such as a 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 CD-ROM. Any such computer-readable medium may reside on or within a single computational apparatus, and may be present on or within different computational apparatuses within a system or network.
While certain exemplary embodiments have been described in detail and shown in the accompanying drawings, it is to be understood that such embodiments are merely illustrative of and not intended to be restrictive of the broad invention, and that this invention is not to be limited to the specific arrangements and constructions shown and described, since various other modifications may occur to those with ordinary skill in the art.
As used herein, the use of “a”, “an” or “the” is intended to mean “at least one”, unless specifically indicated to the contrary.
This application is a non-provisional application of and claims the benefit of the filing date of U.S. Provisional Application No. 62/263,393, filed on Dec. 4, 2015, which is herein incorporated by reference in its entirety for all purposes.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5280527 | Gullman | Jan 1994 | A |
| 5613012 | Hoffman | Mar 1997 | A |
| 5781438 | Lee | Jul 1998 | A |
| 5883810 | Franklin | Mar 1999 | A |
| 5930767 | Reber | Jul 1999 | A |
| 5953420 | Matyas, Jr. | Sep 1999 | A |
| 5953710 | Fleming | Sep 1999 | A |
| 5956699 | Wong | Sep 1999 | A |
| 6000832 | Franklin | Dec 1999 | A |
| 6014635 | Harris | Jan 2000 | A |
| 6044360 | Picciallo | Mar 2000 | A |
| 6163771 | Walker | Dec 2000 | A |
| 6227447 | Campisano | May 2001 | B1 |
| 6236981 | Hill | May 2001 | B1 |
| 6267292 | Walker | Jul 2001 | B1 |
| 6327578 | Linehan | Dec 2001 | B1 |
| 6341724 | Campisano | Jan 2002 | B2 |
| 6385596 | Wiser | May 2002 | B1 |
| 6422462 | Cohen | Jul 2002 | B1 |
| 6425523 | Shem Ur | Jul 2002 | B1 |
| 6453301 | Niwa | Sep 2002 | B1 |
| 6592044 | Wong | Jul 2003 | B1 |
| 6625135 | Johnson | Sep 2003 | B1 |
| 6636833 | Flitcroft | Oct 2003 | B1 |
| 6694431 | Binding | Feb 2004 | B1 |
| 6748367 | Lee | Jun 2004 | B1 |
| 6805287 | Bishop | Oct 2004 | B2 |
| 6879965 | Fung | Apr 2005 | B2 |
| 6891953 | DeMello | May 2005 | B1 |
| 6901387 | Wells | May 2005 | B2 |
| 6931382 | Laage | Aug 2005 | B2 |
| 6938019 | Uzo | Aug 2005 | B1 |
| 6941285 | Sarcanin | Sep 2005 | B2 |
| 6980670 | Hoffman | Dec 2005 | B1 |
| 6990470 | Hogan | Jan 2006 | B2 |
| 6991157 | Bishop | Jan 2006 | B2 |
| 6993652 | Medvinsky | Jan 2006 | B2 |
| 7051929 | Li | May 2006 | B2 |
| 7069249 | Stolfo | Jun 2006 | B2 |
| 7103576 | Mann, III | Sep 2006 | B2 |
| 7113930 | Eccles | Sep 2006 | B2 |
| 7136835 | Flitcroft | Nov 2006 | B1 |
| 7177835 | Walker | Feb 2007 | B1 |
| 7177848 | Hogan | Feb 2007 | B2 |
| 7194437 | Britto | Mar 2007 | B1 |
| 7209561 | Shankar et al. | Apr 2007 | B1 |
| 7246231 | Tariq | Jul 2007 | B2 |
| 7264154 | Harris | Sep 2007 | B2 |
| 7287692 | Patel | Oct 2007 | B1 |
| 7290141 | Sengodan | Oct 2007 | B2 |
| 7292999 | Hobson | Nov 2007 | B2 |
| 7350230 | Forrest | Mar 2008 | B2 |
| 7353382 | Labrou | Apr 2008 | B2 |
| 7379919 | Hogan | May 2008 | B2 |
| RE40444 | Linehan | Jul 2008 | E |
| 7415443 | Hobson | Aug 2008 | B2 |
| 7444676 | Asghari-Kamrani | Oct 2008 | B1 |
| 7469151 | Khan | Dec 2008 | B2 |
| 7548889 | Bhambri | Jun 2009 | B2 |
| 7567934 | Flitcroft | Jul 2009 | B2 |
| 7567936 | Peckover | Jul 2009 | B1 |
| 7571139 | Giordano | Aug 2009 | B1 |
| 7571142 | Flitcroft | Aug 2009 | B1 |
| 7580898 | Brown | Aug 2009 | B2 |
| 7584153 | Brown | Sep 2009 | B2 |
| 7593896 | Flitcroft | Sep 2009 | B1 |
| 7606560 | Labrou | Oct 2009 | B2 |
| 7627531 | Breck | Dec 2009 | B2 |
| 7627895 | Gifford | Dec 2009 | B2 |
| 7650314 | Saunders | Jan 2010 | B1 |
| 7685037 | Reiners | Mar 2010 | B2 |
| 7702578 | Fung | Apr 2010 | B2 |
| 7707120 | Dominguez | Apr 2010 | B2 |
| 7712655 | Wong | May 2010 | B2 |
| 7734527 | Uzo | Jun 2010 | B2 |
| 7753265 | Harris | Jul 2010 | B2 |
| 7761374 | Sahota | Jul 2010 | B2 |
| 7770789 | Oder, II | Aug 2010 | B2 |
| 7784685 | Hopkins, III | Aug 2010 | B1 |
| 7793851 | Mullen | Sep 2010 | B2 |
| 7801826 | Labrou | Sep 2010 | B2 |
| 7805376 | Smith | Sep 2010 | B2 |
| 7805378 | Berardi | Sep 2010 | B2 |
| 7818264 | Hammad | Oct 2010 | B2 |
| 7828220 | Mullen | Nov 2010 | B2 |
| 7835960 | Breck | Nov 2010 | B2 |
| 7841523 | Oder, II | Nov 2010 | B2 |
| 7841539 | Hewton | Nov 2010 | B2 |
| 7844550 | Walker | Nov 2010 | B2 |
| 7848980 | Carlson | Dec 2010 | B2 |
| 7849020 | Johnson | Dec 2010 | B2 |
| 7853529 | Walker | Dec 2010 | B1 |
| 7853995 | Chow | Dec 2010 | B2 |
| 7865414 | Fung | Jan 2011 | B2 |
| 7873579 | Hobson | Jan 2011 | B2 |
| 7873580 | Hobson | Jan 2011 | B2 |
| 7890393 | Talbert | Feb 2011 | B2 |
| 7891563 | Oder, II | Feb 2011 | B2 |
| 7896238 | Fein | 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 | May 2011 | B2 |
| 7954705 | Mullen | Jun 2011 | B2 |
| 7959076 | Hopkins, III | Jun 2011 | B1 |
| 7996288 | Stolfo | Aug 2011 | B1 |
| 8025223 | Saunders | Sep 2011 | B2 |
| 8046256 | Chien | Oct 2011 | B2 |
| 8060448 | Jones | Nov 2011 | B2 |
| 8060449 | Zhu | Nov 2011 | B1 |
| 8074877 | Mullen | Dec 2011 | B2 |
| 8074879 | Harris | Dec 2011 | B2 |
| 8082210 | Hansen | Dec 2011 | B2 |
| 8095113 | Kean | Jan 2012 | B2 |
| 8104679 | Brown | Jan 2012 | B2 |
| RE43157 | Bishop | Feb 2012 | E |
| 8109436 | Hopkins, III | Feb 2012 | B1 |
| 8121942 | Carlson | Feb 2012 | B2 |
| 8121956 | Carlson | Feb 2012 | B2 |
| 8126449 | Beenau | Feb 2012 | B2 |
| 8132723 | Hogg et al. | Mar 2012 | B2 |
| 8171525 | Pelly | May 2012 | B1 |
| 8175973 | Davis et al. | May 2012 | B2 |
| 8190523 | Patterson | May 2012 | B2 |
| 8196813 | Vadhri | Jun 2012 | B2 |
| 8205791 | Randazza | Jun 2012 | B2 |
| 8219489 | Patterson | Jul 2012 | B2 |
| 8224702 | Mengerink | Jul 2012 | B2 |
| 8225385 | Chow | Jul 2012 | B2 |
| 8229852 | Carlson | Jul 2012 | B2 |
| 8265993 | Chien | Sep 2012 | B2 |
| 8280777 | Mengerink | Oct 2012 | B2 |
| 8281991 | Wentker et al. | Oct 2012 | B2 |
| 8328095 | Oder, II | 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 | Mar 2013 | B2 |
| 8401539 | Beenau | Mar 2013 | B2 |
| 8401898 | Chien | Mar 2013 | B2 |
| 8402555 | Grecia | Mar 2013 | B2 |
| 8403211 | Brooks | Mar 2013 | B2 |
| 8412623 | Moon | Apr 2013 | B2 |
| 8412837 | Emigh | Apr 2013 | B1 |
| 8417642 | Oren | Apr 2013 | B2 |
| 8447699 | Batada | May 2013 | B2 |
| 8453223 | Svigals | May 2013 | B2 |
| 8453925 | Fisher | Jun 2013 | B2 |
| 8458487 | Palgon | Jun 2013 | B1 |
| 8484134 | Hobson | Jul 2013 | B2 |
| 8485437 | Mullen | Jul 2013 | B2 |
| 8494959 | Hathaway | Jul 2013 | B2 |
| 8498908 | Mengerink | Jul 2013 | B2 |
| 8504475 | Brand et al. | Aug 2013 | B2 |
| 8504478 | Saunders | Aug 2013 | B2 |
| 8510816 | Quach | Aug 2013 | B2 |
| 8433116 | Davis et al. | Sep 2013 | B2 |
| 8528067 | Hurry et al. | Sep 2013 | B2 |
| 8533860 | Grecia | Sep 2013 | B1 |
| 8538845 | Liberty | Sep 2013 | B2 |
| 8555079 | Shablygin | Oct 2013 | B2 |
| 8566168 | Bierbaum | Oct 2013 | B1 |
| 8567670 | Stanfield | Oct 2013 | B2 |
| 8571939 | Lindsey | Oct 2013 | B2 |
| 8577336 | Mechaley, Jr. | Nov 2013 | B2 |
| 8577803 | Chatterjee | Nov 2013 | B2 |
| 8577813 | Weiss | Nov 2013 | B2 |
| 8578176 | Mattsson | Nov 2013 | B2 |
| 8583494 | Fisher | Nov 2013 | B2 |
| 8584251 | Mcguire | Nov 2013 | B2 |
| 8589237 | Fisher | Nov 2013 | B2 |
| 8589271 | Evans | Nov 2013 | B2 |
| 8589291 | Carlson | Nov 2013 | B2 |
| 8595098 | Starai | Nov 2013 | B2 |
| 8595812 | Bomar | Nov 2013 | B2 |
| 8595850 | Spies | Nov 2013 | B2 |
| 8606638 | Dragt | Dec 2013 | B2 |
| 8606700 | Carlson | Dec 2013 | B2 |
| 8606720 | Baker | Dec 2013 | B1 |
| 8615468 | Varadarajan | Dec 2013 | B2 |
| 8620754 | Fisher | Dec 2013 | B2 |
| 8635157 | Smith | Jan 2014 | B2 |
| 8646059 | Von Behren | Feb 2014 | B1 |
| 8651374 | Brabson | Feb 2014 | B2 |
| 8656180 | Shablygin | Feb 2014 | B2 |
| 8751391 | Freund | Jun 2014 | B2 |
| 8751642 | Vargas | 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 |
| 9531637 | Sharp | Dec 2016 | B2 |
| 9646303 | Karpenko | May 2017 | B2 |
| 9680942 | Dimmick | Jun 2017 | B2 |
| 9792782 | Basu | Oct 2017 | B1 |
| 20010029485 | Brody | Oct 2001 | A1 |
| 20010034720 | Armes | Oct 2001 | A1 |
| 20010054003 | Chien | Dec 2001 | A1 |
| 20020007320 | Hogan | Jan 2002 | A1 |
| 20020016749 | Borecki | Feb 2002 | A1 |
| 20020029193 | Ranjan | Mar 2002 | A1 |
| 20020035548 | Hogan | Mar 2002 | A1 |
| 20020073045 | Rubin | Jun 2002 | A1 |
| 20020116341 | Hogan | Aug 2002 | A1 |
| 20020133467 | Hobson | Sep 2002 | A1 |
| 20020147913 | Lun Yip | Oct 2002 | A1 |
| 20030028481 | Flitcroft | Feb 2003 | A1 |
| 20030130955 | Hawthorne | Jul 2003 | A1 |
| 20030191709 | Elston | Oct 2003 | A1 |
| 20030191945 | Keech | Oct 2003 | A1 |
| 20040010462 | Moon | Jan 2004 | A1 |
| 20040050928 | Bishop | Mar 2004 | A1 |
| 20040059682 | Hasumi | Mar 2004 | A1 |
| 20040093281 | Silverstein | May 2004 | A1 |
| 20040139008 | Mascavage | Jul 2004 | A1 |
| 20040143532 | Lee | Jul 2004 | A1 |
| 20040158532 | Breck | Aug 2004 | A1 |
| 20040210449 | Breck | Oct 2004 | A1 |
| 20040210498 | Freund | Oct 2004 | A1 |
| 20040232225 | Bishop | Nov 2004 | A1 |
| 20040236632 | Maritzen | Nov 2004 | A1 |
| 20040260646 | Berardi | Dec 2004 | A1 |
| 20050037735 | Coutts | Feb 2005 | A1 |
| 20050080730 | Sorrentino | Apr 2005 | A1 |
| 20050108178 | York | May 2005 | A1 |
| 20050199709 | Linlor | Sep 2005 | A1 |
| 20050246293 | Ong | Nov 2005 | A1 |
| 20050269401 | Spitzer | Dec 2005 | A1 |
| 20050269402 | Spitzer | Dec 2005 | A1 |
| 20060235795 | Johnson | Oct 2006 | A1 |
| 20060237528 | Bishop | Oct 2006 | A1 |
| 20060278704 | Saunders | Dec 2006 | A1 |
| 20070107044 | Yuen | May 2007 | A1 |
| 20070129955 | Dalmia | Jun 2007 | A1 |
| 20070136193 | Starr | Jun 2007 | A1 |
| 20070136211 | Brown | Jun 2007 | A1 |
| 20070170247 | Friedman | Jul 2007 | A1 |
| 20070179885 | Bird | Aug 2007 | A1 |
| 20070208671 | Brown | Sep 2007 | A1 |
| 20070245414 | Chan | Oct 2007 | A1 |
| 20070288377 | Shaked | Dec 2007 | A1 |
| 20070291995 | Rivera | Dec 2007 | A1 |
| 20080015988 | Brown | Jan 2008 | A1 |
| 20080029607 | Mullen | Feb 2008 | A1 |
| 20080035738 | Mullen | Feb 2008 | A1 |
| 20080052226 | Agarwal | Feb 2008 | A1 |
| 20080054068 | Mullen | Mar 2008 | A1 |
| 20080054079 | Mullen | Mar 2008 | A1 |
| 20080054081 | Mullen | Mar 2008 | A1 |
| 20080065554 | Hogan | Mar 2008 | A1 |
| 20080065555 | Mullen | Mar 2008 | A1 |
| 20080201264 | Brown | Aug 2008 | A1 |
| 20080201265 | Hewton | Aug 2008 | A1 |
| 20080228646 | Myers | Sep 2008 | A1 |
| 20080243702 | Hart | Oct 2008 | A1 |
| 20080245855 | Fein | Oct 2008 | A1 |
| 20080245861 | Fein | Oct 2008 | A1 |
| 20080283591 | Oder, II | Nov 2008 | A1 |
| 20080302869 | Mullen | Dec 2008 | A1 |
| 20080302876 | Mullen | Dec 2008 | A1 |
| 20080313264 | Pestoni | Dec 2008 | A1 |
| 20090006262 | Brown | Jan 2009 | A1 |
| 20090010488 | Matsuoka | Jan 2009 | A1 |
| 20090037333 | Flitcroft | Feb 2009 | A1 |
| 20090037388 | Cooper | Feb 2009 | A1 |
| 20090043702 | Bennett | Feb 2009 | A1 |
| 20090048971 | Hathaway | Feb 2009 | A1 |
| 20090106112 | Dalmia | Apr 2009 | A1 |
| 20090106160 | Skowronek | Apr 2009 | A1 |
| 20090132813 | Schibuk | May 2009 | A1 |
| 20090134217 | Flitcroft | May 2009 | A1 |
| 20090157555 | Biffle | Jun 2009 | A1 |
| 20090159673 | Mullen | Jun 2009 | A1 |
| 20090159700 | Mullen | Jun 2009 | A1 |
| 20090159707 | Mullen | Jun 2009 | A1 |
| 20090173782 | Muscato | Jul 2009 | A1 |
| 20090200371 | Kean | Aug 2009 | A1 |
| 20090248583 | Chhabra | Oct 2009 | A1 |
| 20090276347 | Kargman | Nov 2009 | A1 |
| 20090281948 | Carlson | Nov 2009 | A1 |
| 20090294527 | Brabson | Dec 2009 | A1 |
| 20090307139 | Mardikar | Dec 2009 | A1 |
| 20090308921 | Mullen | Dec 2009 | A1 |
| 20090327131 | Beenau | Dec 2009 | A1 |
| 20100008535 | Abulafia | Jan 2010 | A1 |
| 20100088237 | Wankmueller | Apr 2010 | A1 |
| 20100094755 | Kloster | Apr 2010 | A1 |
| 20100106644 | Annan | Apr 2010 | A1 |
| 20100120408 | Beenau | 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 | Jul 2010 | A1 |
| 20100211505 | Saunders | Aug 2010 | A1 |
| 20100223186 | Hogan | Sep 2010 | A1 |
| 20100228668 | Hogan | Sep 2010 | A1 |
| 20100235284 | Moore | Sep 2010 | A1 |
| 20100258620 | Torreyson | Oct 2010 | A1 |
| 20100274721 | Hammad | Oct 2010 | A1 |
| 20100291904 | Musfeldt | Nov 2010 | A1 |
| 20100299267 | Faith et al. | Nov 2010 | A1 |
| 20100306076 | Taveau | Dec 2010 | A1 |
| 20100325041 | Berardi | Dec 2010 | A1 |
| 20110010292 | Giordano | Jan 2011 | A1 |
| 20110010552 | Hoornaert et al. | Jan 2011 | A1 |
| 20110016047 | Wu | Jan 2011 | A1 |
| 20110016320 | Bergsten | Jan 2011 | A1 |
| 20110040640 | Erikson | Feb 2011 | A1 |
| 20110047076 | Carlson et al. | Feb 2011 | A1 |
| 20110083018 | Kesanupalli | Apr 2011 | A1 |
| 20110087596 | Dorsey | Apr 2011 | A1 |
| 20110093397 | Carlson | Apr 2011 | A1 |
| 20110125597 | Oder, II | May 2011 | A1 |
| 20110153437 | Archer | Jun 2011 | A1 |
| 20110153498 | Makhotin et al. | Jun 2011 | A1 |
| 20110154466 | Harper | Jun 2011 | A1 |
| 20110161233 | Tieken | Jun 2011 | A1 |
| 20110178926 | Lindelsee et al. | Jul 2011 | A1 |
| 20110191244 | Dai | Aug 2011 | A1 |
| 20110238511 | Park | 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 | Nov 2011 | A1 |
| 20110276381 | Mullen | Nov 2011 | A1 |
| 20110276424 | Mullen | Nov 2011 | A1 |
| 20110276425 | Mullen | Nov 2011 | A1 |
| 20110295745 | White | Dec 2011 | A1 |
| 20110302081 | Saunders | Dec 2011 | A1 |
| 20120023567 | Hammad | Jan 2012 | A1 |
| 20120028609 | Hruska | Feb 2012 | A1 |
| 20120030047 | Fuentes et al. | Feb 2012 | A1 |
| 20120035998 | Chien | Feb 2012 | A1 |
| 20120041881 | Basu | Feb 2012 | A1 |
| 20120047237 | Arvidsson | Feb 2012 | A1 |
| 20120066078 | Kingston | Mar 2012 | A1 |
| 20120072350 | Goldthwaite | Mar 2012 | A1 |
| 20120078735 | Bauer | Mar 2012 | A1 |
| 20120078798 | Downing | Mar 2012 | A1 |
| 20120078799 | Jackson | Mar 2012 | A1 |
| 20120095852 | Bauer | Apr 2012 | A1 |
| 20120095865 | Doherty | Apr 2012 | A1 |
| 20120116902 | Cardina | May 2012 | A1 |
| 20120123882 | Carlson | May 2012 | A1 |
| 20120123940 | Killian | May 2012 | A1 |
| 20120129514 | Beenau | May 2012 | A1 |
| 20120143754 | Patel | Jun 2012 | A1 |
| 20120143767 | Abadir | Jun 2012 | A1 |
| 20120143772 | Abadir | Jun 2012 | A1 |
| 20120158580 | Eram | Jun 2012 | A1 |
| 20120158593 | Garfinkle | Jun 2012 | A1 |
| 20120173431 | Ritchie | Jul 2012 | A1 |
| 20120185386 | Salama | Jul 2012 | A1 |
| 20120197807 | Schlesser | Aug 2012 | A1 |
| 20120203664 | Torossian | Aug 2012 | A1 |
| 20120203666 | Torossian | Aug 2012 | A1 |
| 20120215688 | Musser | 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 | Sep 2012 | A1 |
| 20120246079 | Wilson et al. | Sep 2012 | A1 |
| 20120265631 | Cronic | Oct 2012 | A1 |
| 20120271770 | Harris | Oct 2012 | A1 |
| 20120297446 | Webb | Nov 2012 | A1 |
| 20120300932 | Cambridge | Nov 2012 | A1 |
| 20120303503 | Cambridge | Nov 2012 | A1 |
| 20120303961 | Kean | Nov 2012 | A1 |
| 20120304273 | Bailey | Nov 2012 | A1 |
| 20120310725 | Chien | Dec 2012 | A1 |
| 20120310831 | Harris | Dec 2012 | A1 |
| 20120316992 | Oborne | Dec 2012 | A1 |
| 20120317035 | Royyuru | Dec 2012 | A1 |
| 20120317036 | Bower | Dec 2012 | A1 |
| 20130017784 | Fisher | Jan 2013 | A1 |
| 20130018757 | Anderson et al. | Jan 2013 | A1 |
| 20130019098 | Gupta | Jan 2013 | A1 |
| 20130031006 | Mccullagh et al. | Jan 2013 | A1 |
| 20130054337 | Brendell | Feb 2013 | A1 |
| 20130054466 | Muscato | Feb 2013 | A1 |
| 20130054474 | Yeager | Feb 2013 | A1 |
| 20130081122 | Svigals | Mar 2013 | A1 |
| 20130091028 | Oder (“J.D.”), II | Apr 2013 | A1 |
| 20130110658 | Lyman | May 2013 | A1 |
| 20130111599 | Gargiulo | May 2013 | A1 |
| 20130117185 | Collison | 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 | Jun 2013 | A1 |
| 20130145148 | Shablygin | Jun 2013 | A1 |
| 20130145172 | Shablygin | Jun 2013 | A1 |
| 20130159178 | Colon | Jun 2013 | A1 |
| 20130159184 | Thaw | Jun 2013 | A1 |
| 20130166402 | Parento | Jun 2013 | A1 |
| 20130166456 | Zhang | Jun 2013 | A1 |
| 20130173736 | Krzeminski | Jul 2013 | A1 |
| 20130185202 | Goldthwaite | Jul 2013 | A1 |
| 20130191227 | Pasa et al. | Jul 2013 | A1 |
| 20130191286 | Cronic | Jul 2013 | A1 |
| 20130191289 | Cronic | 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 | Aug 2013 | A1 |
| 20130204794 | Sahota | Aug 2013 | A1 |
| 20130212007 | Mattsson | Aug 2013 | A1 |
| 20130212017 | Bangia | Aug 2013 | A1 |
| 20130212019 | Mattsson | Aug 2013 | A1 |
| 20130212024 | Mattsson | Aug 2013 | A1 |
| 20130212026 | Powell et al. | Aug 2013 | A1 |
| 20130212666 | Mattsson | Aug 2013 | A1 |
| 20130218698 | Moon | Aug 2013 | A1 |
| 20130218769 | Pourfallah et al. | Aug 2013 | A1 |
| 20130226799 | Raj | Aug 2013 | A1 |
| 20130226802 | Hammad | Aug 2013 | A1 |
| 20130226813 | Voltz | Aug 2013 | A1 |
| 20130232079 | Lindelsee et al. | Sep 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 | Sep 2013 | A1 |
| 20130254102 | Royyuru | Sep 2013 | A1 |
| 20130254117 | Von Mueller | Sep 2013 | A1 |
| 20130262296 | Thomas | Oct 2013 | A1 |
| 20130262302 | Lettow | Oct 2013 | A1 |
| 20130262315 | Hruska | Oct 2013 | A1 |
| 20130262316 | Hruska | Oct 2013 | A1 |
| 20130262317 | Collinge | Oct 2013 | A1 |
| 20130275300 | Killian | Oct 2013 | A1 |
| 20130275307 | Khan | Oct 2013 | A1 |
| 20130275308 | Paraskeva | Oct 2013 | A1 |
| 20130282502 | Jooste | Oct 2013 | A1 |
| 20130282575 | Mullen | Oct 2013 | A1 |
| 20130282588 | Hruska | Oct 2013 | A1 |
| 20130297501 | Monk et al. | Nov 2013 | A1 |
| 20130297504 | Nwokolo | Nov 2013 | A1 |
| 20130297508 | Belamant | Nov 2013 | A1 |
| 20130304649 | Cronic | Nov 2013 | A1 |
| 20130308778 | Fosmark | Nov 2013 | A1 |
| 20130311382 | Fosmark | Nov 2013 | A1 |
| 20130317982 | Mengerink | Nov 2013 | A1 |
| 20130332344 | Weber | Dec 2013 | A1 |
| 20130339253 | Sincai | Dec 2013 | A1 |
| 20130346305 | Mendes | Dec 2013 | A1 |
| 20130346314 | Mogollon | Dec 2013 | A1 |
| 20140006775 | Dixon | Jan 2014 | A1 |
| 20140007213 | Sanin | 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 | Feb 2014 | A1 |
| 20140040139 | Brudnicki | Feb 2014 | A1 |
| 20140040144 | Plomske | Feb 2014 | A1 |
| 20140040145 | Ozvat | Feb 2014 | A1 |
| 20140040148 | Ozvat | Feb 2014 | A1 |
| 20140040628 | Fort | Feb 2014 | A1 |
| 20140041018 | Bomar | Feb 2014 | A1 |
| 20140046853 | Spies | Feb 2014 | A1 |
| 20140047551 | Nagasundaram et al. | Feb 2014 | A1 |
| 20140052532 | Tsai | Feb 2014 | A1 |
| 20140052620 | Rogers | Feb 2014 | A1 |
| 20140052637 | Jooste | 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 | 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 | Jan 2015 | A1 |
| 20150032626 | Dill | Jan 2015 | A1 |
| 20150032627 | Dill | Jan 2015 | A1 |
| 20150046338 | Laxminarayanan | Feb 2015 | A1 |
| 20150046339 | Wong et al. | Feb 2015 | A1 |
| 20150052064 | Karpenko et al. | Feb 2015 | A1 |
| 20150081544 | Wong et al. | Mar 2015 | A1 |
| 20150088756 | Makhotin et al. | Mar 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 |
| 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 |
| 20150269566 | Gaddam et al. | Sep 2015 | A1 |
| 20150278799 | Palanisamy | Oct 2015 | A1 |
| 20150287037 | Salmon | Oct 2015 | A1 |
| 20150312038 | Palanisamy | Oct 2015 | A1 |
| 20150319158 | Kumnick | Nov 2015 | A1 |
| 20150324736 | Sheets | 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 | Mar 2016 | A1 |
| 20160103675 | Aabye et al. | Apr 2016 | A1 |
| 20160119296 | Laxminarayanan et al. | Apr 2016 | A1 |
| 20160132878 | O'Regan | 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 | Jul 2016 | A1 |
| 20160218875 | Le Saint et al. | Jul 2016 | A1 |
| 20160224976 | Basu | Aug 2016 | A1 |
| 20160224977 | Sabba et al. | Aug 2016 | A1 |
| 20160232527 | Patterson | Aug 2016 | A1 |
| 20160239842 | Cash et al. | 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 | Apr 2017 | A1 |
| 20170148013 | Rajurkar | May 2017 | A1 |
| 20170163629 | Law | Jun 2017 | A1 |
| 20170186001 | Reed et al. | Jun 2017 | A1 |
| 20170200156 | Karpenko | Jul 2017 | A1 |
| 20170200165 | Laxminarayanan et al. | Jul 2017 | A1 |
| 20170201520 | Chandoor | Jul 2017 | A1 |
| 20170220818 | Nagasundaram et al. | Aug 2017 | A1 |
| 20170221054 | Flurscheim | Aug 2017 | A1 |
| 20170221056 | Karpenko | Aug 2017 | A1 |
| 20170228723 | Taylor | Aug 2017 | A1 |
| 20170236113 | Chitalia | Aug 2017 | A1 |
| 20170293914 | Girish | Oct 2017 | A1 |
| 20170295155 | Wong et al. | Oct 2017 | A1 |
| 20170364903 | Lopez | Dec 2017 | A1 |
| 20170373852 | Cassin | Dec 2017 | A1 |
| 20180006821 | Kinagi | Jan 2018 | A1 |
| 20180075081 | Chipman | Mar 2018 | A1 |
| 20180247303 | Raj | Aug 2018 | A1 |
| 20180262334 | Hammad | Sep 2018 | A1 |
| 20180268399 | Spector | Sep 2018 | A1 |
| 20180268405 | Lopez | Sep 2018 | A1 |
| 20180285875 | Law | Oct 2018 | A1 |
| 20180324184 | Kaja | Nov 2018 | A1 |
| 20180324584 | Lopez | Nov 2018 | A1 |
| 20190020478 | Girish | Jan 2019 | A1 |
| 20190066069 | Faith | Feb 2019 | A1 |
| Number | Date | Country |
|---|---|---|
| 1028401 | Aug 2000 | EP |
| 2156397 | Feb 2010 | EP |
| 2000014648 | Mar 2000 | WO |
| 2001035304 | May 2001 | WO |
| 2001035304 | May 2001 | WO |
| 52004051585 | Nov 2003 | WO |
| 2004042536 | May 2004 | WO |
| 2005001751 | Jun 2004 | 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 |
| Entry |
|---|
| PCT International Search Report dated Mar. 23, 2017 in re Application No. PCT/US2016/064817 filed Dec. 2, 2016, 16 pages. |
| “DCVV Card”, Available online at: http://www.oberthur.comjot/OT_dCVV.pdf, Sep. 15, 2014, 2 pages. |
| “Gemalto Dynamic Code Verification”, Available online at: https://www.gemalto.comjbrochures-site/download-site/Documents/fs-dynamic-code-verification.pdf, Oct. 12, 2015, 4 pages. |
| EP16871667.8 , “Extended European Search Report”, dated Jul. 25, 2018, 8 pages. |
| 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, filed Feb. 17, 2016, Before the USPTO Patent Trial and Appeal Board, IPR 2016-00600, 65 pages. |
| Wang, et. al, U.S. Appl. No. 16/302,054 (unpublished), “Methods of Distributing Tokens and Managing Token Relationships,” filed Nov. 15, 2018. |
| Dean, et al., U.S. Appl. No. 16/311,144 (unpublished), “Encryption Key Exhange Process Using Access Device,” filed Dec. 18, 2018. |
| Purves, et al., U.S. Appl. No. 16/287,244 (unpublished), “Payment Channel Returning Limited Use Proxy Dynamic Value,” filed Feb. 27, 2019. |
| U.S. Appl. No. 15/471,711 , “Final Office Action”, dated Oct. 3, 2019, 24 pages. |
| SG11201803495V , “Written Opinion”, dated Nov. 19, 2019, 8 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20170163617 A1 | Jun 2017 | US |
| Number | Date | Country | |
|---|---|---|---|
| 62263393 | Dec 2015 | US |
