Patent Grant
11122133
Current implementations of token systems could be improved. For example, in some cases, there may be an insufficient amount of possible unique token values. This may be an issue when multiple tokens are issued for one user account. A unique token may be issued for each domain in which the payment account is used, and tokens may be regularly refreshed (e.g., one-time use tokens). Current token formats only allow a certain amount of variation, so eventually all possible unique values may be exhausted.
Another issue is that users have historically been recognized by various entities through their primary account numbers. User activity tracking, loyalty programs, activity analysis, and other programs have been based on PAN usage. When the PAN is replaced with multiple tokens, each token may appear to be a different account to certain entities (e.g., acquirers), and thus these entities may not be able to determine the total activity for a given account. Accordingly, using tokens instead of primary account numbers can be disruptive.
Embodiments of the invention address these and other problems, individually and collectively.
One embodiment of the invention is directed to a method. The method comprises receiving, by a data processor in a token service computer, a first token request from a first token requestor computer, the first token request including a value credential and a first domain identifier. The method also comprises identifying a value token associated with the value credential, generating a first token code associated with the value token, assigning the value token and the first token code to the first domain identifier, and transmitting the value token and the first token code to the first token requestor computer. The first token requestor subsequently uses the value token for an interaction, and the first token requestor's subsequent use of the value token is valid if the value token is accompanied by the first token code.
In another embodiment, the method further comprises receiving a second token request from a second token requestor computer, the second token request including the value credential and a second domain identifier. The method also comprises identifying the value token associated with the value credential generating a second token code associated with the value token assigning the value token and the second token code to the second domain identifier, and transmitting the value token and the second token code to the second token requestor computer. The second token requestor subsequently uses the value token for an interaction, and the second token requestor's subsequent use of the value token is valid if the value token is accompanied by the second token code.
Another embodiment of the invention is directed to a token service computer configured to perform the above-described method.
Another embodiment of the invention is directed to a method comprising receiving, by a token service system, a first authorization request message including a value token, a first token code, and a first domain identifier. The method also comprises determining that the first token code is associated with the value token, determining that the value token and the first token code are assigned to the first domain identifier, identifying a value credential associated with the value token, adding the value credential to the first authorization request message, sending the first authorization request message to an authorizing entity computer, receiving a first authorization response message including the value credential from the authorizing entity computer, replacing the value credential with the value token and the first token code in the first authorization response message, and forwarding the first authorization response message.
In another embodiment, the method further comprises receiving, by the token service system, a second authorization request message including a value token, a second token code, and a second domain identifier. The method also comprises determining that the second token code is associated with the value token, determining that the value token and the second token code are assigned to the second domain identifier, identifying a value credential associated with the value token, adding the value credential to the second authorization request message, sending the second authorization request message to the authorizing entity computer, receiving a second authorization response message including the value credential from the authorizing entity computer, replacing the value credential with the value token and the second token code in the authorization response message, and forwarding the authorization response message.
Another embodiment of the invention is directed to a token service system 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 providing, in addition to a value token, a token code to a token requestor. The token code can serve as a shared secret between a token holder and a token vault. Both the value token and the token code can be provided together during a transaction, and the token code can be used to authenticate that the token holder is authorized to use the value token.
In some embodiments, one value token can be provided for use in multiple domains. Each domain may receive a different token code along with the value token. If the value token is received for a transaction through a certain domain, it may only be considered valid if accompanied by the appropriate token code for that domain.
As discussed above, using value tokens can lead to a token numeric issue. For example, a typical PAN (payment account number) is composed of 16 digits. If each digit can range from 0-9, than there are 1016 possible unique PANs. However, certain digits within a PAN are sometimes occupied by various types of identification information. For example, the first six digits may be used to indicate a BIN (bank identification number). Other digits may be used for other purposes, such as the final digit being used as a checksum. In some embodiments, the number of digits used to actually identify a specific account may be as low as (or lower than) 9 digits. In the example of 9 digits, there are now only 109, or one billion, possible unique values. Considering that there may be many millions of account holders, that there may be multiple tokens associated with each account at any given time, and that each token might be refreshed regularly (e.g., once a week, after each transaction, etc.), it can be seen that one billion unique values may not be enough to accommodate tokenization applications.
Embodiments of the invention solve this issue by providing one value token for use in multiple token domains, along with a different token code for each domain. Instead of increasing token proliferation (e.g., by issuing a different value token to every domain, by constantly refreshing value tokens, etc.), a single value token can be issued to each domain for a certain payment account. Current token formats may provide enough possible token values to accommodate a single unique value token per payment account. For example, one billion values may be sufficient for each account holder to have a unique token value. The token code allows the single value token to be widely distributed without sacrificing security, as a token code may be required when using the value token, and token codes may only be provided to (and valid for) domains that are authorized to use the value token.
This can also solve the issue of tracking users. As described above, incorporating token codes allows a payment account to be uniquely represented by a single value token across all domains. Accordingly, entities (e.g., acquirers and merchants) that previously used a PAN to track user activity can now simply use the value token instead (as it may be provided during transactions instead of the PAN). Thus, entities can essentially continue tracking user activity as usual. In some cases, the value token may be formatted similarly to a PAN, so entities may not be able to distinguish between a value token and a PAN, and they may not even notice that anything changed. For example, a value token be a 16 digit number, such as “4146 7238 9345 7895”. Acquirers and merchants may use the entire number, or a portion of the number (such as field 2, the last four digits “7895”, etc.) to identify an account and/or user. When communicating about the user, entities may refer to the user by the value token “4146 7238 9345 7895”. Also, when identifying which user is participating in a transaction, acquirers and merchants identify a user record based on the value token “4146 7238 9345 7895”.
This token code system may be easily adopted by merchants, acquirers, and other relevant entities. Minimal changes are needed for existing systems (e.g., user activity tracking remains the same, as described above). Token holders may simply store an extra value (the token code), and other entities may simply pass the token code along in authorization request and response messages. In some embodiments, the token code may be able to fit within existing authorization message formats without requiring any changes. Thus, a token system that increases payment security can be introduced with minimal interruptions.
Prior to discussing specific embodiments of the invention, some terms may be described in detail.
An “interaction” may include a communication, contact, or exchange between parties, devices, and/or entities. In some embodiments, data can be exchanged in an interaction between two devices (e.g., an interaction between a mobile device and an access device).
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 account information may include a PAN (primary account number or “account number”), user name, expiration date, CVV (card verification value), dCVV (dynamic card verification value), CVV2 (card verification value 2), CVC3 card verification values, etc. CVV2 is generally understood to be a static verification value associated with a payment device. CVV2 values are generally visible to a user (e.g., a consumer), whereas CVV and dCVV values are typically embedded in memory or authorization request messages and are not readily known to the user (although they are known to the issuer and payment processors). Payment credentials may be any information that identifies or is associated with a payment account. Payment credentials may be provided in order to make a payment from a payment account. Payment credentials can also include a user name, an expiration date, a gift card number or code, and any other suitable information.
“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 which 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 “value token” may be an identifier for worth. Examples of a value token include payment tokens, a coupon identifier, 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.
A “token code” may be any string of characters that serve as evidence of permission for using a value token (e.g., a payment token). In some embodiments, a token code may be a hexadecimal value. In other embodiments, a token code could be any other alphabetical, numeric, or alphanumeric value. For example, in some embodiments, a token code may be composed of five characters, or any other suitable number of characters. A token code may also be a random or otherwise un-guessable value. A token code may be issued to a holder of a value token, and the token code may be able to validate the value token. The combination of the token code and a value token may constitute a unique combination. A token code may also be associated with a domain ID (e.g., that indicates a token domain), such that a value token is validated by a token code and an associated domain ID. In some embodiments, a token code may be unique for a value token to which it is assigned. However, the token code may not necessarily be globally unique. For example, the same token code could possibly be randomly generated and assigned for a different value token. Thus, running out of unique token codes may not be a concern.
A “token service system” or “token service computer” can include a system that that services payment tokens. In some embodiments, a token service system 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). In some embodiments, the token service system may establish a token assurance level for a given token to indicate the confidence level of the token to PAN binding. The token service system may include or be in communication with a token vault where the generated tokens are stored. The token service system 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 token service 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 service provider. For example, payment networks and issuers or their agents may become the token service provider by implementing the token services according to embodiments of the present invention.
In addition to generating and processing payment tokens, a token service computer can generate, issue, and process token codes. For example, a token service computer can generate and provide a token code for each distributed payment token. In some embodiments, a single payment token can be distributed to multiple token requestors, but a different token code may be provided to each token requestor for the single payment token. Similarly, when de-tokenizing a payment token, the token service computer can verify that a payment token is accompanied by an appropriate token code and/or domain ID.
A “token vault” may be an example of a token service computer and can include a repository that maintains established token-to-PAN mappings. According to various embodiments, the token vault may also maintain other attributes of the token requestor that may be determined at the time of registration. The attributes may be used by the token service provider to apply domain restrictions or other controls during transaction processing. In some embodiments, the token vault may be a part of the token service system or the token service provider. Alternatively, the token vault may be a remote repository accessible to the token service provider. Token vaults, due to the sensitive nature of the data mappings that are stored and managed in them, may be protected by strong underlying physical and logical security.
“Token exchange” or “de-tokenization” can include a process of restoring the data that was substituted during tokenization. For example, a token exchange may include replacing a payment token with a corresponding primary account number (PAN) that was associated with the payment token during tokenization of the PAN. Thus, the de-tokenization may refer to the process of redeeming a token for the associated PAN value based on a token-to-PAN mapping stored, for example, in a token vault. The ability to retrieve a PAN in exchange for the associated token may be restricted to specifically authorized entities, individuals, applications, or systems. Further, de-tokenization or token exchange may be applied to any other information. In some embodiments, token exchange may be achieved via a transactional message, such as an ISO message, an application programming interface (API), or another type of web interface (e.g., web request).
A “token requestor” include an entity that requests a token. The token requestor may initiate a request that a primary account number (PAN) be tokenized by submitting a token request message to the token service provider. According to various embodiments, a token requestor may no longer need to store a PAN associated with a token once the requestor has received a requested token. The requestor may be an application, a device, a process, or a system that is configured to perform actions associated with tokens. A token requestor can request registration with a network token system, request token generation, token activation, token de-activation, token exchange, token lifecycle management related processes, and/or any other token related processes. A requestor may interface with a network token system through any suitable communication networks and/or protocols (e.g., using HTTPS, SOAP and/or an XML interface among others). Some non-limiting examples of token requestors may include, for example, communication devices (e.g., mobile phones and computers) operated by users, card-on-file merchants, acquirers, acquirer processors, and payment gateways acting on behalf of merchants, payment enablers (e.g., original equipment manufacturers, mobile network operators, etc.), digital wallet providers, issuers, third party wallet providers, and/or transaction processing networks. In some embodiments, a token requestor can request tokens for multiple domains and/or channels. A token requestor may be registered and identified uniquely by the token service provider within the tokenization ecosystem. During token requestor registration, the token service provider may formally process the token requestor's application to participate in the token service system. The token service provider may collect information pertaining to the nature of the requestor and the relevant use of tokens to validate and formally approve the token requestor and establish appropriate domain restriction controls. Successfully registered token requestors may be assigned a domain ID that may also be entered and maintained within the token vault. Token requestors may be revoked or assigned new domain ID. This information may be subject to reporting and audit by the token service provider.
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 (i.e. token domain restriction controls) 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. For example, the token domain restriction 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 restriction controls may restrict the use of the token at a particular merchant that can be uniquely identified. Some exemplary token domain restriction controls may require the verification of the presence of a token cryptogram that is unique to a given transaction. In some embodiments, a token domain can be associated with a token requestor. For example, a token requestor may request tokens for a certain domain, and both the token requestor and domain may be identified by a certain domain ID.
A “domain identifier (ID)” may include an identifier for a token domain and/or a token requestor. It may include any characters, numerals, or other identifiers associated with an entity associated with a network token system. In some embodiments, a unique domain ID may be assigned for each domain associated with the same token requestor. For example, a domain ID can identify a pairing of a token requestor (e.g., a mobile device, a merchant, a mobile wallet provider, etc.) with a token domain (e.g., e-commerce, contactless, etc.). A domain ID may include any format or type of information. For example, in one embodiment, the domain ID may include an alphanumerical value such as a ten digit or an eleven digit letter and/or number (e.g., 4678012345). In some embodiments, a domain ID may include a code for a token service provider (e.g., first 3 digits) such as the network token system and the remaining digits may be assigned by the token service provider for each requesting entity (e.g., mobile wallet provider) and the token domain (e.g., contactless, e-commerce, etc.).
“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).
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), Wi-Fi, Wi-Max, or any other communication medium that may provide access to a network such as the Internet or a private network. Examples of 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 mobile device may also include any suitable device that may be used to conduct a financial transaction, such as to provide payment credentials to a merchant. Such a mobile device may be in any suitable form. For example, suitable mobile devices can be hand-held and compact so that they can fit into a user's wallet and/or pocket (e.g., pocket-sized). They may include smart cards, magnetic stripe cards, keychain devices (such as the Speedpass™ commercially available from Exxon-Mobil Corp.), etc. Other examples of mobile devices include pagers, payment cards, security cards, access cards, smart media, transponders, and the like. If the mobile device is in the form of a debit, credit, or smartcard, the mobile device may also optionally have features such as magnetic stripes. Such devices can operate in either a contact or contactless mode.
“Short range communication” or “short range wireless communication” may comprise any method of providing short-range contact or contactless communications capability, such as RFID, Bluetooth™, infra-red, or other data transfer capability that can be used to exchange data between a mobile device and an access device. In some embodiments, short range communications may be in conformance with a standardized protocol or data transfer mechanism (e.g., ISO 14443/NFC). Short range communication typically comprises communications at a range of less than 2 meters. In some embodiments, it may be preferable to limit the range of short range communications (e.g., to a range of less than 1 meter, less than 10 centimeters, or less than 2.54 centimeters) for security, technical, and/or practical considerations.
An “application” may be computer code or other data stored on a computer readable medium (e.g. memory element or secure element) that may be executable by a processor to complete a task.
A “digital wallet” can include an electronic device that allows an individual to conduct electronic commerce transactions. A digital wallet may store user profile information, payment credentials, bank account information, one or more digital wallet identifiers and/or the like and can be used in a variety of transactions, such as but not limited to eCommerce, social networks, money transfer/personal payments, mobile commerce, proximity payments, gaming, and/or the like for retail purchases, digital goods purchases, utility payments, purchasing games or gaming credits from gaming websites, transferring funds between users, and/or the like. A digital wallet may be designed to streamline the purchase and payment process. A digital wallet may allow the user to load one or more payment cards onto the digital wallet so as to make a payment without having to enter an account number or present a physical card.
A “digital wallet provider” may include an entity, such as an issuing bank or third party service provider, that issues a digital wallet to a user that enables the user to conduct financial transactions. A digital wallet provider may provide standalone user-facing software applications that store account numbers, or representations of the account numbers (e.g., payment tokens), on behalf of a cardholder (or other user) to facilitate payments at more than one unrelated merchant, perform person-to-person payments, or load financial value into the digital wallet. A digital wallet provider may enable a user to access its account via a personal computer, mobile device or access device. Additionally, a digital wallet provider may also provide one or more of the following functions: storing multiple payment cards and other payment products on behalf of a user, storing other information including billing address, shipping addresses, and transaction history, initiating a transaction by one or more methods, such as providing a user name and password, NFC or a physical token, and may facilitate pass-through or two-step transactions.
A “user” may include an individual that may be associated with one or more personal accounts and/or mobile devices. The user may also be referred to as a cardholder, account holder, or consumer.
An “issuer” or “authorizing entity” may typically refer to a business entity (e.g., a bank) that maintains an account for a user.
A “merchant” may typically be an entity that engages in transactions and can sell goods or services, or provide access to goods or services.
An “acquirer” may typically be a business entity (e.g., a commercial bank) that has a business relationship with a particular merchant or other entity. Some entities can perform both issuer and acquirer functions. Some embodiments may encompass such single entity issuer-acquirers.
An “access device” may be any suitable device that provides access to a remote system. An access device may also be used for communicating with a merchant computer, a transaction processing network, an authentication computer, or any other suitable system. An access device may generally be located in any suitable location, such as at the location of a merchant. An access device may be in any suitable form. Some examples of access devices include POS or point of sale devices (e.g., POS terminals), cellular phones, PDAs, personal computers (PCs), tablet PCs, hand-held specialized readers, set-top boxes, electronic cash registers (ECRs), automated teller machines (ATMs), virtual cash registers (VCRs), kiosks, security systems, access systems, and the like. An access device may use any suitable contact or contactless mode of operation to send or receive data from, or associated with, a user mobile device. In some embodiments, where an access device may comprise a POS terminal, any suitable POS terminal may be used and may include a reader, a processor, and a computer-readable medium. A reader may include any suitable contact or contactless mode of operation. For example, exemplary card readers can include radio frequency (RF) antennas, optical scanners, bar code readers, or magnetic stripe readers to interact with a payment device and/or mobile device. In the examples provided herein, an access device and merchant computer may be referred to as separate system components. It should be appreciated, however, that the access device and merchant computer may be a single component, for example, one merchant mobile device or POS device.
An “authorization request message” may be an electronic message that is sent to a transaction processing network 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, 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 an electronic message reply to an authorization request message generated by an issuing financial institution or a transaction processing network. 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 network) to the merchant's access device (e.g. POS equipment) that indicates approval of the transaction. The code may serve as proof of authorization. As noted above, in some embodiments, a transaction processing network may generate or forward the authorization response message to the merchant.
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. The server computer may comprise one or more computational apparatuses and may use any of a variety of computing structures, arrangements, and compilations for servicing the requests from one or more client computers.
The user 120 (i.e., a device operated by the user 120) may be in communication with the token requestor 115, the authorizing entity computer 150, and the merchant computer 130. Furthermore, the merchant computer 130, the acquirer computer 135, the transaction processing network 140, the authorizing entity computer 150, and a token network 145 may all be in operative communication with each other through any suitable communication channel or communications network. A suitable communications network may be any one and/or the combination of the following: a direct interconnection; the Internet; a Local Area Network (LAN); a Metropolitan Area Network (MAN); an Operating Missions as Nodes on the Internet (OMNI); a secured custom connection; a Wide Area Network (WAN); a wireless network (e.g., employing protocols such as, but not limited to a Wireless Application Protocol (WAP), I-mode, and/or the like); and/or the like.
The token vault 110 may be associated with the transaction processing network 140, the authorizing entity computer 150, the acquirer computer 135, or the merchant computer 130. For example, in some embodiments, a token service provider may comprise an associated token vault 110 and transaction processing network 140. The token vault 110 may be able to issue payment tokens, token codes, and domain IDs. The token vault 110 may also be able to authenticate and de-tokenize payment tokens, token codes, and domain IDs.
An example of the token vault 110, according to some embodiments of the invention, is shown in
The computer readable medium 110F may comprise an authentication module 110G, a token generation module 110H, a token identification module 110J, a token code generation module 110K, a communication module 110L, a de-tokenization module 110M, a registration module 110N, and any other suitable module. It may also comprise code, executable by the processor 110A for implementing a method comprising receiving a first token request from a first token requestor computer, wherein the first token request includes a value credential and a first domain identifier; identifying a value token associated with the value credential; generating a first token code associated with the value token; assigning the value token and the first token code to the first domain identifier; transmitting the value token and the first token code to the first token requestor computer, wherein the first token requestor subsequently uses the value token for an interaction, and wherein the first token requestor's subsequent use of the value token is valid if the value token is accompanied by the first token code; receiving a second token request from a second token requestor computer, wherein the second token request includes the value credential and a second domain identifier; identifying the value token associated with the value credential; generating a second token code associated with the value token; assigning the value token and the second token code to the second domain identifier; and transmitting the value token and the second token code to the second token requestor computer, wherein the second token requestor subsequently uses the value token for an interaction, and wherein the second token requestor's subsequent use of the value token is valid if the value token is accompanied by the second token code.
The authentication module 110G may comprise code that causes the processor 110A to authenticate a token requestor 115. For example, the token vault 110 can receive a token request from the token requestor 115, the request including a domain ID that identifies the token requestor 115, as well as a set of payment credentials that identify a payment account. The authentication module 110G may contain logic that causes the processor 110A to authenticate the domain ID or otherwise authenticate the token requestor. The authentication module 110G may utilize information, such as stored domain IDs, from the token requestor database 110E.
The token generation module 110H may comprise code that causes the processor 110A to generate payment tokens. For example, the token generation module 110H may contain logic that causes the processor 110A to issue a payment token that can be used as surrogate payment account information for a set of payment credentials included in a token request. Any suitable token generation process can be used. Such processes can utilize hashing, encryption, or random token generation processes. A record of the token may be stored at the token database 110C, and the record may include the token, token expiration date, associated payment account information, token assurance information, token requestor information (e.g. a domain ID), and/or any other suitable information.
The token generation module 110H may be able to periodically update payment tokens. For example, new payment tokens can be generated and sent to replace old payment tokens, and the payment tokens can be stored in token database 110C.
The token identification module 110J may comprise code that causes the processor 110A to identify a payment token. For example, the token identification module 110J may contain logic that causes the processor 110A to identify a payment token that is associated with a set of payment credentials received in a token request. In some embodiments, a payment token may be assigned to more than one token requestor 115. The payment token may be generated when a first token requestor 115 initially requests a token for the payment credentials. When a second token requestor 115 requests a token for the same payment credentials, the token identification module 110J may be used to identify the existing payment token, instead of generating another payment token. The token identification module 110J also may update the record of the payment token at the token database 110C to indicate that the second token requestor 115 (e.g. the second domain ID) is also associated with the payment token.
The token code generation module 110K may comprise code that causes the processor 110A to generate token codes. For example, the token code generation module 110K may contain logic that causes the processor 110A to generate a token code associated with a payment token for a certain token requestor 115. Any suitable token code generation process can be used. Such processes can utilize hashing, encryption, or random token generation processes. In some embodiments, when a payment token is provided to a token requestor 115, a token code is also provided. The token code may serve as a passcode for utilizing the payment token. The token vault 110 may provide a different token code to each token requestor that requests the same payment token. Thus, multiple token requestors 115 may possess the same payment token, but they each may have a different token code for that payment token. In order to use the payment token, a token requestor 115 may also need to provide their token code.
The token code generation module 110K may also store a record of the token code at the token code database 110D. The record may indicate a domain ID and/or a payment token associated with the token code. In addition or alternatively, the token code generation module 110K may cause the record of the payment token at the token database 110C to indicate one or more token codes and/or domain IDs associated with the payment token.
The token code generation module 110K may be able to periodically update token codes. For example, new token codes can be generated and sent to replace old token codes, and the new token codes can be stored in the token code database 110D.
The communication module 110L may comprise code that causes the processor 110A to communicate with one or more entities. For example, the communication module 110L may contain logic that causes the processor 110A to receive token requests and send payment tokens to token requestors 115. The communication module 110L may also be able to receive de-tokenization requests and send payment credentials to the transaction processing network 140 and any other suitable entity.
The de-tokenization module 110M may comprise code that causes the processor 110A to de-tokenize a payment token. For example, the de-tokenization module 110M may contain logic that causes the processor 110A to identify a set of payment credentials associated with a payment token (e.g., as indicated in the token database 110C). The de-tokenization module 110M may also be able to authenticate a payment token by validating that a received token code and/or domain ID are associated with the payment token (e.g., as indicated in the token code database 110D). For example, the token vault 110 may receive requests for payment account information from the transaction processing network 140, authorizing entity computer 150, and any other suitable entities. The token vault 110 may receive such a de-tokenization request including a payment token, token code, and/or domain ID, the token vault 110 may authenticate the information and identify the associated payment credentials, and then the token vault 110 may provide the payment account information to the de-tokenization requestor.
The token vault 110 may also allow the token requestor 115 to register at the token vault 110. The registration module 110N may comprise code that causes the processor 110A to register a token requestor 115. For example, the registration module 110N may contain logic that causes the processor 110A to receive a request to register from the token requestor 115, the request including information about the token requestor 115, information about how tokens will be used (e.g. token domain information), a desired token assurance level, or any other suitable information. The token vault 110 may authenticate the identity of the token requestor 115, and the token vault 110 may approve or reject the registration request. If approved, the token vault 110 may generate and issue a domain ID for the token requestor 115. The domain ID may serve to identify the token requestor 115 as well as a token domain for which issued payment tokens will be used.
The registration module 110N may be able to periodically update domain IDs. For example, new domain IDs can be generated and sent to replace old domain IDs, and the new domain IDs can be stored in the token requestor database 110E.
Referring back to
The memory 315E may comprise a digital wallet application 315J, a payment module 315K, a token request module 315L, a credential storage 315M, a payment token 315N, a domain ID 315P, a token code 315Q, and any other suitable module or data. The mobile device 315 may have any number of mobile applications installed or stored on the memory 315E and is not limited to that shown in
The digital wallet application 315J may comprise code that causes the processor 315A to provide digital wallet services. For example, the digital wallet application 315J may contain logic that causes the processor 315A to provide a user interface for the user to provide input and initiate, facilitate, and manage transactions using the mobile device 315. The digital wallet application 315F may be able to access payment credentials, such as the token 315N, the token code 315Q, and the domain ID 315P stored in the credential storage 315M. Further, the digital wallet application 315F may be able to obtain payment tokens from the token vault 110 (e.g., via the token request module 315L). For example, the token request module 315L may send a token request including a set of payment credentials (which may have been provided by the user 120) as well as a domain ID 315P associated with the mobile device 315.
The digital wallet application 315F may also be able to provide the payment credentials for a transaction (e.g., via the payment module 315L). In some embodiments, the digital wallet application 315F may be able to provide payment credentials for online payments and/or in-person transactions (e.g., via short-range communication). In one example, the digital wallet application 315F may generate single data element such as an NFC transmission packet or a QR code including the token 315N, the token code 315Q, and the domain ID 315P, and any other suitable information.
The credential storage 315M may be able to store one or more tokens 315N, token codes 315Q, and domain IDs 315P. For example, the credential storage 315M may store credentials for one or more payment accounts, and there may be a different token 315N and token code 315Q for each payment account. The mobile device 315 may also be able to request payment tokens for more than one token domain, and the mobile device 315 may use a different domain ID 315P for each different token domain. If one token 315N is used for multiple domains (e.g., in-person contactless payments and online payments), the mobile device 315 may possess a different token code 315Q for each domain (and domain ID 315P).
Referring back to the token requestor 115 in
An example of the merchant computer 130 (e.g., a server computer operated by the merchant), according to some embodiments of the invention, is shown in
The computer readable medium 130F may comprise a transaction processing module 130G, a global analysis module 130H, an authorization module 130J, a token request module 130K, a token receive module 130L, and any other suitable module.
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 payment credentials (e.g., a payment token) from the user 120 for a transaction. In some embodiments, the merchant computer 130 may store a payment token associated with the user 120 (e.g., at the credential database 130D), and the transaction processing module 130G identify the payment token when the user 120 initiates a purchase. The transaction processing module 130G may be able to initiate transaction authorization (using either received payment credentials or an identified payment token), and may also be able to finalize a transaction so that goods and/or services can be released.
The global analysis module 130H may comprise code that causes the processor 130A to analyze payment credentials. For example, the global analysis module 130H may contain logic that causes the processor 130A to use a payment token to track user 120 spending habits.
In some embodiments, the global analysis module 130H may use a payment token as a user 120 identifier instead of a PAN. The global analysis module 130H may keep a record (e.g., at the user database 130E) of user 120 trends by recording transactions that involve the payment token. As explained above, in some embodiments, the same payment token that represents a certain payment account can be provided to multiple token requestors 115. As a result, the payment token may be static, so that the same payment token is provided each time a user 120 uses a certain payment account at a merchant computer 130, even if the token code, domain ID, and/or token domain can vary. For example, in some embodiments, one payment account may be associated with several digital wallets, and each digital wallet may have the same payment token associated with the same payment account. The merchant computer 130 may receive the same payment token whenever any of these different digital wallets are used. Thus, the global analysis module 130H may be able to recognize a payment account by a received payment token.
In some embodiments, the payment token may comprise 16, 18, or 19 digits and can be formatted as a PAN so that merchants 130 can easily integrate a payment token into an existing user-tracking system that typically uses a PAN for user tracking. For example, users are sometimes identified by a portion of the PAN known as “field 2”. Payment tokens may also include a “field 2” that can similarly identify a payment account or user. The payment token may replace a PAN for any suitable identification purpose. A payment token may also be formatted to indicate an authentication entity 150 and/or a token vault 110.
In some embodiments, the merchant computer 130 (e.g., via the global analysis module 130H) may use the payment token and associated user purchase record for other applications including value added services such as loyalty programs, backend applications, and reporting. For example, the payment token may function as a user 120 loyalty identifier for tracking loyalty points (e.g., at the user database 130E) and providing rewards or special offers.
The merchant computer 130 (or other entity) may also use the payment token for fraud/risk checks during authorization. For example, the merchant computer 130 (e.g., via the global analysis module 130H) may be able to detect high-velocity transactions. If too many transactions associated with the payment token occur within a certain amount of time, the merchant computer 130 may suspect fraudulent activity. The merchant computer 130 may then reject further transactions involving the payment token. Alternatively, the merchant computer 130 may mark the payment token as high-risk or put the payment token on a “blacklist.” The merchant computer 130 may also use the payment token to review fraud/risk levels after a transaction is authorized.
The merchant computer 130 may use the payment token to access past transactions. For example, the merchant computer 130 may use the payment token to identify a past transaction (e.g., stored in the user database 130E) for a refund or an inquiry.
The payment token may also be used for providing a transaction feed to third party value added applications. For example, the merchant computer 130 may inform third party applications about user 120 purchases and trends that are tracked via the payment token. A third-party may use a transaction feed for providing rewards or offers to the user 120 in real time or offline (e.g., in a statement of credit).
The authorization module 130J may comprise code that causes the processor 130A to send and receive authorization messages. For example, the authorization module 130J may contain logic that causes the processor 130A to generate an authorization request message including payment credentials (e.g., a payment token, token code, domain ID, name, etc.), transaction data, and any other relevant information, and then send the authorization request message to the acquirer computer 135. An authorization response message from the acquirer computer 135 can also be received and processed.
The token request module 130K may comprise code that causes the processor 130A to request payment tokens. For example, the token request module 130K may contain logic that causes the processor 130A to send a token request to the token vault 110, the token request including a set of payment credentials (which may have been provided by the user 120) as well as a domain ID 315P associated with the merchant computer 130.
The token receive module 130L may comprise code that causes the processor 130A to receive and store payment tokens and other associated credentials. For example, the token receive module 130L may contain logic that causes the processor 130A to receive a requested payment token along with an associated token code, domain ID, and/or any other suitable information. The token receive module 130L may be able to store any received payment tokens and associated information in the credential database 130D. The merchant computer 130 may store payment tokens for users 120 that wish to store payment account information at the merchant computer 130 (e.g., for convenience). The merchant computer 130 may be able to submit a stored payment token for one or more purchases initiated by the user 120.
The credential database 130D may be able to store one or more payment tokens, token codes, and/or domain IDs. For example, the credential storage 130D may store credentials for one or more payment accounts, and there may be a different payment token and token code for each payment account. The merchant computer 130 may also be able to request payment tokens for more than one token domain, and the merchant computer 130 may use a different domain ID for each different token domain.
Referring back to the token requestor 115 in
Referring back to
As explained above, in some embodiments, the same payment token that represents a certain payment account can be held and used by different token requestors 115 (e.g., mobile devices 315, merchants 130, third-party token providers, etc.). As a result, each time the payment account is used for a transaction, the acquirer computer 135 may receive the same payment token in an authorization request message, regardless of the payment domain. As a result, the acquirer computer 135 may also be able use the payment token to track user 120 activity, as already described for the merchant computer 130 above.
For example, the acquirer computer 135 may use the payment token for online fraud analysis, offline fraud analysis, loyalty services, third party loyalty programs, reporting to merchants, or any other suitable purpose. For example, in some embodiments, the acquirer computer 135 may flag a payment account (identified by a payment token) and an associated merchant computer 130 for fraud/risk level scoring. In another example, a payment token may be used for providing card-linked offers. In another example, the acquirer computer 135 may provide a user transaction report to merchants, the report including transactions that involved a certain payment token.
As shown in
The transaction processing network 140 may be capable of de-tokenizing a token in an authorization request message. For example, the transaction processing network 140 may receive an authorization request message including a payment token, a token code, and/or a domain ID. The transaction processing network 140 may be able to send the received information to the token vault 110, then receive associated payment account information from the token vault 110, and then forward the authorization request message to the authorizing entity computer 150 with the payment account information. The transaction processing network 140 may also receive an authorization response message with the payment account information, and replace some or all of the payment account information with the payment token, token code, and/or domain ID (e.g., via the token vault 110) before forwarding the message to the acquirer computer 135.
In some embodiments, the token vault 110 and the transaction processing network 140 may form a token service system.
The transaction processing network 140, the acquirer computer 135, and the authorizing entity computer 150 may operate suitable routing tables to route authorization request messages using account identifiers such as PANs or tokens. Token routing data may be provided or maintained by the token vault 110, and may be communicated to any of the entities in
Referring back to
The token network 145 may also be able to provide de-tokenization services. The token network 145 may include another transaction processing network, another token vault, and/or another token requestor. For example, in some embodiments, the transaction processing network 140 may receive a payment token that is associated the token network 145 instead of the token vault 110. In order to de-tokenize the token for authorization, the transaction processing network 140 may send the token, token code, and/or domain ID to the token network 145, which may then authenticate the information and return the payment credentials. In some embodiments, the token network 145 may wish to de-tokenize a token that is associated with the transaction processing network 140, and may obtain associated payment account information by similarly communicating with the transaction processing network 140 and token vault 110.
As can be seen in
In addition to the payment token 520, token codes associated with the payment token may also be generated. A different token code may be assigned to each domain when requesting access to the payment token 520. For example, the first domain 530 may have a token code of “A53B9”, the second domain 540 may have a token code of “1D5F6”, and the third domain 550 may have a token code of “6789A”. A token code may be a shared secret between the domain and the token provider. Accordingly, token codes may be protected by encryption, secure storage, and any other suitable safeguarding. In some embodiments, the token code may also be used in the creation of a cryptogram. Token codes may also be periodically replaced and updated.
The combination of the payment token 520 and a token code may constitute a unique combination. Thus, while each domain may possess the same payment token 520, each domain may possess a unique token code for the payment token 520.
The token code may be a hexadecimal value, although the token code could be any other alphabetical, numeric, or alphanumeric value. In some embodiments, the token code may be indicative of the specific domain for which it was obtained.
The token code may be generated by the same token provider that generated the payment token 520. The holder of the payment token 520 (e.g., merchant, digital wallet application, etc.) may receive and store both the payment token 520 and the token code at the same time. The payment token 520 and the token code may also be updated at any time for a number of reasons, including to prevent a security threat (e.g., fraudulent transactions).
The token code may be specific to the domain so that transaction authentication may occur on the combination of the payment token 520, the token code, and/or the domain ID (along with merchant ID, acquirer BIN/PCR, etc.). Thus, in order for the first merchant 530 to utilize the payment token 520 for a transaction, the first merchant 530 may need to provide the token code “A53B9” and/or the domain ID “101” along with the payment token 520 for the transaction. Then, the token vault 110 can authenticate the payment token 520, the token code “A53B9”, and/or the domain ID “101”. Further, the token vault 110 can verify that the payment token 520, the token code “A53B9”, and/or the domain ID “101” are all associated with one another. The token vault 110 thereby verifies that the first merchant 530 is authorized to utilize the payment token 520. Thus, the payment token 520 may be distributed to multiple entities, but the payment token 520 may only be usable if it is accompanied by an authentic token code and/or domain ID.
For example, the second merchant 540 may be able to use the payment token 520, but the second merchant 540 may need to provide its token code “1D5F6” and its domain ID “102”. If a fraudster attempts to use the payment token 520 and provides an illegitimate token code, an illegitimate domain ID, or a mismatching token code and domain ID (e.g., token code “A53B9” and domain ID “103”), the transaction may be rejected as potentially fraudulent.
Accordingly, the domains (e.g., merchants, acquirers, etc.) may be able to have a unique identifier (i.e. the payment token 520) for which to track transactions for risk, fraud, and other analytical metrics. Transactions can be further tracked, divided, analyzed based on the different domain IDs used transactions.
Payment tokens can be a secure replacement for PANs, and may be formatted similarly to PANs. Accordingly, such an implementation would not require a great deal of infrastructure changes on the part of the domains, and may allow for risk and loyalty management on the part of the domains. Since the payment token 520 can be the same across the various domains, less infrastructure change may be required on the part of the domains than would be required for implementations involving providing a unique payment token 520 for each domain.
It can be appreciated that the implementation described with respect to
Additionally, in some embodiments, it may be possible to use token codes in conjunction with a PAN. Instead of introducing the payment token 520, the PAN may be maintained under the condition that a token code should be provided with the PAN. Thus, similar to the payment token 520, the PAN can be widely distributed, but only usable for authorized domains where a token code and/or domain ID have been assigned.
A method 600 according to embodiments of the invention can be described with respect to
The various messages in
In the method 600 described below, the mobile device 315 is the token requestor. However, as discussed above, in some embodiments the token requestor may alternatively be a merchant, a third-party token provider, or any other suitable entity.
At step S602, the user 120 may indicate a desire to have payment credentials provisioned onto the mobile device 315. For example, the user 120 may provide a PAN or other suitable payment credentials to the digital wallet application 315J.
At step S604, the mobile device 315 may send a token request to the token vault 110 (e.g., via the token request module 315L). The token request may include the payment credentials (e.g., the PAN, expiration date, etc.). The token request may also include mobile device 315 identifying information, such as the domain ID 315P, and any other suitable information.
At step S606, the token vault 110 may authenticate the mobile device 315. The token vault 110 can check the payment credentials, device ID, etc. Also, the token vault 110 may verify that the domain ID 315P is valid in the token requestor database 110E (e.g., via the authentication module 110G).
At step S608, the token vault 110 may identify a payment token that is associated with the payment credentials in the token database 110C (e.g., via the token identification module 110J). For example, a payment token may already have been generated for the payment credentials for another token requestor. If there is no payment token already associated with the payment credentials, the token vault 110 may generate a payment token, create an association between the payment token and the received payment credentials, and store a record of the payment token in the token database 110C (e.g., via the token generation module 110H).
At step S610, the token vault 110 may generate a token code for the mobile device 315 to use in conjunction with the payment token (e.g., via the token code generation module 110K).
At step S612, the token vault 110 may store a record indicating an association between the token code, the payment token, and the domain ID at the token code database 110D and/or the token database 110C (e.g., via the token code generation module 110K). For example, the token code and domain ID may be added to a list of token codes and domain IDs that are authorized to use the payment token. In another example, the payment token and token code may be added to a list of payment tokens and token codes that the domain ID is authorized to use.
At step S614, the token vault 110 may send a token response to the mobile device 315. The token response may include the payment token, the token code, and/or the domain ID.
At step S616, the mobile device 315 may store the payment token 315N, the token code 315Q, and/or the domain ID 315P (e.g., at the credential storage 315M). This may conclude the token provisioning process, and the mobile device 315 may then be able to utilize the payment token 315N for mobile transactions.
At step S618, the user 120 may initiate a purchase. For example, the user 120 may activate the digital wallet application 315J, and may indicate a desire to make a payment (e.g., by selecting a “payment” option). The user 120 may wish to purchase a good or service at the merchant computer 130 via the mobile device 315. Further, the user 120 may select a payment account within the digital wallet application 315J (e.g., by selecting a visually displayed icon representing a payment account), and present the mobile device 315 to an access device for transmitting the payment information.
At step S620, the mobile device 315 may provide the payment token 315N, the token code 315Q, the domain ID 315P, and/or any other suitable information to the merchant computer 130 for the transaction (e.g., via the payment module 315K). For example, the mobile device 315 may provide the payment information via short-range communication to a merchant access device. The token code 315Q may be encrypted or otherwise protected during transmission, such that only the token vault 110 can decrypt and view the token code 315Q.
At step S622, the merchant computer 130 may analyze the payment token and/or the domain ID. For example, the merchant computer 130 may track user 120 activity based on the payment token, and may use the payment token to perform fraud risk analysis (e.g., check a blacklist and determine transaction velocity), process loyalty-related services, update a user 120 record, and perform any other suitable operations (e.g., via the global analysis module 130H). The merchant computer 130 may not view or utilize the token code, and may simply pass the token code along in the authorization request message.
At step S624, the merchant computer 130 may send an authorization request message to the acquirer computer 135. The authorization request message may include transaction information, the payment token, the token code, the domain ID, and any other suitable information.
At step S626, the acquirer computer 135 may optionally analyze the payment token 315N and/or the domain ID. For example, the acquirer computer 135 may track user 120 activity based on the payment token, and may use the payment token to perform fraud risk analysis (e.g., check a blacklist and determine transaction velocity), process loyalty-related services, update a user 120 record, and perform any other suitable operations. The acquirer computer 135 may not view or utilize the token code, and may simply pass the token code along in the authorization request message.
At step S628, the acquirer computer 135 may forward the authorization request message to the transaction processing network 140.
At step S630, the transaction processing network 140 may determine that a payment token is included in the authorization request message. The transaction processing network 140 may send a de-tokenization request to the token vault 110, the de-tokenization request including the payment token, the token code, the domain ID, and/or any other suitable information.
At step S632, the token vault 110 may authenticate the payment token, the token code, and/or the domain ID (e.g., via the authentication module 110G, the token database 110C, and/or the token code database 110D). For example, the token vault 110 may validate that the payment token, the token code, and/or the domain ID are all associated with one another. The token vault 110 may confirm that the mobile device 315 is authorized to use the payment token. For example, the token vault 110 may confirm that the token code was issued to the mobile device 315 (e.g., it was assigned to the domain ID).
At step S634, the token vault 110 may identify the payment credentials (e.g., the PAN) that are associated with the payment token in the token database 110C (e.g., via the de-tokenization module 110G).
At step S636, the token vault 110 may send a de-tokenization response to the transaction processing network 140, the de-tokenization response including the payment credentials.
At step S638, the transaction processing network 140 may add the payment credentials to the authorization request message and forward the authorization request message to the authorizing entity computer 150. The transaction processing network 140 may optionally remove the payment token, the token code, and/or the domain ID from the authorization request message.
At step S640, the authorizing entity computer 150 then determines whether or not the transaction should be authorized. The authorizing entity computer 150 may check the status of the payment account, conduct any appropriate fraud or credit checks, and perform any other suitable processing in order to determine whether or not to approve of the transaction.
At step S642, the authorizing entity computer 150 then generates and sends an authorization response message back to the transaction processing network 140.
At step S644, the transaction processing network 140 may remove the payment credentials from the authorization response message. The transaction processing network 140 may also reformat the authorization response message to include the payment token, the token code, and/or the domain ID. In some embodiments, the token code may not be included in the authorization response message, as the token code may not be readable or useful to the acquirer computer 135 or merchant computer 130. In some embodiments, the transaction processing network 140 may obtain the payment token, the token code, and/or the domain ID from the token vault 110 in order to include the information in the authorization response message.
At step S646, the transaction processing network 140 may then forward the authorization response message to the acquirer computer 135.
At step S648, the acquirer computer 135 may forward the authorization response message to the merchant computer 130.
At step S650, the merchant computer 130 may release the purchased goods and/or services to the user 120 based on the authorization response message.
At the end of the day or at some other predetermined interval of time, a clearing and settlement process between the authorizing entity computer 150, the transaction processing network 140, and the acquirer computer 135 may occur. In the clearing and settlement process, account information and token exchanges that are similar to those in the above-described authorization processing steps can occur.
Accordingly, it may be possible to replace sensitive payment credentials with the payment token for purchases, but it may still be possible to track user 120 activity based on the payment token, as the payment token can remain static and can be submitted by multiple entities. The security of the payment token can be maintained by incorporating the token code and the domain ID, as the payment token may only be valid if accompanied by a valid token code and domain ID. Thus, with minimal changes to existing systems, payment security is improved without sacrificing the ability to track user 120 activity.
Before describing
Accordingly, in payment token systems, token holding entities may want to share payment tokens in the same way that other payment credentials have been shared in the past. However, in typical payment token systems, payment tokens are uniquely assigned to a domain. Only the token holder can use the payment token, so the payment token cannot be functionally shared. If a payment token is used in the wrong domain, the transaction may be rejected. For example, the hotel reservation website may have been provisioned with a payment token associated with a user. The hotel reservation website could send the payment token to the hotel, but the hotel will not be able to use the payment token.
Another problem with typical tokenization systems is that the user can no longer be tracked. In the past, the user could be tracked by a PAN across merchants and acquirers. However, in token systems, there may by multiple payment tokens associated with the same PAN. Accordingly, different merchants and domains cannot identify the user by a single static number, as they have done with the PAN in the past.
Embodiments of the invention solve these problems by using a single payment token. The user can be identified with the single payment token across domains (e.g., merchants and acquirers), similarly to how users have been tracked with a PAN in the past. However, embodiments are more secure than previous systems that shared the PAN, as the single payment token can only be used in authorized domains. If a domain is authorized to use the payment token, it may have a token code and domain ID to prove it.
In some embodiments, token holders/requestors may be able to share payment tokens, as discussed above. However, to maintain security, if a token holder receives a payment token from another token holder, instead of from the token vault, that token holder may need to seek authorization to use the token from the token vault. An example of such a token-sharing process, according to embodiments of the invention, can be described with respect to
A first token requester 115 may possess a payment token, a first token code, a first domain ID, and any other suitable information associated with a user payment account. The first token requestor 115 may want to share the payment token with a second token requestor 715. The first token requestor 115 and the second token requestor 715 may each be a merchant, mobile device, third-party token provider, or any other suitable entity.
At step S702, the first token requestor 115 may send the payment token to the second token requestor 715. The first token code may be withheld from the second token requestor 715, as it may be a shared secret that is only usable by the first token requestor 115. The first domain ID also be withheld, as it may be an identifier for the first token requestor 115 alone, and it may only be valid for the first token requestor 115.
At step S704, the second token requestor 715 may send a permission request to the token vault 110. The permission request may include the payment token, a second domain ID associated with the second token requestor 715, and any other suitable information. A permission request may differ from a token request in that a permission request includes a payment token, while a token request includes a PAN (or other suitable payment credentials).
At step S706, the token vault 110 may authenticate the second token requestor 715. For example, the token vault 110 may verify that the second domain ID is valid in the token requestor database 110E (e.g., via the authentication module 110G), or otherwise authenticate that the second token requestor 715 is eligible to receive payment tokens. If the second token requestor 715 is not yet registered with the token vault 110 and/or does not have a domain ID, the second token requestor 715 may be prompted to register before a second token code is generated.
At step S708, the token vault 110 may generate a second token code for the second token requestor 715 to use in conjunction with the payment token (e.g., via the token code generation module 110K).
At step S710, the token vault 110 may store a record indicating an association between the second token code, the payment token, and the second domain ID at the token code database 110D and/or the token database 110C (e.g., via the token code generation module 110K). For example, the second token code and the second domain ID may be added to a list of token codes and domain IDs that are authorized to use the payment token. In another example, the payment token and the second token code may be added to a list of payment tokens and token codes that the domain ID is authorized to use.
At step S712, the token vault 110 may send a permission response to the second token requestor 715. The token response may include the payment token, the second token code, and/or the second domain ID.
At step S714, the second token requestor 715 may store the payment token, the second token code, and/or the second domain ID. This may conclude the token provisioning process, and the second token requestor 715 may thereby be granted authorization to utilize the payment token for transactions.
Once the second token requestor 715 receives the payment token from the first token requestor 115, the two entities may be able to use the payment token to identify the user 120 when communicating about the user 120. Further, once the second token requestor 715 has the second token code, the second token requestor 715 may be able to use the payment token to submit charges associated with the user 120.
Embodiments of the invention have a number of advantages. Token proliferation issues are solved, as introducing token codes allows payment tokens to be re-used for multiple domains and transactions. In previous systems, there was a risk that the total number of possible token values would be exhausted, as multiple tokens were being rapidly distributed for single payment accounts. In contrast, token codes allow single payment tokens to be safely distributed to multiple token holders. In some embodiments, token codes can effectively serve to differentiate a single payment token into multiple unique (payment token+token code) pairs. Also, because introducing token codes reduces the amount of unique payment tokens needed, it may be easier to divide limited token BIN space among smaller issuers.
Additionally, embodiments allow tokens to be introduced without interrupting the user-activity tracking programs of several entities (e.g., acquirers, merchants). Entities that previously tracked a user's payment account activity based on a PAN can continue to track user activity based on a similarly formatted payment token that may now be present in each transaction involving the payment account.
Further, payment security can be increased. Instead of exposing sensitive payment credentials (e.g., a PAN), a payment token can be used. In some embodiments, additional authentication takes places when the payment token is used for a transaction. For example, a valid token code and corresponding domain ID may need be provided with the payment token. Token codes and domain IDs may only be available to registered token requestors. Thus, the entity submitting the payment token can be identified, and a shared secret (i.e., the token code) may protect the payment token from being fraudulently used. Additionally, payment tokens, token codes, and domain IDs can be refreshed periodically.
Another advantage in embodiments is that the system may be relatively easy to adopt. Merchants, acquirers, and other involved entities may be able to engage in the token system by simply passing along a token code and/or domain ID in an authorization message. Applications that previously relied on a PAN, such as loyalty, merchant-to-merchant communication, and other user tracking applications, may still function by utilizing the payment token (which may appear similar to the PAN). The token vault may be able to orchestrate issuing, authentication, and maintenance of payment tokens, token codes, and domain IDs such that other entities are not burdened. Also, in some embodiments, current authorization message formats may be able to accommodate the addition of the token code and/or domain ID without needing to add new fields or otherwise change the format of the messages. Thus, embodiments may provide an easy transition from traditional payment systems into token systems.
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 continuation of U.S. patent application Ser. No. 14/704,571, filed Jul. 22, 2015, which is a non-provisional application of and claims the benefit of the filing date of U.S. Provisional Application No. 61/988,815, filed on May 5, 2014, which is herein incorporated by reference in its entirety for all purposes.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5613012 | Hoffman | Mar 1997 | A |
| 5781438 | Lee | Jul 1998 | A |
| 5883810 | Franklin | Mar 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 |
| 6592044 | Wong | Jul 2003 | B1 |
| 6636833 | Flitcroft | Oct 2003 | 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 |
| 6968372 | Thompson | Nov 2005 | B1 |
| 6980670 | Hoffman | Dec 2005 | B1 |
| 6990470 | Hogan | Jan 2006 | B2 |
| 6991157 | Bishop | 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 |
| 7264154 | Harris | Sep 2007 | B2 |
| 7287692 | Patel | Oct 2007 | B1 |
| 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 |
| 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 |
| 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 |
| 8682802 | Kannanari | Mar 2014 | B1 |
| 8751391 | Freund | 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 |
| 9195984 | Spector | Nov 2015 | B1 |
| 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 |
| 9680942 | Dimmick | Jun 2017 | B2 |
| 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 |
| 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 |
| 20080072301 | Chia | Mar 2008 | A1 |
| 20080178274 | Nakhjiri | Jul 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 |
| 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 |
| 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 |
| 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 |
| 20110208600 | Aharoni et al. | 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 |
| 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 |
| 20120259782 | Hammad | Oct 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 et al. | Mar 2013 | A1 |
| 20130091028 | Oder, 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 |
| 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 |
| 20130211934 | Balasubramanian | 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 |
| 20130226813 | Voltz | Aug 2013 | A1 |
| 20130246199 | Carlson | Sep 2013 | A1 |
| 20130246202 | Tobin | Sep 2013 | A1 |
| 20130246203 | Laracey | Sep 2013 | A1 |
| 20130246258 | Dessert | Sep 2013 | A1 |
| 20130246259 | Dessert | Sep 2013 | A1 |
| 20130246261 | Purves et al. | Sep 2013 | A1 |
| 20130246267 | Tobin | Sep 2013 | A1 |
| 20130254028 | Salci | Sep 2013 | A1 |
| 20130254052 | Royyuru | 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 |
| 20130268776 | Motoyama | 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 |
| 20130346314 | Mogollon | Dec 2013 | 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 | Caiman | Jan 2014 | A1 |
| 20140032417 | Mattsson | Jan 2014 | A1 |
| 20140032418 | Weber | Jan 2014 | A1 |
| 20140032419 | Anderson et al. | 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 |
| 20140074724 | Gordon et al. | Mar 2014 | A1 |
| 20140108172 | Weber et al. | Apr 2014 | A1 |
| 20140108260 | Poole | Apr 2014 | A1 |
| 20140108265 | Hayhow et al. | Apr 2014 | A1 |
| 20140114857 | Griggs et al. | Apr 2014 | A1 |
| 20140122331 | Vaish et al. | May 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 |
| 20140330721 | Wang | Nov 2014 | A1 |
| 20140330722 | Laxminarayanan | 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 |
| 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 |
| 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 |
| 20160197725 | Hammad | Jul 2016 | A1 |
| 20160224976 | Basu | Aug 2016 | A1 |
| 20160308995 | Youdale et al. | Oct 2016 | A1 |
| 20170046696 | Powell et al. | Feb 2017 | A1 |
| 20170103387 | Weber | Apr 2017 | A1 |
| 20170186001 | Reed et al. | Jun 2017 | A1 |
| 20170220818 | Nagasundaram et al. | Aug 2017 | A1 |
| 20170228723 | Taylor | Aug 2017 | A1 |
| 20170295155 | Wong et al. | Oct 2017 | A1 |
| 20170364903 | Lopez | Dec 2017 | A1 |
| Number | Date | Country |
|---|---|---|
| 101014958 | Aug 2007 | CN |
| 102754116 | Oct 2012 | CN |
| 103270524 | Aug 2013 | CN |
| 2156397 | Feb 2010 | EP |
| 2001035304 | May 2001 | WO |
| 2004042536 | May 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 |
|---|
| “Payment Tokenisation Specification Technical Framework”, Retrieved from the internet: https://www.emvco.com/specifications.aspx?id=263, Mar. 31, 2014. |
| EP15789444.5 , “Extended European Search Report”, dated Nov. 20, 2017, 11 pages. |
| SG11201609216Y , “Written Opinion”, dated Dec. 13, 2017, 7 pages. |
| PCT International Search Report dated Jul. 23, 2015 in connection with International Application No. PCT/US2015/029267, filed May 5, 2015, 12 pages. |
| Petition for Inter Partes Review of U.S. Pat. No. 8,533,860 Challenging Claims 1-30 Under 35 U.S.C. .sctn. 312 and 37 C.F.R. .sctn. 42.104, filed Feb. 17, 2016, Before the USPTO Patent Trial and Appeal Board, IPR 2016-00600, 65 pages. |
| Wang, U.S. Appl. No. 62/000,288 (unpublished), Payment System Canonical Address Format filed May 19, 2014. |
| Sharma et al., U.S. Appl. No. 62/003,717 (unpublished), Mobile Merchant Application filed May 28, 2014. |
| Kalgi et al., U.S. Appl. No. 62/024,426, (unpublished) Secure Transactions Using Mobile Devices filed Jul. 14, 2014. |
| Prakash et al., U.S. Appl. No. 62/037,033 (unpublished), Sharing Payment Token filed Aug. 13, 2014. |
| Hoverson et al., U.S. Appl. No. 62/038,174 (unpublished), Customized Payment Gateway filed Aug. 15, 2014. |
| Wang, U.S. Appl. No. 62/042,050 (unpublished), Payment Device Authentication and Authorization System filed Aug. 26, 2014. |
| Gaddam et al., U.S. Appl. No. 62/053,736 (unpublished), Completing Transactions Without a User Payment Device filed Sep. 22, 2014. |
| Patterson, U.S. Appl. No. 62/054,346 (unpublished), Mirrored Token Vault filed Sep. 23, 2014. |
| Dimmick, U.S. Appl. No. 14/952,514 (unpublished), Systems Communications With Non-Sensitive Identifiers filed Nov. 25, 2015. |
| Dimmick, U.S. Appl. No. 14/952,444 (unpublished), Tokenization Request Via Access Device filed Nov. 25, 2015. |
| Prakash et al., U.S. Appl. No. 14/955,716 (unpublished), Provisioning Platform for Machine-To-Machine Devices filed Dec. 1, 2015. |
| Wong et al., U.S. Appl. No. 14/966,948 (unpublished), Automated Access Data Provisioning filed Dec. 11, 2015. |
| Stubbs et al., U.S. Appl. No. 62/103,522 (unpublished), Methods and Systems for Wallet Provider Provisioning filed Jan. 14, 2015. |
| McGuire, U.S. Appl. No. 14/600,523 (unpublished), Secure Payment Processing Using Authorization Request filed Jan. 20, 2015. |
| Flurscheim et al., U.S. Appl. No. 15/004,705 (unpublished), Cloud-Based Transactions With Magnetic Secure Transmission filed Jan. 22, 2016. |
| Flurscheim et al., U.S. Appl. No. 62/108,403 (unpublished), Wearables With NFC HCE filed Jan. 27, 2015. |
| Sabba et al., U.S. Appl. No. 15/011,366 (unpublished), Token Check Offline filed Jan. 29, 2016. |
| Patterson, U.S. Appl. No. 15/019,157 (unpublished), Token Processing Utilizing Multiple Authorizations filed Feb. 9, 2016. |
| Cash et al., U.S. Appl. No. 15/041,495 (unpublished), Peer Forward Authorization of Digital Requests filed Feb. 11, 2016. |
| Le Saint et al., , U.S. Appl. No. 15/008,388 (unpublished), Methods for Secure Credential Provisioning filed Jan. 27, 2016. |
| Kinagi, U.S. Appl. No. 62/117,291 (unpublished), Token and Cryptogram Using Transaction Specific Information filed Feb. 17, 2015. |
| Galland et al. U.S. Appl. No. 62/128,709 (unpublished), Tokenizing Transaction Amounts filed Mar. 5, 2015. |
| Rangarajan et al., U.S. Appl. No. 61/751,763 (unpublished), Payments Bridge filed Jan. 11, 2013. |
| Li, U.S. Appl. No. 61/894,749 (unpublished), Methods and Systems for Authentication and Issuance of Tokens in a Secure Environment filed Oct. 23, 2013. |
| Aissi et al., U.S. Appl. No. 61/738,832 (unpublished), Management of Sensitive Data filed Dec. 18, 2012. |
| Wong et al., U.S. Appl. No. 61/879,362 (unpublished), Systems and Methods for Managing Mobile Cardholder Verification Methods filed Sep. 18, 2013. |
| Powell, U.S. Appl. No. 61/892,407 (unpublished), Issuer Over-The-Air Update Method and System filed Oct. 17, 2013. |
| Powell, U.S. Appl. No. 61/926,236 (unpublished), Methods and Systems for Provisioning Mobile Devices With Payment Credentials and Payment Token Identifiers filed Jan. 10, 2014. |
| Kaja, et al., U.S. Appl. No. 15/585,077 (Unpublished), System and Method Using Interaction Token, filed May 2, 2017. |
| Chipman, et al., U.S. Appl. No. 15/265,282 (Unpublished), Self-Cleaning Token Vault, filed Sep. 14, 2016. |
| Lopez, et al., U.S. Appl. No. 15/462,658 (Unpublished), Replacing Token on a Multi-Token User Device, filed Mar. 17, 2017. |
| First Office Action, dated Feb. 2, 2019, in Chinese Application No. 201580023408.3, 6 pages. |
| EP15789444.5 , “Office Action”, dated Jan. 28, 2020, 14 pages. |
| AU2015256205 , “First Examination Report”, dated Jan. 28, 2020, 3 pages. |
| PCT/US2015/031968, “International Search Report and Written Opinion”, dated Jul. 27, 2015, 7 pages. |
| EP15789444.5 , “Summons to Attend Oral Proceedings”, dated Jul. 3, 2020, 13 pages. |
| Application No. SG10201803024S , Notice of Decision to Grant, dated Jun. 19, 2020, 4 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20180069936 A1 | Mar 2018 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61988815 | May 2014 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 14704571 | May 2015 | US |
| Child | 15806947 | US |
