Tokens are used in transactions to access resources such as goods, data, or secure locations. A token can be a substitute for a real credential such as a real account identifier, and can provide data security by protecting the real credential. If the token is stolen by a man-in-the-middle or a hacker, the real credential is protected from unauthorized use.
In some cases, an additional piece of data such as a dynamic cryptogram must accompany the token in order for the token to be used. That is, for each transaction that uses a token, a user (or a communication device or resource provider acting on behalf of the user) needs to request a new cryptogram for the token from a token computer. The new cryptogram needs to accompany the token when the token is used in a transaction. Such cryptograms may be characterized as being “dynamic cryptograms,” since they are changed frequently or for every transaction.
Using a new cryptogram with every token transaction improves data security relative to situations where only tokens are used to conduct transactions. If the new cryptogram is not present in an authorization request message in a transaction, then it will be declined since a valid cryptogram does not accompany the token.
Although the use of dynamic cryptograms for transactions is effective, improvements could made. For example, not all types of transactions are suitable for use with dynamic cryptograms. As an illustration, an interaction such as a recurring payment transaction conducted using an application on a user's mobile phone may not be capable of requesting a cryptogram each time a payment is made using the application. For example, as noted above, a dynamic cryptogram may only be generated when a user initiates a transaction. In this case, a token computer may only provide a cryptogram to a token holder (e.g., the user that is conducting the transaction) if it can perform some basic level of authentication (e.g., checking a device ID of the communication device requesting the cryptogram, or requesting a password from the token holder) of the token holder. However, in the case of a recurring payment, the merchant, and not the user, is requesting payment. The merchant is unable to request a dynamic cryptogram, because the merchant is not the token holder.
One way has been developed to circumvent the requirement of having a dynamic cryptogram accompany a token in every authorization request message from a recurring merchant. After an initial transaction is conducted with a merchant that conducts recurring transactions, a transaction identifier can be provided to the merchant or the merchant's acquirer from an issuer or a payment processing network. The merchant or the merchant's acquirer must then re-submit the transaction identifier along with future authorization requests for transactions that are not initiated by the user. A processing computer that receives the authorization request messages with the transaction identifier may use the transaction identifier as proof that the transaction is being conducted on behalf of a recurring merchant that was authorized to submit authorization request messages for transactions not initiated by the user.
Unfortunately, this solution does not work that well, because many merchant and acquirer systems are not equipped to store and re-transmit transaction identifiers in authorization request messages. In order for such systems to work, each and every merchant and/or merchant's acquirer needs to modify their systems in order to accommodate the storage and processing of transaction identifiers. This is burdensome, and it is difficult to achieve universal adoption of the solution.
Embodiments of the invention address these and other problems, individually and collectively.
One embodiment of the invention is includes a method comprising: receiving, by a resource provider computer, a communication comprising a real credential from a communication device; providing, by the resource provider computer, the real credential to a token computer, wherein the token computer generates a token and a cryptogram, and wherein the cryptogram is formed using a resource provider initiated transaction indicator; receiving, by the resource provider computer from the token computer, the token and the cryptogram; transmitting, by the resource provider computer to a processing computer, an authorization request message comprising the token, the cryptogram, a resource provider identifier, and a transaction amount for a first transaction, wherein the processing computer validates the cryptogram, exchanges the token for the real credential, stores the resource provider identifier, and forwards the authorization request message including the real credential, and the transaction amount to an authorizing entity computer; and receiving, by the resource provider computer, an authorization response message from the authorizing entity computer.
Another embodiment of the invention includes a method comprising: receiving, by a token computer, a communication comprising a real credential from a communication device for a transaction conducted with a resource provider computer; obtaining, by the token computer, a token and a cryptogram, wherein the cryptogram is formed using a resource provider initiated transaction indicator; receiving, by the token computer, a request to exchange the token with the real credential from a processing computer; and transmitting, by the token computer, a response including the token to the processing computer, wherein the processing computer exchanges the token with the real credential in an authorization request message from the resource provider computer, the authorization request message including the real credential and a transaction amount, and processes the authorization request message.
Other embodiments include a computer comprising: a processor; and a computer readable medium coupled to the processor, the computer readable medium comprising code, executable by the processor, for performing the above-described methods.
These and other embodiments of the invention are described in further detail below.
Embodiments of the present invention are directed to methods and systems that can simplify transactions.
A “communication device” may comprise any suitable electronic device that may be operated by a user, which may also provide remote communication capabilities to a network. A “mobile communication device” may be an example of a “communication device” that can be easily transported. 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 communication 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 communication devices include wearable devices, such as smart watches, fitness bands, ankle bracelets, rings, earrings, etc., as well as automobiles with remote communication capabilities. In some embodiments, a mobile communication device can function as a payment device (e.g., a mobile communication device can store and be able to transmit payment credentials for a transaction).
A “payment device” may include any suitable device that may be used to conduct a financial transaction, such as to provide payment credentials to a merchant. The payment device may be a software object, a hardware object, or a physical object. As examples of physical objects, the payment device may comprise a substrate such as a paper or plastic card, and information that is printed, embossed, encoded, or otherwise included at or near a surface of an object. A hardware object can relate to circuitry (e.g., permanent voltage values), and a software object can relate to non-permanent data stored on a device. A payment device may be associated with a value such as a monetary value, a discount, or store credit, and a payment device may be associated with an entity such as a bank, a merchant, a payment processing network, or a person. Suitable payment devices can be hand-held and compact so that they can fit into a user's wallet and/or pocket (e.g., pocket-sized). Example payment devices may include smart cards, magnetic stripe cards, keychain devices (such as the Speedpass™ commercially available from Exxon-Mobil Corp.), etc. Other examples of payment devices include payment cards, smart media, transponders, and the like. If the payment device is in the form of a debit, credit, or smartcard, the payment device may also optionally have features such as magnetic stripes. Such devices can operate in either a contact or contactless mode.
A “credential” may be any suitable information that serves as reliable evidence of worth, ownership, identity, or authority. A credential may be a string of numbers, letters, or any other suitable characters, as well as any object or document that can serve as confirmation. Examples of credentials include value credentials (e.g., payment credentials), identification cards, certified documents, access cards, passcodes and other login information, 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, and verification values such as CVV, dCVV, CVV2, dCVV2, and CVC3 values.
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 “token” may be a substitute value for a credential. A token may be a string of numbers, letters, or any other suitable characters. Examples of tokens include payment tokens, access tokens, personal identification tokens, etc.
A “payment token” may include an identifier for a payment account that is a substitute for an account identifier, such as a primary account number (PAN). For example, a payment 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 payment 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 payment 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 payment token may be generated such that the recovery of the original PAN or other account identifier from the token value may not be computationally derived. Further, in some embodiments, the token format may be configured to allow the entity receiving the token to identify it as a token and recognize the entity that issued the token.
“Tokenization” is a process by which data is replaced with substitute data. For example, a payment account identifier (e.g., a primary account number (PAN)) may be tokenized by replacing the primary account identifier with a substitute number (e.g. a token) that may be associated with the payment account identifier. Further, tokenization may be applied to any other information that may be replaced with a substitute value (i.e., token).
A “token issuer,” token provider” or “token service system” can include a system that services tokens. It may operate a token computer. 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 tokens to obtain the actual PANs. In some embodiments, a token service system may include a tokenization computer alone, or in combination with other computers such as a transaction processing 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.
A “token domain” may indicate an area and/or circumstance in which a token can be used. Examples of token domains 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 to enforce 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.
A “token expiry date” may refer to the expiration date/time of the token. The token expiry date may be passed among the entities of the tokenization ecosystem during transaction processing to ensure interoperability. The token expiration date may be a numeric value (e.g., a 4-digit numeric value). In some embodiments, the token expiry date can be expressed as a time duration as measured from the time of issuance.
A “token request message” may be an electronic message for requesting a token. A token request message may include information usable for identifying a payment account or digital wallet, and/or information for generating a payment token. For example, a token request message may include payment credentials, mobile device identification information (e.g., a phone number or MSISDN), a digital wallet identifier, information identifying a tokenization service provider, a merchant identifier, a cryptogram, and/or any other suitable information. Information included in a token request message can be encrypted (e.g., with an issuer-specific key).
A “token response message” may be a message that responds to a token request. A token response message may include an indication that a token request was approved or denied. A token response message may also include a token, mobile device identification information (e.g., a phone number or MSISDN), a digital wallet identifier, information identifying a tokenization service provider, a merchant identifier, a cryptogram, and/or any other suitable information. Information included in a token response message can be encrypted (e.g., with an issuer-specific key).
A “token requestor identifier” may include any characters, numerals, or other identifiers associated with an entity associated with a network token system. For example, a token requestor identifier may be associated with an entity that is registered with the network token system. In some embodiments, a unique token requestor identifier may be assigned for each domain for a token request associated with the same token requestor. For example, a token requestor identifier can identify a pairing of a token requestor (e.g., a mobile device, a mobile wallet provider, etc.) with a token domain (e.g., e-commerce, contactless, etc.). A token requestor identifier may include any format or type of information. For example, in one embodiment, the token requestor identifier may include a numerical value such as a ten digit or an eleven digit number (e.g., 4678012345).
A “user” may include an individual. In some embodiments, a user 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 in some embodiments.
A “resource provider” may be an entity that can provide a resource such as goods, services, information, and/or access. Examples of resource providers includes merchants, data providers, transit agencies, governmental entities, venue and dwelling operators, etc.
A “merchant” may typically be an entity that engages in transactions and can sell goods or services, or provide access to goods or services.
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 acquirer may operate an acquirer computer, which can also be generically referred to as a “transport computer”.
An “authorizing entity” may be an entity that authorizes a request. Examples of an authorizing entity may be an issuer, a governmental agency, a document repository, an access administrator, etc.
An “issuer” may typically refer to a business entity (e.g., a bank) that maintains an account for a user. An issuer may also issue payment credentials stored on a communication device, such as a cellular telephone, smart card, tablet, or laptop to the consumer.
An “authorization request message” may be an electronic message that requests authorization for a transaction. In some embodiments, it is sent to a transaction processing computer and/or an issuer of a payment card to request authorization for a transaction. An authorization request message according to some embodiments may comply with ISO 8583, which is a standard for systems that exchange electronic transaction information associated with a payment made by a user using a payment device or payment account. The authorization request message may include an issuer account identifier that may be associated with a payment device or payment account. An authorization request message may also comprise additional data elements corresponding to “identification information” including, by way of example only: a service code, a CVV (card verification value), a dCW (dynamic card verification value), a PAN (primary account number or “account number”), a payment token, a user name, an expiration date, etc. An authorization request message may also comprise “transaction information,” such as any information associated with a current transaction, such as the transaction amount, merchant identifier, merchant location, acquirer bank identification number (BIN), card acceptor ID, information identifying items being purchased, etc., as well as any other information that may be utilized in determining whether to identify and/or authorize a transaction.
An “authorization response message” may be a message that responds to an authorization request. In some cases, it may be an electronic message reply to an authorization request message generated by an issuing financial institution or a transaction processing computer. The authorization response message may include, by way of example only, one or more of the following status indicators: Approval—transaction was approved; Decline—transaction was not approved; or Call Center—response pending more information, merchant must call the toll-free authorization phone number. The authorization response message may also include an authorization code, which may be a code that a credit card issuing bank returns in response to an authorization request message in an electronic message (either directly or through the transaction processing computer) to the merchant's access device (e.g. POS equipment) that indicates approval of the transaction. The code may serve as proof of authorization.
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 comprise one or more computational apparatuses and may use any of a variety of computing structures, arrangements, and compilations for servicing the requests from one or more client computers.
A method and system according to an embodiment of the invention can be described with reference to
Each of the entities in
In step S102, a resource provider computer 110 receives a communication comprising a real credential such as a real account identifier (e.g., a PAN or a primary account number) and an indication that recurring transactions will be conducted with the real account identifier, from a communication device 101. The indication may be formed in response to a user selecting a button on a Website or application hosted by the resource provider associated with the resource provider computer 110. By selecting the button, the user agrees to allow the resource provider associated with the resource provider computer 110 to make future payments on a recurring basis using the real account identifier (or token based upon the real account identifier) on behalf of the user. For example, the user of the communication device 101 may wish to purchase a recurring video subscription from the resource provider computer 110 (e.g., a recurring video subscription service such as Netflix™) using an application on the communication device 101. When the user enters her credit card number into the application, the user may be prompted to allow the resource provider to conduct future transactions for the user without the user's involvement. A button may be provided on the application, and the user can agree to this by selecting the button.
In step S104, after receiving the communication comprising the real account identifier and the indication that recurring transactions will be conducted with the real account identifier, the resource provider computer 110 can transmit a token request message for a token to the token computer 130 to request a token to process an initial payment for the requested resource. In some embodiments, the resource provider computer 110 may interact with the token computer 130 through a dedicated API or through a resource locator such as a URL.
In step S106, the token computer 130 may obtain (e.g., generate or retrieve) the token and a cryptogram for the resource provider computer 110. The token may be obtained in any suitable manner. In some embodiments, a token may be obtained by using various inputs (e.g., the real account identifier) and a mathematical function. In other embodiments, tokens may be preformed (and may not be mathematically derived from a real account identifier) and may be stored in a database. A token may be obtained by selecting a pre-existing token from the database.
The cryptogram may be generated by encrypting certain data using a cryptographic key (e.g., a symmetric key). An algorithm based on a scheme such as DES, triple DES, or AES may be used to form the cryptogram. In this case, since the resource computer 110 has indicated that recurring transactions will be conducted with the real account identifier, the data that is encrypted can include a “future MIT indicator” or generically a “resource provider initiated transaction indicator.” Other types of token requests from merchants that do not conduct recurring payment transactions would not include the resource provider initiated transaction indicator in the cryptogram.
Other data may also be encrypted along with the resource provider initiated transaction indicator in the cryptogram. Such other data may include static data such as the token, the real credential, and/or a device identifier associated with the communication device 101. Other data may also include dynamic data such as counters, the time of day, etc. In some embodiments, dynamic data, static data, and the resource provider initiated transaction indicator, or portions thereof, may be concatenated (and also possibly truncated or modified), and then encrypted using an encryption algorithm and an appropriate cryptographic key. The cryptographic key may be a symmetric key of a key pair. In some embodiments, the other key of the key pair may be held by the processing computer 120, which may validate the cryptogram during a transaction.
In step S108, after the token computer 130 obtains the token and the cryptogram, the token computer 130 provides (e.g., transmits) the token and the cryptogram to the resource provider computer 110.
In steps S110 and S114, after receiving the token and the cryptogram from the token computer 130, the resource provider computer 110 then generates and transmits an authorization request message comprising at least the token, the cryptogram, a resource provider identifier, and a transaction amount for a first transaction to the processing computer 120 via the transport computer 115. The cryptogram may be present in a cryptogram data field in the authorization request message. The transport computer 115 may be an acquirer computer. Other data that may be in the authorization request message may be an acquirer identifier (e.g., an acquirer BIN or bank identification number) and/or acceptor identifier.
In step S116, after receiving the authorization request message, the processing computer 120 validates the cryptogram, and then stores the resource provider identifier, the resource provider initiated transaction indicator, and optionally the token (or its corresponding real account identifier) in a database. Other information that may be stored along with the resource provider identifier in the data that may be obtained from the authorization request message or from some other source may include an acquirer BID (bank ID), and a card acceptor ID. The validation of the cryptogram may include decrypting the cryptogram using an appropriate cryptographic key to obtain the inputs to the cryptogram, where the inputs may include the resource provider initiated transaction indictor and other information in the cryptogram. The processing computer 120 may recognize the presence of the resource provider initiated transaction indictor, and may recognize that the resource provider computer 110 should thereafter be designated as a one which will submit recurring authorization request messages on behalf of the user of the communication device 101 without any involvement of the user of the communication device 101.
The cryptographic key that is used to decrypt the cryptogram may be one key of a key pair. The other key of the key pair may be shared with the token computer 130 and may have been used to form the cryptogram. The cryptographic keys may be symmetric keys that may be independently generated by the token computer 130 and the processing computer 120 using shared secrets and algorithms. Alternatively, the token computer 130 could generate a symmetric key and may deliver the corresponding symmetric key to the processing computer 120 (using secure key delivery methods), or vice-versa.
After the processing computer 120 has validated the cryptogram, in step S117, it may then obtain the real account identifier from the token computer 130. The processing computer 120 may transmit a detokenization request message including the token to the token computer 130. The token computer 130 may then search a database for the real account identifier using the token, and may transmit a detokenization response message including the real account identifier back to the processing computer 120.
In step S118, the processing computer 120 modifies the authorization request message to include the real account identifier, and then forwards the authorization request message including at least the real account identifier and the transaction amount to the authorizing entity computer 140. The authorizing entity computer 140 may then evaluate the authorization request message and may then generate an authorization response message indicating that the transaction is either approved or declined.
In step S120, the authorization response message is transmitted by the authorizing entity computer 140 to the processing computer 120. In step S121, the processing computer 120 can communicate with the token computer 130 to exchange the real account identifier for the token. In step S122, the processing computer 120 can modify the authorization response message to include the token instead of the real account identifier. In steps S124 and S126, the processing computer 120 may forward the authorization response message with the token to the resource provider computer via the transport computer 116. In step S128, a clearing and settlement process can occur at a later time between the transport computer 115, the processing computer 120, and the authorizing entity computer 140.
At some later point in time, a second transaction may be initiated by the resource provider computer 110 without requiring any action on the part of the user of the communication device 101. This might occur, for example, if the second transaction is a recurring payment transaction (e.g., for a subscription service) that is initiated by the resource provider computer 110 (or a resource provider application on the communication device 101), and not the user of the communication device 101.
In step S130, the resource provider computer 110 generates a second authorization request message comprising at least the token, a transaction amount, and a resource provider identifier without interacting with the user of the communication device 101. The second authorization request message comprises a cryptogram data field. The cryptogram data field comprises the cryptogram (i.e., the cryptogram that was generated in the first transaction) or no cryptogram. The cryptogram data field in the second authorization request message does not contain a new cryptogram, since the user communication device 101 did not initiate the second transaction.
Further, in steps S130 and S132, the resource provider computer 110 transmits the second authorization request message to the processing computer 120 via the transport computer 115. In step S134, the processing computer 120 analyzes the authorization request message and determines that the cryptogram data field contains the cryptogram or no cryptogram, and allows the second transaction to proceed, even though the cryptogram data field contains the cryptogram or no cryptogram, and does not contain a new cryptogram. Upon determining that the cryptogram data field contains an invalid cryptogram or no cryptogram, the processing computer can search its database to determine if the resource provider identifier and/or the token is associated with a resource provider initiated transaction indicator in the database. In some embodiments, the processing computer 120 can compare a resource provider identifier and other data such as an acquirer BID (bank ID), and a card acceptor ID, in the second authorization request message with the data in the database at the processing computer 120. The data in the database may include data such as the resource provider identifier and the other data stored along with an indication that any transactions submitted with the resource provider identifier will be treated as a resource provider initiated transaction (e.g., a merchant imitated transaction). After the processing computer 120 determines that the second transaction is a resource provider initiated transaction, in step 135, processing computer 120 can obtain the real account identifier for the token by communicating with the token computer 130.
If the transaction was not a recurring transaction, the second transaction would be declined as a new cryptogram needs to be obtained for every transaction. In conventional systems, cryptograms would only be generated if the user of the user communication device 110 specifically interacted in the transaction. However, in embodiments of the invention, the processing computer 120 was previously informed that the resource provider computer would be submitting future transactions that are not initiated by the user of the user communication device 110.
In step S136, the authorization request message comprising the real account identifier is transmitted to the authorizing entity computer 140. In step S140, the authorizing entity computer 140 generates and transmits an authorization response message. Steps S136, and S140 may be similar to steps S118 and S120.
In step S141, the processing computer 120 communicates with the token computer 130 to exchange the real account identifier for the token. In step S142, the processing computer 120 then modifies the authorization response message to include the token instead of the real account identifier. In step S144, the processing computer 120 transmits the authorization response message to the transport computer 115. In step S146, the transport computer 115 transmits the authorization response message to the resource provider computer 110. In step S148, after the authorization response message is received by the resource provider computer 110, and at a later point in time, a clearing and settlement process can occur between the transport computer 115 and the authorizing entity computer 140.
In some embodiments, the processing computer 120 may continue to accept transactions with the same cryptogram or without any cryptogram in the cryptogram data field in the authorization request message for any suitable predetermined period of time (e.g., 3 months).
Embodiments of the invention have a number of advantages. For example, one advantage of this approach compared to conventional solutions is that embodiments minimize changes to a merchant/acquirer infrastructure, since transaction identifiers need not be re-submitted with every recurring transaction. Embodiments also minimize resource provider opportunities to “cheat,” by requiring them to have their users initially initiate transactions to obtain authentic cryptograms for initial transactions. Also, embodiments of the invention use tokens that protect real credentials during transactions, and the use of cryptograms can restrict the use of tokens in certain domains to further improve security relative to conventional payment transactions.
Device hardware 204 may include a processor 206, a short range antenna 214, a long range antenna 216, input elements 210, a user interface 208, and output elements 212 (which may be part of the user interface 208). Examples of input elements may include microphones, keypads, touchscreens, sensors, etc. Examples of output elements may include speakers, display screens, and tactile devices. The processor 206 can be implemented as one or more integrated circuits (e.g., one or more single core or multicore microprocessors and/or microcontrollers), and is used to control the operation of mobile communication device 200. The processor 206 can execute a variety of programs in response to program code or computer-readable code stored in the system memory 202, and can maintain multiple concurrently executing programs or processes.
The long range antenna 216 may include one or more RF transceivers and/or connectors that can be used by mobile communication device 200 to communicate with other devices and/or to connect with external networks. The user interface 208 can include any combination of input and output elements to allow a user to interact with and invoke the functionalities of mobile communication device 200. The short range antenna 214 may be configured to communicate with external entities through a short range communication medium (e.g. using Bluetooth, Wi-Fi, infrared, NFC, etc.).
The system memory 202 can be implemented using any combination of any number of non-volatile memories (e.g., flash memory) and volatile memories (e.g. DRAM, SRAM), or any other non-transitory storage medium, or a combination thereof media.
The system memory 202 may also store a resource provider application 202A, a voice assistant module 202B, an authentication module 202C, credentials and/or tokens 202D, and an operating system 202E.
The resource provider application 202A may be an application for a resource provider. The resource provider application 202A (or an associated resource provider application server computer) may be used to conduct recurring transaction such as recurring payments in some instances.
The voice assistant module 202B may, in conjunction with the processor 206, allow the user to provide voice commands to the mobile communication device 200. The authentication module 202C may, in conjunction with the processor 206, authenticate the user of the communication device 200 in any suitable manner (e.g., using passwords).
System memory 202 may also store credentials and/or tokens 202D. Credentials and/or tokens 202D may include information identifying the mobile communication device 200 and/or the user of the mobile communication device 200. Examples of credentials may include a public key associated with the mobile communication device 200 and/or a user of the mobile communication device 200, a digital signature (e.g., the public key of the mobile communication device 200 signed by a key of the authentication system), payment credentials such as PANs or biometric data (e.g., biometric samples or templates), etc.
The computer readable medium 304 may store code or instructions for allowing access device 300 to operate in the manner described herein. The instructions may cause the processor 302 to perform a method including: receiving, by a resource provider computer, a communication comprising a real credential from a communication device; providing, by the resource provider computer, the real credential to a token computer, wherein the token computer obtains a token and a cryptogram, wherein the cryptogram is formed using a resource provider initiated transaction indicator; receiving, by the resource provider computer from the token computer, the token and the cryptogram; transmitting, by the resource provider computer to a processing computer, an authorization request message comprising the token, the cryptogram, a resource provider identifier, and a transaction amount for a first transaction, wherein the processing computer validates the cryptogram, exchanges the token for the real credential, stores the resource provider identifier, and forwards the authorization request message including the real credential, and the transaction amount to an authorizing entity computer; and receiving, by the resource provider computer, an authorization response message from the authorizing entity computer
The computer readable medium 304 may further comprise a host application module 304A, a transaction authorization module 304B, and a token interaction module 304C.
The host application module 304A may be an application that interfaces with an application on the communication device. In some embodiments, the host application module 304A may be a Web service application or other application that can initiate transactions on behalf of a user.
The transaction authorization module 304B may, in conjunction with the processor 302, generate and/or transmit authorization request messages, and receive authorization response messages.
The token interaction module 304C may, in conjunction with the processor 302, interact with a token computer to obtain cryptograms or tokens. The token interaction module 304C may in some cases include an API that is associated with the token computer.
The network interface 306 may comprise any suitable hardware or software that can allow the token computer 300 to communicate with external entities. Some examples of network interfaces may include a modem, a physical network interface (such as an Ethernet card or other Network Interface Card (NIC)), a virtual network interface, a communications port, a Personal Computer Memory Card International Association (PCMCIA) slot and card, or the like.
The computer readable medium 404 may comprise code, executable by the processor 402 to perform a method including: receiving, by a token computer, a communication comprising a real credential from a communication device for a transaction conducted with a resource provider computer; obtaining, by the token computer, a token and a cryptogram, wherein the cryptogram is formed using a resource provider initiated transaction indicator; receiving, by the token computer, a request to exchange the token for the real credential from a processing computer; and transmitting, by the token computer, a response including the token to the processing computer, wherein the processing computer exchanges the token with the real credential in an authorization request message from the resource provider computer, the authorization request message including the real credential and a transaction amount, and processes the authorization request message.
The computer readable medium 404 may comprise a token exchange module 404A, a cryptogram generation module 404B, and an authentication module 404C.
The token vault 406 may store tokens and their associated credentials in a database. Other data that may be present in the token value 406 may include restrictions on the use of tokens, cryptograms, etc. The token vault 406 may store data in a database such as an Oracle™ database.
The tokenization exchange module 404A may comprise code that causes the processor 402 to provide tokens for real credentials or vice-versa. For example, the token exchange module 404A may contain logic that causes the processor 402 to receive a real credential, search the token vault 406, and return a token. It may also contain logic that causes the processor 402 to receive a token, search the token vault 406, and return a real credential.
The cryptogram generation module 404B may comprise code that causes the processor 402 to generate cryptograms for tokens. The generation of cryptograms is described above.
The authentication module 404C may comprise code that causes the processor 402 to authenticate communication devices, users, processor computers, etc. to verify their ability to receive certain data such as tokens or cryptograms. In some embodiments, the authentication module 404C, in conjunction with the processor 402, may verify device identifiers or IP addresses associated with communication devices to ensure that they are authentic. It may also verify user credentials such as passwords or secrets to ensure that the user that is using a particular communication device is legitimate.
The computer readable medium 504 may comprise a number of software modules including an authorization processing module 504A, a cryptogram validation module 504B, and a token process module 504C. The computer readable medium may also comprise a clearing and settlement module (not shown).
The authorization processing module 504A may comprise code that can cause the processor 502 to evaluate authorization request messages for transactions and determine if the transactions should be authorized. The authorization processing module 504A may also include code for routing or modifying authorization request and response messages as they pass between various parties such as authorizing entity computers (e.g., issuer computers) and transport computers (e.g., acquirer computers).
The cryptogram validation module 504B may include a module that can validate cryptograms. Suitable data encryption/decryption algorithms may include DES, triple DES, AES, etc. It may also store encryption keys that can be used with such encryption/decryption algorithms. The cryptogram module 504B may utilize symmetric or asymmetric encryption techniques to encrypt and/or verify data. Cryptographic keys that may be used by the cryptogram module 504B may be securely stored in the data storage 506. Cryptogram validation processes are further described above.
The token process module 504C may comprise code that causes the processor 502 to communicate with the token computer, as described above.
In some embodiments, the processing computer 500 may be in a payment processing network and may include data processing subsystems, networks, and operations used to support and deliver authorization services, exception file services, and clearing and settlement services. An exemplary payment processing network may include VisaNet™. Payment processing networks such as VisaNet™ are able to process credit card transactions, debit card transactions, and other types of commercial transactions. VisaNet™, in particular, includes a VIP system (Visa Integrated Payments system) which processes authorization requests and a Base II system which performs clearing and settlement services. The payment processing network may use any suitable wired or wireless network, including the Internet.
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 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.
The above description is illustrative and is not restrictive. Many variations of the invention may become apparent to those skilled in the art upon review of the disclosure. The scope of the invention can, therefore, be determined not with reference to the above description, but instead can be determined with reference to the pending claims along with their full scope or equivalents.
One or more features from any embodiment may be combined with one or more features of any other embodiment without departing from the scope of the invention.
A recitation of “a”, “an” or “the” is intended to mean “one or more” unless specifically indicated to the contrary.
All patents, patent applications, publications, and descriptions mentioned above are herein incorporated by reference in their entirety for all purposes. None is admitted to be prior art.
This application is a continuation of U.S. patent application Ser. No. 16/444,339, filed on Jun. 18, 2019, which is a non-provisional application of and claims priority to U.S. Provisional Application No. 62/686,381, filed on Jun. 18, 2018, which are herein incorporated by reference in their entirety for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
5280527 | Gullman et al. | Jan 1994 | A |
5613012 | Hoffman et al. | Mar 1997 | A |
5781438 | Lee et al. | Jul 1998 | A |
5883810 | Franklin et al. | Mar 1999 | A |
5930767 | Reber et al. | Jul 1999 | A |
5953710 | Fleming | Sep 1999 | A |
5956699 | Wong et al. | Sep 1999 | A |
6000832 | Franklin et al. | Dec 1999 | A |
6014635 | Harris et al. | Jan 2000 | A |
6044360 | Picciallo | Mar 2000 | A |
6163771 | Walker et al. | Dec 2000 | A |
6227447 | Campisano | May 2001 | B1 |
6236981 | Hill | May 2001 | B1 |
6267292 | Walker et al. | Jul 2001 | B1 |
6327578 | Linehan | Dec 2001 | B1 |
6341724 | Campisano | Jan 2002 | B2 |
6385596 | Wiser et al. | May 2002 | B1 |
6422462 | Cohen | Jul 2002 | B1 |
6425523 | Shem-Ur et al. | Jul 2002 | B1 |
6453301 | Niwa | Sep 2002 | B1 |
6592044 | Wong et al. | Jul 2003 | B1 |
6636833 | Flitcroft et al. | Oct 2003 | B1 |
6748367 | Lee | Jun 2004 | B1 |
6805287 | Bishop et al. | Oct 2004 | B2 |
6879965 | Fung et al. | Apr 2005 | B2 |
6891953 | DeMello et al. | May 2005 | B1 |
6901387 | Wells et al. | May 2005 | B2 |
6931382 | Laage et al. | Aug 2005 | B2 |
6938019 | Uzo | Aug 2005 | B1 |
6941285 | Sarcanin | Sep 2005 | B2 |
6980670 | Hoffman et al. | Dec 2005 | B1 |
6990470 | Hogan et al. | Jan 2006 | B2 |
6991157 | Bishop et al. | Jan 2006 | B2 |
7051929 | Li | May 2006 | B2 |
7069249 | Stolfo et al. | Jun 2006 | B2 |
7103576 | Mann, III et al. | Sep 2006 | B2 |
7113930 | Eccles et al. | Sep 2006 | B2 |
7136835 | Flitcroft et al. | Nov 2006 | B1 |
7177835 | Walker et al. | Feb 2007 | B1 |
7177848 | Hogan et al. | Feb 2007 | B2 |
7194437 | Britto et al. | Mar 2007 | B1 |
7209561 | Shankar et al. | Apr 2007 | B1 |
7264154 | Harris | Sep 2007 | B2 |
7287692 | Patel et al. | Oct 2007 | B1 |
7292999 | Hobson et al. | Nov 2007 | B2 |
7350230 | Forrest | Mar 2008 | B2 |
7353382 | Labrou et al. | Apr 2008 | B2 |
7379919 | Hogan et al. | May 2008 | B2 |
RE40444 | Linehan | Jul 2008 | E |
7415443 | Hobson et al. | Aug 2008 | B2 |
7444676 | Asghari-Kamrani et al. | Oct 2008 | B1 |
7469151 | Khan et al. | Dec 2008 | B2 |
7548889 | Bhambri et al. | Jun 2009 | B2 |
7567934 | Flitcroft et al. | Jul 2009 | B2 |
7567936 | Peckover et al. | Jul 2009 | B1 |
7571139 | Giordano et al. | Aug 2009 | B1 |
7571142 | Flitcroft et al. | Aug 2009 | B1 |
7580898 | Brown et al. | Aug 2009 | B2 |
7584153 | Brown et al. | Sep 2009 | B2 |
7593896 | Flitcroft et al. | Sep 2009 | B1 |
7606560 | Labrou et al. | Oct 2009 | B2 |
7627531 | Breck et al. | Dec 2009 | B2 |
7627895 | Gifford et al. | Dec 2009 | B2 |
7650314 | Saunders | Jan 2010 | B1 |
7685037 | Reiners et al. | Mar 2010 | B2 |
7702578 | Fung et al. | Apr 2010 | B2 |
7707120 | Dominguez et al. | Apr 2010 | B2 |
7712655 | Wong | May 2010 | B2 |
7734527 | Uzo | Jun 2010 | B2 |
7753265 | Harris | Jul 2010 | B2 |
7770789 | Oder, II et al. | Aug 2010 | B2 |
7784685 | Hopkins, III | Aug 2010 | B1 |
7793851 | Mullen | Sep 2010 | B2 |
7801826 | Labrou et al. | Sep 2010 | B2 |
7805376 | Smith | Sep 2010 | B2 |
7805378 | Berardi et al. | Sep 2010 | B2 |
7818264 | Hammad | Oct 2010 | B2 |
7828220 | Mullen | Nov 2010 | B2 |
7835960 | Breck et al. | Nov 2010 | B2 |
7841523 | Oder, II et al. | Nov 2010 | B2 |
7841539 | Hewton | Nov 2010 | B2 |
7844550 | Walker et al. | Nov 2010 | B2 |
7848980 | Carlson | Dec 2010 | B2 |
7849020 | Johnson | Dec 2010 | B2 |
7853529 | Walker et al. | Dec 2010 | B1 |
7853995 | Chow et al. | Dec 2010 | B2 |
7865414 | Fung et al. | Jan 2011 | B2 |
7873579 | Hobson et al. | Jan 2011 | B2 |
7873580 | Hobson et al. | Jan 2011 | B2 |
7890393 | Talbert et al. | Feb 2011 | B2 |
7891563 | Oder, II et al. | Feb 2011 | B2 |
7896238 | Fein et al. | Mar 2011 | B2 |
7908216 | Davis et al. | Mar 2011 | B1 |
7922082 | Muscato | Apr 2011 | B2 |
7931195 | Mullen | Apr 2011 | B2 |
7937324 | Patterson | May 2011 | B2 |
7938318 | Fein et al. | May 2011 | B2 |
7954705 | Mullen | Jun 2011 | B2 |
7959076 | Hopkins, III | Jun 2011 | B1 |
7996288 | Stolfo | Aug 2011 | B1 |
8025223 | Saunders et al. | Sep 2011 | B2 |
8046256 | Chien et al. | Oct 2011 | B2 |
8060448 | Jones | Nov 2011 | B2 |
8060449 | Zhu | Nov 2011 | B1 |
8074877 | Mullen et al. | Dec 2011 | B2 |
8074879 | Harris | Dec 2011 | B2 |
8082210 | Hansen et al. | Dec 2011 | B2 |
8095113 | Kean et al. | Jan 2012 | B2 |
8104679 | Brown | Jan 2012 | B2 |
RE43157 | Bishop et al. | Feb 2012 | E |
8109436 | Hopkins, III | Feb 2012 | B1 |
8132723 | Hogg et al. | Mar 2012 | B2 |
8171525 | Pelly et al. | May 2012 | B1 |
8175973 | Davis et al. | May 2012 | B2 |
8190523 | Patterson | May 2012 | B2 |
8196813 | Vadhri | Jun 2012 | B2 |
8205791 | Randazza et al. | Jun 2012 | B2 |
8219489 | Patterson | Jul 2012 | B2 |
8224702 | Mengerink et al. | Jul 2012 | B2 |
8225385 | Chow et al. | Jul 2012 | B2 |
8229852 | Carlson | Jul 2012 | B2 |
8265993 | Chien et al. | Sep 2012 | B2 |
8280777 | Mengerink et al. | Oct 2012 | B2 |
8281991 | Wentker et al. | Oct 2012 | B2 |
8328095 | Oder, II et al. | Dec 2012 | B2 |
8336088 | Raj et al. | Dec 2012 | B2 |
8346666 | Lindelsee et al. | Jan 2013 | B2 |
8376225 | Hopkins, III | Feb 2013 | B1 |
8380177 | Laracey | Feb 2013 | B2 |
8387873 | Saunders et al. | Mar 2013 | B2 |
8401539 | Beenau et al. | Mar 2013 | B2 |
8401898 | Chien et al. | Mar 2013 | B2 |
8402555 | Grecia | Mar 2013 | B2 |
8403211 | Brooks et al. | Mar 2013 | B2 |
8412623 | Moon et al. | Apr 2013 | B2 |
8412837 | Emigh et al. | Apr 2013 | B1 |
8417642 | Oren | Apr 2013 | B2 |
8433116 | Butler et al. | Apr 2013 | B2 |
8447699 | Batada et al. | May 2013 | B2 |
8453223 | Svigals et al. | May 2013 | B2 |
8453925 | Fisher et al. | Jun 2013 | B2 |
8458487 | Palgon et al. | Jun 2013 | B1 |
8484134 | Hobson et al. | Jul 2013 | B2 |
8485437 | Mullen et al. | Jul 2013 | B2 |
8494959 | Hathaway et al. | Jul 2013 | B2 |
8498908 | Mengerink et al. | Jul 2013 | B2 |
8504475 | Brand et al. | Aug 2013 | B2 |
8504478 | Saunders et al. | Aug 2013 | B2 |
8510816 | Quach et al. | Aug 2013 | B2 |
8528067 | Hurry et al. | Sep 2013 | B2 |
8533860 | Grecia | Sep 2013 | B1 |
8538845 | Liberty | Sep 2013 | B2 |
8555079 | Shablygin et al. | Oct 2013 | B2 |
8566168 | Bierbaum et al. | Oct 2013 | B1 |
8567670 | Stanfield et al. | Oct 2013 | B2 |
8571939 | Lindsey et al. | Oct 2013 | B2 |
8577336 | Mechaley, Jr. | Nov 2013 | B2 |
8577803 | Chatterjee et al. | Nov 2013 | B2 |
8577813 | Weiss | Nov 2013 | B2 |
8578176 | Mattsson | Nov 2013 | B2 |
8583494 | Fisher | Nov 2013 | B2 |
8584251 | McGuire et al. | Nov 2013 | B2 |
8589237 | Fisher | Nov 2013 | B2 |
8589271 | Evans | Nov 2013 | B2 |
8589291 | Carlson et al. | Nov 2013 | B2 |
8595098 | Starai et al. | Nov 2013 | B2 |
8595812 | Bomar et al. | Nov 2013 | B2 |
8595850 | Spies et al. | Nov 2013 | B2 |
8606638 | Dragt | Dec 2013 | B2 |
8606700 | Carlson et al. | Dec 2013 | B2 |
8606720 | Baker et al. | Dec 2013 | B1 |
8615468 | Varadarajan | Dec 2013 | B2 |
8620754 | Fisher | Dec 2013 | B2 |
8635157 | Smith et al. | Jan 2014 | B2 |
8646059 | von Behren et al. | Feb 2014 | B1 |
8651374 | Brabson et al. | Feb 2014 | B2 |
8656180 | Shablygin et al. | Feb 2014 | B2 |
8751391 | Freund | Jun 2014 | B2 |
8751642 | Vargas et al. | Jun 2014 | B2 |
8762263 | Gauthier et al. | Jun 2014 | B2 |
8793186 | Patterson | Jul 2014 | B2 |
8838982 | Carlson et al. | Sep 2014 | B2 |
8856539 | Weiss | Oct 2014 | B2 |
8887308 | Grecia | Nov 2014 | B2 |
9065643 | Hurry et al. | Jun 2015 | B2 |
9070129 | Sheets et al. | Jun 2015 | B2 |
9100826 | Weiss | Aug 2015 | B2 |
9160741 | Wentker et al. | Oct 2015 | B2 |
9229964 | Stevelinck | Jan 2016 | B2 |
9245267 | Singh | Jan 2016 | B2 |
9249241 | Dai et al. | Feb 2016 | B2 |
9256871 | Anderson et al. | Feb 2016 | B2 |
9280765 | Hammad | Mar 2016 | B2 |
9530137 | Weiss | Dec 2016 | B2 |
9646303 | Karpenko et al. | May 2017 | B2 |
9680942 | Dimmick | Jun 2017 | B2 |
20010029485 | Brody et al. | Oct 2001 | A1 |
20010034720 | Armes | Oct 2001 | A1 |
20010054003 | Chien et al. | Dec 2001 | A1 |
20020007320 | Hogan et al. | Jan 2002 | A1 |
20020016749 | Borecki et al. | Feb 2002 | A1 |
20020029193 | Ranjan et al. | Mar 2002 | A1 |
20020035548 | Hogan et al. | Mar 2002 | A1 |
20020073045 | Rubin et al. | Jun 2002 | A1 |
20020116341 | Hogan et al. | Aug 2002 | A1 |
20020133467 | Hobson et al. | Sep 2002 | A1 |
20020147913 | Lun Yip | Oct 2002 | A1 |
20030028481 | Flitcroft et al. | Feb 2003 | A1 |
20030130955 | Hawthorne | Jul 2003 | A1 |
20030191709 | Elston et al. | Oct 2003 | A1 |
20030191945 | Keech | Oct 2003 | A1 |
20040010462 | Moon et al. | Jan 2004 | A1 |
20040050928 | Bishop et al. | Mar 2004 | A1 |
20040059682 | Hasumi et al. | Mar 2004 | A1 |
20040093281 | Silverstein et al. | May 2004 | A1 |
20040139008 | Mascavage, III | Jul 2004 | A1 |
20040143532 | Lee | Jul 2004 | A1 |
20040158532 | Breck et al. | Aug 2004 | A1 |
20040210449 | Breck et al. | Oct 2004 | A1 |
20040210498 | Freund | Oct 2004 | A1 |
20040232225 | Bishop et al. | Nov 2004 | A1 |
20040236632 | Maritzen et al. | Nov 2004 | A1 |
20040260646 | Berardi et al. | Dec 2004 | A1 |
20050037735 | Coutts | Feb 2005 | A1 |
20050080730 | Sorrentino | Apr 2005 | A1 |
20050108178 | York | May 2005 | A1 |
20050199709 | Linlor | Sep 2005 | A1 |
20050246293 | Ong | Nov 2005 | A1 |
20050269401 | Spitzer et al. | Dec 2005 | A1 |
20050269402 | Spitzer et al. | Dec 2005 | A1 |
20060235795 | Johnson et al. | Oct 2006 | A1 |
20060237528 | Bishop et al. | Oct 2006 | A1 |
20060278704 | Saunders et al. | Dec 2006 | A1 |
20070107044 | Yuen et al. | May 2007 | A1 |
20070129955 | Dalmia et al. | Jun 2007 | A1 |
20070136193 | Starr | Jun 2007 | A1 |
20070136211 | Brown et al. | Jun 2007 | A1 |
20070170247 | Friedman | Jul 2007 | A1 |
20070179885 | Bird et al. | Aug 2007 | A1 |
20070208671 | Brown et al. | Sep 2007 | A1 |
20070245414 | Chan et al. | Oct 2007 | A1 |
20070288377 | Shaked | Dec 2007 | A1 |
20070291995 | Rivera | Dec 2007 | A1 |
20080015988 | Brown et al. | Jan 2008 | A1 |
20080029607 | Mullen | Feb 2008 | A1 |
20080035738 | Mullen | Feb 2008 | A1 |
20080052226 | Agarwal et al. | Feb 2008 | A1 |
20080054068 | Mullen | Mar 2008 | A1 |
20080054079 | Mullen | Mar 2008 | A1 |
20080054081 | Mullen | Mar 2008 | A1 |
20080065554 | Hogan et al. | Mar 2008 | A1 |
20080065555 | Mullen | Mar 2008 | A1 |
20080201264 | Brown et al. | Aug 2008 | A1 |
20080201265 | Hewton | Aug 2008 | A1 |
20080228646 | Myers et al. | Sep 2008 | A1 |
20080243702 | Hart et al. | Oct 2008 | A1 |
20080245855 | Fein et al. | Oct 2008 | A1 |
20080245861 | Fein et al. | Oct 2008 | A1 |
20080283591 | Oder, II et al. | Nov 2008 | A1 |
20080302869 | Mullen | Dec 2008 | A1 |
20080302876 | Mullen | Dec 2008 | A1 |
20080313264 | Pestoni | Dec 2008 | A1 |
20090006262 | Brown et al. | Jan 2009 | A1 |
20090010488 | Matsuoka et al. | Jan 2009 | A1 |
20090037333 | Flitcroft et al. | Feb 2009 | A1 |
20090037388 | Cooper et al. | Feb 2009 | A1 |
20090043702 | Bennett | Feb 2009 | A1 |
20090048971 | Hathaway et al. | Feb 2009 | A1 |
20090106112 | Dalmia et al. | Apr 2009 | A1 |
20090106160 | Skowronek | Apr 2009 | A1 |
20090134217 | Flitcroft et al. | May 2009 | A1 |
20090157555 | Biffle et al. | Jun 2009 | A1 |
20090159673 | Mullen et al. | Jun 2009 | A1 |
20090159700 | Mullen et al. | Jun 2009 | A1 |
20090159707 | Mullen et al. | Jun 2009 | A1 |
20090173782 | Muscato | Jul 2009 | A1 |
20090200371 | Kean et al. | Aug 2009 | A1 |
20090248583 | Chhabra | Oct 2009 | A1 |
20090276347 | Kargman | Nov 2009 | A1 |
20090281948 | Carlson | Nov 2009 | A1 |
20090294527 | Brabson et al. | Dec 2009 | A1 |
20090307139 | Mardikar et al. | Dec 2009 | A1 |
20090308921 | Mullen | Dec 2009 | A1 |
20090327131 | Beenau et al. | Dec 2009 | A1 |
20100008535 | Abulafia et al. | Jan 2010 | A1 |
20100088237 | Wankmueller | Apr 2010 | A1 |
20100094755 | Kloster | Apr 2010 | A1 |
20100106644 | Annan et al. | Apr 2010 | A1 |
20100120408 | Beenau et al. | May 2010 | A1 |
20100133334 | Vadhri | Jun 2010 | A1 |
20100138347 | Chen | Jun 2010 | A1 |
20100145860 | Pelegero | Jun 2010 | A1 |
20100161433 | White | Jun 2010 | A1 |
20100185545 | Royyuru et al. | Jul 2010 | A1 |
20100211505 | Saunders et al. | Aug 2010 | A1 |
20100223186 | Hogan et al. | Sep 2010 | A1 |
20100228668 | Hogan et al. | Sep 2010 | A1 |
20100235284 | Moore | Sep 2010 | A1 |
20100258620 | Torreyson et al. | Oct 2010 | A1 |
20100291904 | Musfeldt et al. | Nov 2010 | A1 |
20100299267 | Faith et al. | Nov 2010 | A1 |
20100306076 | Taveau et al. | Dec 2010 | A1 |
20100325041 | Berardi et al. | Dec 2010 | A1 |
20110010292 | Giordano et al. | Jan 2011 | A1 |
20110016047 | Wu et al. | Jan 2011 | A1 |
20110016320 | Bergsten et al. | Jan 2011 | A1 |
20110040640 | Erikson | Feb 2011 | A1 |
20110047076 | Carlson et al. | Feb 2011 | A1 |
20110083018 | Kesanupalli et al. | Apr 2011 | A1 |
20110087596 | Dorsey | Apr 2011 | A1 |
20110093397 | Carlson et al. | Apr 2011 | A1 |
20110125597 | Oder, II et al. | May 2011 | A1 |
20110153437 | Archer et al. | Jun 2011 | A1 |
20110153498 | Makhotin et al. | Jun 2011 | A1 |
20110154466 | Harper et al. | Jun 2011 | A1 |
20110161233 | Tieken | Jun 2011 | A1 |
20110178926 | Lindelsee et al. | Jul 2011 | A1 |
20110191244 | Dai | Aug 2011 | A1 |
20110238511 | Park et al. | Sep 2011 | A1 |
20110238573 | Varadarajan | Sep 2011 | A1 |
20110246317 | Coppinger | Oct 2011 | A1 |
20110258111 | Raj et al. | Oct 2011 | A1 |
20110272471 | Mullen | Nov 2011 | A1 |
20110272478 | Mullen | Nov 2011 | A1 |
20110276380 | Mullen et al. | Nov 2011 | A1 |
20110276381 | Mullen et al. | Nov 2011 | A1 |
20110276424 | Mullen | Nov 2011 | A1 |
20110276425 | Mullen | Nov 2011 | A1 |
20110295745 | White et al. | Dec 2011 | A1 |
20110302081 | Saunders et al. | Dec 2011 | A1 |
20120023567 | Hammad | Jan 2012 | A1 |
20120028609 | Hruska | Feb 2012 | A1 |
20120030047 | Fuentes et al. | Feb 2012 | A1 |
20120035998 | Chien et al. | Feb 2012 | A1 |
20120041881 | Basu et al. | Feb 2012 | A1 |
20120047237 | Arvidsson et al. | Feb 2012 | A1 |
20120066078 | Kingston et al. | Mar 2012 | A1 |
20120072350 | Goldthwaite et al. | Mar 2012 | A1 |
20120078735 | Bauer et al. | Mar 2012 | A1 |
20120078798 | Downing et al. | Mar 2012 | A1 |
20120078799 | Jackson et al. | Mar 2012 | A1 |
20120095852 | Bauer et al. | Apr 2012 | A1 |
20120095865 | Doherty et al. | Apr 2012 | A1 |
20120116902 | Cardina et al. | May 2012 | A1 |
20120123882 | Carlson et al. | May 2012 | A1 |
20120123940 | Killian et al. | May 2012 | A1 |
20120129514 | Beenau et al. | May 2012 | A1 |
20120143754 | Patel | Jun 2012 | A1 |
20120143767 | Abadir | Jun 2012 | A1 |
20120143772 | Abadir | Jun 2012 | A1 |
20120158580 | Eram et al. | Jun 2012 | A1 |
20120158593 | Garfinkle et al. | Jun 2012 | A1 |
20120173431 | Ritchie et al. | Jul 2012 | A1 |
20120185386 | Salama et al. | Jul 2012 | A1 |
20120197807 | Schlesser et al. | Aug 2012 | A1 |
20120203664 | Torossian et al. | Aug 2012 | A1 |
20120203666 | Torossian et al. | Aug 2012 | A1 |
20120215688 | Musser et al. | Aug 2012 | A1 |
20120215696 | Salonen | Aug 2012 | A1 |
20120221421 | Hammad | Aug 2012 | A1 |
20120226582 | Hammad | Sep 2012 | A1 |
20120231844 | Coppinger | Sep 2012 | A1 |
20120233004 | Bercaw | Sep 2012 | A1 |
20120246070 | Vadhri | Sep 2012 | A1 |
20120246071 | Jain et al. | Sep 2012 | A1 |
20120246079 | Wilson et al. | Sep 2012 | A1 |
20120265631 | Cronic et al. | Oct 2012 | A1 |
20120271770 | Harris et al. | Oct 2012 | A1 |
20120297446 | Webb et al. | Nov 2012 | A1 |
20120300932 | Cambridge et al. | Nov 2012 | A1 |
20120303503 | Cambridge et al. | Nov 2012 | A1 |
20120303961 | Kean et al. | Nov 2012 | A1 |
20120304273 | Bailey et al. | Nov 2012 | A1 |
20120310725 | Chien et al. | Dec 2012 | A1 |
20120310831 | Harris et al. | Dec 2012 | A1 |
20120316992 | Oborne | Dec 2012 | A1 |
20120317035 | Royyuru et al. | Dec 2012 | A1 |
20120317036 | Bower et al. | Dec 2012 | A1 |
20130017784 | Fisher | Jan 2013 | A1 |
20130018757 | Anderson et al. | Jan 2013 | A1 |
20130019098 | Gupta et al. | Jan 2013 | A1 |
20130031006 | McCullagh et al. | Jan 2013 | A1 |
20130054337 | Brendell et al. | Feb 2013 | A1 |
20130054466 | Muscato | Feb 2013 | A1 |
20130054474 | Yeager | Feb 2013 | A1 |
20130081122 | Svigals et al. | Mar 2013 | A1 |
20130091028 | Oder ("J.D."), II et al. | Apr 2013 | A1 |
20130110658 | Lyman et al. | May 2013 | A1 |
20130111599 | Gargiulo | May 2013 | A1 |
20130117185 | Collison et al. | May 2013 | A1 |
20130124290 | Fisher | May 2013 | A1 |
20130124291 | Fisher | May 2013 | A1 |
20130124364 | Mittal | May 2013 | A1 |
20130138525 | Bercaw | May 2013 | A1 |
20130144888 | Faith et al. | Jun 2013 | A1 |
20130145148 | Shablygin et al. | Jun 2013 | A1 |
20130145172 | Shablygin et al. | Jun 2013 | A1 |
20130159178 | Colon et al. | Jun 2013 | A1 |
20130159184 | Thaw | Jun 2013 | A1 |
20130166402 | Parento et al. | Jun 2013 | A1 |
20130166456 | Zhang et al. | Jun 2013 | A1 |
20130173736 | Krzeminski et al. | Jul 2013 | A1 |
20130185202 | Goldthwaite et al. | Jul 2013 | A1 |
20130191227 | Pasa et al. | Jul 2013 | A1 |
20130191286 | Cronic et al. | Jul 2013 | A1 |
20130191289 | Cronic et al. | Jul 2013 | A1 |
20130198071 | Jurss | Aug 2013 | A1 |
20130198080 | Anderson et al. | Aug 2013 | A1 |
20130200146 | Moghadam | Aug 2013 | A1 |
20130204787 | Dubois | Aug 2013 | A1 |
20130204793 | Kerridge et al. | Aug 2013 | A1 |
20130212007 | Mattsson et al. | Aug 2013 | A1 |
20130212017 | Bangia | Aug 2013 | A1 |
20130212019 | Mattsson et al. | Aug 2013 | A1 |
20130212024 | Mattsson et al. | Aug 2013 | A1 |
20130212026 | Powell et al. | Aug 2013 | A1 |
20130212666 | Mattsson et al. | Aug 2013 | A1 |
20130218698 | Moon et al. | Aug 2013 | A1 |
20130218769 | Pourfallah et al. | Aug 2013 | A1 |
20130226799 | Raj | Aug 2013 | A1 |
20130226802 | Hammad et al. | Aug 2013 | A1 |
20130226813 | Voltz | Aug 2013 | A1 |
20130246199 | Carlson | Sep 2013 | A1 |
20130246202 | Tobin | Sep 2013 | A1 |
20130246203 | Laracey | Sep 2013 | A1 |
20130246258 | Dessert | Sep 2013 | A1 |
20130246259 | Dessert | Sep 2013 | A1 |
20130246261 | Purves et al. | Sep 2013 | A1 |
20130246267 | Tobin | Sep 2013 | A1 |
20130254028 | Salci | Sep 2013 | A1 |
20130254052 | Royyuru et al. | Sep 2013 | A1 |
20130254102 | Royyuru | Sep 2013 | A1 |
20130254117 | von Mueller et al. | Sep 2013 | A1 |
20130262296 | Thomas et al. | Oct 2013 | A1 |
20130262302 | Lettow et al. | Oct 2013 | A1 |
20130262315 | Hruska | Oct 2013 | A1 |
20130262316 | Hruska | Oct 2013 | A1 |
20130262317 | Collinge et al. | Oct 2013 | A1 |
20130275300 | Killian et al. | Oct 2013 | A1 |
20130275307 | Khan | Oct 2013 | A1 |
20130275308 | Paraskeva et al. | Oct 2013 | A1 |
20130282502 | Jooste | Oct 2013 | A1 |
20130282575 | Mullen et al. | Oct 2013 | A1 |
20130282588 | Hruska | Oct 2013 | A1 |
20130297501 | Monk et al. | Nov 2013 | A1 |
20130297504 | Nwokolo et al. | Nov 2013 | A1 |
20130297508 | Belamant | Nov 2013 | A1 |
20130304649 | Cronic et al. | Nov 2013 | A1 |
20130308778 | Fosmark et al. | Nov 2013 | A1 |
20130311382 | Fosmark et al. | Nov 2013 | A1 |
20130317982 | Mengerink et al. | Nov 2013 | A1 |
20130332344 | Weber | Dec 2013 | A1 |
20130339253 | Sincai | Dec 2013 | A1 |
20130346305 | Mendes | Dec 2013 | A1 |
20130346314 | Mogollon et al. | Dec 2013 | A1 |
20140007213 | Sanin et al. | Jan 2014 | A1 |
20140013106 | Redpath | Jan 2014 | A1 |
20140013114 | Redpath | Jan 2014 | A1 |
20140013452 | Aissi et al. | Jan 2014 | A1 |
20140019352 | Shrivastava | Jan 2014 | A1 |
20140025581 | Calman | Jan 2014 | A1 |
20140025585 | Calman | Jan 2014 | A1 |
20140025958 | Calman | Jan 2014 | A1 |
20140032417 | Mattsson | Jan 2014 | A1 |
20140032418 | Weber | Jan 2014 | A1 |
20140040137 | Carlson et al. | Feb 2014 | A1 |
20140040139 | Brudnicki et al. | Feb 2014 | A1 |
20140040144 | Plomske et al. | Feb 2014 | A1 |
20140040145 | Ozvat et al. | Feb 2014 | A1 |
20140040148 | Ozvat et al. | Feb 2014 | A1 |
20140040628 | Fort et al. | Feb 2014 | A1 |
20140041018 | Bomar et al. | Feb 2014 | A1 |
20140046853 | Spies et al. | Feb 2014 | A1 |
20140047551 | Nagasundaram et al. | Feb 2014 | A1 |
20140052532 | Tsai et al. | Feb 2014 | A1 |
20140052620 | Rogers et al. | Feb 2014 | A1 |
20140052637 | Jooste et al. | Feb 2014 | A1 |
20140068706 | Aissi | Mar 2014 | A1 |
20140074637 | Hammad | Mar 2014 | A1 |
20140108172 | Weber et al. | Apr 2014 | A1 |
20140114857 | Griggs et al. | Apr 2014 | A1 |
20140143137 | Carlson | May 2014 | A1 |
20140143146 | Passanha et al. | May 2014 | A1 |
20140164243 | Aabye et al. | Jun 2014 | A1 |
20140188586 | Carpenter et al. | Jul 2014 | A1 |
20140249945 | Gauthier et al. | Sep 2014 | A1 |
20140294701 | Dai et al. | Oct 2014 | A1 |
20140297534 | Patterson | Oct 2014 | A1 |
20140310183 | Weber | Oct 2014 | A1 |
20140324690 | Allen et al. | Oct 2014 | A1 |
20140330721 | Wang | Nov 2014 | A1 |
20140330722 | Laxminarayanan et al. | Nov 2014 | A1 |
20140331265 | Mozell et al. | Nov 2014 | A1 |
20140337236 | Wong et al. | Nov 2014 | A1 |
20140344153 | Raj et al. | Nov 2014 | A1 |
20140372308 | Sheets | Dec 2014 | A1 |
20140372322 | Tieken et al. | Dec 2014 | A1 |
20150019443 | Sheets et al. | Jan 2015 | A1 |
20150032625 | Dill et al. | Jan 2015 | A1 |
20150032626 | Dill et al. | Jan 2015 | A1 |
20150032627 | Dill et al. | Jan 2015 | A1 |
20150046338 | Laxminarayanan et al. | Feb 2015 | A1 |
20150046339 | Wong et al. | Feb 2015 | A1 |
20150052064 | Karpenko et al. | Feb 2015 | A1 |
20150058227 | Dua | Feb 2015 | A1 |
20150081544 | Schulz et al. | Mar 2015 | A1 |
20150088756 | Makhotin et al. | Mar 2015 | A1 |
20150106239 | Gaddam et al. | Apr 2015 | A1 |
20150112870 | Nagasundaram et al. | Apr 2015 | A1 |
20150112871 | Kumnick | Apr 2015 | A1 |
20150120472 | Aabye et al. | Apr 2015 | A1 |
20150127529 | Makhotin et al. | May 2015 | A1 |
20150127547 | Powell et al. | May 2015 | A1 |
20150140960 | Powell et al. | May 2015 | A1 |
20150142673 | Nelsen et al. | May 2015 | A1 |
20150161597 | Subramanian et al. | Jun 2015 | A1 |
20150178724 | Ngo et al. | Jun 2015 | A1 |
20150180836 | Wong et al. | Jun 2015 | A1 |
20150186864 | Jones et al. | Jul 2015 | A1 |
20150193222 | Pirzadeh et al. | Jul 2015 | A1 |
20150195133 | Sheets et al. | Jul 2015 | A1 |
20150199679 | Palanisamy et al. | Jul 2015 | A1 |
20150199689 | Kumnick et al. | Jul 2015 | A1 |
20150220917 | Aabye et al. | Aug 2015 | A1 |
20150269566 | Gaddam et al. | Sep 2015 | A1 |
20150278799 | Palanisamy | Oct 2015 | A1 |
20150287037 | Salmon et al. | Oct 2015 | A1 |
20150312038 | Palanisamy | Oct 2015 | A1 |
20150319158 | Kumnick | Nov 2015 | A1 |
20150324736 | Sheets et al. | Nov 2015 | A1 |
20150332262 | Lingappa | Nov 2015 | A1 |
20150339664 | Wong et al. | Nov 2015 | A1 |
20150356560 | Shastry et al. | Dec 2015 | A1 |
20150363781 | Badenhorst | Dec 2015 | A1 |
20160028550 | Gaddam et al. | Jan 2016 | A1 |
20160036790 | Shastry et al. | Feb 2016 | A1 |
20160042263 | Gaddam et al. | Feb 2016 | A1 |
20160065370 | Le Saint et al. | Mar 2016 | A1 |
20160092696 | Guglani et al. | Mar 2016 | A1 |
20160092872 | Prakash et al. | Mar 2016 | A1 |
20160092874 | O'Regan et al. | Mar 2016 | A1 |
20160103675 | Aabye et al. | Apr 2016 | A1 |
20160119296 | Laxminarayanan et al. | Apr 2016 | A1 |
20160132878 | O'Regan et al. | May 2016 | A1 |
20160140545 | Flurscheim et al. | May 2016 | A1 |
20160148197 | Dimmick | May 2016 | A1 |
20160148212 | Dimmick | May 2016 | A1 |
20160171479 | Prakash et al. | Jun 2016 | A1 |
20160173483 | Wong et al. | Jun 2016 | A1 |
20160197725 | Hammad | Jul 2016 | A1 |
20160210628 | McGuire | Jul 2016 | A1 |
20160217452 | Wong et al. | Jul 2016 | A1 |
20160217461 | Gaddam et al. | Jul 2016 | A1 |
20160218875 | Le Saint et al. | Jul 2016 | A1 |
20160224976 | Basu et al. | Aug 2016 | A1 |
20160224977 | Sabba et al. | Aug 2016 | A1 |
20160232527 | Patterson | Aug 2016 | A1 |
20160239842 | Cash et al. | Aug 2016 | A1 |
20160269391 | Gaddam et al. | Sep 2016 | A1 |
20160308995 | Youdale et al. | Oct 2016 | A1 |
20170046696 | Powell et al. | Feb 2017 | A1 |
20170076288 | Awasthi | Mar 2017 | A1 |
20170103387 | Weber | Apr 2017 | A1 |
20170109745 | Al-Bedaiwi et al. | Apr 2017 | A1 |
20170148013 | Rajurkar et al. | May 2017 | A1 |
20170161701 | Amancherla | Jun 2017 | A1 |
20170163617 | Laxminarayanan et al. | Jun 2017 | A1 |
20170163629 | Law et al. | Jun 2017 | A1 |
20170186001 | Reed et al. | Jun 2017 | A1 |
20170200156 | Karpenko et al. | Jul 2017 | A1 |
20170200165 | Laxminarayanan et al. | Jul 2017 | A1 |
20170201520 | Chandoor et al. | Jul 2017 | A1 |
20170220818 | Nagasundaram et al. | Aug 2017 | A1 |
20170221054 | Flurscheim et al. | Aug 2017 | A1 |
20170221056 | Karpenko et al. | Aug 2017 | A1 |
20170228723 | Taylor et al. | Aug 2017 | A1 |
20170236113 | Chitalia et al. | Aug 2017 | A1 |
20170255932 | Aabye et al. | Sep 2017 | A1 |
20170293914 | Girish et al. | Oct 2017 | A1 |
20170295155 | Wong | Oct 2017 | A1 |
20170338965 | Gaddam | Nov 2017 | A1 |
20170364903 | Lopez | Dec 2017 | A1 |
20170364914 | Howard | Dec 2017 | A1 |
20170373852 | Cassin et al. | Dec 2017 | A1 |
20180006821 | Kinagi | Jan 2018 | A1 |
20180075081 | Chipman | Mar 2018 | A1 |
20180174137 | Subbarayan | Jun 2018 | A1 |
20180232722 | Wong et al. | Aug 2018 | A1 |
20180247303 | Raj et al. | Aug 2018 | A1 |
20180262334 | Hammad | Sep 2018 | A1 |
20180268399 | Spector et al. | Sep 2018 | A1 |
20180268405 | Lopez | Sep 2018 | A1 |
20180268411 | Voldman | Sep 2018 | A1 |
20180285875 | Law et al. | Oct 2018 | A1 |
20180324184 | Kaja et al. | Nov 2018 | A1 |
20180324584 | Lopez | Nov 2018 | A1 |
20190020478 | Girish et al. | Jan 2019 | A1 |
20190066069 | Faith et al. | Feb 2019 | A1 |
20190130384 | Shauh et al. | May 2019 | A1 |
20190147439 | Wang et al. | May 2019 | A1 |
20190197548 | Kelly-Frank et al. | Jun 2019 | A1 |
20190213589 | Aabye et al. | Jul 2019 | A1 |
20190288844 | Cassin | Sep 2019 | A1 |
20190342295 | Peterson | Nov 2019 | A1 |
20190356489 | Palanisamy | Nov 2019 | A1 |
20200126072 | Karaivanov | Apr 2020 | A1 |
20200322350 | Mccarter et al. | Oct 2020 | A1 |
20210084029 | Kallugudde | Mar 2021 | A1 |
20210344672 | Drechsler | Nov 2021 | A1 |
20220231851 | Cassin | Jul 2022 | A1 |
Number | Date | Country |
---|---|---|
1028401 | Aug 2000 | EP |
2156397 | Feb 2010 | EP |
0014648 | Mar 2000 | WO |
01035304 | May 2001 | WO |
0135304 | May 2002 | WO |
2004042536 | May 2004 | WO |
2004051585 | Jun 2004 | WO |
2005001751 | Jan 2005 | WO |
2006113834 | Oct 2006 | WO |
2009032523 | Mar 2009 | WO |
2010078522 | Jul 2010 | WO |
2012068078 | May 2012 | WO |
2012098556 | Jul 2012 | WO |
2012142370 | Oct 2012 | WO |
2012167941 | Dec 2012 | WO |
2013048538 | Apr 2013 | WO |
2013056104 | Apr 2013 | WO |
2013119914 | Aug 2013 | WO |
2013179271 | Dec 2013 | WO |
Entry |
---|
Aspen Olmsted, 2017 IEEE, International Conference on Information Society, “Secure Autonomous Process Communication”, pp. 94-99 (Year: 2017). |
“Petition for Inter Partes Review of U.S. Pat. No. 8,533,860 Challenging Claims 1-30 Under 35 U.S.C. § 312 and 37 C.F.R. § 42.104”, USPTO Patent Trial and Appeal Board, IPR 2016-00600, Feb. 17, 2016, 65 pages. |
U.S. Appl. No. 16/311,144 , Encryption Key Exchange Process Using Access Device, filed Dec. 18, 2018, 83 pages. |
U.S. Appl. No. 16/347,175 , Access Identifier Provisioning To Application, filed May 2, 2019. |
U.S. Appl. No. 16/415,360 , Method and System for Access Token Processing, filed May 17, 2019, 37 pages. |
U.S. Appl. No. 16/444,339 , Final Office Action, dated Aug. 3, 2021, 17 pages. |
U.S. Appl. No. 16/444,339 , Non-Final Office Action, dated Mar. 29, 2021, 14 pages. |
U.S. Appl. No. 16/444,339 , Notice of Allowance, dated Oct. 14, 2021, 9 pages. |
Number | Date | Country | |
---|---|---|---|
20220138291 A1 | May 2022 | US |
Number | Date | Country | |
---|---|---|---|
62686381 | Jun 2018 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16444339 | Jun 2019 | US |
Child | 17573958 | US |