System and method using interaction token

Information

  • Patent Grant
  • 11449862
  • Patent Number
    11,449,862
  • Date Filed
    Wednesday, December 16, 2020
    3 years ago
  • Date Issued
    Tuesday, September 20, 2022
    a year ago
Abstract
A communication device may receive input from a user and initiate generation of an interaction token in response. This interaction token can be used by the communication device in order search for a specific resource provider computer from among one or more resource provider computers, and to initiate a resource transfer between the user and a specific resource provider, mediated by a token provider computer.
Description
BACKGROUND

Interaction tokens are used by the payments industry to reduce fraud risk. For example, an interaction token can be a substitute for a primary account number (PAN). If the interaction token is stolen by an unauthorized person, then the underlying PAN is still safe and does not have to be replaced. Because they reduce fraud, interaction tokens improve user and merchant confidence in the security of payment systems.


Despite their strengths, interaction tokens still present fraud risks. Just as a fraudster can improperly obtain a PAN and use it to make illegitimate purchases, so too could a fraudster illegally acquire an interaction token and use it to make illegitimate purchases. As such, there is a need for additional security and fraud risk reduction.


Embodiments of the invention address these and other problems individually and collectively.


SUMMARY

Embodiments of the invention are directed to methods and systems for provisioning interaction tokens and initiating resource transfers.


One embodiment of the invention is directed to a method. The method comprises receiving, by a communication device operated by a user, user input data comprising a resource identifier for a resource, a time period to acquire the resource, and an interaction value; initiating, by the communication device, generation of an interaction token based at least upon the user input data; initiating, by the communication device, a search from among one or more resource provider computers for the resource over the time period, wherein the search selects a specific resource provider associated with a specific resource provider computer from among the one or more resource provider computers, the specific resource provider providing the resource at a specific value; determining whether the specific value is less than or equal to the interaction value; and initiating transmitting, by the communication device, the interaction token and a resource provider identifier for the specific resource provider computer to a token provider computer, wherein the token provider computer processes the transaction using the interaction token.


Another embodiment of the invention is directed to the communication device configured or programmed to perform the above-noted method.


Another embodiment of the invention is directed to a method. The method comprises receiving, by a token provider computer from a communication device, an interaction token request message comprising user input data comprising a resource identifier for a resource, a time period to acquire the resource, and an interaction value; analyzing the user input data; determining, by the token provider computer, an interaction token based on the user input data; and transmitting, by the token provider computer, the interaction token to the communication device.


Further details regarding embodiments of the invention can be found in the Detailed Description and the Figures.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 shows a block diagram of a system according to an embodiment of the invention.



FIG. 2 shows a block diagram of a communication device according to an embodiment of the invention.



FIG. 3 shows a block diagram of a token provider computer according to an embodiment of the invention.



FIG. 4 shows a block diagram of an authorizing entity computer according to an embodiment of the invention.



FIGS. 5A and 5B show a process flow diagram detailing how devices in a communication network may interact in order to enact a token provider mediated resource transfer according to embodiments of the invention.





DETAILED DESCRIPTION

In embodiments of the invention, a token provider computer may, in response to a message from a communication device operated by a user, generate an interaction token that has constraints associated with user input data in the message. The message may indicate that the requested interaction token is for the acquisition of some specific resource, is active or useful over a defined time period, and has a certain value. The token provider further may encrypt and transmit the interaction token to the user communication device. The interaction token may be subsequently used to conduct a transaction for the specific resource.


Prior to discussing specific embodiments of the invention, some terms may be described in detail.


A “user” can be a person or thing that employs some other thing for some purpose. A user may include an individual that may be associated with one or more personal accounts and/or mobile devices. The user may also be referred to as a cardholder, account holder, or consumer in some embodiments.


An “interaction” can be a reciprocal action, effect, or influence. An interaction, for example, could be an exchange or transaction between two or more parties.


A “value” can be some quantity that may be represented with numbers. An example of a value is a quantity such as a quantity of money.


An “interaction value” can be a quantity associated with an interaction. In some embodiments, an interaction value may be determined by a user, and may correspond to a preferred or maximum amount which the user is willing to expend to obtain a particular resource.


A “value reduction element” is something which serves to indicate a reduction in a particular value associated with a resource to be acquired. Examples of value reduction elements may include points, coupons, discounts, etc.


A “resource” is something that may be used by an entity or transferred between entities. Examples of resources include goods, services, information, and/or access to a restricted location.


A “resource identifier” may include an identifier for a particular resource. Examples of resource identifiers may include codes that identify resources, descriptions of resources, or any other data that identifies a resource.


An “interaction token” may be a substitute for a real credential. The interaction token can be used in an interaction between two entities. In some embodiments, an interaction token may be a substitute for a payment account number, such as a primary account number (PAN). For example, an interaction token may include a series of alphanumeric characters that may be used as a substitute for an original account identifier. For example, an interaction token “4900 0000 0000 0001” may be used in place of a PAN “4147 0900 0000 1234.” In some embodiments, an interaction 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).


“Tokenization” is a process by which data is replaced with substitute data. For example, a payment account identifier (e.g., a primary account number (PAN)) may be tokenized by replacing the primary account identifier with a substitute number (e.g., a token) that may be associated with the payment account identifier. Further, tokenization may be applied to any other information which may be replaced with a substitute value (i.e., a token).


A “token provider computer” can include a computer that that provides or services tokens. In some embodiments, a token provider computer can facilitate requesting, determining (e.g., generating) and/or issuing tokens, as well as maintaining an established mapping of tokens to credentials such as primary account numbers (PANs) in a repository (e.g., a token vault). In some embodiments, the token provider computer may establish a token assurance level for a given token to indicate the confidence level of the token to PAN binding. The token provider computer may include or be in communication with a token vault where the generated tokens are stored. The token provider computer may support token processing of payment transactions submitted using tokens by de-tokenizing the token to obtain the actual PAN.


A “token vault” may be an example of a token service and can include a repository that maintains established token mappings. It may be present in a token provider computer. According to various embodiments, the token vault may also maintain other attributes of the token requestor that may be determined at the time of registration. The attributes may be used by the token provider to apply domain restrictions or other controls during transaction processing. In some embodiments, the token vault may be a part of the token provider. Alternatively, the token vault may be a remote repository accessible to the token provider. Token vaults, due to the sensitive nature of the data mappings that are stored and managed in them, may be protected by strong underlying physical and logical security.


“Token exchange” or “de-tokenization” can include a process of restoring the data that was substituted during tokenization. For example, a token exchange may include replacing a payment token with a corresponding primary account number (PAN) that was associated with the payment token during tokenization of the PAN. Thus, the de-tokenization may refer to the process of redeeming a token for the associated PAN value based on a token-to-PAN mapping stored, for example, in a token vault. The ability to retrieve a PAN in exchange for the associated token may be restricted to specifically authorized entities, individuals, applications, or systems. Further, de-tokenization or token exchange may be applied to any other information. In some embodiments, token exchange may be achieved via a transactional message, such as an ISO message, an application programming interface (API), or another type of web interface (e.g., web request). Token exchange may also be achieved via a credential request message, whereby a requesting entity, which may be a token holder, makes a request to receive a PAN associated with a token.


A “communication device” may comprise any suitable device that can be used for communication. A communication device may provide remote or direct communication capabilities. Examples of remote communication capabilities include using a mobile phone (wireless) network, wireless data network (e.g., 3G, 4G or similar networks), Wi-Fi, Wi-Max, or any other communication medium that may provide access to a network such as the Internet or a private network. Examples of communication devices include desktop computers, videogame consoles, mobile phones (e.g., cellular phones), PDAs, tablet computers, net books, laptop computers, personal music players, hand-held specialized readers, etc. Further examples of communication devices include wearable devices, such as smart watches, fitness bands, ankle bracelets, rings, earrings, etc., as well as automobiles with remote or direct communication capabilities. A communication device may comprise any suitable hardware and software for performing such functions, and may also include multiple devices or components (e.g., when a device has remote access to a network by tethering to another device—i.e., using the other device as a modem—both devices taken together may be considered a single communication device).


A “resource provider” may be an entity that can provide resources. Examples of resource providers include merchants, governmental agencies, etc.


A “merchant” may typically be an entity that engages in transactions and can sell goods or services, or provide access to goods or services.


An “acquiring entity” is an entity which can come into possession of something. An acquiring entity may be a business entity (e.g., a commercial bank) that has a business relationship with a particular merchant or other entity. An acquiring entity may operate an acquiring entity computer, which may be generically referred to as a “transport computer.”


An “authorizing entity” is an entity which can authorize or approve interactions. An authorizing entity may typically refer to a business entity (e.g., a bank) that maintains an account for a user and is capable of authorizing interactions such as payment transactions, for example the purchase of goods or services.


An “authorization request message” may be an electronic message that requests authorization for a transaction. In some embodiments, it is sent to a transaction processing computer and/or an issuer of a payment card to request authorization for a transaction. An authorization request message according to some embodiments may comply with ISO 8583, which is a standard for systems that exchange electronic transaction information associated with a payment made by a user using a payment device or payment account. The authorization request message may include an issuer account identifier that may be associated with a payment device or payment account. An authorization request message may also comprise additional data elements corresponding to “identification information” including, by way of example only: a service code, a CVV (card verification value), a dCW (dynamic card verification value), a PAN (primary account number or “account number”), a payment token, a user name, an expiration date, etc. An authorization request message may also comprise “transaction information,” such as any information associated with a current transaction, such as the transaction amount, merchant identifier, merchant location, acquirer bank identification number (BIN), card acceptor ID, information identifying items being purchased, etc., as well as any other information that may be utilized in determining whether to identify and/or authorize a transaction.


