Patent Grant
10977657
In recent years, payment tokens have been used in place of primary account numbers (PANs). While payment tokens can functions like PANs, they are not PANs. For example, instead of having ubiquitous properties, tokens are intentionally restricted. These restrictions are known as domain restrictions. The purpose of domain restrictions is to protect both the consumer and merchant from fraudulent and inappropriate purchases. Tokens are issued with domain restrictions based on the nature of the token requestor. In many cases, the token requestor will not be a merchant, but will be a mobile communication device with an issuer or third party wallet application. This means that some tokens are only able to operate in select channels. For instance, a token may be limited to an environment where the card data is stored such as a secure element or in a database. A token stored with these kind of domain restrictions cannot be used in another channel. Cryptography is the method used to protect card data and tokens and acts as proof of the interaction between the consumer and a merchant.
Because tokens are format preserving, meaning that they look and act like a PAN, a merchant that accepts the token may not be aware that domain restrictions may be applied to their transactions. This creates an inconsistency between PANs and tokens.
Embodiments of the invention address this and other problems, individually and collectively.
Embodiments enable processing of transactions utilizing multiple authorizations. Such transactions may utilize tokens, which may cause problems since the tokens can have different domain restrictions and authorizations can occur in different environments. For example, an initial authorization using a token can be for a card not present transaction (e.g., a transaction in which a payment device such as a credit card is not physically present when conducting a transaction at a point of sale) and a subsequent authorization using that token for a related transaction can be for a card present transaction (e.g., a transaction in which a payment device is physically present at a point of sale). A token restricted to a card not present environment may not be able to be properly processed if the subsequent authorization is outside of its domain. This inconsistency may result in transactions being unnecessarily declined.
One embodiment of the invention is directed to a method comprising: a) receiving, by a server computer, an authorization request message comprising a token from a resource provider computer for a transaction conducted in a second domain, wherein the authorization request message includes a related transaction indicator for a prior transaction and reference data for the prior transaction, and wherein the prior transaction was conducted in a first domain that is different from the second domain; b) determining, by the server computer, that the token is being used outside of the first domain; c) determining, by the server computer, that the authorization request message includes the related transaction indicator and the reference data; d) in response to steps b) and c), determining, by the server computer, the account identifier associated with the token; and e) initiating authorizing the transaction using the account identifier.
Another embodiment of the invention is directed to a server computer comprising: a processor; and a computer readable medium, the computer readable medium comprising code, executable by the processor, to implement a method comprising a) receiving, by a server computer, an authorization request message comprising a token from a resource provider computer for a transaction conducted in a second domain, and wherein the authorization request message includes a related transaction indicator for a prior transaction and reference data for the prior transaction, wherein the prior transaction was conducted in a first domain that is different from the second domain; b) determining, by the server computer, that the token is being used outside of the first domain; c) determining, by the server computer, that the authorization request message includes the related transaction indicator and the reference data; d) in response to steps b) and c), determining, by the server computer, the account identifier associated with the token; and e) initiating authorizing the transaction using the account identifier.
These and other embodiments of the invention are described in further detail below.
Before discussing specific embodiments and examples, some descriptions of some terms that are used are provided below.
A “communication device” may comprise any suitable electronic device that may be operated by a user, which may also provide remote communication capabilities to a network. A “mobile communication device” may be an example of a “communication device” that can be easily transported. Examples of remote communication capabilities include using a mobile phone (wireless) network, wireless data network (e.g. 3G, 4G or similar networks), Wi-Fi, Wi-Max, or any other communication medium that may provide access to a network such as the Internet or a private network. Examples of mobile communication devices include mobile phones (e.g. cellular phones), PDAs, tablet computers, net books, laptop computers, personal music players, hand-held specialized readers, etc. Further examples of mobile communication devices include wearable devices, such as smart watches, fitness bands, ankle bracelets, rings, earrings, etc., as well as automobiles with remote communication capabilities. In some embodiments, a mobile communication device can function as a payment device (e.g., a mobile communication device can store and be able to transmit payment credentials for a transaction).
A “payment device” may include any suitable device that may be used to conduct a financial transaction, such as to provide payment credentials to a merchant. The payment device may be a software object, a hardware object, or a physical object. As examples of physical objects, the payment device may comprise a substrate such as a paper or plastic card, and information that is printed, embossed, encoded, or otherwise included at or near a surface of an object. A payment device may be associated with a value such as a monetary value, a discount, or store credit, and a payment device may be associated with an entity such as a bank, a merchant, a payment processing network, or a person. Suitable payment devices can be hand-held and compact so that they can fit into a user's wallet and/or pocket (e.g., pocket-sized). Example payment devices may include smart cards, magnetic stripe cards, keychain devices (such as the Speedpass™ commercially available from Exxon-Mobil Corp.), etc. Other examples of payment devices include payment cards, smart media, transponders, and the like. If the payment device is in the form of a debit, credit, or smartcard, the payment device may also optionally have features such as magnetic stripes. Such devices can operate in either a contact or contactless mode.
A “credential” may be any suitable information that serves as reliable evidence of worth, ownership, identity, or authority. A credential may be a string of numbers, letters, or any other suitable characters, as well as any object or document that can serve as confirmation. Examples of credentials include value credentials, identification cards, certified documents, access cards, passcodes and other login information, etc.
“Payment credentials” may include any suitable information associated with an account (e.g. a payment account and/or payment device associated with the account). Such information may be directly related to the account or may be derived from information related to the account. Examples of account information may include a PAN (primary account number or “account number”), user name, expiration date, and verification values such as CVV, dCVV, CVV2, dCVV2, and CVC3 values.
A “digital wallet” can include an electronic device that allows an individual to conduct electronic commerce transactions. A digital wallet may store user profile information, payment credentials, bank account information, one or more digital wallet identifiers and/or the like and can be used in a variety of transactions, such as but not limited to eCommerce, social networks, money transfer/personal payments, mobile commerce, proximity payments, gaming, and/or the like for retail purchases, digital goods purchases, utility payments, purchasing games or gaming credits from gaming websites, transferring funds between users, and/or the like. A digital wallet may be designed to streamline the purchase and payment process. A digital wallet may allow the user to load one or more payment cards onto the digital wallet so as to make a payment without having to enter an account number or present a physical card.
A “token” may be a substitute value for a credential. A token may be a string of numbers, letters, or any other suitable characters. Examples of tokens include payment tokens, access tokens, personal identification tokens, etc.
A “payment token” may include an identifier for a payment account that is a substitute for an account identifier, such as a primary account number (PAN). For example, a payment token may include a series of alphanumeric characters that may be used as a substitute for an original account identifier. For example, a token “4900 0000 0000 0001” may be used in place of a PAN “4147 0900 0000 1234.” In some embodiments, a payment token may be “format preserving” and may have a numeric format that conforms to the account identifiers used in existing transaction processing networks (e.g., ISO 8583 financial transaction message format). In some embodiments, a payment token may be used in place of a PAN to initiate, authorize, settle or resolve a payment transaction or represent the original credential in other systems where the original credential would typically be provided. In some embodiments, a payment token may be generated such that the recovery of the original PAN or other account identifier from the token value may not be computationally derived. Further, in some embodiments, the token format may be configured to allow the entity receiving the token to identify it as a token and recognize the entity that issued the token.
“Tokenization” is a process by which data is replaced with substitute data. For example, a payment account identifier (e.g., a primary account number (PAN)) may be tokenized by replacing the primary account identifier with a substitute number (e.g. a token) that may be associated with the payment account identifier. Further, tokenization may be applied to any other information that may be replaced with a substitute value (i.e., token). Tokenization enhances transaction efficiency and security.
A “token issuer,” token provider” or “token service system” can include a system that services tokens. In some embodiments, a token service system can facilitate requesting, determining (e.g., generating) and/or issuing tokens, as well as maintaining an established mapping of tokens to primary account numbers (PANs) in a repository (e.g. token vault). In some embodiments, the token service system may establish a token assurance level for a given token to indicate the confidence level of the token to PAN binding. The token service system may include or be in communication with a token vault where the generated tokens are stored. The token service system may support token processing of payment transactions submitted using tokens by de-tokenizing the tokens to obtain the actual PANs. In some embodiments, a token service system may include a tokenization computer alone, or in combination with other computers such as a transaction processing 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.
A “token domain” may indicate an area and/or circumstance in which a token can be used. Examples of token domains may include, but are not limited to, payment channels (e.g., e-commerce, physical point of sale, etc.), POS entry modes (e.g., contactless, magnetic stripe, etc.), and merchant identifiers to uniquely identify where the token can be used. A set of parameters (i.e. token domain restriction controls) may be established as part of token issuance by the token service provider that may allow for enforcing appropriate usage of the token in payment transactions. For example, the token domain restriction controls may restrict the use of the token with particular presentment modes, such as contactless or e-commerce presentment modes. In some embodiments, the token domain restriction controls may restrict the use of the token at a particular merchant that can be uniquely identified. Some exemplary token domain restriction controls may require the verification of the presence of a token cryptogram that is unique to a given transaction. In some embodiments, a token domain can be associated with a token requestor.
A “token expiry date” may refer to the expiration date/time of the token. The token expiry date may be passed among the entities of the tokenization ecosystem during transaction processing to ensure interoperability. The token expiration date may be a numeric value (e.g. a 4-digit numeric value). In some embodiments, the token expiry date can be expressed as an time duration as measured from the time of issuance.
A “token request message” may be an electronic message for requesting a token. A token request message may include information usable for identifying a payment account or digital wallet, and/or information for generating a payment token. For example, a token request message may include payment credentials, mobile device identification information (e.g. a phone number or MSISDN), a digital wallet identifier, information identifying a tokenization service provider, a merchant identifier, a cryptogram, and/or any other suitable information. Information included in a token request message can be encrypted (e.g., with an issuer-specific key).
A “token response message” may be a message that responds to a token request. A token response message may include an indication that a token request was approved or denied. A token response message may also include a 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).
A “token requestor identifier” may include any characters, numerals, or other identifiers associated with an entity associated with a network token system. For example, a token requestor identifier may be associated with an entity that is registered with the network token system. In some embodiments, a unique token requestor identifier may be assigned for each domain for a token request associated with the same token requestor. For example, a token requestor identifier can identify a pairing of a token requestor (e.g., a mobile device, a mobile wallet provider, etc.) with a token domain (e.g., e-commerce, contactless, etc.). A token requestor identifier may include any format or type of information. For example, in one embodiment, the token requestor identifier may include a numerical value such as a ten digit or an eleven digit number (e.g., 4678012345).
A “user” may include an individual. In some embodiments, a user may be associated with one or more personal accounts and/or mobile devices. The user may also be referred to as a cardholder, account holder, or consumer in some embodiments.
A “resource provider” may be an entity that can provide a resource such as goods, services, information, and/or access. Examples of resource providers includes merchants, data providers, transit agencies, governmental entities, venue and dwelling operators, etc.
A “merchant” may typically be an entity that engages in transactions and can sell goods or services, or provide access to goods or services.
An “acquirer” may typically be a business entity (e.g., a commercial bank) that has a business relationship with a particular merchant or other entity. Some entities can perform both issuer and acquirer functions. Some embodiments may encompass such single entity issuer-acquirers. An acquirer may operate an acquirer computer, which can also be generically referred to as a “transport computer”.
An “authorizing entity” may be an entity that authorizes a request. Examples of an authorizing entity may be an issuer, a governmental agency, a document repository, an access administrator, etc.
An “issuer” may typically refer to a business entity (e.g., a bank) that maintains an account for a user. An issuer may also issue payment credentials stored on a user device, such as a cellular telephone, smart card, tablet, or laptop to the consumer.
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 mobile communication or payment 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.
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.
“Reference data” for a prior transaction that may be present in an authorization request for a subsequent transaction may include any suitable indicator of the prior transaction. For example, in some embodiments of the invention, “reference data” may include a retrieval reference number, a transaction identifier, a merchant or resource provider identifier, a location of the resource provider, a date and/or timestamp, etc. The reference data may also include data related to a decline for a prior transaction. Also, the reference data may be of any suitable length or may include any suitable combination of characters.
A “related transaction indicator” may include any suitable data that indicates that the current transaction is related to a past transaction. In some embodiments, the related transaction indicator may include, for example, a resubmission indicator, an incremental authorization indicator, a recurring payment indicator, etc. Additional examples are provided in the examples below. Also, the related transaction indicator may be of any suitable length or may include any suitable combination of characters.
A “token presentment mode” may indicate a method through which a token is submitted for a transaction. Some non-limiting examples of the token presentment mode may include machine readable codes (e.g., QR™ code, bar code, etc.), mobile contactless modes (e.g., near-field communication (NFC) communication), e-commerce remote modes, e-commerce proximity modes, and any other suitable modes in which to submit a token.
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.
I. Exemplary Systems
The transaction processing system 100 may further comprise a transport computer 140, a processing network computer 150, and an authorizing computer 170. The token requestor 120 may be configured to communicate with the resource provider computer 130 through a transaction channel 180. The transaction channel 180 may be, for example, a proximity or contactless transaction channel, an e-commerce transaction channel, a contact based transaction channel (e.g., magnetic stripe, etc.), etc.
The token issuer 160 can be configured to communicate with the resource provider computer 130, the transport computer 140, the processing network computer 150, the authorizing computer 170, and the token requestor 120 over any suitable communications network (e.g., the Internet or a telecommunications network).
The user 110 may use a portable consumer device (e.g., a credit card). The account holder 110 may also use a communication device (e.g., a mobile phone) that can serve as the token requestor 120 during a transaction with a resource provider such as a merchant. In some embodiments, the communication device may function as a payment device.
The token requestor 120 may be a device or entity that may be associated with a payment account of the account holder 110. In some implementations, the token requestor 120 may be a mobile communication device such as a mobile phone, a tablet, a PDA, a notebook computer, a key fob, or any suitable device. The token requestor 120 may include a digital or mobile wallet and/or a payment application that may be associated with one or more payment accounts of the account holder 110. In some embodiments, the mobile communication device may be configured to display a machine readable code, such as a QR code or barcode. The mobile communication device may also include a camera or a scanning device capable of scanning machine readable code. In some embodiments, a user may use a token requestor device to interface with a token requestor that may be provided through a remote computer (e.g., mobile wallet provider), etc. Accordingly, the user may use their mobile device to obtain a token that is stored by a remote server computer of a mobile wallet provider that may have previously obtained a token from a token issuer. Accordingly, there may be multiple token requestor devices in some embodiments and/or a communication device of a user (e.g., mobile device, laptop computer, desktop computer, etc.) that may be used to provide a previously requested token to a resource provider computer or access device.
As noted above, the token requestor 120 may communicate with the resource provider computer 130 via the transaction channel 180. The transaction channel 180 may be established using any suitable communication protocol. In some embodiments, the token requestor 120 may be capable of communicating with the resource provider computer 130 using a contactless or proximity communication method such as NFC (near field communications) or machine readable codes such as QR codes. In some embodiments, if the resource provider computer 130 is an access device, such as a POS terminal, the user 110 may interact with the resource provider computer 130 by tapping or waving the payment device near an access device associated with the resource provider computer 130.
The resource provider computer 130 may be associated with a merchant. The resource provider computer 130 may be an access device such as a POS terminal at a merchant location, a computer coupled with an access device of a merchant, or a remote server computer that operates a web site operated by the merchant. In some embodiments, the merchant operating the resource provider computer 130 may be a card-on-file (COF) merchant. The card-on-file merchant may store consumer account information in a remote database for future payments (e.g., recurring or periodic payments). The resource provider computer 130 may be configured to generate an authorization request message for a transaction that is initiated by the user 110. In some embodiments, the resource provider computer 130 may generate multiple authorization request messages if the transaction involves multiple authorizations.
The transport computer 140 may be operated by an acquirer. An acquirer 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 transport computer 140 may be communicatively coupled to the resource provider computer 130 and the processing network computer 150 and may issue and manage an account of the merchant. In some embodiments, the transport computer 140 may forward the authorization request message to the processing network computer 150 and the authorization response message to the resource provider computer 130 during a transaction to confirm processing of a payment transaction.
The processing network computer 150 may be configured to provide authorization services, and clearing and settlement services for payment transactions. A processing network computer 150 may include data processing subsystems, networks, and operations used to support and deliver authorization services, exception file services, and clearing and settlement services. An exemplary payment processing network may include VisaNet™. Payment processing networks such as VisaNet™ are able to process credit card transactions, debit card transactions, and other types of commercial transactions. VisaNet™, in particular includes a Visa Integrated Payments (VIP) system which processes authorization requests and a Base II system which performs clearing and settlement services. Furthermore, the payment processing network may include a server computer and may use any suitable wired or wireless telecommunications network, including the Internet. In some embodiments, the processing network computer 150 may forward an authorization request received from the transport computer 140 to the authorizing computer 170 via a communication channel. The processing network computer 150 may further forward an authorization response message received from the authorizing computer 170 to the transport computer 140.
The authorizing computer 170 may be operated by an account issuer. Typically the issuer is an entity (e.g., a bank) that issues and maintains an account of the user 110. The account may be a credit, debit, prepaid, or any other type of account.
The authorizing computer 160 may be a stand-alone entity or may be coupled to, integrated into, and/or operated or managed by any of the entities shown in
According to some embodiments of the present invention, the token issuer 160 may be configured to perform a method including receiving a token request from a requestor, generating a token, and providing the token to the requestor. Additionally, in some embodiments, the token issuer 160 may verify tokens for a requestor.
The token issuer 160 may interface with the token requestor 120 (e.g., mobile communication device) using a token requestor API interface. The token requestor API interface may provide a standard interface for the token requestor 120 to request and receive an issued token, request and receive information regarding whether a token is activated or deactivated, authenticate a received token, and/or manage the token through its lifecycle. Accordingly, a token requestor 120 may request that a token be issued by the token issuer 160, send a previously issued token (or message identifying the token) to the token issuer 160 to activate or deactivate the token, send a request to the token issuer 160 to authenticate the token, or provide a number of management functions regarding the lifecycle of the token. In some embodiments, the token issuer 160 may communicate with an issuer or payment processing network to perform some or all of these functions.
The token issuer 160 may communicate with the resource provider computer 130 through the use of APIs. The token issuer 160 may exchange tokens and process or route tokens to an appropriate entity for the resource provider operating the resource provider computer 130. Additionally, the token issuer 160 may communicate with the transport computer 140 through APIs. The APIs may standardize messaging between the resource provider or transport computers 130, 140 such that they may exchange and route tokens.
The token issuer 160 may interface with the authorizing computer 170 using authorizing computer APIs. The token issuer 160 registers and authenticates tokens for the issuer.
The token issuer computer 160 may interface with the processing network computer 150 through the use of a network or a gateway API. In some embodiments, the processing network computer 150 or a gateway API may provide message and token translation between network processing systems.
Messages between the computers, networks, and devices in
II. Methods
Some embodiments of the invention are directed to methods. The methods may include performing first and second transactions, where the second transaction is linked to the first transaction. Although two transactions are described in detail, it is understood that embodiments of the invention may encompass more than two transactions that may be associated with a single interaction event between a resource provider and a user.
In the first transaction, a server computer receives a first authorization request message comprising a token and a cryptogram from a resource provider computer. Prior to this, the resource provider computer receives the token and the cryptogram from a communication device used by a user. The communication device may be a mobile phone, which may function as a payment device. The cryptogram may have been generated using an encryption key that resides on the communication device. The encryption key may be used to encrypt data from the resource provider computer (e.g., a terminal ID, date and time of the transaction, etc.) and data from the communication device (e.g., a device ID, the token, the token expiration date, etc.) to form the cryptogram.
After the server computer receives the first authorization request message, the server computer determines that the token is being conducted within the first domain. It can do this by verifying the cryptogram and/or analyzing a transaction channel indicator in the authorization request message. The first domain may be a domain that requires that a contactless payment device interact with the resource provider computer at a point of sale. If the token is not being used in the correct domain, then the transaction may be rejected at this point and an authorization response message may be sent back to the resource provider computer indicating the same.
After the server computer determines that the token is being used in the proper domain, the server computer then determines the account identifier associated with the token. The server computer can determine the account identifier in any number of ways. In some embodiments, the server computer may transmit the token to an token issuer, and the token issuer may return the real account identifier. In other embodiments, the real account identifier may be mathematically derived from the token, and the server computer can derive the real account identifier from the token.
Once the real account identifier is determined, the server computer modifies the first authorization request message to include the account identifier. The server computer then forwards the first authorization request message to an authorizing computer. After forwarding the first authorization request message to the authorizing computer, the authorizing computer determines if the transaction should be declined or approved. An authorizing computer may decline a transaction for a number of reasons. For instance, an authorizing computer may decline a transaction, because there are insufficient funds and/or credit in the account, or the amount of the transaction is over a daily limit.
In some embodiments of the invention, the authorizing computer could decline the transaction. The server computer then receives a first authorization response message from the authorizing computer declining the first transaction, and the first authorization response message is forwarded to the resource provider computer.
In a second subsequent transaction that is linked to the first transaction, the server computer receives a second authorization request message comprising the token from the resource provider computer for a transaction conducted in a second domain. In this example, in the second transaction, the resource provider did not receive the token and the cryptogram from the token requestor as in the first transaction. The second authorization request message includes one or more of an amount, the token, a related transaction indicator for the first transaction, reference data for the first transaction, and other information. The first domain is different from the second domain. For example, the second domain may be a transaction that is a “device not present” transaction where a physical device is not used at the point of transaction. That is, the resource provider may initiate the second authorization request without the user being present at the time that the second authorization request is initiated.
After the server computer receives the second authorization request message, the server computer parses the second authorization request message to identify the token. The server computer then determines that the token is being used outside of the first domain. The server computer also determines that the authorization request message includes the related transaction indicator and the reference data. It may also determine that there is no cryptogram that is present in the data field that would normally contain the cryptogram. Although the second subsequent transaction is being conducted via a different domain than the first transaction, the server computer will still continue to process the transaction and will not decline the transaction. This is because the server computer has determined that the current transaction is related to the first transaction and is not an original submission. The server computer then determines the account identifier associated with the token and initiates authorizing the transaction using the account identifier.
In embodiments of the invention, initiating authorizing the transaction may include performing authorization processing on the second transaction or it may include forwarding the second authorization request message to an authorizing computer to allow the authorizing computer to perform authorization processing. In either case, a second authorization response message may be sent back to the resource provider computer from the server computer (e.g., a processing network computer or an authorizing computer), optionally via a transport computer.
If the second transaction is approved, then a clearing and settlement process can occur between the various parties to the second transaction (or the first transaction, if appropriate).
There are various situations in which exemplary transactions may utilize multiple authorization processing as described above. Although many of the examples described below relate to financial transactions, embodiments of the invention are not limited to financial transactions. For example, embodiments of the invention can be used in situations where access to a resource (e.g., such as access to a service) is desired.
Some embodiments of the invention may be used in Offline Data Authentication (ODA). ODA is used in environments where sub-second transaction speed is necessary to facilitate a high volume of consumers or connectivity to an authorization source is unavailable. Transit and airline in-flight purchases are classic examples of this business practice. In this environment, a token submitted from a proximity device is domain restricted to prevent card not present (CNP) transactions, thereby preventing a merchant from collecting funds associated with the consumers purchase when the original authorization is declined.
In typical operation in this environment, a consumer interacts with a merchant's contactless reader, where only basic information is verified prior to providing the consumer with service. In the case of transit, the fare gate opens and the consumer is able to enter. The contactless cryptogram information can be captured and transmitted at a later time. The merchant submits an authorization along with the relevant cryptogram information. This occurs after the consumer has already received the goods or service. In this case, the authorization is submitted after the fare gate has opened and the consumer has already begun their transit journey. Subsequently, the cryptogram is validated and the issuer either approves or declines the transaction. While the merchant is taking the risk for the transaction, the merchant and consumer have entered into a purchase agreement. The merchant has the right to collect the debt in situations where the transaction was declined for insufficient funds (NSF), as this is a temporary account disposition. The merchant sends a card not present (CNP) transaction without a cryptogram for any re-authorization attempt caused by the insufficient (NSF) state.
While it is impractical to have merchants store the cryptogram information after a successful authorization message has been provided with an issuer decision, removing domain restrictions would be counter to the objectives of tokens. Therefore, a resubmission may be proposed to address this transit use case. A resubmission may be a transaction that refers to an original consumer initiated card present transaction, but is initiated by the merchant without cryptogram information.
Some characteristics of a resubmission may be described. The original transaction conducted by the consumer may be a card present, contactless transaction associated with valid Merchant Category Codes (e.g., from transport, travel, entertainment, etc.) that is declined due to the consumer having insufficient funds or being over the daily withdrawal limit. In some embodiments, the resubmission does not have cryptographic information. Accordingly, the same point of sale entry mode as the original decline may be used for the resubmission. Reference to one or more key data elements from the authorization decline, such as a transaction identifier, a reference number, or timestamp may be utilized in the resubmission. Further, a related transaction indicator such as a unique data element indicating the transaction is a resubmission may be included.
In some embodiments, the merchant may utilize a resubmission under certain conditions. The merchant may initiate a resubmission, once per day for a time period (e.g., fourteen days), after which the resubmission may be invalid. In some embodiments, the merchant may not submit a resubmission for a transaction that does not reference an original transaction as indicated by the presence of the reference data.
A processing network computer (or token issuer) may validate data elements in the resubmission against those in the original decline transaction. The clearing message associated with the transaction may comprise the related transaction indicator such as a unique resubmission indicator. Further, an issuer may modify its authorization systems and risk management tools to recognize the resubmission in the authorization message. For example, the issuer may provide a specific response code depending on certain reasons for the decline (e.g., insufficient fund, account closed, over daily withdrawal limits, etc.). If the transaction is declined due to a closed account or a cryptogram fail, the issuer may provide different response codes. In some embodiments, the issuer may prioritize a decline caused by cryptographic reasons over a decline cause by insufficient funds or exceeding daily withdrawal limit. The tracing data from the decline may be utilized in subsequent debt collection requests to establish that the transaction was properly authenticated.
Referring to
At step S202, the resource provider computer 130 may generate a first authorization request message, and the first authorization request message may be transmitted to a transport computer 140. Some data elements in the authorization request message are shown as reference number 240 in
At step S204, the transport computer 140 may receive, analyze, and then transmit the first authorization request message to the processing network computer 150.
At step S206, the processing network computer 150 may receive and may then determine that the first authorization request message contains the token. It may also send the token and any other pertinent information to the token issuer 160. Other pertinent information may include any channel indicators or transaction characteristics such as transaction amount. Such information can be used to the token issuer 160 to determine if the token that is being used is within the domain restrictions set for that token. For example, if the token is only to be used in card present type transactions where a device is physically present at the point of interaction with the resource provider, then cryptogram may serve as an indicator that the token requestor 120 was physically present at the point of interaction with the resource provider. The processing network computer 150 may decrypt or otherwise determine the data elements that were used to form the cryptogram and can verify that the token requestor 120 was in fact physically present at the point of interaction with the resource provider. If the token issuer 160 determines that the token is valid, the token issuer 160 may then retrieve the account identifier such as the real account number corresponding to the token from a database. Alternatively, the token issuer 160 may derive (mathematically) the account identifier from the token.
In step S208, after the token issuer 160 retrieves the real account identifier, the token issuer 160 sends the real account identifier to the processing network computer 150. After receiving the real account identifier, in step S210, the processing network computer 150 may modify the previously received authorization request message to include the real account identifier and may forward it to the authorizing computer 170. At this point the authorizing computer 170, and the authorization computer 170 may determine if there are or are not sufficient funds and/or credit in the account associated with the real account identifier. It may also determine whether or not the transaction is indicative of fraud.
Although the token issuer 160 and the processing network computer 150 are shown as being two separate entities, in other embodiments, the token issuer 160 and the processing network computer 150 may be a single entity and may be embodied by a single server computer or computer system in some embodiments of the invention.
In this particular example, the account associated with the real account identifier may have insufficient funds to conduct the transaction. However, because transit transactions need to proceed before the authorization process can be completed, the user that operates the token requestor 120 may simply be allowed to pass into the transit system even though the transaction was officially declined.
In step S212, once the authorizing computer has made an authorization decision, the authorizing computer 170 may then send a first authorization response message back to the processing network computer 150.
In step S214, after receiving the first authorization request message from the authorizing computer 170, the processing network computer 150 may then send the real account identifier back to the token issuer 160.
In step S216, after the token issuer 160 receives the real account identifier, the token issuer 160 may send back the token corresponding to the real account identifier. After the processing network computer 150 receives the token from the token issuer 160, the processing network computer 150 may modify the first authorization response message received from the authorizing computer 170 to replace the real account identifier with the token.
In step S218, the first authorization response message comprising the token is forwarded to the transport computer 140. After the transport computer 140 receives the first authorization response message, it then sends the first authorization response message to the resource provider computer 130.
As noted above, in this example, the user may have insufficient funds, even though the user was allowed to pass into the transit system. Because the user was able to obtain the benefit of the transit service without paying for it, the transit agency (a merchant in this case) may be allowed to resubmit the authorization request in a second transaction. However, the resubmission would occur without the user's token requestor device 120 because the user is not present. The transaction that would need to be conducted would therefore by a “card not present” or “device not present” type of transaction. While the transit agency may store the token in a local database, the transit agency would not store the cryptogram. As such, in prior systems, if the transit agency resubmits another authorization request, it would be denied because the token, which was domain restricted to card present transactions, is now being used in a card or device not present type of transaction.
Embodiments of the invention address this problem by removing the cryptogram from the second authorization request message. Alternatively, a related transaction indicator and reference data linking the second transaction to the first transaction may be present in the second authorization request message. In both instances, the processing network computer 150 can determine that the use of the token is valid in the second transaction, even though it is being used in a domain that is not the intended domain of the token.
At step S302, a resource provider computer 130 may generate a second authorization request message, and the second authorization request message may be transmitted to a transport computer 140. In this exemplary second transaction, the token requestor 120 did not pass the token and the cryptogram used in the first transaction to the resource provider computer 130. Rather, the resource provider computer 130 obtained the token from a data store at the resource provider computer 130. Some data elements in the authorization request message are shown as reference number 340 in
At step S304, the transport computer 140 may receive and then transmit the second authorization request message to the processing network computer 150.
At step S306, the processing network computer 150 may receive, and may then determine that the second authorization request message contains the token. The processing network computer 150 may then determine the real account identifier from the token. This can be done in any suitable manner. For example, the processing network computer 150 may then send the token and any other pertinent information to the token issuer 160. Other pertinent information may include any channel indicators or transaction characteristics such as the transaction amount. Such information can be used by the token issuer 160 to determine if the token that is being used is within the domain restrictions set for that token. In this case, the processing network computer 150 may determine that the cryptogram data field 344 is empty and that the additional data 360 indicates that this second authorization request is tied to the first authorization request. The absence of the cryptogram in the cryptogram data field 344 indicates to the processing network computer 150 that the transaction may be processed, even though the token is being used in a domain that is different than its intended domain restriction. If the token issuer 160 determines that the token is valid, the token issuer 160 may then retrieve the real account number corresponding to the token from a database. Alternatively, the real account number may be mathematically derived from the token.
In step S308, after the token issuer 160 obtains the real account number, the token issuer 160 sends the real account identifier to the processing network computer 150. After receiving the real account identifier, in step S310, the processing network computer 150 may modify the previously received second authorization request message to include the real account identifier and may forward it to the authorizing computer 170. At this point, the authorizing computer 170 may determine if there are or are not sufficient funds and/or credit in the account associated with the real account identifier. It may also determine whether or not the transaction is indicative of fraud.
In step S312, once the authorizing computer has made an authorization decision, the authorizing computer 170 may then send a second authorization response message back to the processing network computer 150.
In step S314, after receiving the second authorization request message from the authorizing computer, the processing network computer 150 may then send the real account identifier back to the token issuer 160.
In step S316, after the token issuer 160 receives the real account identifier, the token issuer 160 may send back the token corresponding to the real account identifier. After the processing network computer 150 receives the token from the token issuer 160, the processing network computer 150 may modify the authorization response message received from the authorizing computer 170 to replace the real account identifier with the token.
In step S218, the second authorization response message comprising the token is forwarded to the transport computer 140. After the transport computer 140 receives the authorization response message, it then sends the second authorization response message to the resource provider computer 100.
At the end of the day or at any other suitable period of time, a clearing and settlement processing between the processing network computer 150, the transport computer 140, and the authorizing computer 170 may take place.
The above transit transaction example is but one instance in which embodiments of the invention may be used. A number of additional use cases for embodiments of the invention are illustrated below.
Hotel and car rental agencies have a variety of use cases that present challenges when tokens are involved. For example, some use cases include transactions involving incremental authorizations, no show charges, and ancillary charges. In each case, the merchant may properly disclose to the consumer that the consumer will be responsible for any charges associated with either the reservation or stay in accordance with the terms and conditions provided. However, domain restrictions on tokens can cause legitimate transactions from being processed.
Incremental authorizations may occur when a merchant initiates one or more authorizations after the initial consumer interaction (e.g., hotel check-in, car rental) to add incremental funds to the original authorization. Incremental authorizations may refer back to the reference data including key data elements of the original transaction, such as a retrieval reference number or transaction identifier, and may be restricted to certain relevant merchant categories (e.g., travel, entertainment, etc.). The incremental authorization message may comprise a related transaction indicator such as a unique identifier to signal the application of unique authorization or risk rules.
Incremental authorization may be conducted under certain conditions. For example, the incremental authorization may have a related transaction indicator such as a unique identifier to indicate that the authorization will not contain cryptography, but will contain a transaction identifier. The authorization request may comprise characteristics of the original transaction. In some embodiments, a single clearing transaction may be conducted for the original authorization as well as all subsequent authorizations. The single clearing transaction may reflect the sum of all incremental authorizations, the entry mode of the first transaction (e.g., POS), and the transaction identifier of the original transaction.
In some cases, transactions may involve no show charges. For example, when a consumer completes a reservation with a hotel, the hotel may generate an authorization request to validate the consumer account. However, the account may not be charged until the consumer checks in. Any cryptography associated with the initial authorization may not be stored by the merchant. If the consumer does not cancel the reservation prior to the “Terms and Conditions” provided by the merchant, it may be valid for the merchant to submit a transaction to charge the consumer. The merchant may or may not generate an authorization. The no show transaction may be identified in the submitted transaction so that the merchant can be protected from chargeback.
A no-show transaction may be problematic when utilized with tokenization. If a token is presented for the initial reservation as a chip based ecommerce transaction, the domain restrictions associated with chip based ecommerce may prevent a pure CNP transaction from being presented.
To address this problem, merchants may be enabled to initiate a device not present (e.g., card not present) no show transaction without requiring storage of cryptography. For example, one or more of the authorization or clearing message may identify the transaction as one that involves a no show event, as well as reference the original authorization. Additionally, information surrounding the original transaction may be also provided (e.g., hotel check-in date, car rental date). The no show transaction may be particularly useful in relevant merchant category codes (e.g., hotel, car rental, etc.).
Some merchants may have consumers preauthorize a maximum billing amount prior to an actual authorization. This may occur when the final amount of the authorization is not known and will be delayed after the consumer has received services from the merchant. This may cause issues for transactions involving tokens since the original transaction billing the maximum amount and the actual transaction billing the actual amount may be conducted in a different domain.
To address this problem, the merchant may initiate an authorization for the maximum preauthorized billing amount at the time a service is delivered to the consumer. This request may contain the cryptography associated with the channel used by the consumer (e.g., card present or CNP). This can allow the issuer to validate the card. The actual authorization of the actual transaction may reference authorization data associated with the date the service was performed, as well as a related transaction indicator such as a unique preauthorization billing indicator. In some embodiments, the authorization may be limited to certain relevant merchant category codes (e.g., healthcare).
Other challenges with tokens can be present in cross channel transactions. As brick and mortal merchants compete in the retail world, they are looking for ways to integrate their retail outlets with their web/mobile presence. This may allow merchants to compete effectively with online merchants by enabling the consumer convenience of shopping online, with not having to wait for the goods to be delivered. However, integrating these different environments may cause issues for transactions as there are several situations in which a consumer may make a purchase across channels.
In one payment model, a consumer may buy goods at a merchant's store and ship the goods to another address (e.g., consumer's home address). However, certain issues may arise when utilizing this payment model. A consumer may not have access or full visibility to a token value in order to initiate a key entered transaction. If the consumer taps, swipes, or initiates an application based transaction with a token, the merchant may send the authorization to the issuer with the relevant cryptography to be validated. The merchant may not clear the transaction until the item has been shipped to the consumer, which can result in delays in the process that may affect the interchange qualification that is applied to the transaction.
To address this problem, if the merchant initiates an additional authorization after the initial transaction has been validated, the merchant may uniquely identify (e.g., via a related transaction indicator) the authorization as a re-authorization of a previous consumer event. Hence, the merchant may utilize not an incremental authorization, but rather a new authorization. The new authorization may not contain any cryptographic data and may refer to the original authorization by including reference data such as data surrounding the original authorization (e.g., transaction identifier, local date and time, etc.). The new authorization may comprise a related transaction indicator such as a unique message value identifying it as a re-authorization, so that the transaction may be appropriately evaluated by the issuer and its applicable fraud tools. The transaction may reflect the same POS entry mode as presented in the original transaction, so that reference may be made to an original domain restriction (if desired).
In some cases, a card not present transaction may result in multiple clearing transactions in the case of split shipments, which may allow a single authorization to be cleared with multiple clearing items across multiple settlement days. This may typically be accomplished through the use of a multiple clearing sequence number (MCSN) and a single transaction identifier that may be utilized for more than one clearing item. The MCSN may communicate to the issuer to expect a total of N separate clearing items associated with the same transaction identifier. The issuer may expect that all items will be shipped within seven day period for preferential interchange qualifications. Merchants may prefer to authorize split shipments in order to ensure that they meet the seven day timeline, since the difference in interchange can be measurable. This also enables the authorization and clearing amount to match, which can be simpler for bookkeeping purposes. However, accommodations may enable a merchant initiated authorization in the event a portion of the purchase results in additional authorization.
The merchant initiated authorization may provide information to identify the new authorization as a split shipment, as well as include information surrounding the original authorization. Accordingly, the authorization may comprise a unique value to identify it as a split shipment, as well as the local date of the original transaction. The consumer order number and no cryptography may be present in the transaction. The split shipment authorization may indicate a card not present entry mode and domain restrictions may be channel specific based on the entry mode.
In some cases, a merchant may know that an item(s) in a consumer's order is immediately available and is on back order. The merchant may notify the consumer, and if the consumer wishes to continue with the order, the merchant may periodically authorize the total of the back order items. This typically occurs at an interval chosen by the merchant, but may not be less than every three days. This authorization interval ensures that funds are still available in the consumer's account. However, accommodations may be considered to enable better management of authorization results.
A back order authorization may comprise information to identify the new authorization as a back order, as well as include information surrounding the original transaction. Accordingly, the authorization may comprise a related transaction value such as a value to identify it as a back order, as well as reference data such as the local date of the original transaction. The consumer order number and no cryptography may be present in the back order transaction. Cryptography may be validated on the original transaction. The back order authorization will indicate a card not present entry mode and domain restrictions may be channel specific based on the entry mode.
While preorders may be similar to back orders and split shipments, they may carry some unique properties. A preorder may have a deposit associated with it, which could be a full payment or a partial payment. This enables a full transaction cycle at the time of the order. In cases where the merchant retains the card or token on file in order to perform subsequent authorizations, the merchant may not have the ability to acquire additional authentication from the consumer.
To accommodate, the preorder authorization may provide information that identifies the new authorization as related to a preorder. Accordingly, the authorization may comprise a related transaction indicator such as a value to identify it as a preorder, as well as reference data such as the local date of the original transaction. The consumer order number and no cryptography may be present in the preorder transaction. Cryptography may be validated on the original transaction. The preorder authorization may indicate a card not present mode and domain restrictions may be channel specific based on the entry mode.
Recurring transactions may occur when the cardholder and merchant agree to purchase goods or services on an ongoing basis over a period of time. Recurring transactions may comprise multiple transactions processed at predetermined intervals, with no more than one year between transactions. Examples of recurring transactions include insurance premiums, subscriptions, Internet service provider fees, membership fees, tuition, or utility charges. Typically, a merchant may renew the agreement on an annual basis.
Tokens may create a unique challenge for recurring merchants as the initial transaction can occur through either a card present or a card not present channel. Once the initial transaction occurs, the merchant may initiate all subsequent purchases on a periodic basis (e.g., monthly) by card not present transactions. Subsequent transactions may not contain cryptography as all are merchant initiated and based on the initial consumer instruction. In cases where a token may be domain restricted to a select environment, device, or channel, subsequent purchases may be inappropriately declined.
To address this problem, subsequent authorization requests in the recurring series may be processed as recurring transactions by use of a related transaction indicator including a recurring indicator. The merchant may not store and submit issuer authentication results with subsequent authorization transactions.
Installment transactions may be similar to recurring transactions with the exception that for an initial installment transaction, terms associated with the installment may be intended to be carried out with the initial transaction. Even the initial purchase may be defined as an installment transaction and may contain both the full amount of the purchase and the amount of each installment. An initial installment purchase may be a card present or card not present purchase and may be authenticated by the consumer presenting identification (e.g., PIN, Signature) or by an authentication service (e.g., Verified by Visa). Subsequent installment purchases may not carry authentication information. Transactions may be unnecessarily declined if subsequent transactions are submitted in a different domain than the initial transaction.
To address this problem, subsequent authorization requests may be processed as installment transactions by use of a related transaction indicator such as an installment indicator. The merchant may not store and submit issuer authentication results with subsequent authorization transactions.
In yet other embodiments, card present merchant may not be permitted to store a transaction that contains PIN data, but may store a signature based transaction to submit at a later time when communication with the network is restored. It is not uncommon for a merchant to experience a telecommunication failure that may prevent the merchant from connecting to the network to process transactions. This may also occur in disaster zones or as part of routine or normal system maintenance. When communication is lost, select merchant segments (e.g., fuel and supermarket merchants) provide consumers with the ability to purchase goods and services up to a maximum dollar amount. Typically, these merchant authorized amounts can be between a maximum of $50-$75 dollars.
The merchant may be assuming risk for the purchase in the event the purchase cannot be completed. In some embodiments, the merchant may utilize a positive or negative file to determine the level of risk to allow. Since tokens and PANs are not the same values, positive and negative files of merchant may cease to be effective. When a token is involved in the transaction, it is possible that the transaction may not be successful. The domain restrictions associated with tokens may make it far more likely that the transaction may be declined for a reason other than insufficient funds.
To address this problem, if a merchant successfully transmits the transaction with relevant cryptographic data associated with the consumer initiated request and the purchase is declined for insufficient funds by the issuer, the merchant may seek to complete the transaction by initiating a resubmission request. A resubmission may be a transaction that refers to an original consumer initiated card present transaction that is initiated by the merchant without use of cryptographic data. The resubmission may have similar characteristics to that described above regarding offline data authentication and may be valid for certain merchant category codes (e.g., fuel, supermarket).
A computer system that may be used to implement any of the entities or components described above can have any suitable components or subsystems. The subsystems can be interconnected via a system bus. Additional subsystems such as a printer, keyboard, fixed disk (or other memory comprising computer readable media), monitor, which is coupled to display adapter, and others may be used. Peripherals and input/output (I/O) devices, which couple to I/O controller (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 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. In some embodiments, the monitor may be a touch sensitive display screen.
Embodiments of the invention provide for a number of advantages. For example, embodiments of the invention can permit subsequent transactions that are related to prior transactions to be conducted with the same token, even though the token may be domain restricted. This is more efficient, than for example, issuing a separate token and cryptogram for each and every transaction submission in every conceivable domain. As such, embodiments of the invention are simpler and more complex than other potential processing protocols.
It should be understood that any of the embodiments of the present invention can be implemented in the form of control logic using hardware (e.g. an application specific integrated circuit or field programmable gate array) and/or using computer software with a generally programmable processor in a modular or integrated manner. As used herein, a processor includes a single-core processor, multi-core processor on a same integrated chip, or multiple processing units on a single circuit board or networked. Based on the disclosure and teachings provided herein, a person of ordinary skill in the art will know and appreciate other ways and/or methods to implement embodiments of the present invention using hardware and a combination of hardware and software.
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, C++, C#, Objective-C, Swift, or scripting language such as Perl or Python 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 for storage and/or transmission, suitable media include 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 compact disk (CD) or DVD (digital versatile disk), flash memory, and the like. The computer readable medium may be any combination of such storage or transmission devices.
The above description is illustrative and is not restrictive. 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. For example, many of the methods described above have different combinations of steps. Steps may be omitted, added, and/or combined without departing from the scope of the invention.
One or more features from any embodiment may be combined with one or more features of any other embodiment without departing from the scope of the invention.
A recitation of “a”, “an” or “the” is intended to mean “one or more” unless specifically indicated to the contrary.
All patents, patent applications, publications, and descriptions mentioned above are herein incorporated by reference in their entirety for all purposes. None is admitted to be prior art.
This application is a non-provisional application of and claims the benefit of the filing date of U.S. Provisional Application No. 62/113,671, filed on Feb. 9, 2015, which is herein incorporated by reference in its entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5613012 | Hoffman | Mar 1997 | A |
| 5781438 | Lee | Jul 1998 | A |
| 5883810 | Franklin | Mar 1999 | A |
| 5953710 | Fleming | Sep 1999 | A |
| 5956699 | Wong | Sep 1999 | A |
| 6000832 | Franklin | Dec 1999 | A |
| 6014635 | Harris | Jan 2000 | A |
| 6029141 | Bezos | Feb 2000 | A |
| 6044360 | Picciallo | Mar 2000 | A |
| 6163771 | Walker | Dec 2000 | A |
| 6227447 | Campisano | May 2001 | B1 |
| 6236981 | Hill | May 2001 | B1 |
| 6267292 | Walker | Jul 2001 | B1 |
| 6327578 | Linehan | Dec 2001 | B1 |
| 6341724 | Campisano | Jan 2002 | B2 |
| 6385596 | Wiser | May 2002 | B1 |
| 6422462 | Cohen | Jul 2002 | B1 |
| 6425523 | Shem Ur | Jul 2002 | B1 |
| 6592044 | Wong | Jul 2003 | B1 |
| 6636833 | Flitcroft | Oct 2003 | B1 |
| 6748367 | Lee | Jun 2004 | B1 |
| 6805287 | Bishop | Oct 2004 | B2 |
| 6879965 | Fung | Apr 2005 | B2 |
| 6891953 | DeMello | May 2005 | B1 |
| 6901387 | Wells | May 2005 | B2 |
| 6931382 | Laage | Aug 2005 | B2 |
| 6938019 | Uzo | Aug 2005 | B1 |
| 6941285 | Sarcanin | Sep 2005 | B2 |
| 6980670 | Hoffman | Dec 2005 | B1 |
| 6990470 | Hogan | Jan 2006 | B2 |
| 6991157 | Bishop | Jan 2006 | B2 |
| 7051929 | Li | May 2006 | B2 |
| 7069249 | Stolfo | Jun 2006 | B2 |
| 7103576 | Mann, III | Sep 2006 | B2 |
| 7113930 | Eccles | Sep 2006 | B2 |
| 7136835 | Flitcroft | Nov 2006 | B1 |
| 7177835 | Walker | Feb 2007 | B1 |
| 7177848 | Hogan | Feb 2007 | B2 |
| 7194437 | Britto | Mar 2007 | B1 |
| 7264154 | Harris | Sep 2007 | B2 |
| 7287692 | Patel | Oct 2007 | B1 |
| 7292999 | Hobson | Nov 2007 | B2 |
| 7350230 | Forrest | Mar 2008 | B2 |
| 7353382 | Labrou | Apr 2008 | B2 |
| 7379919 | Hogan | May 2008 | B2 |
| RE40444 | Linehan | Jul 2008 | E |
| 7415443 | Hobson | Aug 2008 | B2 |
| 7444676 | Asghari-Kamrani | Oct 2008 | B1 |
| 7469151 | Khan | Dec 2008 | B2 |
| 7548889 | Bhambri | Jun 2009 | B2 |
| 7567934 | Flitcroft | Jul 2009 | B2 |
| 7567936 | Peckover | Jul 2009 | B1 |
| 7571139 | Giordano | Aug 2009 | B1 |
| 7571142 | Flitcroft | Aug 2009 | B1 |
| 7580898 | Brown | Aug 2009 | B2 |
| 7584153 | Brown | Sep 2009 | B2 |
| 7593896 | Flitcroft | Sep 2009 | B1 |
| 7606560 | Labrou | Oct 2009 | B2 |
| 7627531 | Breck | Dec 2009 | B2 |
| 7627895 | Gifford | Dec 2009 | B2 |
| 7650314 | Saunders | Jan 2010 | B1 |
| 7685037 | Reiners | Mar 2010 | B2 |
| 7702578 | Fung | Apr 2010 | B2 |
| 7707120 | Dominguez | Apr 2010 | B2 |
| 7712655 | Wong | May 2010 | B2 |
| 7734527 | Uzo | Jun 2010 | B2 |
| 7753265 | Harris | Jul 2010 | B2 |
| 7770789 | Oder, II | Aug 2010 | B2 |
| 7784685 | Hopkins, III | Aug 2010 | B1 |
| 7793851 | Mullen | Sep 2010 | B2 |
| 7801826 | Labrou | Sep 2010 | B2 |
| 7805376 | Smith | Sep 2010 | B2 |
| 7805378 | Berardi | Sep 2010 | B2 |
| 7828220 | Mullen | Nov 2010 | B2 |
| 7835960 | Breck | Nov 2010 | B2 |
| 7841523 | Oder, II | Nov 2010 | B2 |
| 7841539 | Hewton | Nov 2010 | B2 |
| 7844550 | Walker | Nov 2010 | B2 |
| 7849020 | Johnson | Dec 2010 | B2 |
| 7853529 | Walker | Dec 2010 | B1 |
| 7853995 | Chow | Dec 2010 | B2 |
| 7865414 | Fung | Jan 2011 | B2 |
| 7873579 | Hobson | Jan 2011 | B2 |
| 7873580 | Hobson | Jan 2011 | B2 |
| 7890393 | Talbert | Feb 2011 | B2 |
| 7891563 | Oder, II | Feb 2011 | B2 |
| 7896238 | Fein | Mar 2011 | B2 |
| 7922082 | Muscato | Apr 2011 | B2 |
| 7931195 | Mullen | Apr 2011 | B2 |
| 7938318 | Fein | May 2011 | B2 |
| 7954705 | Mullen | Jun 2011 | B2 |
| 7959076 | Hopkins, III | Jun 2011 | B1 |
| 7996288 | Stolfo | Aug 2011 | B1 |
| 8025223 | Saunders | Sep 2011 | B2 |
| 8046256 | Chien | Oct 2011 | B2 |
| 8060448 | Jones | Nov 2011 | B2 |
| 8060449 | Zhu | Nov 2011 | B1 |
| 8074877 | Mullen | Dec 2011 | B2 |
| 8074879 | Harris | Dec 2011 | B2 |
| 8082210 | Hansen | Dec 2011 | B2 |
| 8095113 | Kean | Jan 2012 | B2 |
| 8104679 | Brown | Jan 2012 | B2 |
| RE43157 | Bishop | Feb 2012 | E |
| 8109436 | Hopkins, III | Feb 2012 | B1 |
| 8121942 | Carlson | Feb 2012 | B2 |
| 8121956 | Carlson | Feb 2012 | B2 |
| 8126449 | Beenau | Feb 2012 | B2 |
| 8171525 | Pelly | May 2012 | B1 |
| 8196813 | Vadhri | Jun 2012 | B2 |
| 8205791 | Randazza | Jun 2012 | B2 |
| 8224702 | Mengerink | Jul 2012 | B2 |
| 8225385 | Chow | Jul 2012 | B2 |
| 8265993 | Chien | Sep 2012 | B2 |
| 8280777 | Mengerink | Oct 2012 | B2 |
| 8328095 | Oder, II | Dec 2012 | B2 |
| 8376225 | Hopkins, III | Feb 2013 | B1 |
| 8380177 | Laracey | Feb 2013 | B2 |
| 8387873 | Saunders | Mar 2013 | B2 |
| 8401539 | Beenau | Mar 2013 | B2 |
| 8401898 | Chien | Mar 2013 | B2 |
| 8402555 | Grecia | Mar 2013 | B2 |
| 8403211 | Brooks | Mar 2013 | B2 |
| 8412623 | Moon | Apr 2013 | B2 |
| 8412837 | Emigh | Apr 2013 | B1 |
| 8417642 | Oren | Apr 2013 | B2 |
| 8447699 | Batada | May 2013 | B2 |
| 8453223 | Svigals | May 2013 | B2 |
| 8453925 | Fisher | Jun 2013 | B2 |
| 8458487 | Palgon | Jun 2013 | B1 |
| 8484134 | Hobson | Jul 2013 | B2 |
| 8485437 | Mullen | Jul 2013 | B2 |
| 8494959 | Hathaway | Jul 2013 | B2 |
| 8498908 | Mengerink | Jul 2013 | B2 |
| 8504478 | Saunders | Aug 2013 | B2 |
| 8510816 | Quach | Aug 2013 | B2 |
| 8533860 | Grecia | Sep 2013 | B1 |
| 8538845 | Liberty | Sep 2013 | B2 |
| 8555079 | Shablygin | Oct 2013 | B2 |
| 8566168 | Bierbaum | Oct 2013 | B1 |
| 8567670 | Stanfield | Oct 2013 | B2 |
| 8571939 | Lindsey | Oct 2013 | B2 |
| 8577336 | Mechaley, Jr. | Nov 2013 | B2 |
| 8577803 | Chatterjee | Nov 2013 | B2 |
| 8578176 | Mattsson | Nov 2013 | B2 |
| 8583494 | Fisher | Nov 2013 | B2 |
| 8584251 | Mcguire | Nov 2013 | B2 |
| 8589237 | Fisher | Nov 2013 | B2 |
| 8589271 | Evans | Nov 2013 | B2 |
| 8589291 | Carlson | Nov 2013 | B2 |
| 8595098 | Starai | Nov 2013 | B2 |
| 8595812 | Bomar | Nov 2013 | B2 |
| 8595850 | Spies | Nov 2013 | B2 |
| 8606638 | Dragt | Dec 2013 | B2 |
| 8606700 | Carlson | Dec 2013 | B2 |
| 8606720 | Baker | Dec 2013 | B1 |
| 8615468 | Varadarajan | Dec 2013 | B2 |
| 8620754 | Fisher | Dec 2013 | B2 |
| 8635157 | Smith | Jan 2014 | B2 |
| 8646059 | Von Behren | Feb 2014 | B1 |
| 8651374 | Brabson | Feb 2014 | B2 |
| 8656180 | Shablygin | Feb 2014 | B2 |
| 8751391 | Freund | Jun 2014 | B2 |
| 8887308 | Grecia | Nov 2014 | B2 |
| 20010029485 | Brody | Oct 2001 | A1 |
| 20010034720 | Armes | Oct 2001 | A1 |
| 20010054003 | Chien | Dec 2001 | A1 |
| 20020007320 | Hogan | Jan 2002 | A1 |
| 20020016749 | Borecki | Feb 2002 | A1 |
| 20020029193 | Ranjan | Mar 2002 | A1 |
| 20020035548 | Hogan | Mar 2002 | A1 |
| 20020073045 | Rubin | Jun 2002 | A1 |
| 20020116341 | Hogan | Aug 2002 | A1 |
| 20020132662 | Sharp et al. | Sep 2002 | A1 |
| 20020133467 | Hobson | Sep 2002 | A1 |
| 20020147913 | Lun Yip | Oct 2002 | A1 |
| 20030018567 | Flitcroft | Jan 2003 | A1 |
| 20030028481 | Flitcroft | Feb 2003 | A1 |
| 20030130955 | Hawthorne | Jul 2003 | A1 |
| 20030191709 | Elston | Oct 2003 | A1 |
| 20030191945 | Keech | Oct 2003 | A1 |
| 20040010462 | Moon | Jan 2004 | A1 |
| 20040050928 | Bishop | Mar 2004 | A1 |
| 20040059682 | Hasumi | Mar 2004 | A1 |
| 20040093281 | Silverstein | May 2004 | A1 |
| 20040139008 | Mascavage | Jul 2004 | A1 |
| 20040143532 | Lee | Jul 2004 | A1 |
| 20040158532 | Breck | Aug 2004 | A1 |
| 20040210449 | Breck | Oct 2004 | A1 |
| 20040210498 | Freund | Oct 2004 | A1 |
| 20040232225 | Bishop | Nov 2004 | A1 |
| 20040260646 | Berardi | Dec 2004 | A1 |
| 20050037735 | Coutts | Feb 2005 | A1 |
| 20050080730 | Sorrentino | Apr 2005 | A1 |
| 20050108178 | York | May 2005 | A1 |
| 20050199709 | Linlor | Sep 2005 | A1 |
| 20050246293 | Ong | Nov 2005 | A1 |
| 20050269401 | Spitzer | Dec 2005 | A1 |
| 20050269402 | Spitzer | Dec 2005 | A1 |
| 20060235795 | Johnson | Oct 2006 | A1 |
| 20060237528 | Bishop | Oct 2006 | A1 |
| 20060278704 | Saunders | Dec 2006 | A1 |
| 20070107044 | Yuen | May 2007 | A1 |
| 20070129955 | Dalmia | Jun 2007 | A1 |
| 20070136193 | Starr | Jun 2007 | A1 |
| 20070136211 | Brown | Jun 2007 | A1 |
| 20070170247 | Friedman | Jul 2007 | A1 |
| 20070179885 | Bird | Aug 2007 | A1 |
| 20070208671 | Brown | Sep 2007 | A1 |
| 20070245414 | Chan | Oct 2007 | A1 |
| 20070288377 | Shaked | Dec 2007 | A1 |
| 20070291995 | Rivera | Dec 2007 | A1 |
| 20080015988 | Brown | Jan 2008 | A1 |
| 20080029607 | Mullen | Feb 2008 | A1 |
| 20080035738 | Mullen | Feb 2008 | A1 |
| 20080052226 | Agarwal | Feb 2008 | A1 |
| 20080054068 | Mullen | Mar 2008 | A1 |
| 20080054079 | Mullen | Mar 2008 | A1 |
| 20080054081 | Mullen | Mar 2008 | A1 |
| 20080065554 | Hogan | Mar 2008 | A1 |
| 20080065555 | Mullen | Mar 2008 | A1 |
| 20080201264 | Brown | Aug 2008 | A1 |
| 20080201265 | Hewton | Aug 2008 | A1 |
| 20080228646 | Myers | Sep 2008 | A1 |
| 20080243702 | Hart | Oct 2008 | A1 |
| 20080245855 | Fein | Oct 2008 | A1 |
| 20080245861 | Fein | Oct 2008 | A1 |
| 20080283591 | Oder, II | Nov 2008 | A1 |
| 20080302869 | Mullen | Dec 2008 | A1 |
| 20080302876 | Mullen | Dec 2008 | A1 |
| 20080313264 | Pestoni | Dec 2008 | A1 |
| 20090006262 | Brown | Jan 2009 | A1 |
| 20090010488 | Matsuoka | Jan 2009 | A1 |
| 20090037333 | Flitcroft | Feb 2009 | A1 |
| 20090037388 | Cooper | Feb 2009 | A1 |
| 20090043702 | Bennett | Feb 2009 | A1 |
| 20090048971 | Hathaway | Feb 2009 | A1 |
| 20090106112 | Dalmia | Apr 2009 | A1 |
| 20090106160 | Skowronek | Apr 2009 | A1 |
| 20090134217 | Flitcroft | May 2009 | A1 |
| 20090157555 | Biffle | Jun 2009 | A1 |
| 20090159673 | Mullen | Jun 2009 | A1 |
| 20090159700 | Mullen | Jun 2009 | A1 |
| 20090159707 | Mullen | Jun 2009 | A1 |
| 20090173782 | Muscato | Jul 2009 | A1 |
| 20090200371 | Kean | Aug 2009 | A1 |
| 20090248583 | Chhabra | Oct 2009 | A1 |
| 20090276347 | Kargman | Nov 2009 | A1 |
| 20090294527 | Brabson | Dec 2009 | A1 |
| 20090307139 | Mardikar | Dec 2009 | A1 |
| 20090308921 | Mullen | Dec 2009 | A1 |
| 20090327131 | Beenau | Dec 2009 | A1 |
| 20100008535 | Abulafia | Jan 2010 | A1 |
| 20100088237 | Wankmueller | Apr 2010 | A1 |
| 20100094755 | Kloster | Apr 2010 | A1 |
| 20100106644 | Annan | Apr 2010 | A1 |
| 20100120408 | Beenau | May 2010 | A1 |
| 20100133334 | Vadhri | Jun 2010 | A1 |
| 20100138347 | Chen | Jun 2010 | A1 |
| 20100145860 | Pelegero | Jun 2010 | A1 |
| 20100161433 | White | Jun 2010 | A1 |
| 20100185545 | Royyuru | Jul 2010 | A1 |
| 20100211505 | Saunders | Aug 2010 | A1 |
| 20100223186 | Hogan | Sep 2010 | A1 |
| 20100228668 | Hogan | Sep 2010 | A1 |
| 20100235284 | Moore | Sep 2010 | A1 |
| 20100258620 | Torreyson | Oct 2010 | A1 |
| 20100291904 | Musfeldt | Nov 2010 | A1 |
| 20100306076 | Taveau | Dec 2010 | A1 |
| 20100325041 | Berardi | Dec 2010 | A1 |
| 20110010292 | Giordano | Jan 2011 | A1 |
| 20110016047 | Wu | Jan 2011 | A1 |
| 20110016320 | Bergsten | Jan 2011 | A1 |
| 20110040640 | Erikson | Feb 2011 | A1 |
| 20110083018 | Kesanupalli | Apr 2011 | A1 |
| 20110087596 | Dorsey | Apr 2011 | A1 |
| 20110093397 | Carlson | Apr 2011 | A1 |
| 20110125597 | Oder, II | May 2011 | A1 |
| 20110153437 | Archer | Jun 2011 | A1 |
| 20110154466 | Harper | Jun 2011 | A1 |
| 20110161233 | Tieken | Jun 2011 | A1 |
| 20110191244 | Dai | Aug 2011 | A1 |
| 20110238511 | Park | Sep 2011 | A1 |
| 20110238573 | Varadarajan | Sep 2011 | A1 |
| 20110246317 | Coppinger | Oct 2011 | A1 |
| 20110272471 | Mullen | Nov 2011 | A1 |
| 20110272478 | Mullen | Nov 2011 | A1 |
| 20110276380 | Mullen | Nov 2011 | A1 |
| 20110276381 | Mullen | Nov 2011 | A1 |
| 20110276424 | Mullen | Nov 2011 | A1 |
| 20110276425 | Mullen | Nov 2011 | A1 |
| 20110295745 | White | Dec 2011 | A1 |
| 20110302081 | Saunders | Dec 2011 | A1 |
| 20120028609 | Hruska | Feb 2012 | A1 |
| 20120035998 | Chien | Feb 2012 | A1 |
| 20120041881 | Basu | Feb 2012 | A1 |
| 20120047237 | Arvidsson | Feb 2012 | A1 |
| 20120066078 | Kingston | Mar 2012 | A1 |
| 20120072350 | Goldthwaite | Mar 2012 | A1 |
| 20120078735 | Bauer | Mar 2012 | A1 |
| 20120078798 | Downing | Mar 2012 | A1 |
| 20120078799 | Jackson | Mar 2012 | A1 |
| 20120095852 | Bauer | Apr 2012 | A1 |
| 20120095865 | Doherty | Apr 2012 | A1 |
| 20120116902 | Cardina | May 2012 | A1 |
| 20120123882 | Carlson | May 2012 | A1 |
| 20120123940 | Killian | May 2012 | A1 |
| 20120129514 | Beenau | May 2012 | A1 |
| 20120143767 | Abadir | Jun 2012 | A1 |
| 20120143772 | Abadir | Jun 2012 | A1 |
| 20120158580 | Eram | Jun 2012 | A1 |
| 20120158593 | Garfinkle | Jun 2012 | A1 |
| 20120173431 | Ritchie | Jul 2012 | A1 |
| 20120185386 | Salama | Jul 2012 | A1 |
| 20120197807 | Schlesser | Aug 2012 | A1 |
| 20120203664 | Torossian | Aug 2012 | A1 |
| 20120203666 | Torossian | Aug 2012 | A1 |
| 20120215688 | Musser | Aug 2012 | A1 |
| 20120215696 | Salonen | Aug 2012 | A1 |
| 20120231844 | Coppinger | Sep 2012 | A1 |
| 20120233004 | Bercaw | Sep 2012 | A1 |
| 20120246070 | Vadhri | Sep 2012 | A1 |
| 20120246071 | Jain | Sep 2012 | A1 |
| 20120265631 | Cronic | Oct 2012 | A1 |
| 20120271770 | Harris | Oct 2012 | A1 |
| 20120297446 | Webb | Nov 2012 | A1 |
| 20120300932 | Cambridge | Nov 2012 | A1 |
| 20120303503 | Cambridge | Nov 2012 | A1 |
| 20120303961 | Kean | Nov 2012 | A1 |
| 20120304273 | Bailey | Nov 2012 | A1 |
| 20120310725 | Chien | Dec 2012 | A1 |
| 20120310831 | Harris | Dec 2012 | A1 |
| 20120316992 | Oborne | Dec 2012 | A1 |
| 20120317035 | Royyuru | Dec 2012 | A1 |
| 20120317036 | Bower | Dec 2012 | A1 |
| 20130017784 | Fisher | Jan 2013 | A1 |
| 20130019098 | Gupta | Jan 2013 | A1 |
| 20130054337 | Brendell | Feb 2013 | A1 |
| 20130054466 | Muscato | Feb 2013 | A1 |
| 20130054474 | Yeager | Feb 2013 | A1 |
| 20130080327 | Baldrick et al. | Mar 2013 | A1 |
| 20130081122 | Svigals | Mar 2013 | A1 |
| 20130091028 | Oder (“J.D.”), II | Apr 2013 | A1 |
| 20130110658 | Lyman | May 2013 | A1 |
| 20130111599 | Gargiulo | May 2013 | A1 |
| 20130117185 | Collison | May 2013 | A1 |
| 20130124290 | Fisher | May 2013 | A1 |
| 20130124291 | Fisher | May 2013 | A1 |
| 20130124364 | Mittal | May 2013 | A1 |
| 20130138525 | Bercaw | May 2013 | A1 |
| 20130144888 | Faith | Jun 2013 | A1 |
| 20130145148 | Shablygin | Jun 2013 | A1 |
| 20130145172 | Shablygin | Jun 2013 | A1 |
| 20130159178 | Colon | Jun 2013 | A1 |
| 20130166402 | Parento | Jun 2013 | A1 |
| 20130166456 | Zhang | Jun 2013 | A1 |
| 20130173736 | Krzeminski | Jul 2013 | A1 |
| 20130185202 | Goldthwaite | Jul 2013 | A1 |
| 20130191286 | Cronic | Jul 2013 | A1 |
| 20130191289 | Cronic | Jul 2013 | A1 |
| 20130198071 | Jurss | Aug 2013 | A1 |
| 20130200146 | Moghadam | Aug 2013 | A1 |
| 20130204787 | Dubois | Aug 2013 | A1 |
| 20130204793 | Kerridge | Aug 2013 | A1 |
| 20130212007 | Mattsson | Aug 2013 | A1 |
| 20130212017 | Bangia | Aug 2013 | A1 |
| 20130212019 | Mattsson | Aug 2013 | A1 |
| 20130212024 | Mattsson | Aug 2013 | A1 |
| 20130212666 | Mattsson | Aug 2013 | A1 |
| 20130218698 | Moon | Aug 2013 | A1 |
| 20130226813 | Voltz | Aug 2013 | A1 |
| 20130246202 | Tobin | Sep 2013 | A1 |
| 20130246203 | Laracey | Sep 2013 | A1 |
| 20130246258 | Dessert | Sep 2013 | A1 |
| 20130246259 | Dessert | Sep 2013 | A1 |
| 20130246267 | Tobin | Sep 2013 | A1 |
| 20130254028 | Salci | Sep 2013 | A1 |
| 20130254052 | Royyuru | Sep 2013 | A1 |
| 20130254102 | Royyuru | Sep 2013 | A1 |
| 20130254117 | Von Mueller | Sep 2013 | A1 |
| 20130262296 | Thomas | Oct 2013 | A1 |
| 20130262302 | Lettow | Oct 2013 | A1 |
| 20130262315 | Hruska | Oct 2013 | A1 |
| 20130262316 | Hruska | Oct 2013 | A1 |
| 20130262317 | Collinge | Oct 2013 | A1 |
| 20130275300 | Killian | Oct 2013 | A1 |
| 20130275307 | Khan | Oct 2013 | A1 |
| 20130275308 | Paraskeva | Oct 2013 | A1 |
| 20130282502 | Jooste | Oct 2013 | A1 |
| 20130282575 | Mullen | Oct 2013 | A1 |
| 20130282588 | Hruska | Oct 2013 | A1 |
| 20130297504 | Nwokolo | Nov 2013 | A1 |
| 20130297508 | Belamant | Nov 2013 | A1 |
| 20130304649 | Cronic | Nov 2013 | A1 |
| 20130308778 | Fosmark | Nov 2013 | A1 |
| 20130311382 | Fosmark | Nov 2013 | A1 |
| 20130317982 | Mengerink | Nov 2013 | A1 |
| 20130332344 | Weber | Dec 2013 | A1 |
| 20130339253 | Sincai | Dec 2013 | A1 |
| 20130346314 | Mogollon | Dec 2013 | A1 |
| 20140007213 | Sanin | Jan 2014 | A1 |
| 20140013106 | Redpath | Jan 2014 | A1 |
| 20140013114 | Redpath | Jan 2014 | A1 |
| 20140025581 | Calman | Jan 2014 | A1 |
| 20140025585 | Calman | Jan 2014 | A1 |
| 20140025958 | Calman | Jan 2014 | A1 |
| 20140032417 | Mattsson | Jan 2014 | A1 |
| 20140032418 | Weber | Jan 2014 | A1 |
| 20140040137 | Carlson | Feb 2014 | A1 |
| 20140040139 | Brudnicki | Feb 2014 | A1 |
| 20140040144 | Plomske | Feb 2014 | A1 |
| 20140040145 | Ozvat | Feb 2014 | A1 |
| 20140040148 | Ozvat | Feb 2014 | A1 |
| 20140040628 | Fort | Feb 2014 | A1 |
| 20140041018 | Bomar | Feb 2014 | A1 |
| 20140046853 | Spies | Feb 2014 | A1 |
| 20140052532 | Tsai | Feb 2014 | A1 |
| 20140052620 | Rogers | Feb 2014 | A1 |
| 20140052637 | Jooste | Feb 2014 | A1 |
| 20140164243 | Aabye | Jun 2014 | A1 |
| 20150032625 | Dill | Jan 2015 | A1 |
| 20150032626 | Dill | Jan 2015 | A1 |
| 20150032627 | Dill | Jan 2015 | A1 |
| 20150046338 | Laxminarayanan | Feb 2015 | A1 |
| Number | Date | Country |
|---|---|---|
| 2156397 | Feb 2010 | EP |
| 2001035304 | May 2001 | WO |
| 2001035304 | May 2001 | WO |
| 2004042536 | May 2004 | WO |
| 2006113834 | Oct 2006 | WO |
| 2009032523 | Mar 2009 | WO |
| 2010078522 | Jul 2010 | WO |
| 2012068078 | May 2012 | WO |
| 2012098556 | Jul 2012 | WO |
| 2012142370 | Oct 2012 | WO |
| 2012167941 | Dec 2012 | WO |
| 2013048538 | Apr 2013 | WO |
| 2013056104 | Apr 2013 | WO |
| 2013119914 | Aug 2013 | WO |
| 2013179271 | Dec 2013 | WO |
| Entry |
|---|
| Ron White, How Computers Work, Oct. 15, 2003, Que Publishing, 7th Ed. (Year: 2003). |
| 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. |
| Number | Date | Country | |
|---|---|---|---|
| 20160232527 A1 | Aug 2016 | US |
| Number | Date | Country | |
|---|---|---|---|
| 62113671 | Feb 2015 | US |
