Symmetric encryption for private smart contracts among multiple parties in a private peer-to-peer network

Information

  • Patent Grant
  • 11962681
  • Patent Number
    11,962,681
  • Date Filed
    Tuesday, April 4, 2023
    a year ago
  • Date Issued
    Tuesday, April 16, 2024
    8 months ago
  • Inventors
    • Mehta; Vijay (Newport Beach, CA, US)
    • Phan; Alexander (Aliso Viejo, CA, US)
  • Original Assignees
  • Examiners
    • Lemma; Samson B
    Agents
    • Knobbe, Martens, Olson & Bear, LLP
Abstract
Features for providing a secure method of symmetric encryption for private smart contacts among multiple parties in a private peer-to-peer network. The features include a master key representing a unique blockchain ledger. The master key may be shared among multiple participants in a private peer-to-peer network. Sharing of the master key may include communicating the master key in an encrypted message (e.g., email) using public key infrastructure (PKI). In some implementations, more complex distribution features may be includes such as quantum entanglement. The features support instantiation of a smart contract using a specific master key. The request may be submitted as an entry to the ledger with appropriate metadata and/or payload information for identifying and processing the request.
Description
CROSS-REFERENCE TO RELATED APPLICATIONS

Any and all applications for which a foreign or domestic priority claim is identified in the Application Data Sheet as filed with the present application are hereby incorporated by reference under 37 CFR 1.57.


BACKGROUND

Distributed ledgers have enabled new systems for networks of users to create a trusted network for tracking and verifying transactions. Bitcoin is one example of a distributed ledger system for managing a cryptocurrency.


Not all transactions lend themselves to a publicly reviewable ledger system, like Bitcoin. In some instances, a private peer-to-peer network may be established to protect the information stored in the ledger. In such implementations, a limited number of trusted entities participate to provide similar features to the public ledgers. Each entity may record ledger entries and validate entries to confirm entries as authentic. The ledger entries may be associated with a multi-step process. The collection of entries related to one instance of the process may be referred to as a smart contract. However, an entity in the peer-to-peer network may wish to protect the details of their transaction (in total or certain steps) while simultaneous reaping the benefit of the trusted network.


SUMMARY

The present disclosure describes systems and methods for providing a secure method of symmetric encryption for private smart contacts among multiple parties in a private peer-to-peer network.


The systems, methods, and devices of the disclosure each have several innovative aspects, no single one of which is solely responsible for the desirable attributes disclosed herein. In one innovative aspect system for secure distributed electronic ledgering is provided. The system includes a master encryption key store storing a plurality of master encryption keys associated with respective client devices; a distributed electronic ledger storing a record generated by a client device included in the client devices, where the record includes: a first portion including unencrypted metadata. The record includes second portion including an internal encryption key encrypted with a master encryption key. The records includes store also includes a third portion including a request for a service, the request encrypted with the internal encryption key. The system also includes a computer-readable memory storing executable instructions and one or more computer processors in communication with the computer-readable memory, where the one or more computer processors are configured to execute the executable instructions to at least: determine that the record has been added to the distributed electronic ledger based at least in part on the unencrypted metadata, retrieve the master encryption key from the master encryption key store based at least in part on the unencrypted metadata, decrypt the second portion of the record using the master encryption key to obtain the internal encryption key, decrypt the third portion of the record to obtain the request, transmit the request to a service selected based at least in part on the request, receive a response from the service, insert at least a portion of the response into the third portion of the record, encrypt the third portion of the record using an encryption key, and store the record in the distributed electronic ledger. Other embodiments of this aspect include corresponding computer systems, apparatus, and computer programs recorded on one or more computer storage devices, each configured to perform the actions of the methods.


In one innovative aspect a system for secure distributed electronic ledgering is provided. The system includes a computer-readable memory storing executable instructions and one or more computer processors in communication with the computer-readable memory, where the one or more computer processors are configured to execute the executable instructions. Upon execution the instructions cause the one or more computer processors to at least: determine that a record has been added to a distributed electronic ledger based at least in part on unencrypted metadata included in a first portion of the record, where the record further includes: (a) a second portion including an internal encryption key encrypted with a master encryption key, and (b) a third portion including a request for a service, the request encrypted with the internal encryption key; retrieve the master encryption key from a data store based at least in part on the unencrypted metadata; decrypt the second portion of the record using the master encryption key to obtain the internal encryption key; decrypt the third portion of the record to obtain the request; transmit the request to a service selected based at least in part on the request; receive a response from the service; insert at least a portion of the response into the third portion of the record; encrypt the third portion of the record using an encryption key; and store the record in the distributed electronic ledger. Other embodiments of this aspect include corresponding computer systems, apparatus, and computer programs recorded on one or more computer storage devices, each configured to perform the actions of the methods.


Implementations of the systems described may include one or more of the following features. The encryption key used for encrypting the third portion may include the internal encryption key. The one or more computer processors may be further configured to execute the executable instructions to at least: generate a revised internal encryption key in response to obtaining the internal encryption key; and encrypt the second portion of the record using the revised internal encryption key, and where the encryption key used for encrypting the third portion includes the revised internal encryption key. The distributed electronic ledger may be further configured to transmit the record via a network, such as a private peer-to-peer network, to a remote distributed electronic ledger hosted by one of the client devices. The one or more computer processors may be further configured to execute the executable instructions to at least: identify a set of records stored in the distributed electronic ledger including a value in respective unencrypted metadata portions; for individual records in the set of records, retrieve the master encryption key from the master encryption key store based at least in part on unencrypted metadata of a first portion of an individual record, decrypt a second portion of the individual record using the master encryption key to obtain an individual internal encryption key, decrypt a third portion of the individual record using the individual internal encryption key to obtain individual record payload data, and validate the individual record payload data. The one or more computer processors may be further configured to execute the executable instructions to at least: initiate a transfer of resources from a first source identified by the individual record payload data to a destination associated with the service. The innovative features described may include or be implemented by hardware, a method or process, or computer software on a computer-accessible medium.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram illustrating an example private peer-to-peer network between three entities.



FIG. 2 is a process diagram illustrating an ordered process for providing a credit inquiry response using a distributed ledger.



FIG. 3 is a block diagram showing example components of a distributed ledger computing system.





DETAILED DESCRIPTION

A master key, representing a unique blockchain ledger, may be shared among multiple participants in a private peer-to-peer network. Sharing of the master key may include communicating the master key in an encrypted message (e.g., email) using public key infrastructure (PKI). In some implementations, more complex distribution features may be includes such as quantum entanglement. A smart contract may be instantiated when requesting a service or data using a specific master key. The request may be submitted as an entry to the ledger with appropriate metadata and/or payload information for identifying and processing the request. On creation, the smart contract may include a randomly generated internal key that may remain private for the life of the smart contract. The internal key may be used to encrypt confidential data within the smart contract, and then the master key may, in turn, be used to encrypt the internal key. This process ensures that the smart contract can only be read and modified by participants of the smart contract holding the proper keys. Each participant has access to the shared master key. With exception of non-confidential transactional metadata, the smart contract remains opaque to other non-participating peers of the private blockchain network.


Master Key and Internal Key


Both the master key and internal key are a form of symmetric encryption; there is no public component as it occurs in PKI encryption.


Master keys may be shared between organizations participating in the private peer-to-peer network. Each master key may represent a blockchain ledger. Each transaction may use one and only one master key. The master key may be used to encrypt the internal key of the smart contract, after the internal key has encrypted the confidential elements of the blockchain contract (e.g., ledger record). The master key, along with metadata for the ledger record, may serve as a signature of each participating organization.


A master key preferably is associated with a unique identifier. Participant systems may use the unique identifier to optimize key identification and retrieval from each organization's key stores. Transmission of master keys outside of a peer's information security boundaries may be minimized or restricted to protect the integrity of the keys. Life-cycle management of the master key can be tied to business contracts and may be non-permanent. For example, a master key may be generated for transactions occurring within a period of time (e.g., monthly, quarterly, annually). A master key may represent a shared blockchain ledger that can be validated by peers who possess the master key. The master key may represent the shared blockchain ledger because without the appropriate master key, the block cannot be assembled into a chain and verified. Once decrypted using the associated master key, the block can be read and verified.


Internal keys are never exposed outside of a smart contract. Opening a smart contract may require the appropriate master key and identifying metadata that uniquely identifies the entity that can open the smart contract. This metadata could be the hash-hash of the public key that represents a blockchain account, or wallet, of the entity that is authorized to open the smart contract. Opening a smart contract with the appropriate master key may first decrypt the internal key. Once the internal key is decrypted, the internal key may be used to decrypt one or more confidential components of the smart contract.


Closing the smart contract is also performed using a master key. The master key may be used to encrypt the internal key after the internal key encrypts the smart contract data. The internal key may or may not be regenerated for improved security after a successful opening. The actual nature of the internal key may be completely opaque to all elements external to the smart contract. Providing the master key to close the contract can protect the internal key and also can be used as a signature of the transaction for “lite” verification/validation.


Private Peer-to-Peer Network


Unlike current implementations of digital currency, the private smart contracts, or blockchain blocks, described herein may be processed in a private peer-to-peer network. The network may include consensus servers, maintained by each peer, and coupled via secured communication links such as a virtual private network or tunneled network. The consensus servers may validate smart contracts between two or more peers. Validation may include confirming that the entries are authentic (e.g., entered by the party claiming to have authored the entry) and non-repudiated (e.g., not reversed or otherwise indicated as an error).


Each organization that participates in the private distributed, blockchain network may implement a consensus server. Each peer's consensus server may only have access to master keys for blockchain ledgers that the peer has a right to access. The right may be assigned by a central authority or through communications between entities. One or more master keys may be required to open, or decrypt the contract, for validation. For smart contracts associated with master keys that are not contained or associated with the organization, may be unreadable and thus cannot be validated by the organization. Such records may be dropped or excluded from validation by the unaffiliated organization. For example, some unencrypted metadata may be provided such as a token or identifier to retrieve the master key. Other metadata may be included for identification of a party or a transaction or a transaction type. For instance, in a contract between three or more parties, each party may want to know who updated a record and in what way. The metadata or a portion thereof may include an encrypted token that can only be decrypted by the token's owner. The encrypted metadata (e.g., private metadata) may not be used for blockchain verification. The private metadata may be used for identifying or confirming transactions. Other parties may the private metadata as base64-encoded data without understanding the true contents.


Because these blocks are secured using master keys, these blocks remain opaque to unauthorized parties without the appropriate master key(s).


A smart blockchain contract may include one or more of the following elements:

    • An embedded, non-retrievable, encrypted private key;
    • A confidential request for the execution of a credit-reporting service;
    • A confidential credit report, or payload, that fulfills the request;
    • Confidential metadata that describes the transaction; or
    • Non-confidential metadata used for routing, delivery, and fulfillment.



FIG. 1 is a block diagram illustrating an example private peer-to-peer network between three entities. The three entities shown in the private peer-to-peer network include Entity A 110, Entity B 120, and Entity C 130. Each entity may include its own instance of a consensus server (e.g., 115, 125, and 135, respectively). However, the information that can be validated may be limited to the records in the blockchains that relate to the entity. In this way, each entity can replicate records across the peer-to-peer network but retain privacy for individual records. Although not shown, Entity A 110, Entity B 120, and Entity C 130 may be in data communication via one or more of a wired or wireless network which may be public or private. In the case of a public network, the connection between the entities may be secured such as by using one or more of a virtual private network, tunneling, encryption, or other means to secure connections between the entities and data transmitted thereby.



FIG. 1 illustrates aspects of a system 100 for secure distributed electronic ledgering. The system 100 may include a master encryption key store storing a plurality of master encryption keys associated with respective client devices. The system 100 may include a distributed electronic ledger (e.g., blockchains) storing one or more records generated by the client device. A record may include a first portion including unencrypted metadata. The record may include a second portion including an internal encryption key (“blockchain key”) encrypted with a master encryption key. The record may include a third portion including a request for a service, the request encrypted with the internal encryption key.


The system 100 may include a device such as a server or other electronic communication device. The electronic communication device may include or be coupled with a computer-readable memory storing executable instructions. One or more computer processors (e.g., of the device) may be in communication with the computer-readable memory. The one or more computer processors may be configured to execute the executable instructions to determine the record has been added to the distributed electronic ledger based at least in part on the unencrypted metadata, retrieve the master encryption key from the master encryption key store based at least in part on the unencrypted metadata, decrypt the second portion of the record using the master encryption key to obtain the internal encryption key, decrypt the third portion of the record to obtain the request, transmit the request to a service selected based at least in part on the request, receive a response from the service, insert at least a portion of the response into the third portion of the record, encrypt the third portion of the record using an encryption key, and store the record in the distributed electronic ledger.


The encryption key used for encrypting the third portion may include the internal encryption key. In some implementations, the internal encryption key may be a one-time-use key and, once used for decrypting, be discarded. In such implementations, the one or more computer processors may be further configured to execute the executable instructions to generate a revised internal encryption key in response to obtaining the internal encryption key and encrypt the second portion of the record using the revised internal encryption key. In such implementations, the encryption key used for encrypting the third portion may include the revised internal encryption key.


The distributed electronic ledger may be configured to transmit the record via a network to a remote distributed electronic ledger hosted by one of the client devices. This ensures that other trusted entities receive the records at least for replicated storage and, when authorized, remote validation. The network may include a private peer-to-peer network.


The one or more computer processors may be configured to execute the executable instructions to identify a set of records stored in the distributed electronic ledger including a value in respective unencrypted metadata portions. For individual records in the set of records, the processors may execute instructions to retrieve the master encryption key from the master encryption key store based at least in part on unencrypted metadata of a first portion of an individual record, decrypt a second portion of the individual record using the master encryption key to obtain an individual internal encryption key, decrypt a third portion of the individual record using the individual internal encryption key to obtain individual record payload data, and validate the individual record payload data. Validation may be dynamically assessed based on the smart contract. For example, a contract for a specified model can return a score while another model may return one thousand or more attributes (each of which may be requested separately). In such instances, each contract may include a validation code (e.g., a regular expression that tests the range of values). Validation may be similar to validating credit card transactions, where each party gets a chance to review transactions before reconciling the accounts. Unlike credit transactions though, each party gets to build the blockchains for independent real-time verification, regardless of when transaction is completed. In some implementations, real-time account reconciliation may be provided. The reconciliation may include guards or limits on the number of transactions or total cost associated with transactions.


In some implementations, the one or more computer processors may be further configured to execute the executable instructions to initiate a transfer of resources from a first source identified by the individual record payload data to a destination associated with the service.


Example Method of Contract Creation


The method of creating a smart contract 160 may be implemented by a computing device such as a consensus server and/or access device used to submit contract information to the consensus server. Entity A 110 may instantiate a smart contract for a service or data request with Entity B 120. The internal key 170 (“blockchain key”) may be randomly generated.


Entity A 110 may create and stores a service request. The blockchain address that represents Entity A's account may be added to the confidential request. The account information may be used to reconcile payment for the requested service. Metadata for the ledger entry may be updated.


Entity A may close the smart contract 160 by using a master key shared with other entities involved in processing the request. Closure may include automatically encrypting all or specific confidential components of the smart contract with the internal key 170. In this example, Entity A encrypts the internal key (“blockchain key”) with the master key 190 shared with Entity B 120.


Entity A may submit the private blockchain contract to the network or service endpoint for fulfillment. Submitting the contract 160 may include recording the record on the distributed ledger. The consensus server 115 of Entity A 110 may include a replication process to disseminate records to other peers on the network.