An “authorization response message” may be a message that responds to an authorization request. In some cases, it may be an electronic message reply to an authorization request message generated by an issuing financial institution or a transaction processing computer. The authorization response message may include, by way of example only, one or more of the following status indicators: Approval—transaction was approved; Decline—transaction was not approved; or Call Center—response pending more information, merchant must call the toll-free authorization phone number. The authorization response message may also include an authorization code, which may be a code that a credit card issuing bank returns in response to an authorization request message in an electronic message (either directly or through the transaction processing computer) to the merchant's access device (e.g., POS equipment) that indicates approval of the transaction. The code may serve as proof of authorization.


A “server computer” may include a powerful computer or cluster of computers. For example, the server computer can be a large mainframe, a minicomputer cluster, or a group of servers functioning as a unit. In one example, the server computer may be a database server coupled to a Web server. The server computer may comprise one or more computational apparatuses and may use any of a variety of computing structures, arrangements, and compilations for servicing the requests from one or more client computers.


A “memory” may be any suitable device or devices that can store electronic data. A suitable memory may comprise a non-transitory computer readable medium that stores instructions that can be executed by a processor to implement a desired method. Examples of memories may comprise one or more memory chips, disk drives, etc. Such memories may operate using any suitable electrical, optical, and/or magnetic mode of operation.


A “processor” may refer to any suitable data computation device or devices. A processor may comprise one or more microprocessors working together to accomplish a desired function. The processor may include a CPU that comprises at least one high-speed data processor adequate to execute program components for executing user and/or system-generated requests. The CPU may be a microprocessor such as AMD's Athlon, Duron and/or Opteron; IBM and/or Motorola's PowerPC; IBM's and Sony's Cell processor; Intel's Celeron, Itanium, Pentium, Xeon, and/or XScale; and/or the like processor(s).



FIG. 1 shows a system 100 comprising a number of components. The system 100 comprises a communication device 104 operated by a user 102 as well as a token provider computer 106, an authorizing entity computer 108, a transport computer 110, a content provider computer 112, and one or more resource provider computers 114. All of these entities, providers, and devices may be in operative communication with each other over a communications network 116.


This communications network can take the form of any suitable communication network, which may be any one and/or the combination of the following: a direct interconnection; the Internet; a Local Area Network (LAN); a Metropolitan Area Network (MAN); an Operating Missions as Nodes on the Internet (OMNI); a secured custom connection; a Wide Area Network (WAN); a wireless network (e.g., employing protocols such as, but not limited to a Wireless Application Protocol (WAP), I-mode, and/or the like); and/or the like.


Messages between the entities, providers, networks, and devices may be transmitted using a secure communications protocols such as, but not limited to, File Transfer Protocol (FTP); HyperText Transfer Protocol (HTTP); Secure Hypertext Transfer Protocol (HTTPS), Secure Socket Layer (SSL), ISO (e.g., ISO 8583) and/or the like.



FIG. 2 shows an example of a communication device 104 according to some embodiments of the invention. Communication device 104 may include circuitry that is used to enable certain device functions, such as telephony. The functional elements responsible for enabling those functions may include a processor 104A that can execute instructions that implement the functions and operations of the device. Processor 104A may access data storage 104E (or another suitable memory region or element) to retrieve instructions or data used in executing the instructions, such as provisioning scripts and mobile applications. Data input/output elements 104C, such as a keyboard or touchscreen, may be used to enable a user to operate the communication device 104 and input data (e.g., user input data). Data input/output elements may also be configured to output data (via a speaker, for example). Display 104B may also be used to output data to a user. Communications element 104D may be used to enable data transfer between communication device 104 and a wired or wireless network (via antenna 104H, for example), enable data transfer functions, and may be used to assist in connectivity to the Internet or another network. Communication device 104 may also include contactless element interface 104F to enable data transfer between contactless element 104G and other elements of the device, where contactless element 104G may include a secure memory and a near field communications data transfer element (or another form of short range communications technology). As noted, a cellular phone or similar device is an example of a communication device 104 that may be used in accordance with embodiments of the present invention.


The data storage 140E may comprise a computer readable medium comprising code, executable by the processor 104A to implement a method comprising: initiating generation of an interaction token based at least upon the user input data; initiating a search from among one or more resource provider computers for the resource over the time period, wherein the search selects a specific resource provider associated with a specific resource provider computer from among the one or more resource provider computers, the specific resource provider providing the resource at a specific value; determining whether the specific value is less than or equal to the interaction value; and initiating transmitting the interaction token and a resource provider identifier for the specific resource provider computer to a token provider computer, wherein the token provider computer processes the transaction using the interaction token.



FIG. 3 shows a block diagram showing basic components that may reside in an exemplary token provider computer 106. The token provider computer 106 may form part of a payment processing network in some embodiments of the invention. The token provider computer 106 comprises a processor 106A, a network interface 106B, an interaction token database 106C, and a computer readable medium 106D.


The computer readable medium 106D may comprise an interaction token generation module 106E, an interaction token association module 106F, a provisioning module 106G, and a communication module 106H. It may also comprise code, executable by the processor 106A for implementing a method comprising: receiving, by a token provider computer from a communication device, an interaction token request message comprising user input data comprising a resource identifier for a resource, a time period to acquire the resource, and an interaction value; analyzing the user input data; determining, by the token provider computer, an interaction token based on the user input data; and transmitting, by the token provider computer, the interaction token to the communication device.


The interaction token generation module 106E may comprise code that causes the processor 106A to generate an interaction token. In some embodiments, the interaction token may include 16 digits and may resemble a PAN.


The interaction token association module 106F may comprise code that causes the processor 106A to associate an interaction token with other user data (e.g., e-mail addresses, telephone numbers, primary account numbers, etc.). For example, the interaction token association module 106F may contain logic that causes the processor 106A to link a generated interaction token with received user input data, and to store the information in the interaction token database 106C.


The provisioning module 106G may comprise code that causes the processor 106A to provision interaction tokens. For example, the provisioning module 106G may contain logic that causes the processor 106A to generate provisioning scripts, and to provide the provisioning scripts, an interaction token, and any other suitable information to a communication device.


The communication module 106H may comprise code that causes the processor 106A to generates messages, reformat messages, and/or otherwise communicate with other entities. For example, the communication module 106H may contain logic that causes the processor 106A to identify an interaction token in a received authorization request message, reformat the authorization request message so that the interaction token is replaced with a user identifier, and forward the authorization request message to an authorization entity computer.


A block diagram of an authorizing entity computer 108, according to some embodiments of the invention, is shown in FIG. 4. The authorizing entity 108 comprises a processor 108A, a network interface 108B, an identifier database 108C, and a computer readable medium 108D.


The computer readable medium 108D may comprise a de-tokenization module 108E, a communication module 108F, an authorization module 108G, a risk analysis module 108H, an encryption module 108I, and any other suitable software modules.


The de-tokenization module 108E may comprise code that causes the processor 108A to de-tokenize interaction tokens. For example, the de-tokenization module 108E may contain logic that causes the processor 108A to identify real credentials associated with an interaction token, such as a PAN. In some embodiments, the de-tokenization module 108E may be able to query a token provider computer for real credentials associated with an interaction token.


The communication module 108F may comprise code that causes the processor 108A to generate messages, reformat messages, and/or otherwise communicate with other entities.


The authorization module 108G may comprise code that causes the processor 108A to perform authorization processing. For example, the authorization module 108G may contain logic that causes the processor 108A to approve or decline authorization request messages.


The risk analysis module 108H may comprise code that causes the processor 108A to analyze the risk of a transaction or the risk of providing an interaction token to a particular communication device. For example, the risk analysis module 108H may contain logic that causes the processor 108A to determine risk levels associated with de-tokenizing an interaction token, authorizing an interaction token, and/or authorizing an interaction.


The encryption module 108I may comprise code that causes the processor 110A to encrypt data. For example, the encryption module 108I may contain logic that causes the processor 108A to encrypt a real credential (e.g., a PAN).


A method 800 according to embodiments of the invention can be described with respect to FIGS. 5A and 5B. Some elements in other Figures are also referred to. The steps shown in the method 800 may be performed sequentially or in any suitable order in embodiments of the invention. In some embodiments, one or more of the steps may be optional.


The various messages in FIGS. 5A and 5B may use any suitable form of communication. In some embodiments, a request or response may be in an electronic message format, such as an e-mail, a short messaging service (SMS) message, a multimedia messaging service (MMS) message, a hypertext transfer protocol (HTTP) request message, a transmission control protocol (TCP) packet, and a web form submission. The request or response may be directed to any suitable location, such as an e-mail address, a telephone number, an internet protocol (IP) address, or a uniform resource locator (URL). In some embodiments, a request or response may comprise a mix of different message types, such as both email and SMS messages.


At step S1, the user 102 may input user input data into a communication device 104. The user input data may include one or more of the following: a user identifier, a resource identifier, an interaction value, an interaction value threshold, a time period in which to acquire that resource, and/or a list of resource providers. For example, a user 102 may input a phone number such as “451-999-9999” and/or an account identifier (e.g., a credit card number) as one or more user identifiers, a “wireless speaker” as a resource identifier, an amount of money, such as “$100.00,” that the user 102 is willing to pay for the resource as an interaction value, an amount of money such as “$10.00” as an interaction value threshold, a time period such as “7 days,” and a list of merchants such as “Best Buy™, Fry's Electronics™, and Walmart™” as the list of potential resource providers.


