US 10,990,967 B2Grant
Method of distributing tokens and managing token relationships
Issue Date:2021-04-27
•12 Claims
•9 Drawing Sheets
Abstract
A method for facilitating a transaction may include generating, via a token server computer, a token for use by a first entity computer, wherein the token is generated in response to a request received from the first entity computer. The method may also include transmitting, via the token server computer, the token to the first entity computer, wherein the first entity computer transmits the token to a second entity computer. The method may also include receiving, at the token server computer and from the first entity computer, data indicative of the second entity computer successfully receiving the token. The data may include a hashed value derived from at least the token, data indicative of an identity of the second entity computer, and writing, by the token server computer, the data indicative of the second entity computer successfully receiving the token to a registry.
Metadata
Assignee
- Visa International Service Association
Inventors
- Jing Wang
- Chackan Lai
Application Information
Application Number:US 16/302,054
Filing Date:2016-07-19
Priority Date:2016-07-19
Art Unit:3692
Classifications
IPC:
G06Q20/38G06Q20/02H04L9/06G06Q20/32G06Q40/02G06Q20/40
Patent Drawings (9 sheets)
Description
Cross-References to Related Applications
[0001] This application is the U.S. National Phase of PCT Application No. PCT/US2016/042991, filed Jul. 19, 2016, the disclosure of which is incorporated by reference.
Background
[0002] Tokenization has become a popular method for increasing the security of transactions. The use of tokenization provides many advantages when conducting these types of transactions, such as improving efficiency and security. For example, a token may be generated to represent a primary account number (PAN) or other type of sensitive data (such as a ticket to an event). Often times, tokens are passed from one entity to another. For example, a token may be passed by one merchant to another merchant in certain integrated systems. However, in modern-day complex ecosystems, it becomes increasingly complex to track the passing of tokens through several entities. It may be important to track the chain of custody of a token to ensure that the token has not been tampered with.
[0003] A conventional token transaction system can be illustrated with reference to FIG. 1 . In the conventional token transaction system, a token requestor 110 is in communication with a token server computer 120. The token requestor may be an entity computer or device that requests a token from the token server computer 120. The token server computer 120 is responsible for generation and registration of a token. For example, the token requestor 110 requests a token from the token server computer 120 and upon verification, the token server computer 120 generates, registers, and returns the token to the token requestor 110. The token requestor 110 then initiates a payment transaction either directly with (or through a merchant) the payment processor network 130 by sending an authorization request message including the token to the payment processor network 130. The payment processor network 130 then forwards the authorization request message to the issuer 140 for authorization.
[0004] While the conventional token transaction system is useful, improvements can be made. For example, often times the token requstor 110 may forward a token received from the token server computer 120 to second entity (not shown), and in turn the second entity may forward the token to a third entity, etc. In such scenarios, it is difficult for the token server computer 120 to track the various handoffs of the token from one entity to another, and maintain a level of a confidence in the integrity and validity of the generated token.
[0005] Embodiments of the invention address these and other problems.
Brief Summary
[0006] In some embodiments of the invention, systems and methods use hash functions to trace and track the distribution of token credentials as they pass from the token requestor, through the entities involved in transaction, to the token “consumer,” e.g. a merchant sending the token credentials received for authorization. Embodiments of the invention support tokenized transactions in more complex scenarios, where tokens are passed between multiple entities. Embodiments of the invention also increase security and decrease the risk of fraud associated with the token.
[0007] Some embodiments of the invention are directed to a method for facilitating a transaction. The method may include generating, via a token server computer, a token for use by a first entity computer, wherein the token is generated in response to a request received from the first entity computer. The method may also include transmitting, via the token server computer, the token to the first entity computer, wherein the first entity computer transmits the token to a second entity computer. The method may also include receiving, at the token server computer and from the first entity computer, data indicative of the second entity computer successfully receiving the token. The data may include a hashed value derived from at least the token, data indicative of an identity of the second entity computer, and writing, by the token server computer, the data indicative of the second entity computer successfully receiving the token to a registry.
[0008] In some embodiments, prior to receiving, at the token server computer and from the first entity computer, the data indicative of the second entity computer successfully receiving the token, the first entity computer receives the data indicative of the second entity computer successfully receiving the token from the second entity computer.
[0009] In some embodiments, the hashed value is generated by the second entity computer.
[0010] In some embodiments, the hashed value is a first hashed value, and the method further includes receiving, at the token server computer and from the second entity computer, data indicative of a third entity computer successfully receiving the token. The data may include a second hashed value derived from at least the token and data indicative of an identity of the third entity computer. The data may also include writing, by the token server computer, the data indicative of the third entity computer successfully receiving the token to the registry.
[0011] In some embodiments, the second hashed value is generated by the third entity computer.
[0012] In some embodiments, the first entity computer is a first merchant computer and the second entity computer is a second merchant computer.
[0013] In some embodiments, the method also includes validating, by the token server computer, the token based at least in part on the data written to the registry.
[0014] In some embodiments, the token is associated with a primary account number (PAN).
[0015] In some embodiments, the token is associated with an entry ticket to an event.
[0016] In some embodiments, the token server computer resides within a cloud network.
[0017] Other embodiments of the invention are directed to servers and systems that are configured to perform the above-described methods.
[0018] These and other embodiments of the invention are described in further detail below.
Brief Description of the Drawings
[0019] FIG. 1 shows a block diagram of a typical token transaction system.
[0020] FIG. 2 illustrates the passing of a token between multiple entities, in accordance with some embodiments of the invention.
[0021] FIG. 3 shows a block diagram of a token server computer, in accordance with some embodiments of the invention.
[0022] FIG. 4 illustrates a flow between a token server computer and multiple entities, in accordance with embodiments of the invention.
[0023] FIG. 5 illustrates another flow between a token server computer and multiple entities, in accordance with some embodiments of the invention.
[0024] FIG. 6 illustrates a flow of validating a token, in accordance with embodiments of the invention.
[0025] FIG. 7 shows a block diagram of an exemplary payment system, according to some embodiments of the invention.
[0026] FIG. 8 shows exemplary computer apparatus, in accordance with some embodiments of the invention.
Detailed Description
[0027] Prior to discussing embodiments of the invention, descriptions of some terms may be helpful in understanding embodiments of the invention.
[0028] 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).
[0029] 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. A payment device may be used to make a payment transaction. 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 mobile devices include pagers, payment cards, security cards, access 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. In some embodiments, a mobile device can function as a payment device (e.g., a mobile device can store and transmit payment credentials for a transaction).
[0030] 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, identification cards, certified documents, access cards, passcodes and other login information, etc.
[0031] A “value credential” may be information associated with worth. Examples of value credentials include payment credentials, coupon identifiers, information needed to obtain a promotional offer, etc.
[0032] 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.
[0033] 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.
[0034] “Tokenization” is a process by which data is replaced with substitute data. For example, a payment account identifier (e.g., a primary account number (PAN)) may be tokenized by replacing the primary account identifier with a substitute number (e.g. a token) that may be associated with the payment account identifier. Further, tokenization may be applied to any other information that may be replaced with a substitute value (i.e., token). Tokenization may be used to enhance transaction efficiency, improve transaction security, increase service transparency, or to provide a method for third-party enablement.
[0035] A “token provider” or “token service system” can include a system that services payment tokens. In some embodiments, a token service system can requesting, determine (e.g., generate) and/or issue tokens, and maintain 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 tokenization computer alone, or in combination with other computers such as a transaction processing network computer. Various entities of a tokenization ecosystem may assume the roles of the token 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.
[0036] 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 enforcement of 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.
[0037] “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 measured from the time of issuance.
[0038] 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). In some embodiments, a token request message may be formatted as an authorization request message (e.g., an ISO 8583 message format). The token request message may be distinguishable from an authorization request message based on a number of factors. For example, the token request message may have a zero dollar amount in an authorization amount field. As another example, the token request message may include a flag or other indicator specifying that the message is a token request message.
[0039] 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 payment 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). In some embodiments, a token response message may be formatted as an authorization response message (e.g., an ISO 8583 message format). The token response message may be distinguishable from an authorization response message based on a number of factors. For example, the token response message may have a zero dollar amount in an authorization amount field. As another example, the token response message may include a flag or other indicator specifying that the message is a token response message.
[0040] 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.
[0041] A “resource provider” may be an entity that can provide a resource such as goods, services, information, and/or access. Examples of a resource provider includes merchants, access devices, secure data access points, etc. A “merchant” may typically be an entity that engages in transactions and can sell goods or services, or provide access to goods or services.
[0042] 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”.
[0043] 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 user device, such as a cellular telephone, smart card, tablet, or laptop to the consumer.
[0044] 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 computer, 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 some embodiments, a cellular phone, tablet, or other dedicated wireless device used as a POS terminal may be referred to as a mobile point of sale or an “mPOS” terminal.
[0045] An “authorization request message” may be an electronic message that requests authorization for a transaction. In some embodiments, it is sent to a transaction processing computer and/or an issuer of a payment card to request authorization for a transaction. An authorization request message according to some embodiments may comply with ISO 8583, which is a standard for systems that exchange electronic transaction information associated with a payment made by a user using a payment device or payment account. The authorization request message may include an issuer account identifier that may be associated with a payment device or payment account. An authorization request message may also comprise additional data elements corresponding to “identification information” including, by way of example only: a service code, a CVV (card verification value), a dCVV (dynamic card verification value), a PAN (primary account number or “account number”), a payment token, a user name, an expiration date, etc. An authorization request message may also comprise “transaction information,” such as any information associated with a current transaction, such as the transaction amount, merchant identifier, merchant location, acquirer bank identification number (BIN), card acceptor ID, information identifying items being purchased, etc., as well as any other information that may be utilized in determining whether to identify and/or authorize a transaction.
[0046] An “authorization response message” may be a message that responds to an authorization request. In some cases, it may be an electronic message reply to an authorization request message generated by an issuing financial institution or a transaction processing computer. The authorization response message may include, by way of example only, one or more of the following status indicators: Approval—transaction was approved; Decline—transaction was not approved; or Call Center—response pending more information, merchant must call the toll-free authorization phone number. The authorization response message may also include an authorization code, which may be a code that a credit card issuing bank returns in response to an authorization request message in an electronic message (either directly or through the transaction processing computer) to the merchant's access device (e.g. POS equipment) that indicates approval of the transaction. The code may serve as proof of authorization. As noted above, in some embodiments, a transaction processing computer may generate or forward the authorization response message to the merchant.
[0047] 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.
[0048] FIG. 2 illustrates the passing of a token between multiple entities, in accordance with some embodiments of the invention. A token server computer 120 may generate a token 230 in response to a token request from a token requestor. The token requestor could be a communication device such as a mobile device (e.g., a mobile wallet application running on a smartphone) or could also be a merchant computer. For example, an online merchant may request that a token be generated. In this example, the first entity computer 210 could be the token requestor. Upon the first entity computer 210 requesting a token from the token server computer 120, the token server computer 120 may generate the token 230 and transmit the token 230 to the first entity computer 210.
[0049] In some cases, the first entity computer 210 may then forward the generated token 230 to the second entity computer 220. The token 230 may even be distributed from the second entity computer 220 to a third entity computer, etc. Token distribution amongst various entities may often be seen where there are more than two parties to a transaction.
[0050] The distribution of tokens through various entities that may process transactions can become difficult for the token server computer 120. Many token providers discourage such types of transactions for these reasons. However, the embodiments described herein allow for the token server computer 120 (e.g., token provider) to track the various handoffs of the token from one entity to another, and maintain a level of a confidence in the integrity and validity of the generated token.
[0051] FIG. 3 shows a block diagram of a token server computer 120, in accordance with some embodiments of the invention. Token server computer 120 includes an input/output interface 310, a memory 320, a processor 330, a computer-readable medium 340, and a registry 350. In some embodiments, token server computer 120 may reside within a token provider cloud. The token server computer 120 may be configured to generate a token.
[0052] The input/output (I/O) interface 310 is configured to receive and transmit data. For example, the I/O interface 310 may receive a request for a token and may transmit a generated token over a communication channel. The I/O interface 310 may also be used for direct interaction with the token server computer 120. The token server computer 120 may accept input from an input device such as, but not limited to, a keyboard, keypad, or mouse. Further, the I/O interface 310 3 may display output on a display device.
[0053] Memory 320 may be any magnetic, electronic, or optical memory. It can be appreciated that memory 320 may include any number of memory modules. An example of memory 320 may be dynamic random access memory (DRAM).
[0054] Processor 330 may be any general-purpose processor operable to carry out instructions on the token server computer 120. The processor 330 is coupled to other units of the token server computer 120 including input/output interface 310, memory 320, and computer-readable medium 340.
[0055] Computer-readable medium 340 may be any magnetic, electronic, optical, or other computer-readable storage medium. Computer-readable storage medium 340 includes token generation module 342, registry writing module 344, and token transmission module 346.
[0056] The token generation module 342 may be configured to, when executed by processor 330, generate a token in response to receiving a token request. The token generated may be associated with a primary account number (PAN). The PAN may be associated with, for example, a bank account or credit card account. The generated token may be intended for use by the token requestor.
[0057] In some embodiments, the token generation module 342 may receive a token requestor identifier, an account number (e.g., PAN), an expiration date and a CVV2. In some embodiments, the token generation module 342 may also receive optional information such as a consumer name, a consumer address and zip code, a requested token type (e.g., payment static, payment dynamic, non-payment, etc.), a card verification status (e.g., AVS/CVV check status), a MSISDN, a UUID, an IMEI, an OS type/version and any other suitable information. In one embodiment, the token generation module 342 may generate a token response with a token number and a token expiration date. In one embodiment, the token generation module 342 may validate the token requestor identifier, determine the PAN type and generate a token from respective token BIN ranges. The token generation module 342 may also provide an interface to the token requestors to submit a bulk token request file.
[0058] In some embodiments, the token generation module 342 may access a token range table that represents available token ranges provisioned by a payment processing network computer and token ranges that have not been associated with PAN ranges. The token generation module 342 may access another table that includes minimum and maximum account ranges for the PAN and the associated token ranges. The token ranges may include the token ranges provisioned by a payment processing network computer 160 and token ranges provisioned by an issuer computer.
[0059] The registry writing module 344 may be configured to, when executed by processor 330, write a hashed value generated by an entity into the registry 350. An entity may generate a hashed value that is associated with the token generated by the token generation module 342. In some embodiments, the entity may generate the hash value upon receiving the token from the token server computer 120 or from another entity. In some embodiments, the generated hash value may be derived by performing a hash function on data identifying the receiving entity and the token data. In some embodiments, the hashed value may be a token digest or a token usage key. In some embodiments, the hash function may be performed on previously hashed data. In some embodiments, the hash function may be performed in accordance with a keyed-hash message authentication code (HMAC). The generated hash value can create a “record” of the distribution of the token to various entities. An entity receiving the token may generate the hash value and return the generated hash value to the transmitting entity or the token server computer 120, as a record that the token was received by the intended receiving entity. The record can indicate the relationship between the token and the receiving entity. The record may be traceable all the way back to the original token server computer 120. For example, if a token generated by the token server computer 120 was transmitted to a first entity computer, which in turn transmitted the token to a second entity computer, the hash value may show the record of distribution of the token between the token server computer 120, the first entity computer, and the second entity computer.
[0060] The token transmission module 346 may be configured to, when executed by processor 330, transmit a token generated by the token generation module 342 to a token requestor. The token transmission module 346 may interface with the input/output interface 310 in order to transmit the generated token. The generated token may be transmitted to the token requestor via a communication channel such as, but not limited to, the Internet. In some embodiments, the token server computer 120 may receive a hash value in response to transmitting the generated token to an entity.
[0061] FIG. 4 illustrates a flow 400 between a token server computer 120 and multiple entities, in accordance with embodiments of the invention. The flow depicts multiple entities including a first entity computer 210, second entity computer 220, and third entity computer 410. In some implementations, the first entity computer 210 may be a first merchant computer, the second entity computer 220 may be a second entity computer, and the third entity computer 410 may be a third merchant computer.
[0062] At step S402, the token server computer 120 may generate a token in response to receiving a request from a token requestor. For example, the first entity computer may be the token requestor and request generation of a token from the token server computer 120. The token request may be issued in response to a user action, such as registering a payment card or stadium event ticket with a mobile application. In some embodiments, the generated token may be associated a PAN. The token server computer 120 may generate the token via the token generation module 342 (FIG. 3 ).
[0063] At step S404, after the token server computer 120 generates the token, the token server computer 120 may transmit the generated token to the first entity computer 210. The token may be transmitted over any suitable communication channel. One such example of a communication channel is the Internet. At step S406, after receiving the generated token from the token server computer 120, the first entity computer 210 may transmit the received token to the second entity computer 220. For example, the first entity computer 210 could be associated with a social networking site that supports payments to third-parties via the social networking site. The second entity computer 220 could be one such third-party that can process a payment for a good or service from the social networking site. As such, the token may be forwarded to the second entity computer 220 (e.g., third-party).
[0064] At step S408, after the second entity computer 220 receives the token from the first entity computer 210, the second entity computer 220 may generate a hashed value. In this example, the generated hashed value may be referred to as a “token usage key”. The token usage key may be an output of a hashed function that processes one or more inputs associated with the token data and/or data associated with one of the entities. For example, the inputs to the hash function can be the token data itself and data identifying the second entity computer 220. The data identifying the second entity computer 220 could be any type of data that uniquely identifies the second entity computer 220. For example, the data identifying the second entity computer 220 could be a unique name (e.g., “Happy Stores, Inc. Location 3”) or could be a identifier code (e.g., “3a8309fao3j2”), or even a public key in a public/private key pair. Further, the two (or more) inputs to the hash function can be concatenated with each other prior to performing the hash function on the concatenated value. For example, the token data and the data identifying the second entity computer 220 could be concatenated with each other prior to performing the hash function. If the token data is “490000000000001” and the identifier code for the second entity computer is “3a8309fao3j2”, the concatenated value would be “4900000000000013a8309fao3j2”. Accordingly, the hash function could be performed on the value “4900000000000013a8309fao3j2”. In some embodiments, the hash value may be a HMAC. Additionally, the second entity computer 220 may have a unique derivation key used to generate the HMAC value. In an example, if the unique derivation key is “asdf” and the HMAC uses a SHA1 message digest algorithm, the computed HMAC may be “167dc2ab5c962c3ffb38e601fa1199f73e0c8782”. The computed HMAC may be referred to as the “token usage key”. It can be appreciated that while this example mentions HMAC, any hashing algorithm may be used to compute the hash value.
[0065] At step S410, after the second entity computer 220 computes the hash value (e.g., computed HMAC), the computed hash value may be transmitted to the first entity computer 210 (e.g., the entity that forwarded the generated token to the second entity computer 220). In addition to the computed hash value, the data identifier associated with the second entity computer 220 may also be transmitted to the first entity computer 210. For example, the second entity computer 220 may transmit the computed hash value (e.g., “167dc2ab5c962c3ffb38e601fa1199f73e0c8782”) and the data identifier associated with the second entity computer 220 (e.g., “3a8309fao3j2”) to the first entity computer 210. Together, the computed hash value and the data identifier associated with the second entity computer 220 may be considered as a “receipt” indicating the second entity computer 220 successfully received the token from the first entity computer 210. In other words, the “receipt” may be considered as data indicative of the second entity computer 220 successfully receiving the token.
[0066] At step S412, after receiving the computed hash value and data identifier associated with the second entity computer 220, the first entity computer 210 may forward the computed hash value and data identifier associated with the second entity computer 220 to the token server computer 120. By receiving these two data elements, the token server computer 120 may be able to track the token initially generated in step S402. Since the token server computer 120 has now received the computed hash value and the identity of the second entity computer 220, the token server computer 120 may have confidence that the token was passed on to the second entity computer 220 by a trusted entity (e.g., the first entity computer 210), since the token server computer 120 has a record of the distribution of the token.
[0067] At step S414, after receiving the computed hash value and data identifier associated with the second entity computer 220, the token server computer 120 may write the received computed hash value and data identifier associated with the second entity computer 220 into a registry. For example, the two data elements may be written in to the registry 350 (FIG. 3 ). Further, a link or association in the registry 350 (FIG. 3 ) may be made between the two received data elements. In some embodiments, instead of residing within the token server computer 120, the registry may reside external to the token server computer 120 (e.g., on a third-party computer or within a cloud network). In some implementations, step S414 may not be present and instead the first entity computer 210 may directly write the computed hash value and data identifier associated with the second entity computer 220 directly to a registry (e.g., a registry residing within a cloud network).
[0068] At step S416, the second entity computer 220 may transmit/forward the generated token to the third entity computer 410. The token may be transmitted over any communication channel. One such example of a communication channel is the Internet. For example, the third entity computer 410 could be yet another third-party that can process a payment for a good or service from the first third-party (e.g., the second entity computer 220). As such, the token may be forwarded to the third entity computer 410 (e.g., another third-party).
[0069] At step S418, after the third entity computer 410 receives the token from the second entity computer 220, the third entity computer 410 may generate a hashed value. In this example, the generated hashed value may be referred to as a “token usage key”. The token usage key may be a hashed function of one or more inputs associated with the token data and/or data associated with one of the entities. For example, the inputs to the hash function can be the token data itself and data identifying the third entity computer 410. The data identifying the third entity computer 410 could be any type of data that uniquely identifies the third entity computer 410. For example, the data identifying the third entity computer 410 could be a unique name (e.g., “GoGo Events, Inc.”) or could be an identifier code (e.g., “59skei9274isl”). Further, the two inputs to the hash function can be concatenated with each other prior to performing the hash function on the concatenated value. For example, the token data and the data identifying the third entity computer 410 could be concatenated with each other prior to performing the hash function. If the token data is “490000000000001” (e.g., same token generated by the token server computer 120 in step S402) and the identifier code for the third entity computer 410 is “59skei9274isl”, the concatenated value would be “49000000000000159skei9274isl”. Accordingly, the hash function could be performed on the value “49000000000000159skei9274isl”. In some embodiments, the hash function may be a HMAC. Additionally, the third entity computer 410 may have a unique derivation key used to generate the HMAC value. In an example, if the unique derivation key is “asdf” and the HMAC uses a SHA1 message digest algorithm, the computed HMAC may be “80d2847b9640d7aa1974364b7be29560f6991a36”. The computed HMAC may be referred to as the “token usage key”. It can be appreciated that while this example mentions HMAC, any hashing algorithm may be used to compute the hash value.
[0070] At step S420, after the third entity computer 410 computes the hash value (e.g., computed HMAC), the computed hash value may be transmitted to the second entity computer 220 (e.g., the entity that forwarded the generated token to the third entity computer 410). In addition to the computed hash value, the data identifier associated with the third entity computer 410 may also be transmitted to the second entity computer 220. For example, the third entity computer 410 may transmit the computed hash value (e.g., “80d2847b9640d7aa1974364b7be29560f6991a36”) and the data identifier associated with the third entity computer 410 (e.g., “59skei9274isl”) to the second entity computer 220. Together, the computed hash value and the data identifier associated with the third entity computer 410 may be considered as a “receipt” indicating that the third entity computer 410 successfully received the token from the second entity computer 220.
[0071] At step S422, after receiving the computed hash value and data identifier associated with the third entity computer 410, the second entity computer 220 may forward the computed hash value and data identifier associated with the third entity computer 410 to the token server computer 120. By receiving these two data elements, the token server computer 120 can track the token initially generated in step S402. Since the token server computer 120 has now received the computed hash value and the identity of the third entity computer 410, the token server computer 120 has confidence that the token was passed on to the third entity computer 410 by a trusted entity (e.g., the second entity computer 220), since the token server computer 120 has a record of the distribution of the token. More specifically, since the token server computer 120 received the first computed hash value (computed in step S408) and data identifier associated with the second entity computer 220, and has now received the second computed hash value (computed in step S418) and the data identifier associated with the third entity computer 410, the token server computer 120 can establish a “chain” of the distribution of the token from when it was originally generated by the token server computer 120 and transmitted to the first entity computer 210.
[0072] At step S424, after receiving the computed hash value and data identifier associated with the third entity computer 410, the token server computer 120 may write the received computed hash value and data identifier associated with the third entity computer 410 into the registry. For example, the two data elements may be written to the registry 350 (FIG. 3 ). Further, a link or association in the registry 350 (FIG. 3 ) may be made between the two received data elements. In some embodiments, instead of residing within the token server computer 120, the registry may reside external to the token server computer 120 (e.g., on a third-party computer or within a cloud network). In some implementations, step S414 may not be present and instead the second entity computer 220 may directly write the computed hash value and data identifier associated with the third entity computer 410 directly to a registry (e.g., a registry residing within a cloud network).
[0073] FIG. 5 illustrates another flow 500 between a token server computer and multiple entities, in accordance with some embodiments of the invention. The flow 500 is similar to the flow in FIG. 4 , except that the present flow 500 allows for data indicating an assurance that the token has been successfully distributed at each step. It also may allows the recipient of the token to acknowledge receipt with data that the sender can use to proof handoff of the token as well. The flow 500 depicts multiple entities including a first entity computer 210, second entity computer 220, and third entity computer 410. In some implementations, the first entity computer 210 may be a first merchant computer, the second entity computer 220 may be a second entity computer, and the third entity computer 410 may be a third merchant computer.
[0074] At step S502, the token server computer 120 may generate a token in response to receiving a request from a token requestor. For example, the first entity computer 210 may be the token requestor and request generation of a token from the token server computer 120. The token request may be issued in response to a user action, such as registering a payment card or stadium event ticket with a mobile application. In some embodiments, the generated token may be associated a PAN. The token server computer 120 may generate the token via the token generation module 342 (FIG. 3 ).
[0075] At step S504, after the token server computer 120 generates the token, the token server computer 120 may transmit the generated token to the first entity computer 210. The token may be transmitted over any communication channel. One such example of a communication channel is the Internet.
[0076] At step S506, after receiving the generated token from the token server computer 120, the first entity computer 210 may generate a hash value. In this example, the generated hash value may be referred to as “Digest Entity 1 (DE1)”. DE1 may represent a sort of additional “token digest” signifying that the first entity computer 210 successfully received the token from the token server computer 120. DE1 may be a hashed function of one or more inputs associated with the token data and/or data associated with one of the entities. For example, the inputs to the hash function for DE1 can be the token data itself and data identifying the destination entity that the first entity computer 210 intends to forward the token on to (e.g., the second entity computer 220). The data identifying the second entity computer 220 could be any type of data that uniquely identifies the second entity computer 220. For example, the data identifying the second entity computer 220 could be a unique name (e.g., “Happy Stores, Inc. Location 3”) or could be a identifier code (e.g., “3a8309fao3j2”). Further, the two inputs to the hash function can be concatenated with each other prior to performing the hash function on the concatenated value. For example, the token data and the data identifying the second entity computer 220 could be concatenated with each other prior to performing the hash function. If the token data is “490000000000001” and the identifier code for the second entity computer is “3a8309fao3j2”, the concatenated value would be “4900000000000013a8309fao3j2”. Accordingly, the hash function could be performed on the value “4900000000000013a8309fao3j2”. In some embodiments, the hash function may be a HMAC. In some embodiments, the first entity computer 210 may have knowledge of the data identifying the second entity computer 220. Additionally, the first entity computer 210 may have a unique derivation key used to generate the HMAC value. In an example, if the unique derivation key is “asdf” and the HMAC uses a SHA1 message digest algorithm, the computed HMAC for DE1 may be “167dc2ab5c962c3ffb38e601fa1199f73e0c8782”. The computed HMAC may be referred to as the “DE1”. It can be appreciated that while this example mentions HMAC, any hashing algorithm may be used to compute the hash value.
[0077] At step S508, the first entity computer 210 may forward the token and DE1 to the second entity computer 220. The token and DE1 may be transmitted over any communication channel. One such example of a communication channel is the Internet. For example, the first entity computer 210 could be associated with a social networking site that supports payments to third-parties via the social networking site. The second entity computer 220 could be one such third-party that can process a payment for a good or service from the social networking site. As such, the token and DE1 may be forwarded to the second entity computer 220 (e.g., third-party).
[0078] At step S510, after receiving the token and DE1 from the first entity computer 210, the second entity computer 220 may generate a hash value. In this example, the generated hashed value may be referred to as a first “token usage key”. The token usage key may be a hashed function of one or more inputs associated with the DE1 and/or data identifying the second entity computer 220. For example, the inputs to the hash function can be the data identifying the second entity computer 220 and DE1 generated by the first entity computer 210 in step S506. Further, the two inputs to the hash function can be concatenated with each other prior to performing the hash function on the concatenated value. For example, the DE1 and the data identifying the second entity computer 220 could be concatenated with each other prior to performing the hash function. If DE1 is “167dc2ab5c962c3ffb38e601fa1199f73e0c8782” and the data identifying the second entity computer is “3a8309fao3j2”, the concatenated value would be “167dc2ab5c962c3ffb38e601fa1199f73e0c87823a8309fao3j2”. Accordingly, the hash function could be performed on the value “167dc2ab5c962c3ffb38e601fa1199f73e0c87823a8309fao3j2”. In some embodiments, the hash function may be a HMAC. Additionally, the second entity computer 220 may have a unique derivation key used to generate the HMAC value. In an example, if the unique derivation key is “asdf” and the HMAC uses a SHA1 message digest algorithm, the computed HMAC may be “97c9d00d5f1d97464383fff441d0c4e34551b5ae”. The computed HMAC may be referred to as the first “token usage key”. It can be appreciated that while this example mentions HMAC, any hashing algorithm may be used to compute the hash value.
[0079] At step S512, after the second entity computer 220 computes the hash value (e.g., computed HMAC), the computed hash value may be transmitted to the first entity computer 210 (e.g., the entity that forwarded the generated token to the second entity computer 220). In addition to the computed hash value, the data identifier associated with the second entity computer 220 may also be transmitted to the first entity computer 210. For example, the second entity computer 220 may transmit the computed hash value (e.g., “97c9d00d5f1d97464383fff441d0c4e34551b5ae”) and the data identifier associated with the second entity computer 220 (e.g., “3a8309fao3j2”) to the first entity computer 210. Together, the computed hash value and the data identifier associated with the second entity computer 220 may be considered as a “token usage key” or “receipt” indicating the second entity computer 220 successfully received the token from the first entity computer 210.
[0080] At step S514, after receiving the computed hash value (e.g., the token usage key) and data identifier associated with the second entity computer 220, the first entity computer 210 may forward the computed hash value and data identifier associated with the second entity computer 220 to the token server computer 120. By receiving these two data elements, the token server computer 120 may be able to track the token initially generated in step S502. Since the token server computer 120 has now received the computed hash value and the identity of the second entity computer 220, the token server computer 120 may have confidence that the token was passed on to the second entity computer 220 by a trusted entity (e.g., the first entity computer 210), since the token server computer 120 has a record of the distribution of the token. Additionally, since one of the elements of the token usage key is DE1, which was generated by the first entity computer 210 upon successfully receiving the token from the token server computer 120, the token server computer 120 may also have record that the first entity computer 210 received the token and forwarded it to the second entity computer 220.
[0081] At step S516, after receiving the computed hash value (e.g., token usage key) and data identifier associated with the second entity computer 220, the token server computer 120 may write the received computed hash value and data identifier associated with the second entity computer 220 into a registry. For example, the two data elements may be written in to the registry 350 (FIG. 3 ). Further, a link or association in the registry 350 (FIG. 3 ) may be made between the two received data elements. In some embodiments, instead of residing within the token server computer 120, the registry may reside external to the token server computer 120 (e.g., on a third-party computer or within a cloud network). In some implementations, step S516 may not be present and instead the first entity computer 210 may directly write the computed hash value and data identifier associated with the second entity computer 220 directly to a registry (e.g., a registry residing within a cloud network).
[0082] At step S520, the second entity computer 220 may generate another hashed value. In this example, the other generated hash value may be referred to as “Digest Entity 2 (DE2)”. DE2 may represent a sort of additional “token digest” signifying that the second entity computer 220 successfully received the token from the first entity computer 210. DE2 may be an output of a hashed function of one or more inputs associated with the first token usage key generated in step S510 and/or data associated with one of the entities. For example, the inputs to the hash function resulting in DE2 can be the first token usage key and data identifying the destination entity that the second entity computer 220 intends to forward the token on to (e.g., the third entity computer 410). The data identifying the third entity computer 410 could be any type of data that uniquely identifies the third entity computer 410. For example, the data identifying the third entity computer 410 could be a unique name (e.g., “GoGo Events, Inc.”) or could be a identifier code (e.g., “59skei9274is1”). Further, the two inputs to the hash function can be concatenated with each other prior to performing the hash function on the concatenated value. For example, the first token usage key and the data identifying the third entity computer 410 could be concatenated with each other prior to performing the hash function. Since, the first token usage key generated in step S510 is “97c9d00d5f1d97464383fff441d0c4e34551b5ae” and the identifier code for the third entity computer is “59skei9274is1”, the concatenated value would be “97c9d00d5f1d97464383fff441d0c4e34551b5ae59skei9274is1”. Accordingly, the hash function could be performed on the value “97c9d00d5f1d97464383fff441d0c4e34551b5ae59skei9274is1”. In some embodiments, the hash function may be a HMAC. In some embodiments, the second entity computer 220 may have knowledge of the data identifying the third entity computer 410. Additionally, the second entity computer 220 may have a unique derivation key used to generate the HMAC value. In an example, if the unique derivation key is “asdf” and the HMAC uses a SHA1 message digest algorithm, the computed HMAC for DE2 may be “e8cbcb3f0419b5f2b481c6de0662d7c51da03c80”. The computed HMAC (e.g., DE2) may be referred to as the “DE2”. It can be appreciated that while this example mentions HMAC, any hashing algorithm may be used to compute the hash value.
[0083] At step S522, the second entity computer 220 may forward the token and DE2 to the third entity computer 410. The token and DE2 may be transmitted over any communication channel. One such example of a communication channel is the Internet. For example, the second entity computer 220 could be associated with a social networking site that supports payments to third-parties via the social networking site. The third entity computer 410 could be one such third-party that can process a payment for a good or service from the social networking site. As such, the token and DE2 may be forwarded to the third entity computer 410.
[0084] At step S524, after receiving the token and DE2 from the second entity computer 220, the third entity computer 410 may generate a hash value. In this example, the generated hashed value may be referred to as a second “token usage key”. The second token usage key may be a hashed function of one or more inputs associated with the DE2 and data identifying the third entity computer 410. For example, the inputs to the hash function can be the DE2 generated by the second entity computer 220 in step S520 and data identifying the third entity computer 410 (e.g., “59skei9274isl”. Further, the two inputs to the hash function can be concatenated with each other prior to performing the hash function on the concatenated value. For example, DE2 and the data identifying the third entity computer 410 could be concatenated with each other prior to performing the hash function. Since DE2 is “e8cbcb3f0419b5f2b481c6de0662d7c51da03c80” and the data identifying the third entity computer is “59skei9274is1”, the concatenated value would be “e8cbcb3f0419b5f2b481c6de0662d7c51da03c8059skei9274isl”. Accordingly, the hash function could be performed on the value “e8cbcb3f0419b5f2b481c6de0662d7c51da03c8059skei9274isl”. In some embodiments, the hash function may be a HMAC function. Additionally, the third entity computer 410 may have a unique derivation key used to generate the HMAC value. In an example, if the unique derivation key is “asdf” and the HMAC uses a SHA1 message digest algorithm, the computed HMAC may be “f146ede2cf1e0685a0042e4c9301c635e15b3a6e”. The computed HMAC may be referred to as the second “token usage key”. It can be appreciated that while this example mentions HMAC, any hashing algorithm may be used to compute the hash value.
[0085] At step S526, after the third entity computer 410 computes the hash value (e.g., computed HMAC), the computed hash value may be transmitted to the second entity computer 220 (e.g., the entity that forwarded the generated token to the third entity computer 410). In addition to the computed hash value, the data identifier associated with the third entity computer 410 may also be transmitted to the first entity computer 210. For example, the third entity computer 410 may transmit the computed hash value (e.g., “f146ede2cf1e0685a0042e4c9301c635e15b3a6e”) and the data identifier associated with the third entity computer 410 (e.g., “59skei9274isl”) to the second entity computer 220. Together, the computed hash value and the data identifier associated with the third entity computer 410 may be considered as a second “token usage key” or “receipt” indicating the third entity computer 410 successfully received the token from the first entity computer 210.
[0086] At step S528, after receiving the computed hash value (e.g., the second token usage key) and data identifier associated with the third entity computer 410, the second entity computer 220 may forward the computed hash value and data identifier associated with the third entity computer 410 to the token server computer 120. By receiving these two data elements, the token server computer 120 can track the token initially generated in step S502. Since the token server computer 120 has now received the computed hash value (e.g., second token usage key) and the identity of the third entity computer 410, the token server computer 120 can have confidence that the token was passed on to the third entity computer 410 by a trusted entity (e.g., the second entity computer 220), since the token server computer 120 has a record of the distribution of the token. Additionally, since one of the elements of the token usage key is DE2, which was generated by the second entity computer 220 upon successfully receiving the token from the token server computer 120, the token server computer 120 may also have a record that the second entity computer 220 received the token (from the first entity computer 210) and forwarded it to the third entity computer 410. This is because the hash value of second token usage key is made up of components including DE2, which is made up of components including the first token usage key, which is made up of components including the DE1, which is made up of components including the token data. Accordingly, the hash value can trace the entire chain of distribution of the token from initial generation of the token in step S502.
[0087] At step S530, after receiving the computed hash value (e.g., second token usage key) and data identifier associated with the third entity computer 410, the token server computer 120 may write the received computed hash value and data identifier associated with the third entity computer 410 into a registry. For example, the two data elements may be written in to the registry 350 (FIG. 3 ). Further, a link or association in the registry 350 (FIG. 3 ) may be made between the two received data elements. In some embodiments, instead of residing within the token server computer 120, the registry may reside external to the token server computer 120 (e.g., on a third-party computer or within a cloud network). In some implementations, step S530 may not be present and instead the second entity computer 220 may directly write the computed hash value (e.g., second token usage key) and data identifier associated with the third entity computer 410 directly to a registry (e.g., a registry residing within a cloud network).
[0088] FIG. 6 illustrates a flow of validating a token, in accordance with embodiments of the invention. While the examples in FIG. 4 and FIG. 5 may illustrate the initial setup the first time a token is distributed to various entities, the following figure illustrates the process of validating or authorizing the use of a token after the initial setup.
[0089] At step S610, the first entity computer 210 may transmit token data to the token server computer 120. The token may be transmitted to the token server computer 120 at, for example, the time of a transaction using the token. Upon receiving the token data, the token server computer 120 may validate the token and approve/deny the transaction based on the validation. This step may be performed in accordance with traditional token processing techniques.
[0090] At step S620, the second entity computer 220 may transmit the token and the first token usage key to the token server computer 120. The token and the first token usage key may be transmitted to the token server computer 120 at, for example, the time of a transaction being performed by the second entity computer 220 using a token that was forwarded to it by the first entity computer 210. At step S630, the token server computer 120 may validate the token by comparing the received first token usage key to the first token usage key stored within the registry. If the received first token usage key matches the first token usage key stored within the registry, the token server computer 120 may validate and approve the use of the token in the transaction. Otherwise, the token server computer 120 may deny the use of the token in the transaction.
[0091] Similarly, at step S640, the third entity computer 410 may transmit the token and the second token usage key to the token server computer 120. The token and the second token usage key may be transmitted to the token server computer 120 at, for example, the time of a transaction being performed by the third entity computer 410 using a token that was forwarded to it by the second entity computer 220. At step S650, the token server computer 120 may validate the token by comparing the received second token usage key to the second token usage key stored within the registry. If the received second token usage key matches the second token usage key stored within the registry, the token server computer 120 may validate and approve the use of the token in the transaction. Otherwise, the token server computer 120 may deny the use of the token in the transaction.
[0092] FIG. 7 shows a block diagram of a more detailed view of a transaction processing system 700. The system 700 may include a communication device 115, a token server computer 120, an access device 150, a merchant computer 160, an acquirer computer 170, a payment processing network computer 130, and an issuer computer 140. In some implementations, different entities in FIG. 7 may communicate with each other using one or more interconnected communication networks 180 such as the Internet, a cellular network, a TCP/IP network or any other suitable communication network. Note that one or more entities in the system 700 may be associated with a computer apparatus that may be implemented using some of the components as described with reference to the previous figures.
[0093] The communication device 115 may be associated with a payment account of a user. In some implementations, the communication device 115 may be a mobile device such as a mobile phone, a tablet, a PDA, a notebook, a key fob or any suitable mobile device. In some embodiments, the communication device 115 may be a wearable device such as, but not limited to, a smart watch, a fitness band, an ankle bracelet, a ring, earrings, etc. For example, the communication device 115 may include a virtual wallet or a payment application that may be associated with one or more payment accounts of the user. In some implementations, the communication device 115 may be capable of communicating with the access device 150 using a wireless data protocol such as Wi-Fi™ or Bluetooth™. For example, the communication device 115 may interact with the access device 150 by establishing a connection with the access device 150 using a wireless data protocol. In some embodiments, the communication device 115 may be the token requestor 110 (FIG. 1 ).
[0094] The access device 150 may be an access point to a transaction processing system that may comprise the acquirer computer 170, the payment processing network computer 130, and the issuer computer 140. In some implementations, the access device 150 may be associated with or operated by the merchant computer 160. For example, the access device 150 may be a point of sale device that may include a contactless reader, an electronic cash register, a display device, etc. In some implementations, the access device 150 may be configured to transmit information pertaining to one or more purchased items at a merchant 160 to an acquirer 170 or payment processing network 130. In some implementations, the access device 150 may be a personal computer that may be used by the user to initiate a transaction with the merchant computer 160 (e.g., an online transaction).
[0095] The acquirer computer 170 may be operated by an acquirer. The acquirer computer 170 is typically a system for an entity (e.g., a bank) that has a business relationship with a particular merchant, a wallet provider or another entity. The acquirer computer 170 may be communicatively coupled to the merchant computer 160 and the payment processing network 130 and may issue and manage a financial account for the merchant. The acquirer computer 630 may be configured to route the authorization request for a transaction to the issuer computer 140 via the payment processing network computer 130 and route an authorization response received via the payment processing network computer 130 to the merchant computer 160.
[0096] The payment processing network computer 130 may be configured to provide authorization services, and clearing and settlement services for payment transactions. The payment processing network computer 130 may include data processing subsystems, wired or wireless networks, including the internet. An example of the payment processing network computer 130 includes VisaNet™, operated by Visa®. 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 Visa Integrated Payments (VIP) system which processes authorization requests and a Base II system which performs clearing and settlement services. The payment processing network computer 130 may include a server computer. In some implementations, the payment processing network computer 130 may forward an authorization request received from the acquirer computer 170 to the issuer computer 140 via a communication channel. The payment processing network computer 130 may further forward an authorization response message received from the issuer computer 140 to the acquirer computer 170.
[0097] The issuer computer 140 may represent an account issuer and/or an issuer processor. Typically, the issuer computer 140 may be associated with a business entity (e.g., a bank) that may have issued an account and/or payment card (e.g., credit account, debit account, etc.) for payment transactions. In some implementations, the business entity (bank) associated with the issuer computer 140 may also function as an acquirer (e.g., the acquirer computer 630).
[0098] The token server computer 120 is responsible for generation and registration of a token. For example, the communication device 115 may request (e.g. via a digital wallet application associated with an entity computer) a token from the token server computer 120 and upon verification, the token server computer 120 generates, registers, and returns the token to the communication device 115. The communication device 115 then initiates a payment transaction with the payment processing network 130 by sending an authorization request message including the token to the payment processing network 130. The payment processing network 130 then forwards the authorization request message to the issuer computer 140 for authorization.
[0099] The various participants and elements described herein with reference to FIGS. 1-6 may operate one or more computer apparatuses to facilitate the functions described herein. Any of the elements in FIGS. 1-6 , including any servers or databases, may use any suitable number of subsystems to facilitate the functions described herein.
[0100] Examples of such subsystems or components are shown in FIG. 8 . The subsystems shown in FIG. 8 are interconnected via a system bus 875. Additional subsystems such as a printer 803, keyboard 806, fixed disk 807 (or other memory comprising computer readable media), monitor 809, which is coupled to display adapter 804, and others are shown. Peripherals and input/output (I/O) devices, which couple to I/O controller 800 (which can be a processor or other suitable controller), can be connected to the computer system by any number of means known in the art, such as serial port 805. For example, serial port 805 or external interface 808 can be used to connect the computer apparatus to a wide area network such as the Internet, a mouse input device, or a scanner. The interconnection via system bus allows the central processor 802 to communicate with each subsystem and to control the execution of instructions from system memory 801 or the fixed disk 807, as well as the exchange of information between subsystems. The system memory 801 and/or the fixed disk 807 may embody a computer readable medium.
[0101] 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.
[0102] The above description is illustrative and is not restrictive. The process flow may be extended beyond the number of components shown. Many variations of the invention will become apparent to those skilled in the art upon review of the disclosure. The scope of the invention should, therefore, be determined not with reference to the above description, but instead should be determined with reference to the pending claims along with their full scope or equivalents.
[0103] 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.
[0104] A recitation of “a”, “an” or “the” is intended to mean “one or more” unless specifically indicated to the contrary.
[0105] 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.
Claims
What is claimed is:
1. A method for facilitating a transaction, comprising:
generating, via a token server computer, a token for use by a first entity computer, wherein the token is generated in response to a request received from the first entity computer;
transmitting, via the token server computer, the token to the first entity computer, wherein the first entity computer transmits the token to a second entity computer, wherein the first entity computer is a first merchant computer and the second entity computer is a second merchant computer;
receiving, at the token server computer and from the first entity computer, data indicative of the second entity computer successfully receiving the token, wherein the data comprises a first hashed value derived from at least:
a concatenated value that concatenates at least:
the token and
data indicative of an identity of the second entity computer, wherein the data indicative of the identity of the second entity computer is data that uniquely identifies the second entity computer,
wherein the first hashed value is generated by the second entity computer, and
wherein prior to receiving, at the token server computer and from the first entity computer, the data indicative of the second entity computer successfully receiving the token, the first entity computer receives the data indicative of the second entity computer successfully receiving the token from the second entity computer;
writing, by the token server computer, the data indicative of the second entity computer successfully receiving the token to a registry;
receiving, at the token server computer and from the second entity computer, data indicative of a third entity computer successfully receiving the token, wherein the data comprises a second hashed value derived from at least:
a concatenated value that concatenates at least:
the token and
data indicative of an identity of the third entity computer, wherein the data indicative of the identity of the third entity computer is data that uniquely identifies the third entity computer, and
wherein the second hashed value is generated by the third entity computer; and
writing, by the token server computer, the data indicative of the third entity computer successfully receiving the token to the registry.
2. The method of claim 1, further comprising validating, by the token server computer, the token based at least in part on the data written to the registry.
3. The method of claim 1, wherein the first hashed value is derived using a hash function.
4. The method of claim 1, wherein the token is associated with an entry ticket to an event.
5. The method of claim 1, wherein the token server computer resides within a cloud network.
6. A server computer for facilitating a transaction, comprising:
a processor; and
a computer readable medium coupled to the processor, the computer readable medium comprising code, executable by the processor, for implementing a method comprising:
generating a token for use by a first entity computer, wherein the token is generated in response to a request received from the first entity computer;
transmitting the token to the first entity computer, wherein the first entity computer transmits the token to a second entity computer, wherein the first entity computer is a first merchant computer and the second entity computer is a second merchant computer;
receiving, from the first entity computer, data indicative of the second entity computer successfully receiving the token, wherein the data comprises a first hashed value derived from at least:
a concatenated value that concatenates at least:
the token and
data indicative of an identity of the second entity computer, wherein the data indicative of the identity of the second entity computer is data that uniquely identifies the second entity computer,
wherein the first hashed value is generated by the second entity computer, and
wherein prior to receiving, from the first entity computer, the data indicative of the second entity computer successfully receiving the token, the first entity computer receives the data indicative of the second entity computer successfully receiving the token from the second entity computer;
writing the data indicative of the second entity computer successfully receiving the token to a registry;
receiving, from the second entity computer, data indicative of a third entity computer successfully receiving the token, wherein the data comprises a second hashed value derived from at least:
a concatenated value that concatenates at least:
the token and
data indicative of an identity of the third entity computer, wherein the data indicative of the identity of the third entity computer is data that uniquely identifies the third entity computer, and
wherein the second hashed value is generated by the third entity computer; and
writing the data indicative of the third entity computer successfully receiving the token to the registry.
7. The server computer of claim 6, further comprising validating the token based at least in part on the data written to the registry.
8. The server computer of claim 6, wherein the first hashed value is derived using a hash function.
9. The server computer of claim 6, wherein the token is associated with an entry ticket to an event.
10. The server computer of claim 6, wherein the server computer is a token server computer, which resides within a cloud network.
11. The method of claim 1, wherein the token is a payment token.
12. The server computer of claim 6, wherein the token is a payment token.
Patent Citations (593)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5280527(A) | 1994-01-01 | Gullman | Applicant |
| US5613012(A) | 1997-03-01 | Hoffman | Applicant |
| US5781438(A) | 1998-07-01 | Lee | Applicant |
| US5883810(A) | 1999-03-01 | Franklin | Applicant |
| US5930767(A) | 1999-07-01 | Reber | Applicant |
| US5953710(A) | 1999-09-01 | Fleming | Applicant |
| US5956699(A) | 1999-09-01 | Wong | Applicant |
| US6000832(A) | 1999-12-01 | Franklin | Applicant |
| US6014635(A) | 2000-01-01 | Harris | Applicant |
| US6044360(A) | 2000-03-01 | Picciallo | Applicant |
| US6163771(A) | 2000-12-01 | Walker | Applicant |
| US6227447(B1) | 2001-05-01 | Campisano | Applicant |
| US6236981(B1) | 2001-05-01 | Hill | Applicant |
| US6267292(B1) | 2001-07-01 | Walker | Applicant |
| US6327578(B1) | 2001-12-01 | Linehan | Applicant |
| US6341724(B2) | 2002-01-01 | Campisano | Applicant |
| US6385596(B1) | 2002-05-01 | Wiser | Applicant |
| US6422462(B1) | 2002-07-01 | Cohen | Applicant |
| US6425523(B1) | 2002-07-01 | Shem Ur | Applicant |
| US6453301(B1) | 2002-09-01 | Niwa | Applicant |
| US6592044(B1) | 2003-07-01 | Wong | Applicant |
| US6636833(B1) | 2003-10-01 | Flitcroft | Applicant |
| US6748367(B1) | 2004-06-01 | Lee | Applicant |
| US6805287(B2) | 2004-10-01 | Bishop | Applicant |
| US6879965(B2) | 2005-04-01 | Fung | Applicant |
| US6891953(B1) | 2005-05-01 | DeMello | Applicant |
| US6901387(B2) | 2005-05-01 | Wells | Applicant |
| US6931382(B2) | 2005-08-01 | Laage | Applicant |
| US6938019(B1) | 2005-08-01 | Uzo | Applicant |
| US6941285(B2) | 2005-09-01 | Sarcanin | Applicant |
| US6980670(B1) | 2005-12-01 | Hoffman | Applicant |
| US6990470(B2) | 2006-01-01 | Hogan | Applicant |
| US6991157(B2) | 2006-01-01 | Bishop | Applicant |
| US7051929(B2) | 2006-05-01 | Li | Applicant |
| US7069249(B2) | 2006-06-01 | Stolfo | Applicant |
| US7103576(B2) | 2006-09-01 | Mann, III | Applicant |
| US7113930(B2) | 2006-09-01 | Eccles | Applicant |
| US7136835(B1) | 2006-11-01 | Flitcroft | Applicant |
| US7177835(B1) | 2007-02-01 | Walker | Applicant |
| US7177848(B2) | 2007-02-01 | Hogan | Applicant |
| US7194437(B1) | 2007-03-01 | Britto | Applicant |
| US7209561(B1) | 2007-04-01 | Shankar et al. | Applicant |
| US7264154(B2) | 2007-09-01 | Harris | Applicant |
| US7287692(B1) | 2007-10-01 | Patel | Applicant |
| US7292999(B2) | 2007-11-01 | Hobson | Applicant |
| US7350230(B2) | 2008-03-01 | Forrest | Applicant |
| US7353382(B2) | 2008-04-01 | Labrou | Applicant |
| US7379919(B2) | 2008-05-01 | Hogan | Applicant |
| USRE40444(E) | 2008-07-01 | Linehan | Applicant |
| US7415443(B2) | 2008-08-01 | Hobson | Applicant |
| US7444676(B1) | 2008-10-01 | Asghari-Kamrani | Applicant |
| US7469151(B2) | 2008-12-01 | Khan | Applicant |
| US7548889(B2) | 2009-06-01 | Bhambri | Applicant |
| US7567934(B2) | 2009-07-01 | Flitcroft | Applicant |
| US7567936(B1) | 2009-07-01 | Peckover | Applicant |
| US7571139(B1) | 2009-08-01 | Giordano | Applicant |
| US7571142(B1) | 2009-08-01 | Flitcroft | Applicant |
| US7580898(B2) | 2009-08-01 | Brown | Applicant |
| US7584153(B2) | 2009-09-01 | Brown | Applicant |
| US7593896(B1) | 2009-09-01 | Flitcroft | Applicant |
| US7606560(B2) | 2009-10-01 | Labrou | Applicant |
| US7627531(B2) | 2009-12-01 | Breck | Applicant |
| US7627895(B2) | 2009-12-01 | Gifford | Applicant |
| US7650314(B1) | 2010-01-01 | Saunders | Applicant |
| US7685037(B2) | 2010-03-01 | Reiners | Applicant |
| US7702578(B2) | 2010-04-01 | Fung | Applicant |
| US7707120(B2) | 2010-04-01 | Dominguez | Applicant |
| US7712655(B2) | 2010-05-01 | Wong | Applicant |
| US7734527(B2) | 2010-06-01 | Uzo | Examiner |
| US7753265(B2) | 2010-07-01 | Harris | Applicant |
| US7770789(B2) | 2010-08-01 | Oder, II | Applicant |
| US7784685(B1) | 2010-08-01 | Hopkins, III | Applicant |
| US7793851(B2) | 2010-09-01 | Mullen | Applicant |
| US7801826(B2) | 2010-09-01 | Labrou | Applicant |
| US7805376(B2) | 2010-09-01 | Smith | Applicant |
| US7805378(B2) | 2010-09-01 | Berardi | Applicant |
| US7818264(B2) | 2010-10-01 | Hammad | Applicant |
| US7828220(B2) | 2010-11-01 | Mullen | Applicant |
| US7835960(B2) | 2010-11-01 | Breck | Applicant |
| US7841523(B2) | 2010-11-01 | Oder, II | Applicant |
| US7841539(B2) | 2010-11-01 | Hewton | Applicant |
| US7844550(B2) | 2010-11-01 | Walker | Applicant |
| US7848980(B2) | 2010-12-01 | Carlson | Applicant |
| US7849020(B2) | 2010-12-01 | Johnson | Applicant |
| US7853529(B1) | 2010-12-01 | Walker | Applicant |
| US7853995(B2) | 2010-12-01 | Chow | Applicant |
| US7865414(B2) | 2011-01-01 | Fung | Applicant |
| US7873579(B2) | 2011-01-01 | Hobson | Applicant |
| US7873580(B2) | 2011-01-01 | Hobson | Applicant |
| US7890393(B2) | 2011-02-01 | Talbert | Applicant |
| US7891563(B2) | 2011-02-01 | Oder, II | Applicant |
| US7896238(B2) | 2011-03-01 | Fein | Applicant |
| US7908216(B1) | 2011-03-01 | Davis et al. | Applicant |
| US7922082(B2) | 2011-04-01 | Muscato | Applicant |
| US7931195(B2) | 2011-04-01 | Mullen | Applicant |
| US7937324(B2) | 2011-05-01 | Patterson | Applicant |
| US7938318(B2) | 2011-05-01 | Fein | Applicant |
| US7954705(B2) | 2011-06-01 | Mullen | Applicant |
| US7959076(B1) | 2011-06-01 | Hopkins, III | Applicant |
| US7996288(B1) | 2011-08-01 | Stolfo | Applicant |
| US8025223(B2) | 2011-09-01 | Saunders | Applicant |
| US8046256(B2) | 2011-10-01 | Chien | Applicant |
| US8060448(B2) | 2011-11-01 | Jones | Applicant |
| US8060449(B1) | 2011-11-01 | Zhu | Applicant |
| US8074877(B2) | 2011-12-01 | Mullen | Applicant |
| US8074879(B2) | 2011-12-01 | Harris | Applicant |
| US8082210(B2) | 2011-12-01 | Hansen | Applicant |
| US8095113(B2) | 2012-01-01 | Kean | Applicant |
| US8104679(B2) | 2012-01-01 | Brown | Applicant |
| USRE43157(E) | 2012-02-01 | Bishop | Applicant |
| US8109436(B1) | 2012-02-01 | Hopkins, III | Applicant |
| US8121942(B2) | 2012-02-01 | Carlson | Applicant |
| US8121956(B2) | 2012-02-01 | Carlson | Applicant |
| US8126449(B2) | 2012-02-01 | Beenau | Applicant |
| US8132723(B2) | 2012-03-01 | Hogg et al. | Applicant |
| US8171525(B1) | 2012-05-01 | Pelly | Applicant |
| US8175973(B2) | 2012-05-01 | Davis et al. | Applicant |
| US8190523(B2) | 2012-05-01 | Patterson | Applicant |
| US8196813(B2) | 2012-06-01 | Vadhri | Applicant |
| US8205791(B2) | 2012-06-01 | Randazza | Applicant |
| US8219489(B2) | 2012-07-01 | Patterson | Applicant |
| US8224702(B2) | 2012-07-01 | Mengerink | Applicant |
| US8225385(B2) | 2012-07-01 | Chow | Applicant |
| US8229852(B2) | 2012-07-01 | Carlson | Applicant |
| US8265993(B2) | 2012-09-01 | Chien | Applicant |
| US8280777(B2) | 2012-10-01 | Mengerink | Applicant |
| US8281991(B2) | 2012-10-01 | Wentker et al. | Applicant |
| US8328095(B2) | 2012-12-01 | Oder, II | Applicant |
| US8336088(B2) | 2012-12-01 | Raj et al. | Applicant |
| US8346666(B2) | 2013-01-01 | Lindelsee et al. | Applicant |
| US8376225(B1) | 2013-02-01 | Hopkins, III | Applicant |
| US8380177(B2) | 2013-02-01 | Laracey | Applicant |
| US8387873(B2) | 2013-03-01 | Saunders | Applicant |
| US8401539(B2) | 2013-03-01 | Beenau | Applicant |
| US8401898(B2) | 2013-03-01 | Chien | Applicant |
| US8402555(B2) | 2013-03-01 | Grecia | Applicant |
| US8403211(B2) | 2013-03-01 | Brooks | Applicant |
| US8412623(B2) | 2013-04-01 | Moon | Applicant |
| US8412837(B1) | 2013-04-01 | Emigh | Applicant |
| US8417642(B2) | 2013-04-01 | Oren | Applicant |
| US8447699(B2) | 2013-05-01 | Batada | Applicant |
| US8453223(B2) | 2013-05-01 | Svigals | Applicant |
| US8453925(B2) | 2013-06-01 | Fisher | Applicant |
| US8458487(B1) | 2013-06-01 | Palgon | Applicant |
| US8484134(B2) | 2013-07-01 | Hobson | Applicant |
| US8485437(B2) | 2013-07-01 | Mullen | Applicant |
| US8494959(B2) | 2013-07-01 | Hathaway | Applicant |
| US8498908(B2) | 2013-07-01 | Mengerink | Applicant |
| US8504475(B2) | 2013-08-01 | Brand et al. | Applicant |
| US8504478(B2) | 2013-08-01 | Saunders | Applicant |
| US8510816(B2) | 2013-08-01 | Quach | Applicant |
| US8433116(B2) | 2013-09-01 | Davis et al. | Applicant |
| US8528067(B2) | 2013-09-01 | Hurry et al. | Applicant |
| US8533860(B1) | 2013-09-01 | Grecia | Applicant |
| US8538845(B2) | 2013-09-01 | Liberty | Applicant |
| US8555079(B2) | 2013-10-01 | Shablygin | Applicant |
| US8566168(B1) | 2013-10-01 | Bierbaum | Applicant |
| US8567670(B2) | 2013-10-01 | Stanfield | Applicant |
| US8571939(B2) | 2013-10-01 | Lindsey | Applicant |
| US8577336(B2) | 2013-11-01 | Mechaley, Jr. | Applicant |
| US8577803(B2) | 2013-11-01 | Chatterjee | Applicant |
| US8577813(B2) | 2013-11-01 | Weiss | Applicant |
| US8578176(B2) | 2013-11-01 | Mattsson | Applicant |
| US8583494(B2) | 2013-11-01 | Fisher | Applicant |
| US8584251(B2) | 2013-11-01 | Mcguire | Applicant |
| US8589237(B2) | 2013-11-01 | Fisher | Applicant |
| US8589271(B2) | 2013-11-01 | Evans | Applicant |
| US8589291(B2) | 2013-11-01 | Carlson | Applicant |
| US8595098(B2) | 2013-11-01 | Starai | Applicant |
| US8595812(B2) | 2013-11-01 | Bomar | Applicant |
| US8595850(B2) | 2013-11-01 | Spies | Applicant |
| US8606638(B2) | 2013-12-01 | Dragt | Applicant |
| US8606700(B2) | 2013-12-01 | Carlson | Applicant |
| US8606720(B1) | 2013-12-01 | Baker | Applicant |
| US8615468(B2) | 2013-12-01 | Varadarajan | Applicant |
| US8620754(B2) | 2013-12-01 | Fisher | Applicant |
| US8635157(B2) | 2014-01-01 | Smith | Applicant |
| US8646059(B1) | 2014-02-01 | Von Behren | Applicant |
| US8651374(B2) | 2014-02-01 | Brabson | Applicant |
| US8656180(B2) | 2014-02-01 | Shablygin | Applicant |
| US8751391(B2) | 2014-06-01 | Freund | Applicant |
| US8762263(B2) | 2014-06-01 | Gauthier et al. | Applicant |
| US8793186(B2) | 2014-07-01 | Patterson | Applicant |
| US8838982(B2) | 2014-09-01 | Carlson et al. | Applicant |
| US8856539(B2) | 2014-10-01 | Weiss | Applicant |
| US8887308(B2) | 2014-11-01 | Grecia | Applicant |
| US9065643(B2) | 2015-06-01 | Hurry et al. | Applicant |
| US9070129(B2) | 2015-06-01 | Sheets et al. | Applicant |
| US9077709(B1) | 2015-07-01 | Dall | Examiner |
| US9100826(B2) | 2015-08-01 | Weiss | Applicant |
| US9160741(B2) | 2015-10-01 | Wentker et al. | Applicant |
| US9229964(B2) | 2016-01-01 | Stevelinck | Applicant |
| US9245267(B2) | 2016-01-01 | Singh | Applicant |
| US9249241(B2) | 2016-02-01 | Dai et al. | Applicant |
| US9256871(B2) | 2016-02-01 | Anderson et al. | Applicant |
| US9280765(B2) | 2016-03-01 | Hammad | Applicant |
| US9530137(B2) | 2016-12-01 | Weiss | Applicant |
| US9680942(B2) | 2017-06-01 | Dimmick | Applicant |
| US2001/0029485(A1) | 2001-10-01 | Brody | Applicant |
| US2001/0034720(A1) | 2001-10-01 | Armes | Applicant |
| US2001/0054003(A1) | 2001-12-01 | Chien | Applicant |
| US2002/0007320(A1) | 2002-01-01 | Hogan | Applicant |
| US2002/0016749(A1) | 2002-02-01 | Borecki | Applicant |
| US2002/0029193(A1) | 2002-03-01 | Ranjan | Applicant |
| US2002/0035548(A1) | 2002-03-01 | Hogan | Applicant |
| US2002/0073045(A1) | 2002-06-01 | Rubin | Applicant |
| US2002/0116341(A1) | 2002-08-01 | Hogan | Applicant |
| US2002/0133467(A1) | 2002-09-01 | Hobson | Applicant |
| US2002/0147913(A1) | 2002-10-01 | Lun Yip | Applicant |
| US2003/0028481(A1) | 2003-02-01 | Flitcroft | Applicant |
| US2003/0130955(A1) | 2003-07-01 | Hawthorne | Applicant |
| US2003/0191709(A1) | 2003-10-01 | Elston | Applicant |
| US2003/0191945(A1) | 2003-10-01 | Keech | Applicant |
| US2004/0010462(A1) | 2004-01-01 | Moon | Applicant |
| US2004/0050928(A1) | 2004-03-01 | Bishop | Applicant |
| US2004/0059682(A1) | 2004-03-01 | Hasumi | Applicant |
| US2004/0093281(A1) | 2004-05-01 | Silverstein | Applicant |
| US2004/0139008(A1) | 2004-07-01 | Mascavage | Applicant |
| US2004/0143532(A1) | 2004-07-01 | Lee | Applicant |
| US2004/0158532(A1) | 2004-08-01 | Breck | Applicant |
| US2004/0210449(A1) | 2004-10-01 | Breck | Applicant |
| US2004/0210498(A1) | 2004-10-01 | Freund | Applicant |
| US2004/0232225(A1) | 2004-11-01 | Bishop | Applicant |
| US2004/0236632(A1) | 2004-11-01 | Maritzen | Applicant |
| US2004/0260646(A1) | 2004-12-01 | Berardi | Applicant |
| US2005/0037735(A1) | 2005-02-01 | Coutts | Applicant |
| US2005/0080730(A1) | 2005-04-01 | Sorrentino | Applicant |
| US2005/0108178(A1) | 2005-05-01 | York | Applicant |
| US2005/0199709(A1) | 2005-09-01 | Linlor | Applicant |
| US2005/0246293(A1) | 2005-11-01 | Ong | Applicant |
| US2005/0269401(A1) | 2005-12-01 | Spitzer | Applicant |
| US2005/0269402(A1) | 2005-12-01 | Spitzer | Applicant |
| US2006/0235795(A1) | 2006-10-01 | Johnson | Applicant |
| US2006/0237528(A1) | 2006-10-01 | Bishop | Applicant |
| US2006/0278704(A1) | 2006-12-01 | Saunders | Applicant |
| US2007/0107044(A1) | 2007-05-01 | Yuen | Applicant |
| US2007/0129955(A1) | 2007-06-01 | Dalmia | Applicant |
| US2007/0136193(A1) | 2007-06-01 | Starr | Applicant |
| US2007/0136211(A1) | 2007-06-01 | Brown | Applicant |
| US2007/0170247(A1) | 2007-07-01 | Friedman | Applicant |
| US2007/0179885(A1) | 2007-08-01 | Bird | Applicant |
| US2007/0208671(A1) | 2007-09-01 | Brown | Applicant |
| US2007/0245414(A1) | 2007-10-01 | Chan | Applicant |
| US2007/0288377(A1) | 2007-12-01 | Shaked | Applicant |
| US2007/0291995(A1) | 2007-12-01 | Rivera | Applicant |
| US2008/0015988(A1) | 2008-01-01 | Brown | Applicant |
| US2008/0029607(A1) | 2008-02-01 | Mullen | Applicant |
| US2008/0035738(A1) | 2008-02-01 | Mullen | Applicant |
| US2008/0052226(A1) | 2008-02-01 | Agarwal | Applicant |
| US2008/0054068(A1) | 2008-03-01 | Mullen | Applicant |
| US2008/0054079(A1) | 2008-03-01 | Mullen | Applicant |
| US2008/0054081(A1) | 2008-03-01 | Mullen | Applicant |
| US2008/0065554(A1) | 2008-03-01 | Hogan | Applicant |
| US2008/0065555(A1) | 2008-03-01 | Mullen | Applicant |
| US2008/0147563(A1) | 2008-06-01 | Yen et al. | Applicant |
| US2008/0201264(A1) | 2008-08-01 | Brown | Applicant |
| US2008/0201265(A1) | 2008-08-01 | Hewton | Applicant |
| US2008/0228646(A1) | 2008-09-01 | Myers | Applicant |
| US2008/0243702(A1) | 2008-10-01 | Hart | Applicant |
| US2008/0245855(A1) | 2008-10-01 | Fein | Applicant |
| US2008/0245861(A1) | 2008-10-01 | Fein | Applicant |
| US2008/0283591(A1) | 2008-11-01 | Oder, II | Applicant |
| US2008/0302869(A1) | 2008-12-01 | Mullen | Applicant |
| US2008/0302876(A1) | 2008-12-01 | Mullen | Applicant |
| US2008/0313264(A1) | 2008-12-01 | Pestoni | Applicant |
| US2009/0006262(A1) | 2009-01-01 | Brown | Applicant |
| US2009/0010488(A1) | 2009-01-01 | Matsuoka | Applicant |
| US2009/0037333(A1) | 2009-02-01 | Flitcroft | Applicant |
| US2009/0037388(A1) | 2009-02-01 | Cooper | Applicant |
| US2009/0043702(A1) | 2009-02-01 | Bennett | Applicant |
| US2009/0048971(A1) | 2009-02-01 | Hathaway | Applicant |
| US2009/0106112(A1) | 2009-04-01 | Dalmia | Applicant |
| US2009/0106160(A1) | 2009-04-01 | Skowronek | Applicant |
| US2009/0134217(A1) | 2009-05-01 | Flitcroft | Applicant |
| US2009/0157555(A1) | 2009-06-01 | Biffle | Applicant |
| US2009/0159673(A1) | 2009-06-01 | Mullen | Applicant |
| US2009/0159700(A1) | 2009-06-01 | Mullen | Applicant |
| US2009/0159707(A1) | 2009-06-01 | Mullen | Applicant |
| US2009/0173782(A1) | 2009-07-01 | Muscato | Applicant |
| US2009/0200371(A1) | 2009-08-01 | Kean | Applicant |
| US2009/0248583(A1) | 2009-10-01 | Chhabra | Applicant |
| US2009/0276347(A1) | 2009-11-01 | Kargman | Applicant |
| US2009/0281948(A1) | 2009-11-01 | Carlson | Applicant |
| US2009/0294527(A1) | 2009-12-01 | Brabson | Applicant |
| US2009/0307139(A1) | 2009-12-01 | Mardikar | Applicant |
| US2009/0308921(A1) | 2009-12-01 | Mullen | Applicant |
| US2009/0327131(A1) | 2009-12-01 | Beenau | Applicant |
| US2010/0008535(A1) | 2010-01-01 | Abulafia | Applicant |
| US2010/0088237(A1) | 2010-04-01 | Wankmueller | Applicant |
| US2010/0094755(A1) | 2010-04-01 | Kloster | Applicant |
| US2010/0106644(A1) | 2010-04-01 | Annan | Applicant |
| US2010/0120408(A1) | 2010-05-01 | Beenau | Applicant |
| US2010/0133334(A1) | 2010-06-01 | Vadhri | Applicant |
| US2010/0138347(A1) | 2010-06-01 | Chen | Applicant |
| US2010/0145860(A1) | 2010-06-01 | Pelegero | Applicant |
| US2010/0161433(A1) | 2010-06-01 | White | Applicant |
| US2010/0185545(A1) | 2010-07-01 | Royyuru | Applicant |
| US2010/0211505(A1) | 2010-08-01 | Saunders | Applicant |
| US2010/0223186(A1) | 2010-09-01 | Hogan | Applicant |
| US2010/0228668(A1) | 2010-09-01 | Hogan | Applicant |
| US2010/0235284(A1) | 2010-09-01 | Moore | Applicant |
| US2010/0258620(A1) | 2010-10-01 | Torreyson | Applicant |
| US2010/0291904(A1) | 2010-11-01 | Musfeldt | Applicant |
| US2010/0299267(A1) | 2010-11-01 | Faith et al. | Applicant |
| US2010/0306076(A1) | 2010-12-01 | Taveau | Applicant |
| US2010/0325041(A1) | 2010-12-01 | Berardi | Applicant |
| US2011/0010292(A1) | 2011-01-01 | Giordano | Applicant |
| US2011/0016047(A1) | 2011-01-01 | Wu | Applicant |
| US2011/0016320(A1) | 2011-01-01 | Bergsten | Applicant |
| US2011/0040640(A1) | 2011-02-01 | Erikson | Applicant |
| US2011/0047076(A1) | 2011-02-01 | Carlson et al. | Applicant |
| US2011/0083018(A1) | 2011-04-01 | Kesanupalli | Applicant |
| US2011/0087596(A1) | 2011-04-01 | Dorsey | Applicant |
| US2011/0093397(A1) | 2011-04-01 | Carlson | Applicant |
| US2011/0125597(A1) | 2011-05-01 | Oder, II | Applicant |
| US2011/0153437(A1) | 2011-06-01 | Archer | Applicant |
| US2011/0153498(A1) | 2011-06-01 | Makhotin et al. | Applicant |
| US2011/0154466(A1) | 2011-06-01 | Harper | Applicant |
| US2011/0161233(A1) | 2011-06-01 | Tieken | Applicant |
| US2011/0178926(A1) | 2011-07-01 | Lindelsee et al. | Applicant |
| US2011/0191244(A1) | 2011-08-01 | Dai | Applicant |
| US2011/0238511(A1) | 2011-09-01 | Park | Applicant |
| US2011/0238573(A1) | 2011-09-01 | Varadarajan | Applicant |
| US2011/0246317(A1) | 2011-10-01 | Coppinger | Applicant |
| US2011/0258111(A1) | 2011-10-01 | Raj et al. | Applicant |
| US2011/0272471(A1) | 2011-11-01 | Mullen | Applicant |
| US2011/0272478(A1) | 2011-11-01 | Mullen | Applicant |
| US2011/0276380(A1) | 2011-11-01 | Mullen | Applicant |
| US2011/0276381(A1) | 2011-11-01 | Mullen | Applicant |
| US2011/0276424(A1) | 2011-11-01 | Mullen | Applicant |
| US2011/0276425(A1) | 2011-11-01 | Mullen | Applicant |
| US2011/0295745(A1) | 2011-12-01 | White | Applicant |
| US2011/0302081(A1) | 2011-12-01 | Saunders | Applicant |
| US2012/0023567(A1) | 2012-01-01 | Hammad | Applicant |
| US2012/0028609(A1) | 2012-02-01 | Hruska | Applicant |
| US2012/0030047(A1) | 2012-02-01 | Fuentes et al. | Applicant |
| US2012/0035998(A1) | 2012-02-01 | Chien | Applicant |
| US2012/0041881(A1) | 2012-02-01 | Basu | Applicant |
| US2012/0047237(A1) | 2012-02-01 | Arvidsson | Applicant |
| US2012/0066078(A1) | 2012-03-01 | Kingston | Applicant |
| US2012/0072350(A1) | 2012-03-01 | Goldthwaite | Applicant |
| US2012/0078735(A1) | 2012-03-01 | Bauer | Applicant |
| US2012/0078798(A1) | 2012-03-01 | Downing | Applicant |
| US2012/0078799(A1) | 2012-03-01 | Jackson | Applicant |
| US2012/0095852(A1) | 2012-04-01 | Bauer | Applicant |
| US2012/0095865(A1) | 2012-04-01 | Doherty | Applicant |
| US2012/0116902(A1) | 2012-05-01 | Cardina | Applicant |
| US2012/0123882(A1) | 2012-05-01 | Carlson | Applicant |
| US2012/0123940(A1) | 2012-05-01 | Killian | Applicant |
| US2012/0129514(A1) | 2012-05-01 | Beenau | Applicant |
| US2012/0143754(A1) | 2012-06-01 | Patel | Applicant |
| US2012/0143767(A1) | 2012-06-01 | Abadir | Applicant |
| US2012/0143772(A1) | 2012-06-01 | Abadir | Applicant |
| US2012/0158580(A1) | 2012-06-01 | Eram | Applicant |
| US2012/0158593(A1) | 2012-06-01 | Garfinkle | Applicant |
| US2012/0173431(A1) | 2012-07-01 | Ritchie | Applicant |
| US2012/0185386(A1) | 2012-07-01 | Salama | Applicant |
| US2012/0197807(A1) | 2012-08-01 | Schlesser | Applicant |
| US2012/0203664(A1) | 2012-08-01 | Torossian | Applicant |
| US2012/0203666(A1) | 2012-08-01 | Torossian | Applicant |
| US2012/0215688(A1) | 2012-08-01 | Musser | Applicant |
| US2012/0215696(A1) | 2012-08-01 | Salonen | Applicant |
| US2012/0221421(A1) | 2012-08-01 | Hammad | Applicant |
| US2012/0226582(A1) | 2012-09-01 | Hammad | Applicant |
| US2012/0231844(A1) | 2012-09-01 | Coppinger | Applicant |
| US2012/0233004(A1) | 2012-09-01 | Bercaw | Applicant |
| US2012/0246070(A1) | 2012-09-01 | Vadhri | Applicant |
| US2012/0246071(A1) | 2012-09-01 | Jain | Applicant |
| US2012/0246079(A1) | 2012-09-01 | Wilson et al. | Applicant |
| US2012/0265631(A1) | 2012-10-01 | Cronic | Applicant |
| US2012/0271770(A1) | 2012-10-01 | Harris | Applicant |
| US2012/0297446(A1) | 2012-11-01 | Webb | Applicant |
| US2012/0300932(A1) | 2012-11-01 | Cambridge | Applicant |
| US2012/0303503(A1) | 2012-11-01 | Cambridge | Applicant |
| US2012/0303961(A1) | 2012-11-01 | Kean | Applicant |
| US2012/0304273(A1) | 2012-11-01 | Bailey | Applicant |
| US2012/0310725(A1) | 2012-12-01 | Chien | Applicant |
| US2012/0310831(A1) | 2012-12-01 | Harris | Applicant |
| US2012/0316992(A1) | 2012-12-01 | Oborne | Applicant |
| US2012/0317035(A1) | 2012-12-01 | Royyuru | Applicant |
| US2012/0317036(A1) | 2012-12-01 | Bower | Applicant |
| US2013/0017784(A1) | 2013-01-01 | Fisher | Applicant |
| US2013/0018757(A1) | 2013-01-01 | Anderson et al. | Applicant |
| US2013/0019098(A1) | 2013-01-01 | Gupta | Applicant |
| US2013/0031006(A1) | 2013-01-01 | Mccullagh et al. | Applicant |
| US2013/0054337(A1) | 2013-02-01 | Brendell | Applicant |
| US2013/0054466(A1) | 2013-02-01 | Muscato | Applicant |
| US2013/0054474(A1) | 2013-02-01 | Yeager | Applicant |
| US2013/0081122(A1) | 2013-03-01 | Svigals | Applicant |
| US2013/0091028(A1) | 2013-04-01 | Oder, II | Applicant |
| US2013/0110658(A1) | 2013-05-01 | Lyman | Applicant |
| US2013/0111599(A1) | 2013-05-01 | Gargiulo | Applicant |
| US2013/0117185(A1) | 2013-05-01 | Collison | Applicant |
| US2013/0124290(A1) | 2013-05-01 | Fisher | Applicant |
| US2013/0124291(A1) | 2013-05-01 | Fisher | Applicant |
| US2013/0124364(A1) | 2013-05-01 | Mittal | Applicant |
| US2013/0138525(A1) | 2013-05-01 | Bercaw | Applicant |
| US2013/0144888(A1) | 2013-06-01 | Faith | Applicant |
| US2013/0145148(A1) | 2013-06-01 | Shablygin | Applicant |
| US2013/0145172(A1) | 2013-06-01 | Shablygin | Applicant |
| US2013/0159178(A1) | 2013-06-01 | Colon | Applicant |
| US2013/0159184(A1) | 2013-06-01 | Thaw | Applicant |
| US2013/0166402(A1) | 2013-06-01 | Parento | Applicant |
| US2013/0166456(A1) | 2013-06-01 | Zhang | Applicant |
| US2013/0173736(A1) | 2013-07-01 | Krzeminski | Applicant |
| US2013/0185202(A1) | 2013-07-01 | Goldthwaite | Applicant |
| US2013/0191227(A1) | 2013-07-01 | Pasa et al. | Applicant |
| US2013/0191286(A1) | 2013-07-01 | Cronic | Applicant |
| US2013/0191289(A1) | 2013-07-01 | Cronic | Applicant |
| US2013/0198071(A1) | 2013-08-01 | Jurss | Applicant |
| US2013/0198080(A1) | 2013-08-01 | Anderson et al. | Applicant |
| US2013/0200146(A1) | 2013-08-01 | Moghadam | Applicant |
| US2013/0204787(A1) | 2013-08-01 | Dubois | Applicant |
| US2013/0204793(A1) | 2013-08-01 | Kerridge | Applicant |
| US2013/0212007(A1) | 2013-08-01 | Mattsson | Applicant |
| US2013/0212017(A1) | 2013-08-01 | Bangia | Applicant |
| US2013/0212019(A1) | 2013-08-01 | Mattsson | Applicant |
| US2013/0212024(A1) | 2013-08-01 | Mattsson | Applicant |
| US2013/0212026(A1) | 2013-08-01 | Powell et al. | Applicant |
| US2013/0212666(A1) | 2013-08-01 | Mattsson | Applicant |
| US2013/0218698(A1) | 2013-08-01 | Moon | Applicant |
| US2013/0218769(A1) | 2013-08-01 | Pourfallah et al. | Applicant |
| US2013/0226799(A1) | 2013-08-01 | Raj | Applicant |
| US2013/0226813(A1) | 2013-08-01 | Voltz | Applicant |
| US2013/0246199(A1) | 2013-09-01 | Carlson | Applicant |
| US2013/0246202(A1) | 2013-09-01 | Tobin | Applicant |
| US2013/0246203(A1) | 2013-09-01 | Laracey | Applicant |
| US2013/0246258(A1) | 2013-09-01 | Dessert | Applicant |
| US2013/0246259(A1) | 2013-09-01 | Dessert | Applicant |
| US2013/0246261(A1) | 2013-09-01 | Purves et al. | Applicant |
| US2013/0246267(A1) | 2013-09-01 | Tobin | Applicant |
| US2013/0254028(A1) | 2013-09-01 | Salci | Applicant |
| US2013/0254052(A1) | 2013-09-01 | Royyuru | Applicant |
| US2013/0254102(A1) | 2013-09-01 | Royyuru | Applicant |
| US2013/0254117(A1) | 2013-09-01 | Von Mueller | Applicant |
| US2013/0262296(A1) | 2013-10-01 | Thomas | Applicant |
| US2013/0262302(A1) | 2013-10-01 | Lettow | Applicant |
| US2013/0262315(A1) | 2013-10-01 | Hruska | Applicant |
| US2013/0262316(A1) | 2013-10-01 | Hruska | Applicant |
| US2013/0262317(A1) | 2013-10-01 | Collinge | Applicant |
| US2013/0275300(A1) | 2013-10-01 | Killian | Applicant |
| US2013/0275307(A1) | 2013-10-01 | Khan | Applicant |
| US2013/0275308(A1) | 2013-10-01 | Paraskeva | Applicant |
| US2013/0282502(A1) | 2013-10-01 | Jooste | Applicant |
| US2013/0282575(A1) | 2013-10-01 | Mullen | Applicant |
| US2013/0282588(A1) | 2013-10-01 | Hruska | Applicant |
| US2013/0297501(A1) | 2013-11-01 | Monk et al. | Applicant |
| US2013/0297504(A1) | 2013-11-01 | Nwokolo | Applicant |
| US2013/0297508(A1) | 2013-11-01 | Belamant | Applicant |
| US2013/0304649(A1) | 2013-11-01 | Cronic | Applicant |
| US2013/0308778(A1) | 2013-11-01 | Fosmark | Applicant |
| US2013/0311382(A1) | 2013-11-01 | Fosmark | Applicant |
| US2013/0317982(A1) | 2013-11-01 | Mengerink | Applicant |
| US2013/0332344(A1) | 2013-12-01 | Weber | Applicant |
| US2013/0339253(A1) | 2013-12-01 | Sincai | Applicant |
| US2013/0346305(A1) | 2013-12-01 | Mendes | Applicant |
| US2013/0346314(A1) | 2013-12-01 | Mogollon | Applicant |
| US2014/0007213(A1) | 2014-01-01 | Sanin | Applicant |
| US2014/0013106(A1) | 2014-01-01 | Redpath | Applicant |
| US2014/0013114(A1) | 2014-01-01 | Redpath | Applicant |
| US2014/0013452(A1) | 2014-01-01 | Aissi et al. | Applicant |
| US2014/0019352(A1) | 2014-01-01 | Shrivastava | Applicant |
| US2014/0025581(A1) | 2014-01-01 | Calman | Applicant |
| US2014/0025585(A1) | 2014-01-01 | Calman | Applicant |
| US2014/0025958(A1) | 2014-01-01 | Calman | Applicant |
| US2014/0032417(A1) | 2014-01-01 | Mattsson | Applicant |
| US2014/0032418(A1) | 2014-01-01 | Weber | Applicant |
| US2014/0040137(A1) | 2014-02-01 | Carlson | Applicant |
| US2014/0040139(A1) | 2014-02-01 | Brudnicki | Applicant |
| US2014/0040144(A1) | 2014-02-01 | Plomske | Applicant |
| US2014/0040145(A1) | 2014-02-01 | Ozvat | Applicant |
| US2014/0040148(A1) | 2014-02-01 | Ozvat | Applicant |
| US2014/0040628(A1) | 2014-02-01 | Fort | Applicant |
| US2014/0041018(A1) | 2014-02-01 | Bomar | Applicant |
| US2014/0046853(A1) | 2014-02-01 | Spies | Applicant |
| US2014/0047551(A1) | 2014-02-01 | Nagasundaram et al. | Applicant |
| US2014/0052532(A1) | 2014-02-01 | Tsai | Applicant |
| US2014/0052620(A1) | 2014-02-01 | Rogers | Applicant |
| US2014/0052637(A1) | 2014-02-01 | Jooste | Applicant |
| US2014/0068706(A1) | 2014-03-01 | Aissi | Applicant |
| US2014/0074637(A1) | 2014-03-01 | Hammad | Applicant |
| US2014/0108172(A1) | 2014-04-01 | Weber et al. | Applicant |
| US2014/0114857(A1) | 2014-04-01 | Griggs et al. | Applicant |
| US2014/0143137(A1) | 2014-05-01 | Carlson | Applicant |
| US2014/0149293(A1) | 2014-05-01 | Laracey | Examiner |
| US2014/0164243(A1) | 2014-06-01 | Aabye et al. | Applicant |
| US2014/0188586(A1) | 2014-07-01 | Carpenter et al. | Applicant |
| US2014/0249945(A1) | 2014-09-01 | Gauthier | Applicant |
| US2014/0294701(A1) | 2014-10-01 | Dai et al. | Applicant |
| US2014/0297534(A1) | 2014-10-01 | Patterson | Applicant |
| US2014/0310183(A1) | 2014-10-01 | Weber | Applicant |
| US2014/0324690(A1) | 2014-10-01 | Allen et al. | Applicant |
| US2014/0330721(A1) | 2014-11-01 | Wang | Applicant |
| US2014/0330722(A1) | 2014-11-01 | Laxminarayanan et al. | Applicant |
| US2014/0331265(A1) | 2014-11-01 | Mozell et al. | Applicant |
| US2014/0337236(A1) | 2014-11-01 | Wong et al. | Applicant |
| US2014/0344153(A1) | 2014-11-01 | Raj et al. | Applicant |
| US2014/0372308(A1) | 2014-12-01 | Sheets | Applicant |
| US2015/0019443(A1) | 2015-01-01 | Sheets et al. | Applicant |
| US2015/0032625(A1) | 2015-01-01 | Dill | Applicant |
| US2015/0032626(A1) | 2015-01-01 | Dill | Applicant |
| US2015/0032627(A1) | 2015-01-01 | Dill | Applicant |
| US2015/0046338(A1) | 2015-02-01 | Laxminarayanan | Applicant |
| US2015/0046339(A1) | 2015-02-01 | Wong et al. | Applicant |
| US2015/0052064(A1) | 2015-02-01 | Karpenko et al. | Applicant |
| US2015/0081544(A1) | 2015-03-01 | Wong et al. | Applicant |
| US2015/0088756(A1) | 2015-03-01 | Makhotin et al. | Applicant |
| US2015/0095133(A1) | 2015-04-01 | Parker | Examiner |
| US2015/0106239(A1) | 2015-04-01 | Gaddam et al. | Applicant |
| US2015/0112870(A1) | 2015-04-01 | Nagasundaram et al. | Applicant |
| US2015/0112871(A1) | 2015-04-01 | Kumnick | Applicant |
| US2015/0120472(A1) | 2015-04-01 | Aabye et al. | Applicant |
| US2015/0127529(A1) | 2015-05-01 | Makhotin et al. | Applicant |
| US2015/0127547(A1) | 2015-05-01 | Powell et al. | Applicant |
| US2015/0140960(A1) | 2015-05-01 | Powell et al. | Applicant |
| US2015/0142673(A1) | 2015-05-01 | Nelsen et al. | Applicant |
| US2015/0161597(A1) | 2015-06-01 | Subramanian et al. | Applicant |
| US2015/0178724(A1) | 2015-06-01 | Ngo et al. | Applicant |
| US2015/0180836(A1) | 2015-06-01 | Wong et al. | Applicant |
| US2015/0186864(A1) | 2015-07-01 | Jones et al. | Applicant |
| US2015/0193222(A1) | 2015-07-01 | Pirzadeh et al. | Applicant |
| US2015/0195133(A1) | 2015-07-01 | Sheets et al. | Applicant |
| US2015/0199679(A1) | 2015-07-01 | Palanisamy et al. | Applicant |
| US2015/0199689(A1) | 2015-07-01 | Kumnick et al. | Applicant |
| US2015/0220917(A1) | 2015-08-01 | Aabye et al. | Applicant |
| US2015/0262195(A1) | 2015-09-01 | Bergdale | Examiner |
| US2015/0269566(A1) | 2015-09-01 | Gaddam et al. | Applicant |
| US2015/0278799(A1) | 2015-10-01 | Palanisamy | Applicant |
| US2015/0287037(A1) | 2015-10-01 | Salmon | Applicant |
| US2015/0312038(A1) | 2015-10-01 | Palanisamy | Applicant |
| US2015/0319158(A1) | 2015-11-01 | Kumnick | Applicant |
| US2015/0332262(A1) | 2015-11-01 | Lingappa | Applicant |
| US2015/0356560(A1) | 2015-12-01 | Shastry et al. | Applicant |
| US2015/0363781(A1) | 2015-12-01 | Badenhorst | Applicant |
| US2016/0028550(A1) | 2016-01-01 | Gaddam | Examiner |
| US2016/0036790(A1) | 2016-02-01 | Shastry et al. | Applicant |
| US2016/0042263(A1) | 2016-02-01 | Gaddam et al. | Applicant |
| US2016/0065370(A1) | 2016-03-01 | Le Saint et al. | Applicant |
| US2016/0092696(A1) | 2016-03-01 | Guglani et al. | Applicant |
| US2016/0092872(A1) | 2016-03-01 | Prakash et al. | Applicant |
| US2016/0092874(A1) | 2016-03-01 | O'Regan | Applicant |
| US2016/0103675(A1) | 2016-04-01 | Aabye et al. | Applicant |
| US2016/0119296(A1) | 2016-04-01 | Laxminarayanan et al. | Applicant |
| US2016/0132878(A1) | 2016-05-01 | O'Regan | Applicant |
| US2016/0140545(A1) | 2016-05-01 | Flurscheim et al. | Applicant |
| US2016/0148197(A1) | 2016-05-01 | Dimmick | Applicant |
| US2016/0148212(A1) | 2016-05-01 | Dimmick | Applicant |
| US2016/0171479(A1) | 2016-06-01 | Prakash et al. | Applicant |
| US2016/0173483(A1) | 2016-06-01 | Wong et al. | Applicant |
| US2016/0197725(A1) | 2016-07-01 | Hammad | Applicant |
| US2016/0210628(A1) | 2016-07-01 | McGuire | Applicant |
| US2016/0217461(A1) | 2016-07-01 | Gaddam | Applicant |
| US2016/0218875(A1) | 2016-07-01 | Le Saint et al. | Applicant |
| US2016/0224976(A1) | 2016-08-01 | Basu et al. | Applicant |
| US2016/0224977(A1) | 2016-08-01 | Sabba et al. | Applicant |
| US2016/0232527(A1) | 2016-08-01 | Patterson | Applicant |
| US2016/0239842(A1) | 2016-08-01 | Cash et al. | Applicant |
| US2016/0269391(A1) | 2016-09-01 | Gaddam et al. | Applicant |
| US2016/0301683(A1) | 2016-10-01 | Narayan | Applicant |
| US2016/0308995(A1) | 2016-10-01 | Youdale et al. | Applicant |
| US2017/0046696(A1) | 2017-02-01 | Powell et al. | Applicant |
| US2017/0103387(A1) | 2017-04-01 | Weber | Applicant |
| US2017/0109745(A1) | 2017-04-01 | Al-Bedaiwi | Applicant |
| US2017/0186001(A1) | 2017-06-01 | Reed et al. | Applicant |
| US2017/0201520(A1) | 2017-07-01 | Chandoor | Applicant |
| US2017/0220818(A1) | 2017-08-01 | Nagasundaram et al. | Applicant |
| US2017/0228723(A1) | 2017-08-01 | Taylor | Applicant |
| US2017/0295155(A1) | 2017-10-01 | Wong et al. | Applicant |
| US2017/0364903(A1) | 2017-12-01 | Lopez | Applicant |
| US2018/0075081(A1) | 2018-03-01 | Chipman | Applicant |
| US2018/0247303(A1) | 2018-08-01 | Raj | Applicant |
| US2018/0268405(A1) | 2018-09-01 | Lopez | Applicant |
| EP1028401(A2) | 2000-08-01 | Applicant | |
| EP2156397(A1) | 2010-02-01 | Applicant | |
| KR10-2015-0132098(A) | 2015-11-01 | Applicant | |
| WO2000/014648(A1) | 2000-03-01 | Applicant | |
| WO2001035304(A1) | 2001-05-01 | Applicant | |
| WO2001035304(A9) | 2001-05-01 | Applicant | |
| WO2004/051585(A2) | 2003-11-01 | Applicant | |
| WO2004042536(A2) | 2004-05-01 | Applicant | |
| WO2005/001751(A1) | 2004-06-01 | Applicant | |
| WO2006113834(A2) | 2006-10-01 | Applicant | |
| WO2009032523(A1) | 2009-03-01 | Applicant | |
| WO2010078522(A1) | 2010-07-01 | Applicant | |
| WO2012068078(A2) | 2012-05-01 | Applicant | |
| WO2012098556(A1) | 2012-07-01 | Applicant | |
| WO2012142370(A2) | 2012-10-01 | Applicant | |
| WO2012167941(A1) | 2012-12-01 | Applicant | |
| WO2013048538(A1) | 2013-04-01 | Applicant | |
| WO2013056104(A1) | 2013-04-01 | Applicant | |
| WO2013115990(A2) | 2013-08-01 | Applicant | |
| WO2013119914(A1) | 2013-08-01 | Applicant | |
| WO2013179271(A2) | 2013-12-01 | Applicant |
Non-Patent Literature (26)
- Paquin, U-Prove Cryptographic Specification V1.1 Revision 3, Microsoft Corporation, pp. 4-22 (Year: 2013).Examiner
- Paquin et al., U-Prove Cryptographic Specification V1.1, Revision 3, Microsoft Corporation, pp. 4-22, Nov. 2013 (Year: 2013).Examiner
- Petition for Inter Partes Review of U.S. Pat. No. 8,533,860 Challenging Claims 1-30 Under 35 U.S.C. § 312 and 37 C.F.R. § 42.104, filed Feb. 17, 2016, Before the USPTO Patent Trial and Appeal Board, IPR 2016-00600, 65 pages.Applicant
- Wang, U.S. Appl. No. 62/000,288 (unpublished), Payment System Canonical Address Format filed May 19, 2014.Applicant
- Sharma et al., U.S. Appl. No. 62/003,717 (unpublished), Mobile Merchant Application filed May 28, 2014.Applicant
- Kalgi et al., U.S. Appl. No. 62/024,426, (unpublished) Secure Transactions Using Mobile Devices filed Jul. 14, 2014.Applicant
- Prakash et al., U.S. Appl. No. 62/037,033 (unpublished), Sharing Payment Token filed Aug. 13, 2014.Applicant
- Hoverson et al., U.S. Appl. No. 62/038,174 (unpublished), Customized Payment Gateway filed Aug. 15, 2014.Applicant
- Wang, U.S. Appl. No. 62/042,050 (unpublished), Payment Device Authentication and Authorization System filed Aug. 26, 2014.Applicant
- Gaddam et al., U.S. Appl. No. 62/053,736 (unpublished), Completing Transactions Without a User Payment Device filed Sep. 22, 2014.Applicant
- Patterson, U.S. Appl. No. 62/054,346 (unpublished), Mirrored Token Vault filed Sep. 23, 2014.Applicant
- Stubbs et al., U.S. Appl. No. 62/103,522 (unpublished), Methods and Systems for Wallet Provider Provisioning filed Jan. 14, 2015.Applicant
- Flurscheim et al., U.S. Appl. No. 62/108,403 (unpublished), Wearables With NFC HCE filed Jan. 27, 2015.Applicant
- Kinagi, U.S. Appl. No. 62/117,291 (unpublished), Token and Cryptogram Using Transaction Specific Information filed Feb. 17, 2015.Applicant
- Galland et al. U.S. Appl. No. 62/128,709 (unpublished), Tokenizing Transaction Amounts filed Mar. 5, 2015.Applicant
- Rangarajan et al., U.S. Appl. No. 61/751,763 (unpublished), Payments Bridge filed Jan. 11, 2013.Applicant
- 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.Applicant
- Aissi et al., U.S. Appl. No. 61/738,832 (unpublished), Management of Sensitive Data filed Dec. 18, 2012.Applicant
- Powell, U.S. Appl. No. 61/892,407 (unpublished), Issuer Over-The-Air Update Method and System filed Oct. 17, 2013.Applicant
- 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.Applicant
- Kaja, et al., U.S. Appl. No. 15/585,077 (Unpublished), System and Method Using Interaction Token, filed May 2, 2017.Applicant
- Hammad, U.S. Appl. No. 15/977,921 (Unpublished), Integration of Verification Tokens with Mobile Communication Devices, filed May 11, 2018.Applicant
- Lopez, et al., U.S. Appl. No. 16/020,796 (Unpublished), Embedding Cloud-Based Functionalities in a Communication Device, filed Jun. 27, 2018.Applicant
- International Search Report and Written Opinion, dated Apr. 17, 2017, in PCT Application No. PCT/US2016/042,991, 14 pages.Applicant
- EP16909662.5 , “Extended European Search Report”, dated Jul. 9, 2019, 8 pages.Applicant
- PCT/US2016/042991 , “International Preliminary Report on Patentability”, dated Jan. 31, 2019, 8 pages.Applicant