Having created the contract 160, the ledger may be monitored by an entity (e.g., Entity B). The monitoring may include identifying entries in the ledger with specific metadata or record type. Once a record is identified by an entity that can provide the requested service or data, the entity may initiate processing to fulfill the request identified by the contract 160.


Example Method of Contract Fulfillment


A method of fulfilling a smart contract may be implemented by a computing device such as a consensus server and/or access device used to submit contract information to the consensus server. Continuing from the example contract creation method discussed above, the consensus server 125 of Entity B 120 may receive the smart blockchain contract 160 and, based at least in part on metadata or record type for the contract 160, identify the contract 160 as a request for a service or data provided by Entity B 120.


Metadata included in the contract 160, such as a UUID of the master key 190, may be used to find the appropriate master key (e.g., the master key 190). If the master key is identified, then the contract 160 can be fulfilled by Entity B 120. The master key 190 may be retrieved from a data store or secured key store (not shown). Entity B 120 may use the master key 190 to decrypt the internal key 170 for opening the smart contract 160. The internal key 170 may then be used to decrypt the confidential components 180 of the smart contract 160. In some implementations, a new internal key may be randomly regenerated after the successful decryption of the smart contract data. Once the contract data is decrypted, Entity B may continue processing the contract 160 to extract the request information to fulfill the request.


Entity B 120 may store one or more results of the service request in the smart contract 160. One example of a service request is a request for credit information about a user. In such implementations, the request may include information identifying the user for which credit information is being requested. Another example of a service is generating a numeric or qualitative score. For example, a service provider may implement thousands of models that accept input values and generate numeric score or qualitative attributes for the provided input values. In some implementations, the smart contract 160 may embed a model. For example, a user may create the contract 160 by sending the appropriate factors to a server or appliance of the service provider. The contract 160 may execute immediately and store the requested score/attribute/information in the contract 160. It can immediately be sent for peer verification. Service providers and customers may be interested in using blockchain technologies to identify and prevent transactional behaviors. For example, “loan-stacking” is a transactional behavior where a user intentionally or unintentionally exceeds a predetermined credit-to-income ratio threshold by applying for and receiving credit in a short amount of time. The current delay in information about credit applications can cause this stacking. By using blockchain smart contracts, all participants can have current transaction history (e.g., credit application history) in real-time for a user to ensure behavior consistent with the predetermined criteria.


Entity B 120 may add metadata, including, for example, a blockchain address for an account that may receive payment.


Entity B 120 may close the smart contract with the master key 190. To close the smart contract 160, the internal key 170 may first be used to encrypt all or specified confidential components 180 of the smart contract 160. The master key 189 may then be used to encrypt the internal key 170.


Entity B 129 may transmit the blockchain representing the smart contact to the peer-to-peer network for external validation by consensus servers associated with other entities (e.g., Entity A). Entity B 129 can also immediately validate the smart contract 160 on a server it controls.


Example Method of Contract Validation


Entity A 110 and Entity B 120 may manage internal consensus servers 115 and 125, respectively. A consensus server may be “internal” to an entity if it is controlled by the entity. The consensus servers 115 and 125 for Entity A 110 and Entity B 120 may each have access to the master key 190 that represents the relationship between Entity A 110 and Entity B 120. Validation can be initiated after the master key 190 is used to decrypt the internal key 170 embedded in the smart contract 160. Validation may be performed by both parties. Reconciliation of accounts can be performed at a predetermined time such as: post-transaction, real-time, batch schedule, etc. In some implementations, more than two parties may coordinate satisfaction of a contract. In such implementations, each participant may have access to a master key for the contract. For example, all three entities shown in FIG. 1 have access to master key 192 which may be used for protecting an internal key 172 for a smart contract 162 associated with all three entities.


Validation may include one or more mathematical processes (e.g., a Merkle root, proof-of-work, nonces, algos, and degrees of difficulty, etc.) to confirm the integrity of the blockchain similar to those used to verify Bitcoin transactions. These processes can be resource intensive as the number of parties and records increase.


One non-limiting advantage of the master key features described is to decrease the resources needed to validate records. For example, opening and closing with the correct master key and required metadata provides a digital signature. The ledger is maintained in a private peer-to-peer network, which also provides some level of trust and protection (e.g., from distributed denial of service attacks) for the ledger. In light of these safeguards, the verification may bypass the resource intensive mathematical approach, which is designed to protect against shortcomings of an open network and total lack of trust. Validation can be done by verifying the integrity of the contract and some protected metadata such as decrypting an internal token that was encrypted with one's public key. The approach described is also one way for two participants in a multi-party contract to exchange private data and still share a core contract with all parties.


Discussion of Certain Features and Non-Limiting Advantages


Symmetric encryption in the form of shared master keys and internal keys, embedded in smart contracts, enables multiple parties to participate in confidential transactions using blockchain technology.


Shared master keys each represent non-permanent blockchain ledgers between two or more parties.


Master keys can be recreated on a predictable basis, which defines may a lifecycle for the corresponding blockchain. Recreation of the master key can be done to improve security, limit the blockchain length, or reduce the resources needed to process and validate smart contracts.


The smart contract can only be opened, closed and processed (read, modified) using the appropriate master key. Without the appropriate master key, the smart contract (or at least its confidential components) may remain encrypted and opaque to non-participating peers and outside-network entities.


The smart contract can expose a limited set of functions to retrieve and store data. The smart contract never exposes the internal key. It is a program that has blockchain components (headers, use of PKI to represent accounts/wallets/addresses, etc.) but also has the “smart” parts: the private encryption key, public metadata, encrypted data and encrypted metadata. Some possible functions that may be used to access the smart contact are shown in Table 1 below. The functions in Table 1 enable the smart contract to be implemented as a “black box” requiring little if any knowledge of the implementation on the part of the participating parties.










TABLE 1





Example Functions
Descriptions







boolean open(master_key,
Opens a new smart contract using the


metadata);
specified master key and metadata. May



return true if the open was successful and



false if open failed.


request getRequest( );
Obtains the request included in the smart



contract. May require successful opening



prior to obtaining the request.


void saveRequest(request);
Includes the specified request in the smart



contract. The request may include a request



for a service or information.


data getData( );
Retrieve the data included in the smart



contract. The data may represent a result or



response to the request.


void saveData(data);
Save data in the smart contract. The data



may represent a result or response to the



request.


boolean checkData( );
Confirms whether data is included in the



contract. Returns true if included and false if



not included.


boolean isValid( );
Confirms whether data included in the



contract is valid. Validity may be assessed



based on who added data to the smart



contract as well as what data was added to



the smart contract. Returns true if valid and



false if invalid.


boolean close(master_key,
Closes the smart contract using the


metadata);
specified master key and metadata. May



return true if the close was successful and



false if close failed.









The internal key can be seamlessly auto-regenerated after successfully being decrypted by the master key and after being used by the smart contract to decrypt the confidential components.


Consensus servers may be included. The consensus servers may be included to provide the appropriate master keys in order to validate and build the blockchains.