The interaction value may indicate the preferred value the user 102 associates with the selected resource. The interaction value threshold may indicate any additional value, which the user may be willing to provide for the resource. Illustratively, a user 102 may input a resource identifier such as “wireless speaker,” an interaction value of “$100.00” and an interaction value threshold of “$10.00” into the communication device 104. This may indicate that the user 102 is willing to pay $100.00 for a wireless speaker, and under certain circumstances, may be willing to pay up to $110.00 (the sum of the interaction value and threshold) for the wireless speaker. By implication, the user 102 is unwilling to pay more than $110.00 for the wireless speaker.


At step S2, the communication device 104 may transmit a request for an interaction token and the user information (e.g., an e-mail address) to a token provider computer 106. The request will initiate the interaction token generation process. This request may include the user input data from step S1.


In some embodiments, at step S3, after receiving and analyzing the request and user input data from the communication device 104, the token provider computer 106 may transmit a token approval request message to an authorizing entity computer 108. The authorizing entity computer 108 may hold a real account with funds that can be held by the user 102, and that may be used to fund the interaction token. The token approval request message could include the user input data, including a real credential (e.g., a PAN) transmitted in step S2. In other embodiments, an alias for the real credential is sent instead of the real credential. The alias for the real credential may be used to identify the real credential, which may be stored at the authorizing entity computer 108.


At step S4, after receiving the token approval request message, the authorizing entity computer 108 may review the user input data in the token approval request message. This may involve the authorizing entity computer 108 evaluating the token approval request message using its processor 108A, its identifier database 108C, and the modules stored on its computer readable medium 108D. More specifically, the authorizing entity computer 108 may compare the one or more user identifiers (e.g., a real credential such as a PAN, a phone number, etc.) received in the token approval request message to user identifiers stored in the identifier database 108C to determine if the received one or more user identifiers matches an existing record in the identifier database 108C. The authorizing entity computer 108 may further analyze the user input data using its risk analysis module 108H. For example, the identified resource and interaction value in the token approval request message may be compared to data from the user's previous purchases. If the interaction value is uncharacteristically high relative to the user's past purchases, or if the resource is an uncharacteristic purchase for the user 102, then the authorizing entity computer 108 may flag the interaction as suspicious, and may then decline the token approval request message.


In addition, the authorizing entity computer 108 may determine if the authorizing entity computer 108 has sufficient funds to fund the requested interaction token. If the user input data includes an account number such as a credit or debit card account number, the authorizing entity computer 108 may determine if the user's account has sufficient funds or credit to fund the obligation for the interaction token. If there are sufficient funds or credit in the user's account, then a hold may be placed on the user's account for the value of the interaction token, plus any additional threshold amount.


Step S4 may further involve the authorizing entity computer 108 searching the identifier database 108C for any value reduction elements associated with the user identifier. These value reduction elements could correspond to rewards, coupons, or loyalty points associated with the user's account. Information regarding any such value reduction elements may then be transmitted from the authorizing entity computer 108 to the token provider computer 106. If the value reduction elements are points offered by the authorizing entity computer 108, the value of the interaction token could be raised by the token provider computer 108, since any transaction conducted could use those points as currency. For example, a value reduction element such as loyalty points with value totaling $10.00 could be used to increase the value of an interaction token from $100.00 to $110.00


At step S5, after the authorizing entity computer 108 analyzes the user input data, the authorizing entity computer 108 may transmit the token approval response message to the token provider computer 106. After receiving the token approval response message, the token provider computer 106 may generate an interaction token if the authorizing entity computer 108 approves.


The authorizing entity computer 108 may place a hold on the user's account for the value of the interaction token approved by the authorizing entity computer 108. For example, if the account of the user has a $1000 credit availability, then the credit availability may be decreased by $100 to $900 to account for the value of the interaction token that was approved by the authorizing entity computer 108.


At step S6, the token provider computer 106, having received the token approval response message, can encrypt the generated interaction token before transmitting it to the communication device 104. The encryption key that is used to encrypted the interaction token may be a symmetric key shared with the communication device 104, or a public key of a public-private key pair, where the communication device 104 holds the public key. In some embodiments, the symmetric key may be derived from information associated with the user 102 (e.g., account information associated with the user). In this case, the actual symmetric keys need not be transported between the communication device 104 and the token provider computer 106, but may be independently derived by these devices.


At step S7, the token provider computer 106 may transmit the encrypted interaction token to the communication device 104. Then, at step S8, the communication device 104 may store the interaction token in its memory 104E or its secure memory element 104G.


At step S9, the communication device 104 may transmit a request for further value reduction elements to the content provider computer 112, or any other content provider computers. This request may include some of the user input data, such as the identification of the resource to be acquired and the user provided list of resource providers, as well as the predetermined list of resource providers. Examples of content providers that might operate the content provider computer 112 may include coupon aggregators such as Groupon™, merchants such as Walmart™, and/or product manufacturers such as Lenovo™. These additional value reduction elements may be used to reduce the price of the resource to be obtained. The may be submitted to the resource provider computer 114 in a transaction request message, and the resource provider computer 114 may apply the value reduction to the purchase price of the resource.


At step S10, the content provider computer 112 may search through the content database 112C for value reduction elements based on the request for value reduction elements. This search may involve querying the content database 112C using a relational or SQL-style query, or any other query method which may provide data which meets a certain set of characteristics or conditions. Such value reduction elements may take the form of coupon codes, discounts, or temporary price changes such as sales.


At step S11, the content provider computer 112 may transmit an indication of any additional value reduction elements to the communication device 104. This indication may include any sort of code or identifier which is associated with the additional value reduction elements, or a message indicating an assurance that value reduction elements exist. For example, a resource provider, such as an online merchant, may have a coupon code such as “1094014.” The content provider 112 may transmit this code and a merchant or resource identifier to the communication device 104. In some cases, there may be a value reduction element that will be passively applied to the resource transfer. As an example, a merchant may have a 25% off sale. In this case, the content provider 112 may transmit a message to the communication device 104 which indicates that a value reduction element of 25% exists.


At step S12, the communication device 104 may store value reduction elements that it may have received in step S11 in a memory element in the communication device 104. As an example, if the user 102 obtained a value reduction element such as a coupon for “$10.00” off of the resource to be acquired, then the processor 104A may store the coupon in memory such that it may be applied later when the purchasing decision has been made by the communication device 104.


At step S13, the communication device 104 may search for a specific resource provider from among the resource providers operating the resource provider computers 114 to obtain the desired resource. For example, the communication device 104 may perform a Web search using a search engine in order to determine the specific resource provider. The communication device 104 may also, over the communication network 116, directly communicate with the resource providers 114 and query them for information appropriate to the search.


As an example, consider a resource such as a “wireless speaker,” an interaction value of “$100.00,” and an interaction value threshold of “$10.00.” The search of step S13 may involve the communication device 104 searching using a search engine, or by directly querying each merchant from among a list of merchants for a “wireless speaker” which costs less than “$110.00” (the sum of the interaction value and interaction value threshold), and which ideally costs less than “$100.00” (the interaction value). The merchants may respond by transmitting the price (a specific value) at which they are willing to provide the resource to the user 102.


At step S14 the communication device 104 may evaluate the results of the search in order to determine a specific resource provider from among the resource providers operating the resource provider computers 114. This may involve the communication device 104 performing a logical operation, using the processor 104A, which selects a specific resource provider based on the interaction value, interaction value threshold, and the results of the search.


In some embodiments, the communication device 104 may first compare each of the specific values produced by the search of step S13 in order to find the lowest value among the specific values. The communication device 104 may then determine if the specific value is less than the interaction value, or if not, if the specific value is less than the sum of the interaction value and the interaction value threshold. The communication device 104 may also take into account other factors such as delivery time when deciding on which resource provider to select.


The communication device 104 may proceed differently depending on the results of the evaluation of step S14. For example, if the communication device 104 determines that the lowest specific value resource provider is willing to provide the resource at a specific value less than the interaction value, then the communication device 104 may conclude that it is appropriate to initiate a resource transfer between the user 102 and the specific resource provider. If the communication device 104 determines that lowest specific value resource provider is willing to provide the resource at a specific value less than the sum of the interaction value and the interaction value threshold, but greater than the interaction value itself, the communication device 104 may conclude that it is appropriate to seek approval for the resource transfer from the user 102. If the communication device 104 determines that the lowest specific value resource provider is unwilling to provide the resource at a specific value less than the sum of the interaction value and the interaction value threshold, then the communication device 104 may conclude that it is not possible at this time to proceed with a resource transfer.


If the communication device 104 determines that it is not possible to proceed with a resource transfer, it may evaluate the time limit input by the user 102. This evaluation might involve using the communication device processor 104A to determine the difference between the current time and the time when the user input was received (the “elapsed time”). This difference may be compared to the time limit provided with the user input. If the elapsed time exceeds the time limit, the communication device 104 may determine that the interaction token has exceeded its lifespan and can no longer be used to purchase the desired resource. If this is the case, the communication device 104 may not need to proceed with steps S15-S31. If the communication device 104 determines that the elapsed time does not exceed the time limit, it may repeat the search process of step S13 and the evaluation process of step S14 until the elapsed time exceeds the time limit specified by the user.


At step S15, the communication device 104 make a request to the user 102 based on the results of the evaluation performed at step S14. If the search and evaluation resulted in selecting a resource provider willing to provide the resource at a value less than the interaction value, the message may simply indicate to the user 102 that a resource transfer, using the interaction token, is being conducted with the identified resource provider on their behalf at a specific price. This message may be displayed to the user 102 as text or images on the communication device display 104B, or communicated to the user 102 via another appropriate method.


If the communication device 104 determined that the specific resource provider is willing to provide the resource for a specific value greater than the interaction value, but less than the sum of the interaction value and the threshold value, then the communication device 104 may request that the user 102 approve of the resource transfer.


At step S16, the user 102 may input a reply to the message into the communication device 104. As an example, if the communication device 104 transmitted a message requesting approval for the resource transfer, the user 102 may use the communication device data input/output 104C in order to indicate approval of the resource transfer. This could be accomplished using any appropriate user input device, such as buttons, a touch screen, or a keyboard.


At step S17 the communication device 104 may transmit a transaction request message, which includes the interaction token, to the specific resource provider computer 114. The transaction request message may also comprise any obtained value reduction elements that may be appropriately passed to the resource provider computer 114. The transaction request message may indicate to the specific resource provider associated with the resource provider computer 114 that the user 102 wishes to acquire the resource and wishes to provide the interaction token to pay for the resource. In some embodiments, the interaction token may be a 16 digit ISO 8583 compliant interaction token. As an illustration, the transaction request message may indicate that the user 102, a consumer, wishes to purchase a resource such as a wireless speaker, and is providing the interaction token as a payment credential. The transaction request message may also comprise a shipping address of the user 102, and any other pertinent information necessary to complete the transfer of the desired resource.


At step S18, after the resource provider computer 114 receives the transaction request message, the specific resource provider associated with the resource provider computer 114 may evaluate the message. In some embodiments, the resource provider computer 114 may generate an authorization request message comprising the interaction token and the amount of the resource to be acquired.


At step S19, the resource provider computer 114 may transmit the authorization request message to the transport computer 110. At step S20, the transport computer 110 may evaluate the message sent from the resource provider computer 114, and may route it to the token provider computer 106.


At step S21, the transport computer 110 may transmit the authorization request message to the token provider computer 106. At step S22, after the authorization request message is received by the token provider computer 106, the token provider computer 106 may de-tokenize the received interaction token in order to determine the real account credential (e.g., a PAN) 108 associated with the interaction token. This may involve querying the interaction token database 106C for data entries matching the provided interaction token. The token provider computer 106 may also check to see if the transaction that is being conducted is consistent with the constraints set for the interaction token. For instance, if the interaction token is authorized for a specific dollar limit, then the token provider computer 106 may compare the transaction amount in the authorization request message with the dollar limit used to generate the interaction token. If the transaction is not consistent with the interaction token constraints, the token provider computer 106 may decline the transaction and may communicate this to the transport computer 110 and the resource provider computer 114.


At step S23, if the interaction token satisfies the constraints for the interaction token, the token provider computer 106 may modify the authorization request message to include the real credential, rather than the interaction token. The modified authorization request message may then be sent to the authorizing entity computer 108.


At step S24, after receiving the modified authorization request message, the authorizing entity computer 108 may determine whether or not the transaction is authorized. It may, for example, check to see if the account balance or available credit limit of the account associated with the real credential is greater than the transaction amount in the authorization request message. It may also perform fraud checks and other transaction analyses.


At step S25 the authorizing entity computer 108 may generate and transmit an authorization response message to the token provider computer 106.


At step S26, after receiving the authorization response message from the authorizing entity computer, the token provider computer 106 may transmit the authorization response message to the transport computer 110. In some embodiments, the real credential in the authorization response message may be replaced with the interaction token by the token provider computer 106, before it is forwarded on to the transport computer 110.


At step S27, the transport computer 110 may determine which resource provider computer 114 is associated with the authorization response message. At step S28, the transport computer 110 may transmit the authorization response message to the resource provider computer 114.


At step S29, the specific resource provider associated with the resource provider computer 114 may initiate transfer of the resource to the user 102. For example, if the resource provider is an online merchant, and the resource is a good such as a wireless speaker, the merchant may begin the process of shipping the good to the user 102.


At a later point in time, a settlement and clearing process may occur between the authorizing entity computer 108, the transport computer 110, and an intermediate payment processing network. The payment processing network may operate or contain the token provider computer 106.


Embodiments of the invention have a number of advantages. As stated previously, conventional interaction token systems could be improved to be more secure, more economical, and more convenient to consumers.


Embodiments of the invention provide for interaction tokens that have a narrow token-domain. They have a defined resource to be acquired, value, and time limit. If a hacker, malicious user, or thief somehow illegally acquires an interaction token according to embodiments of the invention, they have a finite amount of time to purchase the good the user wishes to purchase, at the price set by the user, for the user. This is a considerable advantage over conventional token schemes, where tokens can be used as a direct substitute for a PAN and could be used for potentially any purchase.


Additionally, embodiments of the invention provide for additional convenience to users by initiating resource transfers automatically. With embodiments of the invention, a user does not need to actively search through dozens of resource providers to find the resource they need at a price they are willing to pay. They can simply input the resource, a time limit, and an interaction value into a communication device. The communication device can then automatically and continuously search for the resource and automatically initiate a resource transfer when it is found. This reduces the time and energy necessary to acquire resources.


A computer system will now be described that may be used to implement any of the entities or components described herein. Subsystems in the computer system are interconnected via a system bus. Additional subsystems include a printer, a keyboard, a fixed disk, and a monitor which can be coupled to a display adapter. Peripherals and input/output (I/O) devices, which can couple to an I/O controller, can be connected to the computer system by any number of means known in the art, such as a serial port. For example, a serial port or external interface can be used to connect the computer apparatus to a wide area network such as the Internet, a mouse input device, or a scanner. The interconnection via system bus allows the central processor to communicate with each subsystem and to control the execution of instructions from system memory or the fixed disk, as well as the exchange of information between subsystems. The system memory and/or the fixed disk may embody a computer-readable medium.


As described, the inventive service may involve implementing one or more functions, processes, operations or method steps. In some embodiments, the functions, processes, operations or method steps may be implemented as a result of the execution of a set of instructions or software code by a suitably-programmed computing device, microprocessor, data processor, or the like. The set of instructions or software code may be stored in a memory or other form of data storage element which is accessed by the computing device, microprocessor, etc. In other embodiments, the functions, processes, operations or method steps may be implemented by firmware or a dedicated processor, integrated circuit, etc.


Any of the software components or functions described in this application may be implemented as software code to be executed by a processor using any suitable computer language such as, for example, Java, C++ or Perl using, for example, conventional or object-oriented techniques. The software code may be stored as a series of instructions, or commands on a computer-readable medium, such as a random access memory (RAM), a read-only memory (ROM), a magnetic medium such as a hard-drive or a floppy disk, or an optical medium such as a CD-ROM. Any such computer-readable medium may reside on or within a single computational apparatus, and may be present on or within different computational apparatuses within a system or network.


While certain exemplary embodiments have been described in detail and shown in the accompanying drawings, it is to be understood that such embodiments are merely illustrative of and not intended to be restrictive of the broad invention, and that this invention is not to be limited to the specific arrangements and constructions shown and described, since various other modifications may occur to those with ordinary skill in the art.


As used herein, the use of “a”, “an” or “the” is intended to mean “at least one”, unless specifically indicated to the contrary.

Claims
  • 1. A method comprising: receiving, by a token provider computer from a communication device operated by a user, an interaction token request message comprising user input data comprising one or more user identifiers, a resource identifier for a resource, a time period to acquire the resource, and an interaction value;analyzing the user input data;generating, by the token provider computer and in response to receiving the interaction token request message, an interaction token based on: determining a user account associated with the user based on the one or more user identifiers of the user input data;transmitting, by the token provider computer, a token approval request message to an authorizing entity computer, the token approval request message including the user input data and the user account associated with the user, the authorizing entity computer configured to: initiate a placement of a hold for funds on the user account for the interaction value and a threshold value, the interaction token corresponding to the interaction value, the threshold value, and the time period to acquire the resource;identify value reduction elements that can be applied to the resource based on the one or more user identifiers of the user input data; andtransmit a token approval response message including the value reduction elements to the token provider computer;receiving, by the token provider computer and from the authorizing entity computer, the token approval response message; andtransmitting, by the token provider computer, the interaction token and the value reduction elements to the communication device.
  • 2. The method of claim 1, wherein the communication device is a mobile phone.
  • 3. The method of claim 1, wherein the interaction token is valid for a limited time.
  • 4. The method of claim 1, further comprising: encrypting the interaction token before transmitting the interaction token.
  • 5. The method of claim 1, further comprising associating, by the token provider computer, the interaction token with user data.
  • 6. A token provider computer comprising: a memory configured to store computer-executable instructions; anda processor in communication with the memory and configured to execute the computer-executable instructions to at least: receive, from a communication device operated by a user, an interaction token request message comprising user input data comprising one or more user identifiers, a resource identifier for a resource, a time period to acquire the resource, and an interaction value;analyze the user input data;generate, in response to receiving the interaction token request message, an interaction token based on: determining a user account associated with the user based on the one or more user identifiers of the user input data;transmitting a token approval request message to an authorizing entity computer, the token approval request message including the user input data and the user account associated with the user, the authorizing entity computer configured to: initiate a placement of a hold for funds on the user account for the interaction value and a threshold value, the interaction token corresponding to the interaction value, the threshold value, and the time period to acquire the resourceidentify value reduction elements that can be applied to the resource based on the one or more user identifiers of the user input data; andtransmit a token approval response message including the value reduction elements to the token provider computer;receive, from the authorizing entity computer, the token approval response message; andtransmit the interaction token and the value reduction elements to the communication device.
  • 7. The token provider computer of claim 6, wherein the communication device is a mobile phone.
  • 8. The token provider computer of claim 6, wherein the interaction token is valid for a limited time.
  • 9. The token provider computer of claim 6, wherein the processor is further configured to encrypt the interaction token before transmitting the interaction token.
  • 10. The token provider computer of claim 6, wherein the processor is further configured to associate the interaction token with user data.
  • 11. A non-transitory computer-readable storage medium storing computer-executable instructions that, when executed by a token provider computer, configure the token provider computer to perform operations comprising: receiving, from a communication device operated by a user, an interaction token request message comprising user input data comprising one or more user identifiers, a resource identifier for a resource, a time period to acquire the resource, and an interaction value;analyzing the user input data;generating, in response to receiving the interaction token request message, an interaction token based on: determining a user account associated with the user based on the one or more user identifiers of the user input data;transmitting a token approval request message to an authorizing entity computer, the token approval request message including the user input data and the user account associated with the user, the authorizing entity computer configured to: initiate a placement of a hold for funds on the user account for the interaction value and a threshold value, the interaction token corresponding to the interaction value, the threshold value, and the time period to acquire the resource;identify value reduction elements that can be applied to the resource based on the one or more user identifiers of the user input data; andtransmit a token approval response message including the value reduction elements to the token provider computer;receiving, by the token provider computer and from the authorizing entity computer, the token approval response message; andtransmitting the interaction token and the value reduction elements to the communication device.
  • 12. The non-transitory computer readable storage medium of claim 11, wherein the communication device is a mobile phone.
  • 13. The non-transitory computer readable storage medium of claim 11, wherein the interaction token is valid for a limited time.
  • 14. The non-transitory computer readable storage medium of claim 11, wherein the operations further comprise encrypting the interaction token before transmitting the interaction token.