Validation can be done with appropriate blockchain algorithms (such as Ethereum or Bitcoin's proof-of-work) or short-circuited; the act of closing a smart contract with the appropriate master key and metadata can be agreed as a legally binding, fully auditable action since only parties involved in the smart contract have access to the matching master key and supportive metadata. Hence, validation can be computationally very fast. Short-circuiting may be included where participants rely on the private network and master/internal key features to protect the ledger rather than expending resources to perform resource intensive record validation, as discussed herein.


These private smart contracts can be used to request services with or without return of data.


Example Use Case—User Credit Inquiry


The private peer-to-peer network features described may be used to provide secure transactions in a variety of systems. One example use case is a private peer-to-peer network for entities to submit credit inquiries such as part of processing a loan application. In such examples, Entity A from FIG. 1 above may be a bank or other entity deciding whether to extend credit. Entity B may be a credit reporting agency with access to user data for generating credit scores or reports.



FIG. 2 is a process diagram illustrating an ordered process (steps 0-14) for providing a credit inquiry response using a distributed ledger. FIG. 2 shows various exemplary systems that may participate in the use case such as a subscriber (e.g., customer of the service), subscriber agent (e.g., a system or device that that represents the subscriber in a transaction), hyperledger (e.g., a private distributed ledger data store similar to a Bitcoin Wallet), docker engine (e.g., a container that executes a single program, such as the agents); a message queue that stores intermediate data (e.g., Kafka message queues); consensus servers (e.g., machines that can mathematically verify that the signed transaction is valid. Consensus servers can be operated by both service providers and service subscribers for independent verification), other agents (e.g., systems configured to perform a single set of related tasks such as generating models, retrieving or processing inputs for the model, processing/formatting output from the model).


In the example shown in FIG. 2, a subscriber integrates with a service provider's distributed applications platform. The subscriber may create a hyperledger account with associated private and public keys. The subscriber may initiate a request to calculate a model value for a specific user through an agent process. The subscriber agent may execute the request using one of the public/private key combinations associated with the subscriber account. The request may include information about the user and metadata concerning the transaction.


The service provider's application programming interface (API) endpoint may perform a security check using the metadata. The security check may include confirming unencrypted metadata is present or that valid unencrypted metadata values are provided such that the values may be used to identify a party. Examples of such metatdata include subscriber identifier, IP address, ledger address, account identifier, etc. In some implementations, the security check may include comparing one or more values to a “whitelist” of approved values. If a value included in a contract appears on the whitelist, the contract may be permitted. The security check may be an operational security feature on the request. Additional validation of the transaction may be performed later in the processing. The user information is used to generate a lookup key for the service provider data that represents the user. In this example, the user/consumer information is provided by the requesting agent and used to find the data in the service provider's database. However, the user information may be indirectly provided, inferred, or obtained such as based on values included in the smart contract.


The entire transaction may then be buffered in a message queue. The queue may be processed in real-time as a stream. Each transaction may be “pulled” by a listening agent, such as the customer transaction information profile (CTIP) agent shown in FIG. 2. The CTIP agent may retrieve the user data based at least in part on the lookup key. The CTIP agent may process the user data to generate input data for another system such as the scoring agent. As discussed, the model may be stored as part of the smart contact. In the example shown, the Scoring Agent executes and stores the specific model (e.g., VantageV3), provides a reference to a service provider's hyperledger account using one of several associated private/public keys, transaction cost and associated metadata. The model result is then stored in a Subscriber-specific topic in the transaction buffer. A sales agent, which may be listening to that specific message queue topic on behalf of the subscriber, may “pull” transaction results in real-time and delivers it back to the subscriber agent to complete the transfer of cost. The subscriber agent may receive the transaction result and authorizes the transfer of cost to the service provider's hyperledger, referenced by the hyperledger address associated with the smart contract. The entire transaction may be represented as a blockchain that is then validated by internal and external consensus servers. The results provide real-time visibility on the transaction processing and allocation of resources for the transaction (e.g., billing).


The hyperledger may be implemented using alternate technologies dissimilar from a Bitcoin Wallet, or similar digital currency container. The implementation of the hyperledger should provide an electronic account ledger that a service provider or a service subscriber can visualize in real-time and can both validate independently. The visualization may include real-time monitoring of the ledger to identify requests and responses thereto. The visualization may include a user interface to present monitoring information in aggregate (e.g., for a particular party, request type, user(s), etc.) or for a specific request. The interface may include indicators as to whether the smart contract or elements included therein are valid. The hyperledger can be incremented up and down, even to negative values if no digital currency is used. Transfers of actual resources (e.g., money) can occur at pre-agreed intervals, including real-time.


Example System Implementation and Architecture



FIG. 3 is a block diagram showing example components of a distributed ledger computing system 300. The computing system 300 includes, for example, a personal computer that is IBM, Macintosh, or Linux/Unix compatible or a server or workstation. In one embodiment, the computing system 300 comprises a server, a laptop computer, a smart phone, a personal digital assistant, a kiosk, or a media player, for example. In one embodiment, the exemplary computing system 300 includes one or more central processing unit (“CPU”) 305, which may each include a conventional or proprietary microprocessor. The computing system 300 further includes one or more memory 332, such as random access memory (“RAM”) for temporary storage of information, one or more read only memory (“ROM”) for permanent storage of information, and one or more mass storage device 322, such as a hard drive, diskette, solid state drive, or optical media storage device. Typically, the components of the computing system 300 are connected using a standard based bus system 390. In different embodiments, the standard based bus system 390 could be implemented in Peripheral Component Interconnect (“PCI”), Microchannel, Small Computer System Interface (“SCSI”), Industrial Standard Architecture (“ISA”) and Extended ISA (“EISA”) architectures, for example. In addition, the functionality provided for in the components and modules of computing system 300 may be combined into fewer components and modules or further separated into additional components and modules.


The computing system 300 is generally controlled and coordinated by operating system software, such as Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, Unix, Linux, SunOS, Solaris, iOS, Blackberry OS, or other compatible operating systems. In Macintosh systems, the operating system may be any available operating system, such as MAC OS X. In other embodiments, the computing system 300 may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface, such as a graphical user interface (“GUI”), among other things.


The exemplary computing system 300 may include one or more commonly available input/output (I/O) devices and interfaces 312, such as a keyboard, mouse, touchpad, and printer. In one embodiment, the I/O devices and interfaces 312 include one or more display devices, such as a monitor, that allows the visual presentation of data to a user. More particularly, a display device provides for the presentation of GUIs, application software data, and multimedia presentations, for example. The computing system 300 may also include one or more multimedia devices 342, such as speakers, video cards, graphics accelerators, and microphones, for example.


In the embodiment of FIG. 3, the I/O devices and interfaces 312 provide a communication interface to various external devices. In the embodiment of FIG. 3, the computing system 300 is electronically coupled to one or more networks, which comprise one or more of a LAN, WAN, and/or the Internet, for example, via a wired, wireless, or combination of wired and wireless, communication link. The networks communicate with various computing devices and/or other electronic devices via wired or wireless communication links, such as the credit Bureau data source and financial information data sources.


In some embodiments, information may be provided to the computing system 300 over a network from one or more data sources. The data sources may include one or more internal and/or external data sources that provide transaction data, such as credit issuers (e.g., financial institutions that issue credit cards), transaction processors (e.g., entities that process credit card swipes at points of sale), and/or transaction aggregators. The data sources may include internal and external data sources which store, for example, credit bureau data (for example, credit bureau data from File OneSM) and/or other user data. In some embodiments, one or more of the databases or data sources may be implemented using a relational database, such as Sybase, Oracle, CodeBase and Microsoft® SQL Server as well as other types of databases such as, for example, a flat file database, an entity-relationship database, and object-oriented database, and/or a record-based database.


In general, the word “module,” as used herein, refers to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, Lua, C or C++. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC, Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software modules configured for execution on computing devices may be provided on a computer-readable medium, such as a compact disc, digital video disc, flash drive, or any other tangible medium. Such software code may be stored, partially or fully, on a memory device of the executing computing device, such as the computing system 300, for execution by the computing device. Software instructions may be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. The modules described herein are preferably implemented as software modules, but may be represented in hardware or firmware. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage.


In the example of FIG. 3, the modules 310 may be configured for execution by the CPU 305 to perform any or all of the process discussed above with reference to FIG. 1 or 2. Depending on the embodiment, certain processes, or in the processes, or groups of processes discussed herein may be performed by multiple devices, such as multiple computing system similar to computing system 300. For example, depending on the embodiment, certain of the processes described herein may be performed by a computing system that obtains and stores the ledger, while other processes are performed by systems or devices that access the ledger for validation and yet others are performed by systems or devices that monitor, read, or write to the ledger or process requests submitted thereby.


Additional Embodiments

Each of the processes, methods, and algorithms described in the preceding sections may be embodied in, and fully or partially automated by, code modules executed by one or more computer systems or computer processors comprising computer hardware. The code modules may be stored on any type of non-transitory computer-readable medium or computer storage device, such as hard drives, solid state memory, optical disc, and/or the like. The systems and modules may also be transmitted as generated data signals (for example, as part of a carrier wave or other analog or digital propagated signal) on a variety of computer-readable transmission mediums, including wireless-based and wired/cable-based mediums, and may take a variety of forms (for example, as part of a single or multiplexed analog signal, or as multiple discrete digital packets or frames). The processes and algorithms may be implemented partially or wholly in application-specific circuitry. The results of the disclosed processes and process steps may be stored, persistently or otherwise, in any type of non-transitory computer storage such as, for example, volatile or non-volatile storage.


The various features and processes described above may be used independently of one another, or may be combined in various ways. All possible combinations and sub-combinations are intended to fall within the scope of this disclosure. In addition, certain method or process blocks may be omitted in some implementations. The methods and processes described herein are also not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate. For example, the described blocks or states may be performed in an order other than that specifically disclosed, or multiple blocks or states may be combined in a single block or state. The example blocks or states may be performed in serial, in parallel, or in some other manner. Blocks or states may be added to or removed from the disclosed example embodiments. The example systems and components described herein may be configured differently than described. For example, elements may be added to, removed from, or rearranged compared to the disclosed example embodiments.


Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.


As used herein a “data store” may be embodied in hard disk drives, solid state memories and/or any other type of non-transitory computer-readable storage medium accessible to or by a device such as an access device, server, or other computing device described. A data store may also or alternatively be distributed or partitioned across multiple local and/or remote storage devices as is known in the art without departing from the scope of the present disclosure. In yet other embodiments, a data store may include or be embodied in a data storage web service.


As used herein, the terms “determine” or “determining” encompass a wide variety of actions. For example, “determining” may include calculating, computing, processing, deriving, looking up (e.g., looking up in a table, a database or another data structure), ascertaining and the like. Also, “determining” may include receiving (e.g., receiving information), accessing (e.g., accessing data in a memory) and the like. Also, “determining” may include resolving, selecting, choosing, establishing, and the like.


As used herein, the term “selectively” or “selective” may encompass a wide variety of actions. For example, a “selective” process may include determining one option from multiple options. A “selective” process may include one or more of: dynamically determined inputs, preconfigured inputs, or user-initiated inputs for making the determination. In some implementations, an n-input switch may be included to provide selective functionality where n is the number of inputs used to make the selection.


As used herein, the terms “provide” or “providing” encompass a wide variety of actions. For example, “providing” may include storing a value in a location for subsequent retrieval, transmitting a value directly to the recipient, transmitting or storing a reference to a value, and the like. “Providing” may also include encoding, decoding, encrypting, decrypting, validating, verifying, and the like.


As used herein, the term “message” encompasses a wide variety of formats for communicating (e.g., transmitting or receiving) information. A message may include a machine readable aggregation of information such as an XML document, fixed field message, comma separated message, or the like. A message may, in some implementations, include a signal utilized to transmit one or more representations of the information. While recited in the singular, it will be understood that a message may be composed, transmitted, stored, received, etc. in multiple parts.


As used herein a “user interface” (also referred to as an interactive user interface, a graphical user interface or a UI) may refer to a network based interface including data fields and/or other controls for receiving input signals or providing electronic information and/or for providing information to the user in response to any received input signals. A UI may be implemented in whole or in part using technologies such as hyper-text mark-up language (HTML), ADOBE® FLASH®, JAVA®, MICROSOFT® .NET®, web services, and rich site summary (RSS). In some implementations, a UI may be included in a stand-alone client (for example, thick client, fat client) configured to communicate (e.g., send or receive data) in accordance with one or more of the aspects described.


Any process descriptions, elements, or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those skilled in the art.


All of the methods and processes described above may be embodied in, and partially or fully automated via, software code modules executed by one or more general purpose computers. For example, the methods described herein may be performed by the computing system and/or any other suitable computing device. The methods may be executed on the computing devices in response to execution of software instructions or other executable code read from a tangible computer-readable medium. A tangible computer-readable medium is a data storage device that can store data that is readable by a computer system. Examples of computer-readable mediums include read-only memory, random-access memory, other volatile or non-volatile memory devices, CD-ROMs, magnetic tape, flash drives, and optical data storage devices.


It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are to be understood as being among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure. The foregoing description details certain embodiments. It will be appreciated, however, that no matter how detailed the foregoing appears in text, the systems and methods can be practiced in many ways. As is also stated above, it should be noted that the use of particular terminology when describing certain features or aspects of the systems and methods should not be taken to imply that the terminology is being re-defined herein to be restricted to including any specific characteristics of the features or aspects of the systems and methods with which that terminology is associated.

Claims
  • 1. A system for secure distributed electronic ledgering, the system comprising: a distributed electronic ledger storing a set of records, wherein at least one record in the set of records includes a request for a service, the request encrypted with an encryption key;a computer-readable memory storing executable instructions; andone or more computer processors in communication with the computer-readable memory, wherein the one or more computer processors are configured to execute the executable instructions to at least: decrypt the request for the service using the encryption key;transmit the request to a service provider;receive a response from the service provider;insert at least a portion of the response into the record;encrypt the record including the portion of the response using the encryption key; andstore the record in the distributed electronic ledger.
  • 2. The system of claim 1, wherein the one or more computer processors are further configured to determine that the at least one record has been added to the distributed electronic ledger.
  • 3. The system of claim 2, wherein the at least one record further includes unencrypted metadata, wherein the determination that the at least one record has been added is based on the unencrypted metadata.
  • 4. The system of claim 1, wherein the service provider is selected based at least in part on the at least one request.
  • 5. The system of claim 1, wherein the at least one record is generated by a client device of a plurality of client devices.
  • 6. The system of claim 1, wherein the encryption key is encrypted with a master encryption key stored in a master encryption key store storing a plurality of master encryption keys associated with respective client devices, wherein the at least one record further comprises the encrypted encryption key.
  • 7. The system of claim 1, wherein the request for the service includes at least one of: a request for a credit reporting service, a request for a credit report, or a request for information related to a transaction.
  • 8. The system of claim 1, wherein the distributed electronic ledger is configured to transmit the at least one record via a network to a remote distributed electronic ledger hosted by a client device of a plurality of client devices.
  • 9. The system of claim 8, wherein the network comprises a private peer-to-peer network.
  • 10. The system of claim 1, wherein the one or more computer processors are further configured to: identify the set of records stored in the distributed electronic ledger including a value in respective unencrypted metadata portions;for individual records in the set of records: (i) retrieve a master encryption key from a master encryption key store based at least in part on unencrypted metadata of an individual record, wherein the master encryption key store stores a plurality of master encryption keys associated with respective client devices;(ii) decrypt a second portion of the individual record using the master encryption key to obtain an individual internal encryption key;(iii) decrypt a third portion of the individual record using the individual internal encryption key to obtain individual record payload data; and(iv) validate the individual record payload data.
  • 11. A method comprising: at a distributed electronic ledger storing a record that includes an encrypted request for service, decrypting the encrypted request using an encryption key;transmitting the decrypted request to a service provider;receiving a response from the service provider;inserting at least a portion of the response into the record;encrypting the record including the portion of the response using the encryption key; andstoring the record in the distributed electronic ledger.
  • 12. The method of claim 11, wherein the method further comprises: generating a revised encryption key in response to obtaining the encryption key; andencrypting the encryption key using the revised encryption key.
  • 13. The method of claim 11, wherein the distributed electronic ledger is configured to transmit the record via a network to a remote distributed electronic ledger hosted by a client device of a plurality of client devices.
  • 14. The method of claim 13, wherein the network comprises a private peer-to-peer network.
  • 15. The method of claim 11, wherein the method further comprises: identifying a set of records stored in the distributed electronic ledger including a value in respective unencrypted metadata portions;for individual records in the set of records: (i) retrieving a master encryption key from a master encryption key store based at least in part on unencrypted metadata of an individual record;(ii) decrypting a second portion of the individual record using the master encryption key to obtain an individual internal encryption key;(iii) decrypting a third portion of the individual record using the individual internal encryption key to obtain individual record payload data; and(iv) validating the individual record payload data.
  • 16. The method of claim 15, wherein the method further comprises initiating a transfer of resources from a first source identified by the individual record payload data to a destination associated with the service.
  • 17. A non-transitory computer storage medium storing computer-executable instructions that, when executed by a processor, cause the processor to perform the following method: at a distributed electronic ledger storing a record that includes an encrypted request for service, decrypting the encrypted request using an encryption key;transmitting the request to a service provider;receiving a response from the service provider;inserting at least a portion of the response into the record;encrypting the record including the portion of the response using the encryption key; andstoring the record in the distributed electronic ledger.
  • 18. The non-transitory computer storage medium of claim 17, wherein the method further comprises: generating a revised encryption key in response to obtaining the encryption key; andencrypting the encryption key using the revised encryption key.
  • 19. The non-transitory computer storage medium of claim 17, wherein the distributed electronic ledger is configured to transmit the record via a network to a remote distributed electronic ledger hosted by a client device.
US Referenced Citations (1006)
Number Name Date Kind
3316395 Lavin et al. Apr 1967 A
4346442 Musmanno Aug 1982 A
4491725 Pritchard Jan 1985 A
4774664 Campbell et al. Sep 1988 A
4812628 Boston et al. Mar 1989 A
4872113 Dinerstein Oct 1989 A
4891503 Jewell Jan 1990 A
4947028 Gorog Aug 1990 A
5239462 Jones et al. Aug 1993 A
5274547 Zoffel et al. Dec 1993 A
5301105 Cummings, Jr. Apr 1994 A
5500513 Langhans et al. Mar 1996 A
5557514 Seare et al. Sep 1996 A
5583760 Klesse Dec 1996 A
5590038 Pitroda Dec 1996 A
5611052 Dykstra et al. Mar 1997 A
5640577 Scharmer Jun 1997 A
5644778 Burks et al. Jul 1997 A
5649114 Deaton et al. Jul 1997 A
5659725 Levy et al. Aug 1997 A
5696907 Tom Dec 1997 A
5699527 Davidson Dec 1997 A
5704044 Tarter et al. Dec 1997 A
5739512 Tognazzini Apr 1998 A
5754632 Smith May 1998 A
5754939 Herz et al. May 1998 A
5764923 Tallman et al. Jun 1998 A
5774883 Andersen Jun 1998 A
5819291 Haimowitz et al. Oct 1998 A
5822410 McCausland et al. Oct 1998 A
5828837 Eikland Oct 1998 A
5832068 Smith Nov 1998 A
5832447 Rieker et al. Nov 1998 A
5842211 Horadan et al. Nov 1998 A
5844218 Kawan et al. Dec 1998 A
5878403 DeFrancesco Mar 1999 A
5884287 Edesess Mar 1999 A
5903830 Joao et al. May 1999 A
5903881 Schrader et al. May 1999 A
5907828 Meyer et al. May 1999 A
5924082 Silverman et al. Jul 1999 A
5926800 Baronowski et al. Jul 1999 A
5930759 Moore et al. Jul 1999 A
5930776 Dykstra et al. Jul 1999 A
5933809 Hunt et al. Aug 1999 A
5940812 Tengel et al. Aug 1999 A
5950179 Buchanan et al. Sep 1999 A
5956693 Geerlings Sep 1999 A
5960430 Haimowitz et al. Sep 1999 A
5961593 Gabber et al. Oct 1999 A
5966699 Zandi Oct 1999 A
5970478 Walker et al. Oct 1999 A
5978780 Watson Nov 1999 A
5995947 Fraser et al. Nov 1999 A
5999596 Walker et al. Dec 1999 A
6006333 Nielsen Dec 1999 A
6014632 Gamble et al. Jan 2000 A
6018723 Siegel et al. Jan 2000 A
6021397 Jones et al. Feb 2000 A
6029149 Dykstra et al. Feb 2000 A
6038551 Barlow et al. Mar 2000 A
6044351 Jones Mar 2000 A
6044352 Deavers Mar 2000 A
6067522 Warady et al. May 2000 A
6070241 Edwards et al. May 2000 A
6073104 Field Jun 2000 A
6073106 Rozen et al. Jun 2000 A
6073140 Morgan et al. Jun 2000 A
6088686 Walker et al. Jul 2000 A
6098052 Kosiba et al. Aug 2000 A
6108641 Kenna et al. Aug 2000 A
6119103 Basch et al. Sep 2000 A
6128602 Northington et al. Oct 2000 A
6129273 Shah Oct 2000 A
6144948 Walker et al. Nov 2000 A
6154729 Cannon et al. Nov 2000 A
6157707 Baulier et al. Dec 2000 A
6163770 Gamble et al. Dec 2000 A
6171112 Clark et al. Jan 2001 B1
6182229 Nielsen Jan 2001 B1
6185543 Galperin et al. Feb 2001 B1
6208973 Boyer et al. Mar 2001 B1
6233566 Levine et al. May 2001 B1
6253202 Gilmour Jun 2001 B1
6253203 O'Flaherty et al. Jun 2001 B1
6263447 French et al. Jul 2001 B1
6269369 Robertson Jul 2001 B1
6275824 O'Flaherty et al. Aug 2001 B1
6282658 French et al. Aug 2001 B2
6298348 Eldering Oct 2001 B1
6304860 Martin et al. Oct 2001 B1
6311169 Duhon Oct 2001 B2
6321205 Eder Nov 2001 B1
6321339 French et al. Nov 2001 B1
6343279 Bissonette et al. Jan 2002 B1
6374229 Lowrey et al. Apr 2002 B1
6374230 Walker et al. Apr 2002 B1
6384844 Stewart et al. May 2002 B1
6385594 Lebda et al. May 2002 B1
6393406 Eder May 2002 B1
6397197 Gindlesperger May 2002 B1
6397224 Zubeldia et al. May 2002 B1
6405181 Lent et al. Jun 2002 B2
6424878 Barker et al. Jul 2002 B1
6453297 Burks et al. Sep 2002 B1
6456983 Keyes et al. Sep 2002 B1
6463533 Calamera et al. Oct 2002 B1
6496827 Kozam et al. Dec 2002 B2
6496936 French et al. Dec 2002 B1
5870721 Norris Jan 2003 A1
5870721 Norris Jan 2003 C1
6513018 Culhane Jan 2003 B1
6523021 Monberg et al. Feb 2003 B1
6523041 Morgan et al. Feb 2003 B1
6532450 Brown et al. Mar 2003 B1
6543683 Hoffman Apr 2003 B2
6564210 Korda et al. May 2003 B1
6581059 Barrett et al. Jun 2003 B1
6587841 DeFrancesco Jul 2003 B1
6598030 Siegel et al. Jul 2003 B1
6601173 Mohler Jul 2003 B1
6611816 Lebda et al. Aug 2003 B2
6622131 Brown et al. Sep 2003 B1
6629245 Stone et al. Sep 2003 B1
6647383 August et al. Nov 2003 B1
6658393 Basch et al. Dec 2003 B1
6684093 Kuth Jan 2004 B2
6714944 Shapiro et al. Mar 2004 B1
6734886 Hagan et al. May 2004 B1
6750985 Rhoads Jun 2004 B2
6754665 Futagami et al. Jun 2004 B1
6766327 Morgan, Jr. et al. Jul 2004 B2
6766946 Iida et al. Jul 2004 B2
6795812 Lent et al. Sep 2004 B1
6804346 Mewhinney Oct 2004 B1
6805287 Bishop et al. Oct 2004 B2
6807533 Land et al. Oct 2004 B1
6823319 Lynch et al. Nov 2004 B1
6826535 Wood et al. Nov 2004 B2
6845448 Chaganti et al. Jan 2005 B1
6847942 Land et al. Jan 2005 B1
6857073 French et al. Feb 2005 B2
6873972 Marcial et al. Mar 2005 B1
6901406 Nabe et al. May 2005 B2
6910624 Natsuno Jun 2005 B1
6934714 Meinig Aug 2005 B2
6950807 Brock Sep 2005 B2
6950858 Ogami Sep 2005 B2
6954757 Zargham et al. Oct 2005 B2
6968319 Remington et al. Nov 2005 B1
6983379 Spalink et al. Jan 2006 B1
6985887 Sunstein et al. Jan 2006 B1
6988085 Hedy Jan 2006 B2
6999941 Agarwal Feb 2006 B1
7003491 Starkman Feb 2006 B2
7028052 Chapman et al. Apr 2006 B2
7039607 Watarai et al. May 2006 B2
7058817 Ellmore Jun 2006 B1
7065566 Menard et al. Jun 2006 B2
7069240 Spero et al. Jun 2006 B2
7069249 Stolfo et al. Jun 2006 B2
7072842 Provost et al. Jul 2006 B2
7076462 Nelson et al. Jul 2006 B1
7107241 Pinto Sep 2006 B1
7117172 Black Oct 2006 B1
7124144 Christianson et al. Oct 2006 B2
7133840 Kenna et al. Nov 2006 B1
7133935 Hedy Nov 2006 B2
7171371 Goldstein Jan 2007 B2
7174302 Patricelli et al. Feb 2007 B2
7181427 DeFrancesco Feb 2007 B1
7188169 Buus et al. Mar 2007 B2
7191150 Shao et al. Mar 2007 B1
7191451 Nakagawa Mar 2007 B2
7197468 Patricelli et al. Mar 2007 B1
7206768 deGroeve et al. Apr 2007 B1
7212995 Schulkins May 2007 B2
7234156 French et al. Jun 2007 B2
7234160 Vogel et al. Jun 2007 B2
7236950 Savage et al. Jun 2007 B2
7240363 Ellingson Jul 2007 B1
7246067 Austin et al. Jul 2007 B2
7246068 Thomas, Jr. Jul 2007 B2
7249076 Pendleton et al. Jul 2007 B1
7249096 Lasater et al. Jul 2007 B1
7249113 Continelli et al. Jul 2007 B1
7251625 Anglum Jul 2007 B2
7263497 Wiser et al. Aug 2007 B1
7277869 Starkman Oct 2007 B2
7280980 Hoadley et al. Oct 2007 B1
7281652 Foss Oct 2007 B2
7289971 O'Neil et al. Oct 2007 B1
7295988 Reeves Nov 2007 B1
7298872 Glisson Nov 2007 B2
7302420 Aggarwal et al. Nov 2007 B2
7305359 Bonnell Dec 2007 B2
7310617 Cunningham Dec 2007 B1
7313538 Wilmes et al. Dec 2007 B2
7328276 Alisuag Feb 2008 B2
7333937 Baldwin, Jr. et al. Feb 2008 B2
7340424 Gang et al. Mar 2008 B2
7340434 Schnall Mar 2008 B2
7343295 Pomerance Mar 2008 B2
7346576 Lent et al. Mar 2008 B2
7356506 Watson et al. Apr 2008 B2
7356516 Richey et al. Apr 2008 B2
7366694 Lazerson Apr 2008 B2
7370044 Mulhern et al. May 2008 B2
7379913 Steele et al. May 2008 B2
7380707 Fredman Jun 2008 B1
7383988 Slonecker, Jr. Jun 2008 B2
7392216 Palmgren et al. Jun 2008 B1
7395273 Khan et al. Jul 2008 B2
7403923 Elliott et al. Jul 2008 B2
7403942 Bayliss Jul 2008 B1
7409369 Homuth et al. Aug 2008 B1
7433864 Malik Oct 2008 B2
7451113 Kasower Nov 2008 B1
7460857 Roach, Jr. Dec 2008 B2
7467401 Cicchitto Dec 2008 B2
7478157 Bohrer et al. Jan 2009 B2
7479949 Jobs et al. Jan 2009 B2
7490356 Lieblich et al. Feb 2009 B2
7505939 Lent et al. Mar 2009 B2
7527967 Chao et al. May 2009 B2
7529698 Joao May 2009 B2
7536329 Goldberg et al. May 2009 B2
7536346 Aliffi et al. May 2009 B2
7536348 Shao et al. May 2009 B2
7542993 Satterfield et al. Jun 2009 B2
7543739 Brown et al. Jun 2009 B2
7546271 Chmielewski et al. Jun 2009 B1
7552080 Willard et al. Jun 2009 B1
7552086 Rajasekar et al. Jun 2009 B1
7556192 Wokaty, Jr. Jul 2009 B2
7559217 Bass Jul 2009 B2
7562184 Henmi et al. Jul 2009 B2
7562814 Shao et al. Jul 2009 B1
7571138 Miri et al. Aug 2009 B2
7580884 Cook Aug 2009 B2
7584127 Byrne et al. Sep 2009 B2
7584146 Duhon Sep 2009 B1
7587366 Grim, III et al. Sep 2009 B2
7593889 Raines et al. Sep 2009 B2
7593891 Kornegay et al. Sep 2009 B2
7603317 Adler et al. Oct 2009 B2
7603701 Gaucas Oct 2009 B2
7606725 Robertson et al. Oct 2009 B2
7610229 Kornegay Oct 2009 B1
7617116 Amar et al. Nov 2009 B2
7630932 Danaher et al. Dec 2009 B2
7630933 Peterson et al. Dec 2009 B2
7640200 Gardner et al. Dec 2009 B2
7647274 Peterson et al. Jan 2010 B2
7647344 Skurtovich, Jr. et al. Jan 2010 B2
7653592 Flaxman et al. Jan 2010 B1
7672833 Blume et al. Mar 2010 B2
7676410 Petralia Mar 2010 B2
7676418 Chung et al. Mar 2010 B1
7689505 Kasower Mar 2010 B2
7689506 Fei et al. Mar 2010 B2
7690032 Peirce Mar 2010 B1
7693787 Provinse Apr 2010 B2
7698214 Lindgren Apr 2010 B1
7698217 Phillips et al. Apr 2010 B1
7698445 Fitzpatrick et al. Apr 2010 B2
7707102 Rothstein Apr 2010 B2
7711635 Steele et al. May 2010 B2
7711636 Robida et al. May 2010 B2
7720750 Brody May 2010 B2
7725385 Royer et al. May 2010 B2
7729959 Wells et al. Jun 2010 B1
7734522 Johnson et al. Jun 2010 B2
7739139 Robertson et al. Jun 2010 B2
7747559 Leitner et al. Jun 2010 B2
7752132 Stewart et al. Jul 2010 B2
7756789 Welker et al. Jul 2010 B2
7765311 Itabashi et al. Jul 2010 B2
7769696 Yoda Aug 2010 B2
7769998 Lynch et al. Aug 2010 B2
7774257 Maggioncalda et al. Aug 2010 B2
7774270 MacCloskey Aug 2010 B1
7783515 Kumar et al. Aug 2010 B1
7783562 Ellis Aug 2010 B1
7792715 Kasower Sep 2010 B1
7797725 Lunt et al. Sep 2010 B2
7801807 DeFrancesco et al. Sep 2010 B2
7801828 Candella et al. Sep 2010 B2
7805345 Abrahams et al. Sep 2010 B2
7814004 Haggerty et al. Oct 2010 B2
7814005 Imrey et al. Oct 2010 B2
7818228 Coulter Oct 2010 B1
7818229 Imrey et al. Oct 2010 B2
7832006 Chen et al. Nov 2010 B2
7835983 Lefner et al. Nov 2010 B2
7836111 Shan Nov 2010 B1
7840484 Haggerty et al. Nov 2010 B2
7841008 Cole et al. Nov 2010 B1
7848972 Sharma Dec 2010 B1
7848978 Imrey et al. Dec 2010 B2
7849004 Choudhuri et al. Dec 2010 B2
7849014 Erikson Dec 2010 B2
7853493 DeBie et al. Dec 2010 B2
7853518 Cagan Dec 2010 B2
7853984 Antell et al. Dec 2010 B2
7856386 Hazlehurst et al. Dec 2010 B2
7860782 Cash et al. Dec 2010 B2
7860786 Blackburn et al. Dec 2010 B2
7870078 Clark et al. Jan 2011 B2
7877304 Coulter Jan 2011 B1
7880728 de los Reyes et al. Feb 2011 B2
7899750 Klieman et al. Mar 2011 B1
7900052 Joans Mar 2011 B2
7904306 Johnson et al. Mar 2011 B2
7904367 Chung et al. Mar 2011 B2
7908242 Achanta Mar 2011 B1
7912865 Akerman et al. Mar 2011 B2
7925582 Kornegay et al. Apr 2011 B1
7930195 Heyns et al. Apr 2011 B2
7930252 Bender et al. Apr 2011 B2
7941363 Tanaka et al. May 2011 B2
7966192 Pagliari et al. Jun 2011 B2
7970676 Feinstein Jun 2011 B2
7970679 Kasower Jun 2011 B2
7970698 Gupta et al. Jun 2011 B2
7979908 Millwee Jul 2011 B2
7983976 Nafeh et al. Jul 2011 B2
7983979 Holland, IV Jul 2011 B2
7991689 Brunzell et al. Aug 2011 B1
8001034 Chung et al. Aug 2011 B2
8001040 Keithley Aug 2011 B2
8001042 Brunzell et al. Aug 2011 B1
8001043 Walker et al. Aug 2011 B1
8001153 Skurtovich, Jr. et al. Aug 2011 B2
8015107 Kornegay et al. Sep 2011 B2
8019828 Cash et al. Sep 2011 B2
8019843 Cash et al. Sep 2011 B2
8024778 Cash et al. Sep 2011 B2
8032932 Speyer et al. Oct 2011 B2
8060424 Kasower Nov 2011 B2
8060441 Stewart et al. Nov 2011 B2
8064586 Shaffer et al. Nov 2011 B2
8065233 Lee et al. Nov 2011 B2
8065234 Liao et al. Nov 2011 B2
8073785 Candella et al. Dec 2011 B1
8078524 Crawford et al. Dec 2011 B2
8078527 Cerise et al. Dec 2011 B2
8078528 Vicente et al. Dec 2011 B1
8082202 Weiss Dec 2011 B2
8086523 Palmer Dec 2011 B1
8095443 DeBie Jan 2012 B2
8095458 Peterson et al. Jan 2012 B2
8099309 Bober Jan 2012 B1
8099341 Varghese Jan 2012 B2
8104679 Brown Jan 2012 B2
8127982 Casey et al. Mar 2012 B1
8127986 Taylor et al. Mar 2012 B1
8131685 Gedalius et al. Mar 2012 B1
8135642 Krause Mar 2012 B1
8160960 Fei et al. Apr 2012 B1
8195549 Kasower Jun 2012 B2
8201257 Andres et al. Jun 2012 B1
8204774 Chwast et al. Jun 2012 B2
8204812 Stewart et al. Jun 2012 B2
8219535 Kobori et al. Jul 2012 B1
8224723 Bosch et al. Jul 2012 B2
8225395 Atwood et al. Jul 2012 B2
8234498 Britti et al. Jul 2012 B2
8239130 Upstill et al. Aug 2012 B1
8255978 Dick Aug 2012 B2
8285656 Chang et al. Oct 2012 B1
8290840 Kasower Oct 2012 B2
8296229 Yellin et al. Oct 2012 B1
8312033 McMillan Nov 2012 B1
8321334 Kornegay et al. Nov 2012 B1
8321339 Imrey et al. Nov 2012 B2
8327429 Speyer et al. Dec 2012 B2
8335741 Kornegay et al. Dec 2012 B2
8340685 Cochran et al. Dec 2012 B2
8355967 Debie et al. Jan 2013 B2
8364518 Blake et al. Jan 2013 B1
8364588 Celka et al. Jan 2013 B2
8380618 Kazenas et al. Feb 2013 B1
8412593 Song et al. Apr 2013 B1
8418254 Britti et al. Apr 2013 B2
8433512 Lopatenko et al. Apr 2013 B1
8433648 Keithley et al. Apr 2013 B2
8442886 Haggerty et al. May 2013 B1
8458062 Dutt et al. Jun 2013 B2
8458074 Showalter Jun 2013 B2
8464939 Taylor et al. Jun 2013 B1
8473354 Psota et al. Jun 2013 B2
8473410 Haggerty et al. Jun 2013 B1
8515844 Kasower Aug 2013 B2
8533030 Dhir et al. Sep 2013 B1
8533118 Weller et al. Sep 2013 B2
8538869 Haggerty et al. Sep 2013 B1
8560436 Ingram et al. Oct 2013 B2
8566029 Lopatenko et al. Oct 2013 B1
8566141 Nagdev et al. Oct 2013 B1
8571971 Brown et al. Oct 2013 B1
8572083 Snell et al. Oct 2013 B1
8589069 Lehman Nov 2013 B1
8589208 Kruger et al. Nov 2013 B2
8595101 Daukas et al. Nov 2013 B1
8600886 Ramavarjula et al. Dec 2013 B2
8606694 Campbell et al. Dec 2013 B2
8621562 Antell et al. Dec 2013 B2
8626618 Psota et al. Jan 2014 B2
8631242 Britti et al. Jan 2014 B2
8639616 Rolenaitis et al. Jan 2014 B1
8646101 Millwee Feb 2014 B1
8650407 Britti et al. Feb 2014 B2
8671107 Scully et al. Mar 2014 B2
8671115 Skurtovich, Jr. et al. Mar 2014 B2
8694420 Oliai Apr 2014 B1
8719159 Keithley May 2014 B2
8725613 Celka et al. May 2014 B1
8738516 Dean et al. May 2014 B1
8744956 DiChiara et al. Jun 2014 B1
8756099 Keithley et al. Jun 2014 B2
8768914 Scriffignano et al. Jul 2014 B2
8775299 Achanta et al. Jul 2014 B2
8781882 Arboletti et al. Jul 2014 B1
8781951 Lewis et al. Jul 2014 B2
8781953 Kasower Jul 2014 B2
8781954 Haggerty et al. Jul 2014 B2
8806218 Hatakeda Aug 2014 B2
8856894 Dean et al. Oct 2014 B1
8930251 DeBie Jan 2015 B2
8930262 Searson et al. Jan 2015 B1
8931058 DiChiara et al. Jan 2015 B2
8938399 Herman Jan 2015 B1
8938432 Rossmark et al. Jan 2015 B2
8949981 Trollope et al. Feb 2015 B1
9043930 Britti et al. May 2015 B2
9058627 Wasser et al. Jun 2015 B1
9116918 Kim Aug 2015 B1
9143541 Szamonek et al. Sep 2015 B1
9147042 Haller et al. Sep 2015 B1
9183363 Millwee Nov 2015 B1
9189789 Hastings et al. Nov 2015 B1
9251541 Celka et al. Feb 2016 B2
9256624 Skurtovich, Jr. et al. Feb 2016 B2
9256904 Haller et al. Feb 2016 B1
9443268 Kapczynski et al. Sep 2016 B1
9477988 Haggerty et al. Oct 2016 B2
9489694 Haller et al. Nov 2016 B2
9553936 Dijk et al. Jan 2017 B2
9558519 Burger Jan 2017 B1
9607336 Dean et al. Mar 2017 B1
9652802 Kasower May 2017 B1
9684905 Haller et al. Jun 2017 B1
9697263 Girulat, Jr. Jul 2017 B1
9710523 Skurtovich, Jr. et al. Jul 2017 B2
9760553 Hecht-Nielse Sep 2017 B1
9792648 Haller et al. Oct 2017 B1
10115155 Haller et al. Oct 2018 B1
10362058 Hu Jul 2019 B2
10402792 Lin Sep 2019 B2
10408055 Soofi et al. Sep 2019 B2
10417704 Searson et al. Sep 2019 B2
10579647 Allsopp et al. Mar 2020 B1
10650448 Haller et al. May 2020 B1
10735183 Mehta et al. Aug 2020 B1
10757154 Jacobs et al. Aug 2020 B1
10909617 Kasower Feb 2021 B2
10984404 Nack et al. Apr 2021 B2
11004147 Haller et al. May 2021 B1
11159593 Jacobs et al. Oct 2021 B1
11227001 Rege et al. Jan 2022 B2
11379821 Butvin et al. Jul 2022 B2
11620403 Chen et al. Apr 2023 B2
11636540 Haller et al. Apr 2023 B1
11652607 Mehta et al. May 2023 B1
20010011247 O'Flaherty et al. Aug 2001 A1
20010014868 Herz et al. Aug 2001 A1
20010014878 Mitra et al. Aug 2001 A1
20010029470 Schultz et al. Oct 2001 A1
20010029482 Tealdi et al. Oct 2001 A1
20010034618 Kessler et al. Oct 2001 A1
20010034631 Kiselik Oct 2001 A1
20010039523 Iwamoto Nov 2001 A1
20010039532 Coleman, Jr. et al. Nov 2001 A1
20010042785 Walker et al. Nov 2001 A1
20010044729 Pomerance Nov 2001 A1
20010044756 Watkins et al. Nov 2001 A1
20010049620 Blasko Dec 2001 A1
20020004736 Roundtree et al. Jan 2002 A1
20020004774 Defarlo Jan 2002 A1
20020010594 Levine Jan 2002 A1
20020026519 Itabashi et al. Feb 2002 A1
20020042763 Pillay et al. Apr 2002 A1
20020052841 Guthrie et al. May 2002 A1
20020055869 Hegg May 2002 A1
20020069122 Yun et al. Jun 2002 A1
20020077964 Brody et al. Jun 2002 A1
20020087460 Hornung Jul 2002 A1
20020091635 Dilip et al. Jul 2002 A1
20020091650 Ellis Jul 2002 A1
20020099635 Guiragosian Jul 2002 A1
20020099641 Mills et al. Jul 2002 A1
20020099824 Bender et al. Jul 2002 A1
20020107765 Walker Aug 2002 A1
20020107849 Hickey et al. Aug 2002 A1
20020111816 Lortscher et al. Aug 2002 A1
20020116247 Tucker et al. Aug 2002 A1
20020119824 Allen Aug 2002 A1
20020128962 Kasower Sep 2002 A1
20020128981 Kawan et al. Sep 2002 A1
20020133365 Grey et al. Sep 2002 A1
20020133462 Shteyn Sep 2002 A1
20020138297 Lee Sep 2002 A1
20020138445 Laage et al. Sep 2002 A1
20020138470 Zhou Sep 2002 A1
20020147617 Schoenbaum et al. Oct 2002 A1
20020147669 Taylor et al. Oct 2002 A1
20020152166 Dutta et al. Oct 2002 A1
20020156676 Ahrens et al. Oct 2002 A1
20020156797 Lee et al. Oct 2002 A1
20020161664 Shaya et al. Oct 2002 A1
20020165757 Lisser Nov 2002 A1
20020169747 Chapman et al. Nov 2002 A1
20020173994 Ferguson, III Nov 2002 A1
20020174048 Dheer et al. Nov 2002 A1
20020184054 Cox et al. Dec 2002 A1
20020188478 Breeland et al. Dec 2002 A1
20020194103 Nabe Dec 2002 A1
20020194120 Russell et al. Dec 2002 A1
20020198806 Blagg et al. Dec 2002 A1
20020198824 Cook Dec 2002 A1
20020198830 Randell et al. Dec 2002 A1
20030009418 Green et al. Jan 2003 A1
20030009426 Ruiz-Sanchez Jan 2003 A1
20030014336 Dao et al. Jan 2003 A1
20030018549 Fei et al. Jan 2003 A1
20030018558 Heffner et al. Jan 2003 A1
20030027635 Walker et al. Feb 2003 A1
20030028402 Ulrich et al. Feb 2003 A1
20030036926 Starkey et al. Feb 2003 A1
20030036995 Lazerson Feb 2003 A1
20030037054 Dutta et al. Feb 2003 A1
20030041019 Vagim, III et al. Feb 2003 A1
20030041031 Hedy Feb 2003 A1
20030046112 Dutta et al. Mar 2003 A1
20030046311 Baidya et al. Mar 2003 A1
20030050795 Baldwin, Jr. et al. Mar 2003 A1
20030050796 Baldwin, Jr. et al. Mar 2003 A1
20030065563 Elliott et al. Apr 2003 A1
20030069839 Whittington et al. Apr 2003 A1
20030078877 Beirne et al. Apr 2003 A1
20030097342 Whittingtom May 2003 A1
20030097380 Mulhern et al. May 2003 A1
20030110111 Nalebuff et al. Jun 2003 A1
20030126072 Brock Jul 2003 A1
20030154162 Danaher et al. Aug 2003 A1
20030163416 Kitajima Aug 2003 A1
20030163483 Zingher et al. Aug 2003 A1
20030195859 Lawrence Oct 2003 A1
20030200184 Dominguez et al. Oct 2003 A1
20030204752 Garrison Oct 2003 A1
20030208412 Hillestad et al. Nov 2003 A1
20030220858 Lam et al. Nov 2003 A1
20030229507 Perge Dec 2003 A1
20030233259 Mistretta et al. Dec 2003 A1
20040006488 Fitall et al. Jan 2004 A1
20040010443 May et al. Jan 2004 A1
20040010458 Friedman Jan 2004 A1
20040023637 Johnson et al. Feb 2004 A1
20040024709 Yu et al. Feb 2004 A1
20040030629 Freeman et al. Feb 2004 A1
20040030649 Nelson et al. Feb 2004 A1
20040039688 Sulkowski et al. Feb 2004 A1
20040044563 Stein Mar 2004 A1
20040044673 Brady et al. Mar 2004 A1
20040049473 Gower et al. Mar 2004 A1
20040050928 Bishop et al. Mar 2004 A1
20040054619 Watson et al. Mar 2004 A1
20040064402 Dreyer et al. Apr 2004 A1
20040073456 Gottlieb et al. Apr 2004 A1
20040078323 Johnston et al. Apr 2004 A1
20040078324 Lonnberg et al. Apr 2004 A1
20040088237 Moenickheim et al. May 2004 A1
20040088255 Zielke et al. May 2004 A1
20040103147 Flesher et al. May 2004 A1
20040111305 Gavan et al. Jun 2004 A1
20040111359 Hudock Jun 2004 A1
20040117235 Shacham Jun 2004 A1
20040117302 Weichert et al. Jun 2004 A1
20040128150 Lundegren Jul 2004 A1
20040128230 Oppenheimer et al. Jul 2004 A1
20040133460 Berlin et al. Jul 2004 A1
20040133509 McCoy et al. Jul 2004 A1
20040133513 McCoy et al. Jul 2004 A1
20040133515 McCoy et al. Jul 2004 A1
20040138994 DeFrancesco et al. Jul 2004 A1
20040139025 Coleman Jul 2004 A1
20040143546 Wood et al. Jul 2004 A1
20040153437 Buchan Aug 2004 A1
20040153521 Kogo Aug 2004 A1
20040158523 Dort Aug 2004 A1
20040159700 Khan et al. Aug 2004 A1
20040167793 Masuoka et al. Aug 2004 A1
20040177030 Shoham Sep 2004 A1
20040177114 Friedman et al. Sep 2004 A1
20040193538 Raines Sep 2004 A1
20040199456 Flint et al. Oct 2004 A1
20040199458 Ho Oct 2004 A1
20040199462 Starrs Oct 2004 A1
20040215553 Gang et al. Oct 2004 A1
20040215554 Kemper et al. Oct 2004 A1
20040215555 Kemper et al. Oct 2004 A1
20040215556 Merkley, Jr. et al. Oct 2004 A1
20040215584 Yao Oct 2004 A1
20040220865 Lozowski et al. Nov 2004 A1
20040220896 Finlay et al. Nov 2004 A1
20040220918 Scriffignano et al. Nov 2004 A1
20040225545 Turner et al. Nov 2004 A1
20040225594 Nolan, III et al. Nov 2004 A1
20040225597 Oppenheimer et al. Nov 2004 A1
20040225643 Alpha et al. Nov 2004 A1
20040230534 McGough Nov 2004 A1
20040243450 Bernard, Jr. et al. Dec 2004 A1
20040243588 Tanner et al. Dec 2004 A1
20040267660 Greenwood et al. Dec 2004 A1
20040267714 Frid et al. Dec 2004 A1
20050004855 Jenson et al. Jan 2005 A1
20050004870 McGaughey Jan 2005 A1
20050005168 Dick Jan 2005 A1
20050010513 Duckworth et al. Jan 2005 A1
20050027633 Fortuna et al. Feb 2005 A1
20050027983 Klawon Feb 2005 A1
20050027995 Menschik et al. Feb 2005 A1
20050055231 Lee Mar 2005 A1
20050055275 Newman et al. Mar 2005 A1
20050058262 Timmins et al. Mar 2005 A1
20050071328 Lawrence Mar 2005 A1
20050086071 Fox, Jr. et al. Apr 2005 A1
20050086072 Fox, Jr. et al. Apr 2005 A1
20050086126 Patterson Apr 2005 A1
20050091164 Varble Apr 2005 A1
20050097017 Hanratty May 2005 A1
20050097039 Kulcsar et al. May 2005 A1
20050097320 Golan et al. May 2005 A1
20050102180 Gailey et al. May 2005 A1
20050102206 Savasoglu et al. May 2005 A1
20050125291 Demkiw Grayson et al. Jun 2005 A1
20050125397 Gross et al. Jun 2005 A1
20050137899 Davies et al. Jun 2005 A1
20050137912 Rao et al. Jun 2005 A1
20050154617 Ruggieri et al. Jul 2005 A1
20050154664 Guy et al. Jul 2005 A1
20050154665 Kerr Jul 2005 A1
20050154769 Eckart et al. Jul 2005 A1
20050197953 Broadbent et al. Sep 2005 A1
20050209880 Drelicharz et al. Sep 2005 A1
20050209922 Hofmeister Sep 2005 A1
20050216953 Ellingson Sep 2005 A1
20050228748 Togher et al. Oct 2005 A1
20050251474 Shinn et al. Nov 2005 A1
20050267840 Holm-Blagg et al. Dec 2005 A1
20050273423 Kiai et al. Dec 2005 A1
20050273431 Abel et al. Dec 2005 A1
20050276401 Madill et al. Dec 2005 A1
20050279827 Mascavage et al. Dec 2005 A1
20050288998 Verma et al. Dec 2005 A1
20060014129 Coleman et al. Jan 2006 A1
20060015425 Brooks Jan 2006 A1
20060029107 McCullough et al. Feb 2006 A1
20060031158 Orman Feb 2006 A1
20060032909 Seegar Feb 2006 A1
20060036543 Blagg et al. Feb 2006 A1
20060059086 Mulhern Mar 2006 A1
20060069635 Ram et al. Mar 2006 A1
20060074793 Hibbert et al. Apr 2006 A1
20060080139 Mainzer Apr 2006 A1
20060080233 Mendelovich et al. Apr 2006 A1
20060080251 Fried et al. Apr 2006 A1
20060085334 Murphy Apr 2006 A1
20060089842 Medawar Apr 2006 A1
20060095363 May May 2006 A1
20060100944 Reddin et al. May 2006 A1
20060100954 Schoen May 2006 A1
20060106670 Cai et al. May 2006 A1
20060123461 Lunt et al. Jun 2006 A1
20060131390 Kim Jun 2006 A1
20060155573 Hartunian Jul 2006 A1
20060155639 Lynch et al. Jul 2006 A1
20060173772 Hayes et al. Aug 2006 A1
20060177226 Ellis, III Aug 2006 A1
20060178971 Owen et al. Aug 2006 A1
20060178983 Nice et al. Aug 2006 A1
20060184410 Ramamurthy et al. Aug 2006 A1
20060184440 Britti et al. Aug 2006 A1
20060184585 Grear et al. Aug 2006 A1
20060202012 Grano et al. Sep 2006 A1
20060204051 Holland, IV Sep 2006 A1
20060212407 Lyon Sep 2006 A1
20060229799 Nimmo et al. Oct 2006 A1
20060229943 Mathias et al. Oct 2006 A1
20060229961 Lyftogt et al. Oct 2006 A1
20060235743 Long et al. Oct 2006 A1
20060242046 Haggerty et al. Oct 2006 A1
20060271457 Romain et al. Nov 2006 A1
20060277092 Williams Dec 2006 A1
20060277141 Palmer Dec 2006 A1
20060278704 Saunders et al. Dec 2006 A1
20060282359 Nobili et al. Dec 2006 A1
20060287764 Kraft Dec 2006 A1
20060287766 Kraft Dec 2006 A1
20060287767 Kraft Dec 2006 A1
20060288090 Kraft Dec 2006 A1
20060294199 Bertholf Dec 2006 A1
20070011083 Bird et al. Jan 2007 A1
20070016500 Chatterji et al. Jan 2007 A1
20070016517 Solomon Jan 2007 A1
20070016520 Gang et al. Jan 2007 A1
20070022141 Singleton et al. Jan 2007 A1
20070027778 Schellhammer et al. Feb 2007 A1
20070038483 Wood Feb 2007 A1
20070038497 Britti et al. Feb 2007 A1
20070038568 Greene et al. Feb 2007 A1
20070043654 Libman Feb 2007 A1
20070045402 Rothschild Mar 2007 A1
20070045405 Rothschild Mar 2007 A1
20070067207 Haggerty et al. Mar 2007 A1
20070067297 Kublickis Mar 2007 A1
20070083460 Bachenheimer Apr 2007 A1
20070083463 Kraft Apr 2007 A1
20070088950 Wheeler et al. Apr 2007 A1
20070094137 Phillips et al. Apr 2007 A1
20070094230 Subramaniam et al. Apr 2007 A1
20070094241 M. Blackwell et al. Apr 2007 A1
20070106582 Baker et al. May 2007 A1
20070112668 Celano et al. May 2007 A1
20070118410 Nadai May 2007 A1
20070130070 Williams Jun 2007 A1
20070156576 Imrey et al. Jul 2007 A1
20070156692 Rosewarne Jul 2007 A1
20070162414 Horowitz et al. Jul 2007 A1
20070192121 Routson et al. Aug 2007 A1
20070192122 Routson et al. Aug 2007 A1
20070198336 Thompson Aug 2007 A1
20070198407 Winter Aug 2007 A1
20070208640 Banasiak et al. Sep 2007 A1
20070214000 Shahrabi et al. Sep 2007 A1
20070226047 Ward Sep 2007 A1
20070226093 Chan et al. Sep 2007 A1
20070250459 Schwarz et al. Oct 2007 A1
20070255654 Whipple et al. Nov 2007 A1
20070255655 Kemper et al. Nov 2007 A1
20070258626 Reiner Nov 2007 A1
20070261114 Pomerantsev Nov 2007 A1
20070262137 Brown Nov 2007 A1
20070266439 Kraft Nov 2007 A1
20070279187 Hekmatpour et al. Dec 2007 A1
20070282730 Carpenter et al. Dec 2007 A1
20070284433 Domenica et al. Dec 2007 A1
20070288360 Seeklus Dec 2007 A1
20070294195 Curry et al. Dec 2007 A1
20070294431 Adelman et al. Dec 2007 A1
20070299699 Policelli et al. Dec 2007 A1
20080010203 Grant Jan 2008 A1
20080010206 Coleman Jan 2008 A1
20080015954 Huber et al. Jan 2008 A1
20080015979 Bentley Jan 2008 A1
20080022281 Dubhashi et al. Jan 2008 A1
20080033742 Bernasconi Feb 2008 A1
20080046351 Wiener et al. Feb 2008 A1
20080052182 Marshall Feb 2008 A1
20080052244 Tsuei et al. Feb 2008 A1
20080059317 Chandran et al. Mar 2008 A1
20080059352 Chandran Mar 2008 A1
20080059364 Tidwell et al. Mar 2008 A1
20080086400 Ardelean et al. Apr 2008 A1
20080091519 Foss Apr 2008 A1
20080097768 Godshalk Apr 2008 A1
20080103959 Carroll et al. May 2008 A1
20080103972 Lanc May 2008 A1
20080109315 Huang et al. May 2008 A1
20080109740 Prinsen et al. May 2008 A1
20080109875 Kraft May 2008 A1
20080115191 Kim et al. May 2008 A1
20080120133 Krishnaswami et al. May 2008 A1
20080162383 Kraft Jul 2008 A1
20080172324 Johnson Jul 2008 A1
20080177655 Zalik Jul 2008 A1
20080184270 Cole et al. Jul 2008 A1
20080189202 Zadoorian et al. Aug 2008 A1
20080195548 Chu et al. Aug 2008 A1
20080201257 Lewis et al. Aug 2008 A1
20080205655 Wilkins et al. Aug 2008 A1
20080205774 Brinker et al. Aug 2008 A1
20080208610 Thomas et al. Aug 2008 A1
20080208726 Tsantes et al. Aug 2008 A1
20080208873 Boehmer Aug 2008 A1
20080221972 Megdal et al. Sep 2008 A1
20080222015 Megdal et al. Sep 2008 A1
20080222027 Megdal et al. Sep 2008 A1
20080222706 Renaud et al. Sep 2008 A1
20080255922 Feldman et al. Oct 2008 A1
20080263058 Peden Oct 2008 A1
20080270209 Mauseth et al. Oct 2008 A1
20080270294 Lent et al. Oct 2008 A1
20080270295 Lent et al. Oct 2008 A1
20080288283 Baldwin, Jr. et al. Nov 2008 A1
20080294501 Rennich et al. Nov 2008 A1
20080294540 Celka et al. Nov 2008 A1
20080301016 Durvasula et al. Dec 2008 A1
20080306750 Wunder et al. Dec 2008 A1
20080319832 Liebe Dec 2008 A1
20080319889 Hammad Dec 2008 A1
20080319909 Perkins et al. Dec 2008 A1
20090012889 Finch Jan 2009 A1
20090024428 Hudock, Jr. Jan 2009 A1
20090030776 Walker et al. Jan 2009 A1
20090031426 Dal Lago et al. Jan 2009 A1
20090043691 Kasower Feb 2009 A1
20090044279 Crawford et al. Feb 2009 A1
20090055322 Bykov et al. Feb 2009 A1
20090055894 Lorsch Feb 2009 A1
20090060343 Rosca Mar 2009 A1
20090089190 Girulat Apr 2009 A1
20090094674 Schwartz et al. Apr 2009 A1
20090112650 Iwane Apr 2009 A1
20090119199 Salahi May 2009 A1
20090138335 Lieberman May 2009 A1
20090150166 Leite et al. Jun 2009 A1
20090150238 Marsh et al. Jun 2009 A1
20090158030 Rasti Jun 2009 A1
20090164232 Chmielewski et al. Jun 2009 A1
20090164380 Brown Jun 2009 A1
20090172815 Gu et al. Jul 2009 A1
20090222308 Zoldi et al. Sep 2009 A1
20090222379 Choudhuri et al. Sep 2009 A1
20090234775 Whitney et al. Sep 2009 A1
20090240624 James et al. Sep 2009 A1
20090248573 Haggerty et al. Oct 2009 A1
20090254971 Herz et al. Oct 2009 A1
20090271248 Sherman et al. Oct 2009 A1
20090271265 Lay et al. Oct 2009 A1
20090276244 Baldwin, Jr. et al. Nov 2009 A1
20090289110 Regen et al. Nov 2009 A1
20090328173 Jakobson et al. Dec 2009 A1
20100009663 Chang Jan 2010 A1
20100010930 Allen Jan 2010 A1
20100011428 Atwood et al. Jan 2010 A1
20100023434 Bond Jan 2010 A1
20100023448 Eze Jan 2010 A1
20100030677 Melik-Aslanian et al. Feb 2010 A1
20100042517 Paintin et al. Feb 2010 A1
20100042583 Gervais Feb 2010 A1
20100049803 Ogilvie et al. Feb 2010 A1
20100107225 Spencer et al. Apr 2010 A1
20100114724 Ghosh et al. May 2010 A1
20100114744 Gonen May 2010 A1
20100122316 Lyon May 2010 A1
20100142698 Spottiswoode et al. Jun 2010 A1
20100145836 Baker et al. Jun 2010 A1
20100174638 Debie et al. Jul 2010 A1
20100185546 Pollard Jul 2010 A1
20100188684 Kumara Jul 2010 A1
20100205087 Hubler et al. Aug 2010 A1
20100217837 Ansari et al. Aug 2010 A1
20100223168 Haggerty et al. Sep 2010 A1
20100228658 Ketelsen et al. Sep 2010 A1
20100250411 Ogrodski Sep 2010 A1
20100250497 Redlich et al. Sep 2010 A1
20100250509 Andersen Sep 2010 A1
20100253686 Alsbury et al. Oct 2010 A1
20100257102 Perlman Oct 2010 A1
20100262535 Lent et al. Oct 2010 A1
20100268660 Ekdahl Oct 2010 A1
20100293090 Domenikos et al. Nov 2010 A1
20100299262 Handler Nov 2010 A1
20100325035 Hilgers et al. Dec 2010 A1
20110029427 Haggerty et al. Feb 2011 A1
20110035315 Langley Feb 2011 A1
20110040736 Kalaboukis Feb 2011 A1
20110054981 Faith et al. Mar 2011 A1
20110060654 Elliott et al. Mar 2011 A1
20110125632 Neel May 2011 A1
20110126275 Anderson et al. May 2011 A1
20110131123 Griffin et al. Jun 2011 A1
20110161218 Swift Jun 2011 A1
20110166988 Coulter Jul 2011 A1
20110173116 Yan et al. Jul 2011 A1
20110178841 Rane et al. Jul 2011 A1
20110178899 Huszar Jul 2011 A1
20110184838 Winters et al. Jul 2011 A1
20110196791 Dominguez Aug 2011 A1
20110270779 Showalter Nov 2011 A1
20110270925 Mina Nov 2011 A1
20120005070 McFall et al. Jan 2012 A1
20120023011 Hurwitz Jan 2012 A1
20120030771 Pierson et al. Feb 2012 A1
20120066065 Switzer Mar 2012 A1
20120066084 Sneyders Mar 2012 A1
20120072464 Cohen Mar 2012 A1
20120101938 Kasower Apr 2012 A1
20120101939 Kasower Apr 2012 A1
20120108274 Acebo Ruiz et al. May 2012 A1
20120109990 Yamasaki May 2012 A1
20120123942 Song et al. May 2012 A1
20120136763 Megdal et al. May 2012 A1
20120136774 Imrey et al. May 2012 A1
20120150678 Dyor Jun 2012 A1
20120158574 Brunzell et al. Jun 2012 A1
20120158654 Behren et al. Jun 2012 A1
20120173406 Fei et al. Jul 2012 A1
20120173417 Lohman et al. Jul 2012 A1
20120198556 Patel et al. Aug 2012 A1
20120204026 Shi et al. Aug 2012 A1
20120215682 Lent et al. Aug 2012 A1
20120226916 Hahn et al. Sep 2012 A1
20120232958 Silbert Sep 2012 A1
20120239553 Gonen et al. Sep 2012 A1
20120239583 Dobrowolski Sep 2012 A1
20120246060 Conyack, Jr. et al. Sep 2012 A1
20120253852 Pourfallah et al. Oct 2012 A1
20120265607 Belwadi Oct 2012 A1
20120284118 Mamich, Jr. et al. Nov 2012 A1
20120290660 Rao et al. Nov 2012 A1
20120317016 Hughes Dec 2012 A1
20120324388 Rao et al. Dec 2012 A1
20130018811 Britti et al. Jan 2013 A1
20130031624 Britti et al. Jan 2013 A1
20130060603 Wagner Mar 2013 A1
20130066775 Milam Mar 2013 A1
20130110565 Means et al. May 2013 A1
20130117087 Coppinger May 2013 A1
20130124263 Amaro et al. May 2013 A1
20130173449 Ng et al. Jul 2013 A1
20130173451 Kornegay et al. Jul 2013 A1
20130185293 Boback Jul 2013 A1
20130205135 Lutz Aug 2013 A1
20130211986 Debie et al. Aug 2013 A1
20130226706 Haggerty et al. Aug 2013 A1
20130226753 Haggerty et al. Aug 2013 A1
20130226779 Haggerty et al. Aug 2013 A1
20130226782 Haggerty et al. Aug 2013 A1
20130268357 Heath Oct 2013 A1
20130332338 Yan et al. Dec 2013 A1
20130332342 Kasower Dec 2013 A1
20130332467 Bornea et al. Dec 2013 A1
20130339249 Weller et al. Dec 2013 A1
20140032265 Paprocki et al. Jan 2014 A1
20140032300 Zhang et al. Jan 2014 A1
20140032723 Nema Jan 2014 A1
20140061302 Hammad Mar 2014 A1
20140089167 Kasower Mar 2014 A1
20140110477 Hammad Apr 2014 A1
20140136422 Jung et al. May 2014 A1
20140156500 Lassen et al. Jun 2014 A1
20140156501 Howe Jun 2014 A1
20140156503 Lassen et al. Jun 2014 A1
20140157375 Britti et al. Jun 2014 A1
20140258083 Achanta et al. Sep 2014 A1
20140279329 Dancel Sep 2014 A1
20150254329 Agarwal et al. Sep 2015 A1
20150269506 Britti et al. Sep 2015 A1
20150278944 Searson et al. Oct 2015 A1
20150287091 Koran Oct 2015 A1
20150295906 Ufford et al. Oct 2015 A1
20150310543 DeBie Oct 2015 A1
20150339769 deOliveira et al. Nov 2015 A1
20160055487 Votaw et al. Feb 2016 A1
20160071175 Reuss et al. Mar 2016 A1
20160092997 Shen et al. Mar 2016 A1
20170041296 Ford et al. Feb 2017 A1
20170046526 Chan Feb 2017 A1
20170046652 Haldenby Feb 2017 A1
20170046664 Haldenby Feb 2017 A1
20170046693 Haldenby Feb 2017 A1
20170048021 Yanovsky et al. Feb 2017 A1
20170061138 Lambert Mar 2017 A1
20170109735 Sheng et al. Apr 2017 A1
20170200223 Kasower Jul 2017 A1
20170249481 Edison Aug 2017 A1
20170278182 Kasower Sep 2017 A1
20170300627 Giordano Oct 2017 A1
20180060596 Hamel et al. Mar 2018 A1
20180060600 Hamel Mar 2018 A1
20180062835 Hamel Mar 2018 A1
20180075527 Nagla et al. Mar 2018 A1
20180183768 Lobban Jun 2018 A1
20180204279 Painter et al. Jul 2018 A1
20180205707 Bellala et al. Jul 2018 A1
20180218069 Rege et al. Aug 2018 A1
20180239914 Chen et al. Aug 2018 A1
20180253702 Dowding Sep 2018 A1
20180276661 van Wingerden Sep 2018 A1
20180302215 Salgueiro Oct 2018 A1
20180309567 Wooden Oct 2018 A1
20190147544 Pecoraro et al. May 2019 A1
20190251558 Liu et al. Aug 2019 A1
20190288850 Beecham Sep 2019 A1
20190333142 Thomas Oct 2019 A1
20190347627 Lin et al. Nov 2019 A1
20200143363 Schmidt May 2020 A1
20200153627 Wentz May 2020 A1
20200211103 Searson et al. Jul 2020 A1
20200226284 Yin Jul 2020 A1
20200349639 Mousseau Nov 2020 A1
20210065160 Butvin et al. Mar 2021 A1
20220138238 Rege et al. May 2022 A1
Foreign Referenced Citations (38)
Number Date Country
101452555 Jun 2009 CN
102096886 Jun 2011 CN
102663650 Sep 2012 CN
0 554 083 Aug 1993 EP
0 919 942 Jun 1999 EP
1 028 401 Aug 2000 EP
1 988 501 Nov 2008 EP
1 322 809 Jul 1973 GB
10-2004-0078798 Sep 2004 KR
10-2013-0107394 Oct 2013 KR
2 181 216 Apr 2002 RU
WO 94012943 Jun 1994 WO
WO 95012857 May 1995 WO
WO 99046710 Sep 1999 WO
WO 00055778 Sep 2000 WO
WO 00065469 Nov 2000 WO
WO 01004821 Jan 2001 WO
WO 01039589 Jun 2001 WO
WO 01041355 Jun 2001 WO
WO 01084281 Nov 2001 WO
WO 02013047 Feb 2002 WO
WO 02071176 Sep 2002 WO
WO 2004114160 Dec 2004 WO
WO 2005022348 Mar 2005 WO
WO 2005124619 Dec 2005 WO
WO 2006099081 Sep 2006 WO
WO 2007004158 Jan 2007 WO
WO 2007106393 Sep 2007 WO
WO 2008021061 Feb 2008 WO
WO 2008147918 Dec 2008 WO
WO 2009117468 Sep 2009 WO
WO 2013009920 Jan 2013 WO
WO 2013066633 May 2013 WO
WO 2014088895 Jun 2014 WO
WO 2014137759 Sep 2014 WO
WO 2018144612 Aug 2018 WO
WO 2020146667 Jul 2020 WO
WO 2023081165 May 2023 WO
Non-Patent Literature Citations (195)
Entry
U.S. Appl. No. 12/705,489, filed Feb. 12, 2010, Bargoli et al.
U.S. Appl. No. 12/705,511, filed Feb. 12, 2010, Bargoli et al.
“A New Approach to Fraud Solutions”, BasePoint Science Solving Fraud, pp. 8, 2006.
“ACS Company Birch & Davis Wins Texas CHIP Contract,” PR Newswire, Section: Financial News, May 17, 2000, Dallas, TX, pp. 3.
Aharony et al., “Social Area Networks: Data Networking of the People, by the People, for the People,” 2009 International Conference on Computational Science and Engineering, May 2009, pp. 1148-1155.
“An Even Better Solution to Financing Elective Surgery . . . ”, Unicorn Financial, pp. 7, http://web.archive.org/web/20000816161359/http://www.unicornfinancial.com/, as downloaded Oct. 15, 2008.
“Authorizing Safety Net Public Health Programs,” Hearing before the Subcommittee on Health of theCommittee on Energy and Commerce, House of Representatives, One Hundred Seventh Congress, First Session, Serial No. 107-57, dated Aug. 1, 2001, 226 pgs.
An Expert System for Determining Medicaid Eligibility, Journal of Medical Systems, vol. 12, Nov. 5, 1988, in 10 pages.
Announcing TrueProfiler, http://web.archive.org/web/20021201123646/http://www.truecredit.com/index.asp, dated Dec. 1, 2002, 1 page.
Anonymous, “Credit-Report Disputes Await Electronic Resolution,” Credit Card News, Chicago, Jan. 15, 1993, vol. 5, No. 19, p. 5.
Anonymous, “MBNA Offers Resolution of Credit Card Disputes,” Hempstead, Feb. 2002, vol. 68, No. 2, p. 47.
Antonopoulos, Andreas M., “Mastering Bitcoin: Unlocking Digital Crypto-Currencies”, O'Reilly, Dec. 2014, First Edition, pp. 282.
Barry, Ellen, “Life, Liberty, and the Pursuit of Lipo,” The Boston Phoenix, News & Opinion, dated Apr. 6, 1998, as downloaded at http://weeklywire.com/ww/04-6-98/boston_feature_1.html (1 of 12) [Oct. 15, 2008 2:35:25 PM].
Belford, Terrence, “Technology Quarterly: Computers, Internet Speeds Credit Checks System Tailored for Doctors, Dentists,” The Globe and Mail (Canada), Section: Report on Business Special Reports, p. C10, Mar. 18, 1997.
“Beverly Hills Man Convicted of Operating ‘Bust-Out’ Schemes that Caused More than $8 Million in Losses”, Department of Justice, Jul. 25, 2006, 2 Pgs.
Bienkowski, Nik, “A New Tool for Portfolio Risk Management—Gold Bullion”, Apr. 2003, pp. 6.
“Birch & Davis Wins Texas CHIP Contract,” Birch & Davis Press Release, dated Jan. 4, 2000, 3 pgs., as downloaded from http://web.archive.org/web/20010304065515/www.birchdavis.com/txchip.htm (1 of 3) [Oct. 20, 2008 9:49:18 AM].
Boss, Shira J. “Elective Surgery Without the Plastic: Low-Interest Medical Financing Provides Alternative to Credit Cards,” factiva, Crain's New York Business, 2 pgs., dated Jun. 22, 1998.
Broward County CAP Grant Application, as printed on Aug. 10, 2009, 41 pgs.
Burr Ph.D., et al., “Utility Payments as Alternative Credit Data: A Reality Check”, Asset Builders of America, Inc., Oct. 5, 2006, pp. 1-18, Washington, D.C.
“Bust-Out Schemes”, Visual Analytics Inc. Technical Product Support, Newsletter vol. 4, Issue 1, Jan. 2005, pp. 7.
Calnan, Christopher, “Tenet, Fair Isaac invest $20M in startup,” MHT, Mass High Tech: The Journal of New England Technology, dated Jul. 23, 2007, 2 pgs.
Capps et al., “Recent Changes in Texas Welfare and Work, Child Care and Child Welfare Systems,” Assessing the New Federalism, The Urban Institute, State Update No. 1, 24 pgs., Jun. 2001.
CAPStone Newsletter, Sep. 2001, 8 pgs., as downloaded from http://web.archive.org/web/20011213115738/www.capcommunity.hrsa.gov/Newsletter/Newsletter12.htm (1 of 8) [Oct. 18, 2008 2:39:47 PM].
Card Marketing, Use the Latest CRM Tools and Techniques, www.CardForum.com, vol. 5 No. 10, Dec. 2001.
Cheney, Karen, “Fix Your Nose, If You Wish, But Not With This New Loan,” Money Magazine, vol. 27, No. 5, 1 pg., dated May 1, 1998.
CreditSesame; “FAQ's”; http://www.creditsesame.com/how-we-help/faqs/#cb printed Dec. 5, 2011 in 8 pages.
CreditSesame; “Promote Your Financial Responsibility to Get an Edge in Life”; http://www.creditsesame.com/credit-badge/ printed Dec. 2, 2011 in 1 page.
CreditToolkit, Digital Matrix Systems, as printed out Mar. 4, 2008, pp. 2.
“Credit Information Bureaus and ‘CIBIL’”, http://www.icicibank.com/cibil.html printed Aug. 22, 2012 in 3 pages.
“Consumers Gain Immediate and Full Access to Credit Score Used by Majority of U.S. Lenders”, PR Newswire, ProQuest Copy, Mar. 19, 2001, p. 1.
“CreditCheck Monitoring Services,” Dec. 11, 2000, pp. 1, lines 21-23.
“D&B Corporate Family Linkage”, D&B Internet Access for U.S. Contract Customers, https://www.dnb.com/ecomp/help/linkage.htm as printed Dec. 17, 2009, pp. 1.
“Data Loss Prevention (DLP) Software”, http://www.symantec.com/data-loss-prevention/ printed Apr. 8, 2013 in 8 pages.
“Data Protection”, http://compliantprocessing.com/data-protection/ printed Apr. 8, 2013 in 4 pages.
“Debt Settlement: Watch Video on how to Pay Your Debt Faster”, http://www.debtconsolidationcare.com/debt-settlement.html printed Jan. 9, 2013 in 6 pages.
DentalFinancing.com, “Financial services for patients and dental professionals,”, 7 pgs., as downloaded from http://web.archive.org/web/20010607151954/www.dentalfinancing.com/dentist/index.asp (1 of 2) [Oct. 15, 2008 3:55:16 PM].
DiBartolomeo, Dan, “Portfolio Optimization: The Robust Solution,” Prudential Securities Quantitative Conference, Dec. 21, 1993, pp. 8.
Dietz, Ellen, “Dental Office Management,” 8 pgs. , pp. 316-321, Jul. 16, 1999.
Downes et al., Dictionary of Finance and Investment Terms, Fifth Edition, Nov. 1, 1998, pp. 332-333.
Dymi, Amilda, Need for Leads Spurs Some Upgrades, Origination News—Special Report, May 1, 2008, vol. vol. 17, Issue No. 8, Pages p. 24, Atlanta, Copyright 2008 SourceMedia, Inc.
eFunds Introduces QualiFileSM, Deluxe Corporation, eFunds Press Release and Product Launch, Sep. 23, 1999, Milwaukee, WI.
Electronic Privacy Information Center, “The Fair Credit Reporting Act” 15 USC 1681 (1992), 10 pgs., as downloaded from http://epic.org/privacy/financial/fcra.html on Mar. 19, 2008.
Ellwood, Marilyn, “The Medicaid Eligibility Maze: Coverage Expands, but Enrollment Problems Persist, Findings from a Five-State Study,” Mathematica Policy Research, Inc., Occasional Paper No. 30, 56 pgs., Dec. 1999.
Equifax Consumer Credit Report http://www.equifax.com/home/, as retrieved on Sep. 17, 2008.
Ettorre, “Paul Kahn on Exceptional Marketing,” Management Review, vol. 83, No. 11, Nov. 1994, pp. 48-51.
Expensr.com http://www.expensr.com/, as retrieved on Sep. 17, 2008.
Experian Consumer Credit Report http://www.experian.com/, as retrieved on Sep. 17, 2008.
Experian, Custom Strategist and Qualifile from Funds, Jun. 2000, in 2 pages.
Experian, “Enabling e-business”, White Paper, Jan. 2001, pp. 21.
Experian, “Instant Prescreen: Offer preapproved credit at the point of sale”, Oct. 2000, pp. 2, http://www.cdillinois.com/pdf_file/instant_prescreen_ps.pdf.
Experian, “Experian Rental Payment Data,” http://www.experian.com/rentbureau/rental-data.html printed Nov. 22, 2013 in 2 pages.
FamilySecure.com; “Identity Theft Protection for the Whole Family | FamilySecure.com” http://www.familysecure.com/, as retrieved on Nov. 5, 2009.
Fan et al., “Design of Customer Credit Evaluation System for E-Business”, 2004 IEEE International Conference on Systems, Man and Cybernetics, 2004, pp. 392-397.
Felsenthal, Edward, “Health Costs; Managed Care Helps Curb Costs, Study Says,” The Wall Street Journal, dated Aug. 12, 1991.
“Fictitious Business Name Records”, Westlaw Database Directory, http://directory.westlaw.com/scope/default.asp?db=FBN-ALL&RS-W . . . &VR=2.0 as printed Dec. 17, 2009, pp. 5.
“Fighting the New Face of Fraud”, FinanceTech, http://www.financetech.com/showArticle.jhtml?articleID=167100405, Aug. 2, 2005.
“Financing Medical Procedures A Lucrative But Risky Business,” Credit Risk Management Report, vol. 10, Issue 15, 2 pgs., dated Aug. 7, 2000.
Fisher, Joseph, “Access to Fair Credit Reports: Current Practices and Proposed Legislation,” American Business Law Journal, Fall 1981, vol. 19, No. 3, p. 319.
“Fund Manager,” Portfolio Management Software website, indexed into Google on Jan. 7, 2005, Retrieved Oct. 24, 2014 http://www.fundmanagersoftware.com/, http://www.fundmanagersoftware.com/help/gph_tp_pieasset.html, http://www.fundmanagersoftware.com/demo2.html.
Gilje, Shelby, “Credit Agency Moving into Health Care,” NewsRoom, The Seattle Times, Section: Scene, Mar. 22, 1995, pp. 3, http://web2.westlaw.com/result/documenttext.aspx?rs=WLW8.03&ss+CNT&rp=%2fWelc . . . .
Gionis et al., “Similarity Search in High Dimensions via Hashing”, Sep. 7, 1999, pp. 518-529.
Giudici, Paolo, “Bayesian Data Mining, with Application to Benchmarking and Credit Scoring, ” Applied Stochastic Models in Business and Industry, 2001, vol. 17, pp. 69-81.
“GLBA Compliance and FFIEC Compliance” http://www.trustwave.com/financial-services.php printed Apr. 8, 2013 in 1 page.
Goldstein, Jacob, “The Newest Vital Sign: Your Credit Score,” The Wall Street Journal, Health Blog, as viewed at http://blogs.wsj.com/health/2008/03/18/the-newest-vital-sign-your-cr, Mar. 18, 2008, pp. 3.
Gualtieri et al., “The Forrester Wave™: Big Data Streaming Analytics, Q1 2016”, Forrester®, Mar. 30, 2016, pp. 14, https://www.sas.com/content/dam/SAS/en_us/doc/analystreport/forrester-big-data-streaming-analytics-108218.pdf.
Henry, M.D., Kimberly A., “The Face-Lift Sourcebook,” Oct. 11, 2000, 3 pgs. (p. 207).
Herron, Janna, “Social Media-Based Credit Score?”, http://www.bankrate.com/financing/credit-cards/social-media-based-credit-score/, posted Friday, Jan. 13, 2012, printed Nov. 22, 2013 in 2 pages.
ID Analytics, “ID Analytics® Consumer Notification Service” printed Apr. 16, 2013 in 2 pages.
Ideon, Credit-Card Registry that Bellyflopped this Year, Is Drawing some Bottom-Fishers, The Wall Street Journal, Aug. 21, 1995, pp. C2.
“Improving the Implementation of State Children's Health Insurance Programs for Adolescents Report of an Invitational Conference Sponsored by the American Academy of Pediatrics, Section on Adolescent Health,” Pediatrics, Official Journal of the American Academy of Pediatrics, Section on Adolescent Health, Sep. 26-27, 1999, 9 pages.
IndiCareTM, On-Line Patient Assistant Program, Website User's Manual, JBI Associates, LLC, Jan. 1997, pp. 17.
Kauffman et al., “Research Directions on the Role an Impact of ICT in Microfinance”, Proceedings of the 43rd Hawaii International Conference on System Sciences, 2010, pp. 10.
Kent, Heather, “Huge declines in price as competition heats up in Vancouver's booming laser-surgery market,” CMAJ, Oct. 5, 1999; 161 (7), pp. 857-858.
Lan, Joe, “The Top Portfolio Management Software,” http://www.aaii.com/computerizedinvesting/article/the-top-portfolio-management-software, Includes Discussion thread, Fourth Quarter 2011, pp. 17.
Lanubile, et al., “Evaluating Empirical Models for the Detection of High-Risk Components: Some Lessons Learned”, 20th Annual Software Engineering Workshop, Nov. 29-30, 1995, Greenbelt, Maryland, pp. 1-6.
Lavelle, Marianne, “Health Plan Debate Turning To Privacy Some Call for Safeguards On Medical Disclosure. Is a Federal Law Necessary?,” The National Law Journal, vol. 16, No. 39, dated May 30, 1994, as downloaded from http://web2.westlaw.com/result/.
Lendingtree.com, “Lender Ratings & Reviews,” http://web.archive.org/web/20091015043716/http://www.lendingtree.com/lender-reviews/, Oct. 15, 2009, in 21 pages.
Letter to Donald A. Robert from Carolyn B. Maloney, dated Oct. 31, 2007, pp. 2.
Letter to Donald A. Robert from Senator Charles E. Schumer, dated Oct. 11, 2007, pp. 2.
Letter to Harry C. Gambill from Carolyn B. Maloney, dated Oct. 31, 2007, pp. 2.
Letter to Harry C. Gambill from Senator Charles E. Schumer, dated Oct. 11, 2007, pp. 2.
Letter to Richard F. Smith from Carolyn B. Maloney, dated Oct. 31, 2007, pp. 2.
Letter to Richard F. Smith from Senator Charles E. Schumer, dated Oct. 11, 2007, pp. 2.
Li et al., “Automatic Verbal Information Verification for User Authentication”, IEEE Transactions on Speech and Audio Processing, vol. 8, No. 5, Sep. 2000, pp. 585-596.
Littwin, Angela, “Beyond Usury: A Study of Credit-Card Use and Preference Among Low-Income Consumers”, Texas Law Review, vol. 86, No. 3, pp. 451-506; Feb. 2008.
Lorette, Kristie, “How to Successfully Dispute Inaccuracies on Your Credit Report,” http://web.archive.org/web/20110531184149/http://www.quizzle.com/blog/2011/03/how-to-successfully-dispute-inaccuracies-on-your-credit-report/, Mar. 25, 2011, in * pages.
Magid, Lawrence, J., Business Tools: When Selecting an ASP Ensure Data Mobility, Los Angeles Times, Los Angeles, CA, Feb. 26, 2001, vol. C, Issue 4, pp. 3.
Mathematica Policy Research, Inc., “1998 Health Care Survey of DoD Beneficiaries: Technical Manual,” Jul. 1999.
McGovern, Celeste, Jayhawk Medical Acceptance. (Brief Article), Alberta Report, 1 pg., dated Aug. 23, 1999.
McLaughlin, Nancy H., “Homeless, pregnant and alone Dana Sides knows her baby is likely to come in a month, but she has no idea where she will go after leaving the hospital,” NewsRoom, Greensboro News & Record (NC), Section: General News, dated Dec. 6, 2001.
“MediCredit Announces Major Investment from Medstone; Financing Will Enable Dramatic Expansion of Online Services,” Business Wire, pp. 2, dated May 12, 2000.
MediCredit, Patient Financing, “Thought you couldn't afford Cosmetic Surgery?,” 3 pgs., as downloaded from http://web.archive.org/web/19970601060333/http://www.medicredit.com/ (1 of 2) [Oct. 15, 2008 3:16:31 PM].
Medick et al., “German Agency to Mine Facebook to Assess Creditworthiness”, Jun. 7, 2012, http://www.spiegel.de/international/germany/german-credit-agency-plans-to-analyze-individual-facebook-pages-a-837539.html printed Nov. 22, 2013 in 2 pages.
Menge, Falko, “Enterprise Service Bus”, Free and Open Source Software Conference, 2007, pp. 6.
Merriam Webster's Collegiate Dictionary, 10th Edition, Jan. 1, 1993, p. 79.
MicroBilt, “PRBC Credit Reporting Agency—Payment Reporting Builds Credit,” retrieved from http://www.microbilt.com/nontraditional-credit-report.aspx and corresponding “Sample Report,” retrieved from http://www.microbilt.com/pdfs/PRBC%20Sample%20Report%20(complete).pdf printed Nov. 21, 2013 in 8 pages.
Microfinance Africa, “Philippines: Microfinance Players to get Their Own Credit Info Bureau,” Apr. 5, 2011, http://microfinanceafrica.net/microfinance-around-the-world/philippines-microfinance-players-to-get-their-own-credit-info-bureau/ printed Nov. 22, 2013 in 2 pages.
Mint.com, http://www.mint.com/ printed Sep. 18, 2008 in 2 pages.
MS Money Software by Microsoft http://www.microsoft.com/Money/default.mspx as retrieved on Sep. 17, 2008 in 1 page.
My ID Alerts, “Why ID Alerts” http://www.myidalerts.com/why-id-alerts.jsps printed Apr. 3, 2012 in 2 pages.
My ID Alerts, “How it Works” http://www.myidalerts.com/how-it-works.jsps printed Apr. 3, 2012 in 3 pages.
MyReceipts, http://www.myreceipts.com/, printed Oct. 16, 2012 in 1 page.
MyReceipts—How it Works, http://www.myreceipts.com/howItWorks.do, printed Oct. 16, 2012 in 1 page.
“Name Availability Records”, Westlaw Database Directory, http://directory.westlaw.com/scope/default.asp?db=NA-ALL&RS=W . . . &VR=2.0 as printed Dec. 17, 2009, pp. 5.
NewsRoom, “CIGNA Report Withdrawn As Foe Sees Opening,” Insurance Regulator, State Survey, Sep. 9, 1996, vol. 8, Issue 34, pp. 4.
“New for Investors: Asset Allocation, Seasoned Returns and More,” Prosper, http://blog.prosper.com/2011/10/27/new-for-investors-asset-allocation-seasoned-returns-and-more/, Oct. 27, 2011, pp. 4.
Next Card: About Us, http://web.cba.neu.edu/˜awatson/NextCardCase/NextCardAboutUs.htm printed Oct. 23, 2009 in 10 pages.
Organizing Maniac's Blog—Online Receipts Provided by MyQuickReceipts.com,http://organizingmaniacs.wordpress.com/2011/01/12/online-receipts-provided-by-myquickreceipts.com/ dated Jan. 12, 2011 printed Oct. 16, 2012 in 3 pages.
Pagano, et al., “Information Sharing in Credit Markets,” Dec. 1993, The Journal of Finance, vol. 48, No. 5, pp. 1693-1718.
Partnoy, Frank, Rethinking Regulation of Credit Rating Agencies: An Institutional Investor Perspective, Council of Institutional Investors, Apr. 2009, pp. 21.
Paustian, Chuck, “Every Cardholder a King Customers get the Full Treatment at Issuers' Web Sites,” Card Marketing, New York, Mar. 2001, vol. 5, No. 3, pp. 4.
Pennsylvania Law Weekly, “Discriminating Against Victims Admitting Domestic Abuse Can Lead to Denial of Insurance Coverage,” vol. XVIII, No. 26, dated Jun. 26, 1996, 2 pgs., as downloaded from http://web2.westlaw.com/result/documenttext.aspx?rs=WLW8.
Phinisee, Tamarind, “Banks, FTC Step Up Efforts to Address Identity Theft”, San Antonio Business Journal; San Antonio, Jul. 5, 2002, vol. 16, No. 24, pp. 5.
Planet Receipt—Home, http://www.planetreceipt.com/home printed Oct. 16, 2012 in 1 page.
Planet Receipt—Solutions & Features, http://www.planetreceipt.com/solutions-features printed Oct. 16, 2012 in 2 pages.
“Qualifying For Debt Settlement”, http://www.certifieddebt.com/debt/settlement-qualifications.shtml printed Jan. 9, 2013 in 2 pages.
Quantix Software, “Investment Account Manager,” available at https://www.youtube.com/watch?v=1UwNTEER1Kk, as published Mar. 21, 2012.
Quicken Online by Intuit http://www.quicken.intuit.com/, as retrieved on Sep. 17, 2008.
“Quicken Support”, http://web.archive.org/web/20071231040130/http://web.intuit.com/support/quicken/docs/d_qif.html as archived Dec. 31, 2007 in 6 pages.
Ramaswamy, Vinita M., Identity-Theft Toolkit, The CPA Journal, Oct. 1, 2006, vol. 76, Issue 10, pp. 66-70.
RAP Interactive, Inc. and Web Decisions: Proudly Presents Live Decisions, A Powerful New Information and Technology Resource that Revolutionizes Interactive Marketing, downloaded from www.webdecisions.com/pdf/LiveDecisions_Bro.pdf, as printed on Aug. 13, 2007.
“Recognition and use by Appraisers of Energy-Performance Benchmarking Tools for Commercial Buildings,” prepared by the Institute for Market Transformation, NYSERDA, Feb. 2003, pp. 6.
Repici et al., “The Comma Separated Value (CSV) File Format”, http://creativyst.com/Doc/Articles/CSV/CSV01.htm, Creativyst, Inc., 2002, pp. 10.
“Resolve Debt for Less: With Help from Freedom Financial” http://www.debtsettlementusa.com/ printed Jan. 9, 2013 in 6 pages.
Roth, Andrew, “CheckFree to Introduce E-Mail Billing Serving,” American Banker, New York, Mar. 13, 2001, vol. 166, No. 49, pp. 3.
Rubin, Rita, “Cosmetic Surgery On Credit, Finance plans let patients reconstruct now, pay later,” The Dallas Morning News, 2 pgs., dated Sep. 10, 1988.
Screenshot for Investment Account Manager v.2.8.3, published at http://www.aaii.com/objects/get/1642.gif by at least Aug. 30, 2011 in 1 page.
SearchAmerica, “Payment Advisor Suite TM”, Solutions, 2009, pp. 2.
Selz, Michael, “Lenders Find Niche In Cosmetic Surgery That Isn't Insured—But Since You Can't Repossess A Nose Job, Risks Aren't Restricted to the Patients,” Wall Street Journal, New York, N.Y., Jan. 1997, p. A.1, 3 pgs.
“Settling Your Debts—Part 1 in Our Debt Settlement Series”, http://www.creditinfocenter.com/debt/settle_debts.shtml printed Jan. 9, 2013 in 6 pages.
ShoeBoxed, https://www.shoeboxed.com/sbx-home/ printed Oct. 16, 2012 in 4 pages.
Simpson, Glyn, “Microsoft (MS) Money, MSMoney FAQ, Help and Information Pages”, pp. 2, Copyright © Glyn Simpson 1998-2007, http://web.archive.org/web/20071018075531/http://money.mvps.org/faq/article/196.aspx.
“StarNet Financial, Inc. Acquires Proprietary Rights to Sub-Prime Underwriting System Through Strategic Alliance With TRAkkER Corporation”, PR Newswire, Dallas, TX, Sep. 13, 1999.
State of Wisconsin, Division of Health Care Financing, Department of Health and Family Services: 1999-2001 Biennial Report, pp. 17-21.
Stein, Benchmarking Default Prediction Models: Pitfalls and Remedies in Model Validation, Moody's KMV, Revised Jun. 13, 2002, Technical Report #020305; New York.
Sumner, Anthony, “Tackling The Issue of Bust-Out Fraud”, Experian: Decision Analytics, Dec. 18, 2007, pp. 24.
Sumner, Anthony, “Tackling The Issue of Bust-Out Fraud”, e-News, Experian: Decision Analytics, pp. 4, [Originally Published in Retail Banker International Magazine Jul. 24, 2007].
Texas Department of Human Services, 1999 Annual Report, 60 Years of Progress, Medial Services 9P137, Publication No. DHS-600-FY99.
thatlook.com, Cosmetic Surgery Financing, 3 pgs, as downloaded from http://web.archive.org/web/200001214113900/www.thatlook.com/cosmetic_surgery_financing.cfm (1 of 2) [Oct. 15, 2008 4:11:47 PM].
Thomas, David, “Report on Networks and Electronic Communications Newcourt Credit Turns to Extranet Services / A PC Connects To 1,200 Users At Once”, The Globe and Mail (Canada), Section: Report on Business Special Report, Nov. 12, 1996, pp. 2.
TRAkkER Corporation website, trakkercorp.com, TRAkkER Software Description, May 26, 2000, available at http://web.archive.org/web/20000526234204/http://trakkercorp.com/page4.html.
TransUnion Consumer Credit Report http://www.transunion.com/, as retrieved on Sep. 17, 2008.
US Legal, Description, http://www.uslegalforms.com/us/US-00708-LTR.htm printed Sep. 4, 2007 in 2 pages.
Washington State Office of Public Defense, “Criteria and Standards for Determining and Verifying Indigency,” dated Feb. 9, 2001.
Webpage printed from http://www.magnum.net/pdfs/RapUpBrochure.pdf as printed Mar. 3, 2008.
“We Eliminate Bad Debt”, as printed from http://www.webcreditbureau.com/start/, dated Aug. 22, 2012, 1 Page.
“Web Site Fuels Elective Surgery Trend; The Complete Resource to Paying for Cosmetic Surgery, Laser Vision Correction and Cosmetic Dentistry,” Business Wire, Apr. 7, 1999, pp. 2.
Wesabe.com http://www.wesabe.com/, as retrieved on Sep. 17, 2008.
White, Ron, “How Computers Work”, Special 10th Anniversary, Seventh Edition, Que Corporation, Indianapolis, IN, Oct. 2003, pp. 23.
Wilson, Andrea, “Escaping the Alcatraz of Collections and Charge-Offs”, http://www.transactionworld.net/articles/2003/october/riskMgmt1.asp, Oct. 2003.
Window on State Government, Susan Combs, Texas Comptroller of Public Accounts, Chapter 8: Health and Human Services, “Improve the Medicaid Eligibility Determination Process,” 9 pgs., as downloaded Apr. 9, 2008 from http://www.window.state.tx.us/etexas2001/recommend/ch08.
Winsborough, William et al., “Automated Trust Negotiation”, Conference: DARPA Information Survivability Conference and Exposition, DISCEX '00, Proceedings, vol. 1, Feb. 2000, pp. 15.
Wisconsin Department of Workforce Development, BadgerCare Medicaid Application Credit Report Authorization Form, dated Jun. 21, 2001, effective date, Jul. 1, 2001.
Wisconsin Department of Workforce Development, BadgerCare Medicaid Notification of Eligibility, dated Jul. 25, 2000, effective date, Jul. 1, 2000.
Wood, Greg, “Top Streaming Technologies for Data Lakes and Real-Time Data”, http://blog.zaloni.com/top-streaming-technologies-for-data-lakes-and-real-time-data, Sep. 20, 2016 in 3 pages.
Zoot—Decision Engine, www.zootweb.com/decision_engine.html, as printed on Mar. 3, 2008.
Zoot—Pre-Built Standard Attributes, www.zootweb.com/credit_attributes.html as printed Mar. 3, 2008.
Official Communication in Australian Patent Application No. 2012281182, dated Jul. 8, 2014.
Official Communication in Australian Patent Application No. 2012281182, dated May 19, 2015.
Official Communication in Chinese Patent Application No. 201280041782.2, dated Mar. 4, 2016.
Official Communication in European Patent Application No. 12811546.6, dated Nov. 25, 2014.
Official Communication in European Patent Application No. 12811546.6, dated Sep. 18, 2015.
Official Communication in Indian Patent Application No. 490/DELNP/2014, dated Jun. 20, 2019.
Official Communication in Russian Patent Application No. 2014101674/08, dated Dec. 15, 2014.
International Search Report and Written Opinion for Application No. PCT/US2012/046316, dated Sep. 28, 2012.
International Preliminary Report on Patentability and Written Opinion for Application No. PCT/US2012/046316, dated Jan. 14, 2014.
Official Communication in Australian Patent Application No. 2013356451, dated Jun. 22, 2015.
Official Communication in Chinese Patent Application No. 201380006862.9, dated Aug. 2, 2016.
Official Communication in European Patent Application No. 13860724.7, dated May 21, 2015.
Official Communication in Russian Patent Application No. 2014127000, dated Dec. 23, 2015.
International Search Report and Written Opinion for Application No. PCT/US2013/072102, dated Apr. 18, 2014.
International Preliminary Report on Patentability and Written Opinion for Application No. PCT/US2013/072102, dated Jun. 9, 2015.
Official Communication in Australian Patent Application No. 2014203430, dated Aug. 15, 2015.
Official Communication in Chinese Patent Application No. 201480000626.0, dated Aug. 1, 2016.
Official Communication in European Patent Application No. 14733951.9, dated Sep. 11, 2015.
Official Communication in Russian Patent Application No. 2014127320, dated Jul. 5, 2016.
International Search Report and Written Opinion for Application No. PCT/US2014/019142, dated Jun. 20, 2014.
International Preliminary Report on Patentability and Written Opinion for Application No. PCT/US2014/019142, dated Sep. 17, 2015.
International Search Report and Written Opinion for Application No. PCT/US2017/048265, dated Dec. 5, 2017.
International Preliminary Report on Patentability in Application No. PCT/US2017/048265, dated Mar. 7, 2019.
Official Communication in Australian Patent Application No. 2018215082, dated Jan. 21, 2022.
Partial Supplementary European Search Report for Application No. EP12747205, dated May 14, 2020.
Extended European Search Report for Application No. EP12747205, dated Aug. 14, 2020.
Extended European Search Report for Application No. EP12747205, dated Feb. 11, 2022.
Official Communication in Indian Patent Application No. 201917029540, dated Jan. 7, 2022.
International Search Report and Written Opinion for Application No. PCT/US2018/016258, dated May 16, 2018.
International Preliminary Report on Patentability in Application No. PCT/US2018/016258, dated Aug. 15, 2019.
International Search Report and Written Opinion for Application No. PCT/US2020/012976, dated May 6, 2020.
International Preliminary Report on Patentability in Application No. PCT/US2020/012976, dated Jul. 22, 2021.
Provisional Application as filed in U.S. Appl. No. 60/168,272, dated Dec. 1, 1999 in 14 pages.
Provisional Application as filed in U.S. Appl. No. 60/168,276, dated Dec. 1, 1999 in 82 pages.
Provisional Application as filed in U.S. Appl. No. 60/213,367, dated Jun. 23, 2000 in 20 pages.
Application as filed in U.S. Appl. No. 09/653,595, dated Aug. 31, 2000.
International Search Report and Written Opinion for Application No. PCT/US2022/048616, dated Mar. 14, 2023.
Related Publications (1)
Number Date Country
20240048357 A1 Feb 2024 US
Provisional Applications (1)
Number Date Country
62527579 Jun 2017 US
Continuations (2)
Number Date Country
Parent 16941142 Jul 2020 US
Child 18295694 US
Parent 16022354 Jun 2018 US
Child 16941142 US