CROSS REFERENCE TO RELATED APPLICATIONS

The present application is a Divisional of U.S. patent application Ser. No. 15/585,077, filed May 2, 2017, the contents of which is incorporated by reference in its entirety for all purposes.

US Referenced Citations (545)
Number Name Date Kind
5613012 Hoffman et al. Mar 1997 A
5781438 Lee et al. Jul 1998 A
5883810 Franklin et al. Mar 1999 A
5953710 Fleming Sep 1999 A
5956699 Wong et al. Sep 1999 A
6000832 Franklin et al. Dec 1999 A
6014635 Harris et al. Jan 2000 A
6044360 Picciallo Mar 2000 A
6163771 Walker et al. Dec 2000 A
6227447 Campisano May 2001 B1
6236981 Hill May 2001 B1
6267292 Walker et al. Jul 2001 B1
6341724 Campisano Jan 2002 B2
6385596 Wiser et al. May 2002 B1
6422462 Cohen Jul 2002 B1
6425523 Shem-Ur et al. Jul 2002 B1
6592044 Wong et al. Jul 2003 B1
6636833 Flitcroft et al. Oct 2003 B1
6748367 Lee Jun 2004 B1
6805287 Bishop et al. Oct 2004 B2
6879965 Fung et al. Apr 2005 B2
6891953 DeMello et al. May 2005 B1
6901387 Wells et al. May 2005 B2
6931382 Laage et al. Aug 2005 B2
6938019 Uzo Aug 2005 B1
6941285 Sarcanin Sep 2005 B2
6980670 Hoffman et al. Dec 2005 B1
6990470 Hogan et al. Jan 2006 B2
6991157 Bishop et al. Jan 2006 B2
7051929 Li May 2006 B2
7069249 Stolfo et al. Jun 2006 B2
7103576 Mann, III et al. Sep 2006 B2
7113930 Eccles et al. Sep 2006 B2
7136835 Flitcroft et al. Nov 2006 B1
7177835 Walker et al. Feb 2007 B1
7177848 Hogan et al. Feb 2007 B2
7194437 Britto et al. Mar 2007 B1
7209561 Shankar et al. Apr 2007 B1
7264154 Harris Sep 2007 B2
7287692 Patel et al. Oct 2007 B1
7292999 Hobson et al. Nov 2007 B2
7350230 Forrest Mar 2008 B2
7353382 Labrou et al. Apr 2008 B2
7379919 Hogan et al. May 2008 B2
RE40444 Linehan Jul 2008 E
7415443 Hobson et al. Aug 2008 B2
7444676 Asghari-Kamrani et al. Oct 2008 B1
7469151 Khan et al. Dec 2008 B2
7548889 Bhambri et al. Jun 2009 B2
7567934 Flitcroft et al. Jul 2009 B2
7567936 Peckover et al. Jul 2009 B1
7571139 Giordano et al. Aug 2009 B1
7571142 Flitcroft et al. Aug 2009 B1
7580898 Brown et al. Aug 2009 B2
7584153 Brown et al. Sep 2009 B2
7593896 Flitcroft et al. Sep 2009 B1
7606560 Labrou et al. Oct 2009 B2
7627531 Breck et al. Dec 2009 B2
7627895 Gifford et al. Dec 2009 B2
7650314 Saunders Jan 2010 B1
7685037 Reiners et al. Mar 2010 B2
7702578 Fung et al. Apr 2010 B2
7707120 Dominguez et al. Apr 2010 B2
7712655 Wong May 2010 B2
7734527 Uzo Jun 2010 B2
7753265 Harris Jul 2010 B2
7770789 Oder, II et al. Aug 2010 B2
7784685 Hopkins, III Aug 2010 B1
7793851 Mullen Sep 2010 B2
7801826 Labrou et al. Sep 2010 B2
7805376 Smith Sep 2010 B2
7805378 Berardi et al. Sep 2010 B2
7818264 Hammad Oct 2010 B2
7828220 Mullen Nov 2010 B2
7835960 Breck et al. Nov 2010 B2
7841523 Oder, II et al. Nov 2010 B2
7841539 Hewton Nov 2010 B2
7844550 Walker et al. Nov 2010 B2
7848980 Carlson Dec 2010 B2
7849020 Johnson Dec 2010 B2
7853529 Walker et al. Dec 2010 B1
7853995 Chow et al. Dec 2010 B2
7865414 Fung et al. Jan 2011 B2
7873579 Hobson et al. Jan 2011 B2
7873580 Hobson et al. Jan 2011 B2
7890393 Talbert et al. Feb 2011 B2
7891563 Oder, II et al. Feb 2011 B2
7896238 Fein et al. Mar 2011 B2
7908216 Davis et al. Mar 2011 B1
7922082 Muscato Apr 2011 B2
7931195 Mullen Apr 2011 B2
7937324 Patterson May 2011 B2
7938318 Fein et al. May 2011 B2
7954705 Mullen Jun 2011 B2
7959076 Hopkins, III Jun 2011 B1
7996288 Stolfo Aug 2011 B1
8025223 Saunders et al. Sep 2011 B2
8046256 Chien et al. Oct 2011 B2
8060448 Jones Nov 2011 B2
8060449 Zhu Nov 2011 B1
8074877 Mullen et al. Dec 2011 B2
8074879 Harris Dec 2011 B2
8082210 Hansen et al. Dec 2011 B2
8095113 Kean et al. Jan 2012 B2
8104679 Brown Jan 2012 B2
RE43157 Bishop et al. Feb 2012 E
8109436 Hopkins, III Feb 2012 B1
8121942 Carlson et al. Feb 2012 B2
8121956 Carlson et al. Feb 2012 B2
8126449 Beenau et al. Feb 2012 B2
8132723 Hogg et al. Mar 2012 B2
8171525 Pelly et al. May 2012 B1
8175973 Davis et al. May 2012 B2
8190523 Patterson May 2012 B2
8196813 Vadhri Jun 2012 B2
8205791 Randazza et al. Jun 2012 B2
8219489 Patterson Jul 2012 B2
8224702 Mengerink et al. Jul 2012 B2
8225385 Chow et al. Jul 2012 B2
8229852 Carlson Jul 2012 B2
8265993 Chien et al. Sep 2012 B2
8280777 Mengerink et al. Oct 2012 B2
8281991 Wentker et al. Oct 2012 B2
8328095 Oder, II et al. Dec 2012 B2
8336088 Raj et al. Dec 2012 B2
8346666 Lindelsee et al. Jan 2013 B2
8376225 Hopkins, III Feb 2013 B1
8380177 Laracey Feb 2013 B2
8387873 Saunders et al. Mar 2013 B2
8401539 Beenau et al. Mar 2013 B2
8401898 Chien et al. Mar 2013 B2
8402555 Grecia Mar 2013 B2
8403211 Brooks et al. Mar 2013 B2
8412623 Moon et al. Apr 2013 B2
8412837 Emigh et al. Apr 2013 B1
8417642 Oren Apr 2013 B2
8433116 Butler et al. Apr 2013 B2
8447699 Batada et al. May 2013 B2
8453223 Svigals et al. May 2013 B2
8453925 Fisher et al. Jun 2013 B2
8458487 Palgon et al. Jun 2013 B1
8484134 Hobson et al. Jul 2013 B2
8485437 Mullen et al. Jul 2013 B2
8494959 Hathaway et al. Jul 2013 B2
8498908 Mengerink et al. Jul 2013 B2
8504475 Brand et al. Aug 2013 B2
8504478 Saunders et al. Aug 2013 B2
8510816 Quach et al. Aug 2013 B2
8533860 Grecia Sep 2013 B1
8538845 Liberty Sep 2013 B2
8555079 Shablygin et al. Oct 2013 B2
8566168 Bierbaum et al. Oct 2013 B1
8567670 Stanfield et al. Oct 2013 B2
8571939 Lindsey et al. Oct 2013 B2
8577336 Mechaley, Jr. Nov 2013 B2
8577803 Chatterjee et al. Nov 2013 B2
8577813 Weiss Nov 2013 B2
8578176 Mattsson Nov 2013 B2
8583494 Fisher Nov 2013 B2
8584251 McGuire et al. Nov 2013 B2
8589237 Fisher Nov 2013 B2
8589271 Evans Nov 2013 B2
8589291 Carlson et al. Nov 2013 B2
8595098 Starai et al. Nov 2013 B2
8595812 Bomar et al. Nov 2013 B2
8595850 Spies et al. Nov 2013 B2
8606638 Dragt Dec 2013 B2
8606700 Carlson et al. Dec 2013 B2
8606720 Baker et al. Dec 2013 B1
8615468 Varadarajan Dec 2013 B2
8620754 Fisher Dec 2013 B2
8635157 Smith et al. Jan 2014 B2
8646059 Von Behren et al. Feb 2014 B1
8651374 Brabson et al. Feb 2014 B2
8656180 Shablygin et al. Feb 2014 B2
8751391 Freund Jun 2014 B2
8762263 Gauthier et al. Jun 2014 B2
8793186 Patterson Jul 2014 B2
8838982 Carlson et al. Sep 2014 B2
8856539 Weiss Oct 2014 B2
8887308 Grecia Nov 2014 B2
9065643 Hurry et al. Jun 2015 B2
9070129 Sheets et al. Jun 2015 B2
9100826 Weiss Aug 2015 B2
9160741 Wentker et al. Oct 2015 B2
9229964 Stevelinck Jan 2016 B2
9245267 Singh Jan 2016 B2
9249241 Dai et al. Feb 2016 B2
9256871 Anderson et al. Feb 2016 B2
9280765 Hammad Mar 2016 B2
9530137 Weiss Dec 2016 B2
20010029485 Brody et al. Oct 2001 A1
20010034720 Armes Oct 2001 A1
20010054003 Chien et al. Dec 2001 A1
20020007320 Hogan et al. Jan 2002 A1
20020016749 Borecki et al. Feb 2002 A1
20020029193 Ranjan et al. Mar 2002 A1
20020035548 Hogan et al. Mar 2002 A1
20020073045 Rubin et al. Jun 2002 A1
20020116341 Hogan et al. Aug 2002 A1
20020133467 Hobson et al. Sep 2002 A1
20020147913 Lun Yip Oct 2002 A1
20030028481 Flitcroft et al. Feb 2003 A1
20030130955 Hawthorne Jul 2003 A1
20030191709 Elston et al. Oct 2003 A1
20030191945 Keech Oct 2003 A1
20040010462 Moon et al. Jan 2004 A1
20040050928 Bishop et al. Mar 2004 A1
20040059682 Hasumi et al. Mar 2004 A1
20040093281 Silverstein et al. May 2004 A1
20040139008 Mascavage, III Jul 2004 A1
20040143532 Lee Jul 2004 A1
20040158532 Breck et al. Aug 2004 A1
20040210449 Breck et al. Oct 2004 A1
20040210498 Freund Oct 2004 A1
20040232225 Bishop et al. Nov 2004 A1
20040260646 Berardi et al. Dec 2004 A1
20050037735 Coutts Feb 2005 A1
20050080730 Sorrentino Apr 2005 A1
20050108178 York May 2005 A1
20050199709 Linlor Sep 2005 A1
20050246293 Ong Nov 2005 A1
20050269401 Spitzer et al. Dec 2005 A1
20050269402 Spitzer et al. Dec 2005 A1
20060235795 Johnson et al. Oct 2006 A1
20060237528 Bishop et al. Oct 2006 A1
20060278704 Saunders et al. Dec 2006 A1
20070073593 Perry et al. Mar 2007 A1
20070107044 Yuen et al. May 2007 A1
20070129955 Dalmia et al. Jun 2007 A1
20070136193 Starr Jun 2007 A1
20070136211 Brown et al. Jun 2007 A1
20070170247 Friedman Jul 2007 A1
20070179885 Bird et al. Aug 2007 A1
20070208671 Brown et al. Sep 2007 A1
20070245414 Chan et al. Oct 2007 A1
20070288377 Shaked Dec 2007 A1
20070291995 Rivera Dec 2007 A1
20080015988 Brown et al. Jan 2008 A1
20080029607 Mullen Feb 2008 A1
20080035738 Mullen Feb 2008 A1
20080052226 Agarwal et al. Feb 2008 A1
20080054068 Mullen Mar 2008 A1
20080054079 Mullen Mar 2008 A1
20080054081 Mullen Mar 2008 A1
20080065554 Hogan et al. Mar 2008 A1
20080065555 Mullen Mar 2008 A1
20080201264 Brown et al. Aug 2008 A1
20080201265 Hewton Aug 2008 A1
20080228646 Myers et al. Sep 2008 A1
20080243702 Hart et al. Oct 2008 A1
20080245855 Fein et al. Oct 2008 A1
20080245861 Fein et al. Oct 2008 A1
20080283591 Oder, II et al. Nov 2008 A1
20080302869 Mullen Dec 2008 A1
20080302876 Mullen Dec 2008 A1
20080313264 Pestoni Dec 2008 A1
20090006262 Brown et al. Jan 2009 A1
20090010488 Matsuoka et al. Jan 2009 A1
20090037333 Flitcroft et al. Feb 2009 A1
20090037388 Cooper et al. Feb 2009 A1
20090043702 Bennett Feb 2009 A1
20090048971 Hathaway et al. Feb 2009 A1
20090106112 Dalmia et al. Apr 2009 A1
20090106160 Skowronek Apr 2009 A1
20090134217 Flitcroft et al. May 2009 A1
20090157555 Biffle et al. Jun 2009 A1
20090159673 Mullen et al. Jun 2009 A1
20090159700 Mullen et al. Jun 2009 A1
20090159707 Mullen et al. Jun 2009 A1
20090173782 Muscato Jul 2009 A1
20090198617 Soghoian et al. Aug 2009 A1
20090200371 Kean et al. Aug 2009 A1
20090248583 Chhabra Oct 2009 A1
20090276347 Kargman Nov 2009 A1
20090281948 Carlson Nov 2009 A1
20090294527 Brabson et al. Dec 2009 A1
20090307139 Mardikar et al. Dec 2009 A1
20090308921 Mullen Dec 2009 A1
20090327131 Beenau et al. Dec 2009 A1
20100008535 Abulafia et al. Jan 2010 A1
20100088237 Wankmueller Apr 2010 A1
20100094755 Kloster Apr 2010 A1
20100106644 Annan et al. Apr 2010 A1
20100120408 Beenau et al. May 2010 A1
20100133334 Vadhri Jun 2010 A1
20100138347 Chen Jun 2010 A1
20100145860 Pelegero Jun 2010 A1
20100161433 White Jun 2010 A1
20100185545 Royyuru et al. Jul 2010 A1
20100211505 Saunders et al. Aug 2010 A1
20100223186 Hogan et al. Sep 2010 A1
20100228668 Hogan et al. Sep 2010 A1
20100235284 Moore Sep 2010 A1
20100258620 Torreyson et al. Oct 2010 A1
20100276484 Banerjee Nov 2010 A1
20100291904 Musfeldt et al. Nov 2010 A1
20100299267 Faith et al. Nov 2010 A1
20100306076 Taveau et al. Dec 2010 A1
20100325041 Berardi et al. Dec 2010 A1
20110010292 Giordano et al. Jan 2011 A1
20110016047 Wu et al. Jan 2011 A1
20110016320 Bergsten et al. Jan 2011 A1
20110040640 Erikson Feb 2011 A1
20110047076 Carlson et al. Feb 2011 A1
20110083018 Kesanupalli et al. Apr 2011 A1
20110087596 Dorsey Apr 2011 A1
20110093397 Carlson et al. Apr 2011 A1
20110125597 Oder, II et al. May 2011 A1
20110153437 Archer et al. Jun 2011 A1
20110153498 Makhotin et al. Jun 2011 A1
20110154466 Harper et al. Jun 2011 A1
20110161233 Tieken Jun 2011 A1
20110178926 Lindelsee et al. Jul 2011 A1
20110191244 Dai Aug 2011 A1
20110238511 Park et al. Sep 2011 A1
20110238573 Varadarajan Sep 2011 A1
20110246317 Coppinger Oct 2011 A1
20110258111 Raj et al. Oct 2011 A1
20110272471 Mullen Nov 2011 A1
20110272478 Mullen Nov 2011 A1
20110276380 Mullen et al. Nov 2011 A1
20110276381 Mullen et al. Nov 2011 A1
20110276424 Mullen Nov 2011 A1
20110276425 Mullen Nov 2011 A1
20110295745 White et al. Dec 2011 A1
20110302081 Saunders et al. Dec 2011 A1
20120023567 Hammad Jan 2012 A1
20120028609 Hruska Feb 2012 A1
20120030047 Fuentes et al. Feb 2012 A1
20120035998 Chien et al. Feb 2012 A1
20120041881 Basu et al. Feb 2012 A1
20120047237 Arvidsson et al. Feb 2012 A1
20120066078 Kingston et al. Mar 2012 A1
20120072350 Goldthwaite et al. Mar 2012 A1
20120078735 Bauer et al. Mar 2012 A1
20120078798 Downing et al. Mar 2012 A1
20120078799 Jackson et al. Mar 2012 A1
20120095852 Bauer et al. Apr 2012 A1
20120095865 Doherty et al. Apr 2012 A1
20120116902 Cardina et al. May 2012 A1
20120123882 Carlson et al. May 2012 A1
20120123940 Killian et al. May 2012 A1
20120129514 Beenau et al. May 2012 A1
20120143767 Abadir Jun 2012 A1
20120143772 Abadir Jun 2012 A1
20120158580 Eram et al. Jun 2012 A1
20120158593 Garfinkle et al. Jun 2012 A1
20120173431 Ritchie et al. Jul 2012 A1
20120185386 Salama et al. Jul 2012 A1
20120197807 Schlesser et al. Aug 2012 A1
20120203664 Torossian et al. Aug 2012 A1
20120203666 Torossian et al. Aug 2012 A1
20120215688 Musser et al. Aug 2012 A1
20120215696 Salonen Aug 2012 A1
20120221421 Hammad Aug 2012 A1
20120226582 Hammad Sep 2012 A1
20120231844 Coppinger Sep 2012 A1
20120233004 Bercaw Sep 2012 A1
20120246070 Vadhri Sep 2012 A1
20120246071 Jain et al. Sep 2012 A1
20120246079 Wilson et al. Sep 2012 A1
20120265631 Cronic et al. Oct 2012 A1
20120271770 Harris et al. Oct 2012 A1
20120297446 Webb et al. Nov 2012 A1
20120300932 Cambridge et al. Nov 2012 A1
20120303503 Cambridge et al. Nov 2012 A1
20120303961 Kean et al. Nov 2012 A1
20120304273 Bailey et al. Nov 2012 A1
20120310725 Chien et al. Dec 2012 A1
20120310831 Harris et al. Dec 2012 A1
20120316992 Oborne Dec 2012 A1
20120317035 Royyuru et al. Dec 2012 A1
20120317036 Bower et al. Dec 2012 A1
20130017784 Fisher Jan 2013 A1
20130018757 Anderson et al. Jan 2013 A1
20130019098 Gupta et al. Jan 2013 A1
20130031006 McCullagh et al. Jan 2013 A1
20130054337 Brendell et al. Feb 2013 A1
20130054466 Muscato Feb 2013 A1
20130054474 Yeager Feb 2013 A1
20130081122 Svigals et al. Mar 2013 A1
20130091028 Oder, II et al. Apr 2013 A1
20130110658 Lyman et al. May 2013 A1
20130111599 Gargiulo May 2013 A1
20130117185 Collison et al. May 2013 A1
20130124290 Fisher May 2013 A1
20130124291 Fisher May 2013 A1
20130124364 Mittal May 2013 A1
20130138525 Bercaw May 2013 A1
20130144888 Faith et al. Jun 2013 A1
20130145148 Shablygin et al. Jun 2013 A1
20130145172 Shablygin et al. Jun 2013 A1
20130159178 Colon et al. Jun 2013 A1
20130159184 Thaw Jun 2013 A1
20130166402 Parento et al. Jun 2013 A1
20130166456 Zhang et al. Jun 2013 A1
20130173736 Krzeminski et al. Jul 2013 A1
20130185202 Goldthwaite et al. Jul 2013 A1
20130191227 Pasa et al. Jul 2013 A1
20130191286 Cronic et al. Jul 2013 A1
20130191289 Cronic et al. Jul 2013 A1
20130198071 Jurss Aug 2013 A1
20130198080 Anderson et al. Aug 2013 A1
20130200146 Moghadam Aug 2013 A1
20130204787 Dubois Aug 2013 A1
20130204793 Kerridge et al. Aug 2013 A1
20130212007 Mattsson et al. Aug 2013 A1
20130212017 Bangia Aug 2013 A1
20130212019 Mattsson et al. Aug 2013 A1
20130212024 Mattsson et al. Aug 2013 A1
20130212026 Powell et al. Aug 2013 A1
20130212666 Mattsson et al. Aug 2013 A1
20130218698 Moon et al. Aug 2013 A1
20130218769 Pourfallah et al. Aug 2013 A1
20130226799 Raj Aug 2013 A1
20130226813 Voltz Aug 2013 A1
20130246199 Carlson Sep 2013 A1
20130246202 Tobin Sep 2013 A1
20130246203 Laracey Sep 2013 A1
20130246258 Dessert Sep 2013 A1
20130246259 Dessert Sep 2013 A1
20130246261 Purves et al. Sep 2013 A1
20130246267 Tobin Sep 2013 A1
20130254028 Salci Sep 2013 A1
20130254052 Royyuru et al. Sep 2013 A1
20130254102 Royyuru Sep 2013 A1
20130254117 Von Mueller et al. Sep 2013 A1
20130262296 Thomas et al. Oct 2013 A1
20130262302 Lettow et al. Oct 2013 A1
20130262315 Hruska Oct 2013 A1
20130262316 Hruska Oct 2013 A1
20130262317 Collinge et al. Oct 2013 A1
20130275300 Killian et al. Oct 2013 A1
20130275307 Khan Oct 2013 A1
20130275308 Paraskeva et al. Oct 2013 A1
20130282502 Jooste Oct 2013 A1
20130282575 Mullen et al. Oct 2013 A1
20130282588 Hruska Oct 2013 A1
20130297501 Monk et al. Nov 2013 A1
20130297504 Nwokolo et al. Nov 2013 A1
20130297508 Belamant Nov 2013 A1
20130304649 Cronic et al. Nov 2013 A1
20130308778 Fosmark et al. Nov 2013 A1
20130311382 Fosmark et al. Nov 2013 A1
20130317982 Mengerink et al. Nov 2013 A1
20130332344 Weber Dec 2013 A1
20130339253 Sincai Dec 2013 A1
20130346305 Mendes Dec 2013 A1
20130346314 Mogollon et al. Dec 2013 A1
20140007213 Sanin et al. Jan 2014 A1
20140013106 Redpath Jan 2014 A1
20140013114 Redpath Jan 2014 A1
20140013452 Aissi et al. Jan 2014 A1
20140019352 Shrivastava Jan 2014 A1
20140025581 Caiman Jan 2014 A1
20140025585 Caiman Jan 2014 A1
20140025958 Caiman Jan 2014 A1
20140032417 Mattsson Jan 2014 A1
20140032418 Weber Jan 2014 A1
20140040137 Carlson et al. Feb 2014 A1
20140040139 Brudnicki et al. Feb 2014 A1
20140040144 Plomske et al. Feb 2014 A1
20140040145 Ozvat et al. Feb 2014 A1
20140040628 Fort et al. Feb 2014 A1
20140041018 Bomar et al. Feb 2014 A1
20140046764 Fox et al. Feb 2014 A1
20140046853 Spies et al. Feb 2014 A1
20140047551 Nagasundaram et al. Feb 2014 A1
20140052532 Tsai et al. Feb 2014 A1
20140052620 Rogers et al. Feb 2014 A1
20140052637 Jooste et al. Feb 2014 A1
20140068706 Aissi Mar 2014 A1
20140074637 Hammad Mar 2014 A1
20140108172 Weber et al. Apr 2014 A1
20140108263 Ortiz et al. Apr 2014 A1
20140114857 Griggs et al. Apr 2014 A1
20140143137 Carlson May 2014 A1
20140164243 Aabye et al. Jun 2014 A1
20140188586 Carpenter et al. Jul 2014 A1
20140195323 Hankins et al. Jul 2014 A1
20140294701 Dai et al. Oct 2014 A1
20140297534 Patterson Oct 2014 A1
20140310183 Weber Oct 2014 A1
20140324690 Allen et al. Oct 2014 A1
20140330721 Wang Nov 2014 A1
20140330722 Laxminarayanan et al. Nov 2014 A1
20140331265 Mozell et al. Nov 2014 A1
20140337236 Wong et al. Nov 2014 A1
20140344153 Raj et al. Nov 2014 A1
20140372308 Sheets Dec 2014 A1
20150019443 Sheets et al. Jan 2015 A1
20150032625 Dill et al. Jan 2015 A1
20150032626 Dill et al. Jan 2015 A1
20150032627 Dill et al. Jan 2015 A1
20150046338 Laxminarayanan et al. Feb 2015 A1
20150046339 Wong et al. Feb 2015 A1
20150052064 Karpenko et al. Feb 2015 A1
20150088756 Makhotin et al. Mar 2015 A1
20150106239 Gaddam et al. Apr 2015 A1
20150112870 Nagasundaram et al. Apr 2015 A1
20150112871 Kumnick Apr 2015 A1
20150120472 Aabye et al. Apr 2015 A1
20150127529 Makhotin et al. May 2015 A1
20150127547 Powell et al. May 2015 A1
20150140960 Powell et al. May 2015 A1
20150142673 Nelsen et al. May 2015 A1
20150161597 Subramanian et al. Jun 2015 A1
20150178724 Ngo et al. Jun 2015 A1
20150180836 Wong et al. Jun 2015 A1
20150186864 Jones et al. Jul 2015 A1
20150193222 Pirzadeh et al. Jul 2015 A1
20150195133 Sheets et al. Jul 2015 A1
20150199679 Palanisamy et al. Jul 2015 A1
20150199689 Kumnick et al. Jul 2015 A1
20150220917 Aabye et al. Aug 2015 A1
20150269559 Inotay Sep 2015 A1
20150269566 Gaddam et al. Sep 2015 A1
20150312038 Palanisamy Oct 2015 A1
20150319158 Kumnick Nov 2015 A1
20150332262 Lingappa Nov 2015 A1
20150356560 Shastry et al. Dec 2015 A1
20160028550 Gaddam et al. Jan 2016 A1
20160042263 Gaddam et al. Feb 2016 A1
20160065370 Le Saint et al. Mar 2016 A1
20160092696 Guglani et al. Mar 2016 A1
20160092872 Prakash et al. Mar 2016 A1
20160103675 Aabye et al. Apr 2016 A1
20160119296 Laxminarayanan et al. Apr 2016 A1
20160140545 Flurscheim et al. May 2016 A1
20160148197 Dimmick May 2016 A1
20160148212 Dimmick May 2016 A1
20160171479 Prakash et al. Jun 2016 A1
20160173483 Wong et al. Jun 2016 A1
20160210628 McGuire Jul 2016 A1
20160218875 Le Saint et al. Jul 2016 A1
20160224976 Basu et al. Aug 2016 A1
20160224977 Sabba et al. Aug 2016 A1
20160232527 Patterson Aug 2016 A1
20160239842 Cash et al. Aug 2016 A1
20170046696 Powell et al. Feb 2017 A1
20170103387 Weber Apr 2017 A1
20170155938 Wallters et al. Jun 2017 A1
20170220818 Nagasundaram et al. Aug 2017 A1
20170228723 Taylor et al. Aug 2017 A1
Foreign Referenced Citations (19)
Number Date Country
2156397 Feb 2010 EP
20110006732 Jan 2011 KR
101505847 Apr 2015 KR
20170008652 Jan 2017 KR
0135304 May 2001 WO
0135304 May 2002 WO
2004042536 May 2004 WO
2006113834 Oct 2006 WO
2009032523 Mar 2009 WO
2010078522 Jul 2010 WO
2012068078 May 2012 WO
2012098556 Jul 2012 WO
2012142370 Oct 2012 WO
2012167941 Dec 2012 WO
2013048538 Apr 2013 WO
2013056104 Apr 2013 WO
2013119914 Aug 2013 WO
2013179271 Dec 2013 WO
2015013548 Jan 2015 WO
Non-Patent Literature Citations (42)
Entry
“Automated Price Comparison Shopping Search Engine—Price Hunte”, Retrieved from internet: www.seas.upenn.edui cse400/CSE400_2004_2005/02writeup.pdf, May 2, 2017, 6 pages.
“BuyHatke is Helping Customers to Know the Best Time to Shop, Wraps $1 Mn”, Retrieved from internet: https://inc42.com/buzz/buyhatke-funded/, May 8, 2015, 8 pages.
“Petition for Inter Partes Review of U.S. Pat. No. 8,533,860 Challenging Claims 1-30 Under 35 U.S.C. § 312 and 37 C.F.R. § 42.104”, USPTO Patent Trial and Appeal Board, IPR 2016-00600, Feb. 17, 2016, 65 pages.
“PriceZombie, Price Tracker & Price Comparison—Add-ons for Firefox”, Retrived from internet: https://addons.mozilla.org/en-US/firefox/addon/pricezombie-price-tracker/, Aug. 19, 2015, 3 pages.
U.S. Appl. No. 14/600,523 , “U.S. Patent Application No.”, Secure Payment Processing Using Authorization Request, filed Jan. 20, 2015, 42 pages.
U.S. Appl. No. 14/952,444 , “U.S. Patent Application No.”, Tokenization Request via Access Device, filed Nov. 25, 2015, 78 pages.
U.S. Appl. No. 14/952,514 , “U.S. Patent Application No.”, Systems Communications With Non-Sensitive Identifiers, filed Nov. 25, 2015, 72 pages.
U.S. Appl. No. 14/955,716 , “U.S. Patent Application No.”, Provisioning Platform for Machine-To-Machine Devices, filed Dec. 1, 2015, 61 pages.
U.S. Appl. No. 14/966,948 , “U.S. Patent Application No.”, Automated Access Data Provisioning, filed Dec. 11, 2015, 52 pages.
U.S. Appl. No. 15/004,705 , “U.S. Patent Application No.”, Cloud-Based Transactions With Magnetic Secure Transmission, filed Jan. 22, 2016, 161 pages.
U.S. Appl. No. 15/008,388 , “U.S. Patent Application No.”, Methods for Secure Credential Provisioning, filed Jan. 27, 2016, 90 pages.
U.S. Appl. No. 15/011,366 , “U.S. Patent Application No.”, Token Check Offline, filed Jan. 29, 2016, 60 pages.
U.S. Appl. No. 15/019,157 , “U.S. Patent Application No.”, Token Processing Utilizing Multiple Authorizations, filed Feb. 9, 2016, 62 pages.
U.S. Appl. No. 15/041,495 , “U.S. Patent Application No.”, Peer Forward Authorization of Digital Requests, filed Feb. 11, 2016, 63 pages.
U.S. Appl. No. 15/265,282 , “U.S. Patent Application No.”, Self-Cleaning Token Valut, filed Sep. 14, 2016, 52 pages.
U.S. Appl. No. 15/462,658 , “U.S. Patent Application No.”, Replacing Token on a Multi-Token User Device, filed Mar. 17, 2017, 58 pages.
U.S. Appl. No. 15/585,077 , Final Office Action, dated Apr. 24, 2019, 17 pages.
U.S. Appl. No. 15/585,077 , Final Office Action, dated Apr. 22, 2020, 26 pages.
U.S. Appl. No. 15/585,077 , Non-Final Office Action, dated Dec. 11, 2019, 20 pages.
U.S. Appl. No. 15/585,077 , Non-Final Office Action, dated Nov. 30, 2018, 18 pages.
U.S. Appl. No. 15/585,077 , Notice of Allowance, dated Sep. 17, 2020, 9 pages.
U.S. Appl. No. 61/738,832 , “U.S. Provisional Application No.”, Management of Sensitive Data, filed Dec. 18, 2012, 22 pages.
U.S. Appl. No. 61/751,763 , “U.S. Provisional Application No.”, Payments Bridge, filed Jan. 11, 2013, 64 pages.
U.S. Appl. No. 61/879,632 , “U.S. Provisional Application No.”, Systems and Methods for Managing Mobile Cardholder Verification Methods, filed Sep. 18, 2013, 24 pages.
U.S. Appl. No. 61/892,407 , “U.S. Provisional Application No.”, Issuer Over-The-Air Update Method and System, filed Oct. 17, 2013, 28 pages.
U.S. Appl. No. 61/894,749 , “U.S. Provisional Application No.”, Methods and Systems for Authentication and Issuance of Tokens in a Secure Environment, filed Oct. 23, 2013, 67 pages.
U.S. Appl. No. 61/926,236 , “U.S. Provisional Application No.”, Methods and Systems for Provisioning Mobile Devices With Payment Credentials and Payment Token Identifiers, filed Jan. 10, 2014, 51 pages.
U.S. Appl. No. 62/000,288 , “U.S. Provisional Application No.”, Payment System Canonical Address Format, filed May 19, 2014, 58 pages.
U.S. Appl. No. 62/003,717 , “U.S. Provisional Application No.”, Mobile Merchant Application, filed May 28, 2014, 58 pages.
U.S. Appl. No. 62/024,426 , “U.S. Provisional Application No.”, Secure Transactions Using Mobile Devices, filed Jul. 14, 2014, 102 pages.
U.S. Appl. No. 62/037,033 , “U.S. Provisional Application No.”, Sharing PaymentToken, filed Aug. 13, 2014, 36 pages.
U.S. Appl. No. 62/038,174 , “U.S. Provisional Application No.”, Customized Payment Gateway, filed Aug. 15, 2014, 42 pages.
U.S. Appl. No. 62/042,050 , “U.S. Provisional Application No.”, Payment Device Authentication and Authorization System, filed Aug. 26, 2014, 120 pages.
U.S. Appl. No. 62/053,736 , “U.S. Provisional Application No.”, Completing Transactions Without a User Payment Device, filed Sep. 22, 2014, 31 pages.
U.S. Appl. No. 62/054,346 , “U.S. Provisional Application No.”, Mirrored Token Vault, filed Sep. 23, 2014, 38 pages.
U.S. Appl. No. 62/103,522 , “U.S. Provisional Application No.”, Methods and Systems for Wallet Provider Provisioning, filed Jan. 14, 2015, 39 pages.
U.S. Appl. No. 62/108,403 , “U.S. Provisional Application No.”, Wearables with NFC HCE, filed Jan. 27, 2015, 32 pages.
U.S. Appl. No. 62/117,291 , “U.S. Provisional Application No.”, Token and Cryptogram Using Transaction Specific Information, filed Feb. 17, 2015, 25 pages.
U.S. Appl. No. 62/128,709 , “U.S. Provisional Application No ”, Tokenizing Transaction Amounts, filed Mar. 5, 2015, 30 pages.
Application No. EP18795026.6 , Extended European Search Report, dated Apr. 9, 2020, 9 pages.
Application No. PCT/US2018/029779 , International Preliminary Report on Patentability, dated Nov. 14, 2019, 10 pages.
Application No. PCT/US2018/029779 , International Search Report and Written Opinion, dated Aug. 10, 2018, 13 pages.
Related Publications (1)
Number Date Country
20210103924 A1 Apr 2021 US
Divisions (1)
Number Date Country
Parent 15585077 May 2017 US
Child 17123484 US