Systems, methods and computer-program products for eligibility verification

Information

  • Patent Grant
  • 10373240
  • Patent Number
    10,373,240
  • Date Filed
    Tuesday, December 9, 2014
    10 years ago
  • Date Issued
    Tuesday, August 6, 2019
    5 years ago
Abstract
In one embodiment, a method includes receiving, from a requestor, a request for an on-demand product. The method further includes determining an eligibility token format applicable to the request, wherein the eligibility token format comprises a plurality of partial segments of identifying information. The method also includes prompting the requestor to provide a plurality of partial-segment values corresponding to the plurality of partial segments. In addition, the method includes receiving the plurality of partial-segment values in response to the prompting. Moreover, the method includes generating an eligibility token from the plurality of partial-segment values. The method also includes determining the requestor's eligibility for the on-demand product based, at least in part, on a lookup of the eligibility token in an eligibility token repository. The eligibility token repository includes a plurality of eligibility tokens of the eligibility token format.
Description
BACKGROUND
Technical Field

The present disclosure relates generally to computer processing and more particularly, but not by way of limitation, to eligibility verification systems and methods for on-demand products.


History of Related Art

Numerous computer systems exist that provide on-demand products to consumers. For purposes of this patent application, an on-demand product is a product that is requested by a requestor such as a consumer and is intended by a provider to be delivered in real-time or in near real-time. On-demand products are generally requested electronically over a communications network such as, for example, public or private intranets, a public switched telephone network (PSTN), a cellular network, the Internet, or the like. Examples of on-demand products include content such as, for example, text, graphics, photos, video, audio, code, software applications, documents, access to cloud applications, and the like. On-demand products can also include content streaming, for example, of video, audio, and the like. By way of further example, on-demand products may include services such as, for example, identity-monitoring services.


In general, on-demand products are not, inter alia, physically shipped or delivered. Rather, on-demand products are typically delivered electronically over a communications network or by initiating a requested service. Oftentimes, however, it can be difficult to provide and determine eligibility for on-demand products efficiently and securely.


SUMMARY OF THE INVENTION

In one embodiment, a method includes receiving, from a requestor, a request for an on-demand product. The method further includes determining an eligibility token format applicable to the request, wherein the eligibility token format comprises a plurality of partial segments of identifying information. The method also includes prompting the requestor to provide a plurality of partial-segment values corresponding to the plurality of partial segments. In addition, the method includes receiving the plurality of partial-segment values in response to the prompting. Moreover, the method includes generating an eligibility token from the plurality of partial-segment values. The method also includes determining the requestor's eligibility for the on-demand product based, at least in part, on a lookup of the eligibility token in an eligibility token repository. The eligibility token repository includes a plurality of eligibility tokens of the eligibility token format.


In one embodiment, a system includes at least one processor. The at least one processor is operable to perform a method. The method further includes determining an eligibility token format applicable to the request, wherein the eligibility token format comprises a plurality of partial segments of identifying information. The method also includes prompting the requestor to provide a plurality of partial-segment values corresponding to the plurality of partial segments. In addition, the method includes receiving the plurality of partial-segment values in response to the prompting. Moreover, the method includes generating an eligibility token from the plurality of partial-segment values. The method also includes determining the requestor's eligibility for the on-demand product based, at least in part, on a lookup of the eligibility token in an eligibility token repository. The eligibility token repository includes a plurality of eligibility tokens of the eligibility token format.


In one embodiment, a computer-program product includes a non-transitory computer-usable medium having computer-readable program code embodied therein. The computer-readable program code adapted to be executed to implement a method. The method further includes determining an eligibility token format applicable to the request, wherein the eligibility token format comprises a plurality of partial segments of identifying information. The method also includes prompting the requestor to provide a plurality of partial-segment values corresponding to the plurality of partial segments. In addition, the method includes receiving the plurality of partial-segment values in response to the prompting. Moreover, the method includes generating an eligibility token from the plurality of partial-segment values. The method also includes determining the requestor's eligibility for the on-demand product based, at least in part, on a lookup of the eligibility token in an eligibility token repository. The eligibility token repository includes a plurality of eligibility tokens of the eligibility token format.





BRIEF DESCRIPTION OF THE DRAWINGS

A more complete understanding of the method and apparatus of the present disclosure may be obtained by reference to the following Detailed Description when taken in conjunction with the accompanying Drawings wherein:



FIG. 1 illustrates an example of a system that can be used to dynamically determine eligibility for an on-demand product.



FIG. 2 illustrates an example of a process for establishing an eligibility token repository.



FIG. 3 illustrates an example of eligibility token generation.



FIG. 4 illustrates an example of a process for determining requestor eligibility for an on-demand product.





DETAILED DESCRIPTION

In various embodiments, on-demand products can be provided by a computer system over a network. For purposes of this patent application, providing or delivering an on-demand product refers to automated actions by a computer system to fulfill a request for the on-demand product. For example, for various types of on-demand products, providing or delivering the on-demand products can include transmitting, streaming, or initializing the on-demand product. For various types of on-demand products, providing or delivering the on-demand products can also include, for example, making the on-demand products accessible to consumers for transmission or streaming thereto.


One example of an on-demand product is an on-demand identity product. An on-demand identity product, as used herein, is an on-demand product as defined above that may be used to facilitate discovery or prevention of identity theft. Identity theft generally involves a use of personally identifying information (PII) that is not authorized by an owner of the PII and can include, for example, an unauthorized change to PII or an unauthorized use of PII to access resources or to obtain credit or other benefits. PII, as used herein, refers to information that can be used to uniquely identify, contact, or locate an individual person or can be used with other sources to uniquely identify, contact, or locate an individual person. PII may include, but is not limited to, social security numbers (SSNs), bank or credit card account numbers, passwords, birth dates, and addresses.


Identity products can include, for example, credit products. For purposes of this patent application, a credit product is an on-demand identity product as defined above that pertains to receiving, acquiring, reporting on, monitoring, or otherwise acting upon information related to consumer credit files. On-demand identity products that are not credit products may be referenced herein as non-credit products. Non-credit products can include monitoring and/or reporting services relating, for example, to exchanges of PII over the Internet, aliases associated with social-security numbers, sex-offender registries, payday loans, changes of address, and the like.


Oftentimes, a third party, or sponsor, may want to offer an on-demand product to a selected group of beneficiaries such as, for example, all or a subset of its customers. In various cases, the sponsor may partially or fully subsidize the on-demand product. The sponsored offer may be a reward to certain customers, a marketing promotion, a response to an unfavorable customer experience, combinations of same, and/or the like. In a more specific example, a retail outlet may be subject to a data breach that potentially exposes vast amounts of sensitive data relating to its customers. The sensitive data can include any data not intended for public dissemination such as, for example, data considered classified, confidential, personal, and/or the like. In such a case, the retail outlet may desire to provide an on-demand identity product, such as identity or credit monitoring, to a set of affected customers.


Various technical problems can arise when implementing sponsored offers for on-demand products. As an example, a provider of the on-demand product, who is often completely distinct from the sponsor, generally needs data or information sufficient to identify who is eligible. Although the sponsor may maintain data sufficient to identify a set of eligible beneficiaries, the provider typically does not.


One way to address the above-described problem is for either the sponsor or the provider to issue a code (e.g., a personal identification number) to each beneficiary. The codes can be shared between the provider and the sponsor. The beneficiaries can then enter the codes via a website associated with the provider. In certain embodiments, a disadvantage of this approach is that it does not scale well. For example, if there are millions of potential beneficiaries, as may be the case in the data breach example described above, millions of codes generally need to be generated and distributed. Sometimes, such codes must be distributed by mail due to limited contact information available to the sponsor, which can be expensive in time and money. Electronic distribution (e.g., email) can also be a substantial burden when significant numbers of beneficiaries are involved.


When there are a significant number of beneficiaries, another way to address the above-described problem is to omit eligibility verification. For instance, continuing the above example of the retail outlet that is subject to the data breach, the retail outlet can choose to make credit or identity monitoring available to the public at large. While this approach can remove any need to distribute codes, it also typically results in a much greater expense to the sponsor as a result of a potentially much greater class of beneficiaries than is necessary.


The present disclosure describes examples of determining eligibility for on-demand products using eligibility tokens. In certain embodiments, when a sponsor desires to offer an on-demand product to a group of beneficiaries, an eligibility token format can be configured based on information available to the sponsor about the group of beneficiaries. In various cases, the eligibility token format can define a composition of identifying information such as, for example, PII, that uniquely identifies beneficiaries.


Advantageously, in certain embodiments, the eligibility token format can include a plurality of partial segments of identifying information such as, for example, a last four digits of a SSN, a first three digits of an address field, etc. In various embodiments, the eligibility token format can be used as a basis to dynamically generate eligibility tokens for requestors of on-demand products. In certain embodiments, the eligibility tokens can be used to automatically determine whether the requestors are eligible beneficiaries of a sponsored offer for the on-demand product.



FIG. 1 illustrates an example of a system 100 that can be used to dynamically determine eligibility for an on-demand product. The system 100 includes a product-provision system 110, one or more external systems 116, and one or more client-computing devices 120. The product-provision system 110 is operable to communicate with the one or more external systems 116 and the one or more client-computing devices 120 over a network 118.


The product-provision system 110 includes a software application 114 operable to execute on computer resources 128. In particular embodiments, the product-provision system 110 may perform one or more steps or blocks of one or more methods described or illustrated herein. In particular embodiments, one or more computer systems may provide functionality described or illustrated herein. In particular embodiments, encoded software running on one or more computer systems may perform one or more steps or blocks of one or more methods described or illustrated herein or provide functionality described or illustrated herein.


The components of the product-provision system 110 may comprise any suitable physical form, configuration, number, type and/or layout. As an example, and not by way of limitation, the product-provision system 110 may comprise an embedded computer system, a system-on-chip (SOC), a single-board computer system (SBC) (such as, for example, a computer-on-module (COM) or system-on-module (SOM)), a desktop computer system, a laptop or notebook computer system, an interactive kiosk, a mainframe, a mesh of computer systems, a mobile telephone, a personal digital assistant (PDA), a wearable or body-borne computer, a server, or a combination of two or more of these. Where appropriate, the product-provision system 110 may include one or more computer systems; be unitary or distributed; span multiple locations; span multiple machines; or reside in a cloud, which may include one or more cloud components in one or more networks.


In the depicted embodiment, the product-provision system 110 includes a processor 102, memory 104, storage 108, interface 106, and bus 136. Although a particular product-provision system is depicted having a particular number of particular components in a particular arrangement, this disclosure contemplates any suitable product-provision system having any suitable number of any suitable components in any suitable arrangement.


Processor 102 may be a microprocessor, controller, or any other suitable computing device, resource, or combination of hardware, software and/or encoded logic operable to execute, either alone or in conjunction with other components, (e.g., memory 104), the software application 114. Such functionality may include providing various features discussed herein. In particular embodiments, processor 102 may include hardware for executing instructions, such as those making up the software application 114. As an example and not by way of limitation, to execute instructions, processor 102 may retrieve (or fetch) instructions from an internal register, an internal cache, memory 104, or storage 108; decode and execute them; and then write one or more results to an internal register, an internal cache, memory 104, or storage 108.


In particular embodiments, processor 102 may include one or more internal caches for data, instructions, or addresses. This disclosure contemplates processor 102 including any suitable number of any suitable internal caches, where appropriate. As an example and not by way of limitation, processor 102 may include one or more instruction caches, one or more data caches, and one or more translation lookaside buffers (TLBs). Instructions in the instruction caches may be copies of instructions in memory 104 or storage 108 and the instruction caches may speed up retrieval of those instructions by processor 102. Data in the data caches may be copies of data in memory 104 or storage 108 for instructions executing at processor 102 to operate on; the results of previous instructions executed at processor 102 for access by subsequent instructions executing at processor 102, or for writing to memory 104, or storage 108; or other suitable data. The data caches may speed up read or write operations by processor 102. The TLBs may speed up virtual-address translations for processor 102. In particular embodiments, processor 102 may include one or more internal registers for data, instructions, or addresses. Depending on the embodiment, processor 102 may include any suitable number of any suitable internal registers, where appropriate. Where appropriate, processor 102 may include one or more arithmetic logic units (ALUs); be a multi-core processor; include one or more processors 102; or any other suitable processor.


Memory 104 may be any form of volatile or non-volatile memory including, without limitation, magnetic media, optical media, random access memory (RAM), read-only memory (ROM), flash memory, removable media, or any other suitable local or remote memory component or components. In particular embodiments, memory 104 may include random access memory (RAM). This RAM may be volatile memory, where appropriate. Where appropriate, this RAM may be dynamic RAM (DRAM) or static RAM (SRAM). Moreover, where appropriate, this RAM may be single-ported or multi-ported RAM, or any other suitable type of RAM or memory. Memory 104 may include one or more memories 104, where appropriate. Memory 104 may store any suitable data or information utilized by the product-provision system 110, including software embedded in a computer readable medium, and/or encoded logic incorporated in hardware or otherwise stored (e.g., firmware). In particular embodiments, memory 104 may include main memory for storing instructions for processor 102 to execute or data for processor 102 to operate on. In particular embodiments, one or more memory management units (MMUs) may reside between processor 102 and memory 104 and facilitate accesses to memory 104 requested by processor 102.


As an example and not by way of limitation, the product-provision system 110 may load instructions from storage 108 or another source (such as, for example, another computer system) to memory 104. Processor 102 may then load the instructions from memory 104 to an internal register or internal cache. To execute the instructions, processor 102 may retrieve the instructions from the internal register or internal cache and decode them. During or after execution of the instructions, processor 102 may write one or more results (which may be intermediate or final results) to the internal register or internal cache. Processor 102 may then write one or more of those results to memory 104. In particular embodiments, processor 102 may execute only instructions in one or more internal registers or internal caches or in memory 104 (as opposed to storage 108 or elsewhere) and may operate only on data in one or more internal registers or internal caches or in memory 104 (as opposed to storage 108 or elsewhere).


In particular embodiments, storage 108 may include mass storage for data or instructions. As an example and not by way of limitation, storage 108 may include a hard disk drive (HDD), a floppy disk drive, flash memory, an optical disc, a magneto-optical disc, magnetic tape, or a Universal Serial Bus (USB) drive or a combination of two or more of these. Storage 108 may include removable or non-removable (or fixed) media, where appropriate. Storage 108 may be internal or external to the product-provision system 110, where appropriate. In particular embodiments, storage 108 may be non-volatile, solid-state memory. In particular embodiments, storage 108 may include read-only memory (ROM). Where appropriate, this ROM may be mask-programmed ROM, programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), electrically alterable ROM (EAROM), or flash memory or a combination of two or more of these. Storage 108 may take any suitable physical form and may comprise any suitable number or type of storage. Storage 108 may include one or more storage control units facilitating communication between processor 102 and storage 108, where appropriate.


In particular embodiments, interface 106 may include hardware, encoded software, or both providing one or more interfaces for communication (such as, for example, packet-based communication) among any networks, any network devices, and/or any other computer systems. As an example and not by way of limitation, communication interface 106 may include a network interface controller (NIC) or network adapter for communicating with an Ethernet or other wire-based network and/or a wireless NIC (WNIC) or wireless adapter for communicating with a wireless network.


Depending on the embodiment, interface 106 may be any type of interface suitable for any type of network for which product-provision system 110 is used. As an example and not by way of limitation, product-provision system 110 can include (or communicate with) an ad-hoc network, a personal area network (PAN), a local area network (LAN), a wide area network (WAN), a metropolitan area network (MAN), or one or more portions of the Internet or a combination of two or more of these. One or more portions of one or more of these networks may be wired or wireless. As an example, product-provision system 110 can include (or communicate with) a wireless PAN (WPAN) (such as, for example, a BLUETOOTH WPAN), a WI-FI network, a WI-MAX network, an LTE network, an LTE-A network, a cellular telephone network (such as, for example, a Global System for Mobile Communications (GSM) network), or any other suitable wireless network or a combination of two or more of these. The product-provision system 110 may include any suitable interface 106 for any one or more of these networks, where appropriate.


In some embodiments, interface 106 may include one or more interfaces for one or more I/O devices. One or more of these I/O devices may enable communication between a person and the product-provision system 110. As an example and not by way of limitation, an I/O device may include a keyboard, keypad, microphone, monitor, mouse, printer, scanner, speaker, still camera, stylus, tablet, touchscreen, trackball, video camera, another suitable I/O device or a combination of two or more of these. An I/O device may include one or more sensors. Particular embodiments may include any suitable type and/or number of I/O devices and any suitable type and/or number of interfaces 106 for them. Where appropriate, interface 106 may include one or more drivers enabling processor 102 to drive one or more of these I/O devices. Interface 106 may include one or more interfaces 106, where appropriate.


Bus 136 may include any combination of hardware, software embedded in a computer readable medium, and/or encoded logic incorporated in hardware or otherwise stored (e.g., firmware) to couple components of the product-provision system 110 to each other. As an example and not by way of limitation, bus 136 may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a front-side bus (FSB), a HYPERTRANSPORT (HT) interconnect, an Industry Standard Architecture (ISA) bus, an INFINIBAND interconnect, a low-pin-count (LPC) bus, a memory bus, a Micro Channel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a serial advanced technology attachment (SATA) bus, a Video Electronics Standards Association local (VLB) bus, or any other suitable bus or a combination of two or more of these. Bus 136 may include any number, type, and/or configuration of buses 136, where appropriate. In particular embodiments, one or more buses 136 (which may each include an address bus and a data bus) may couple processor 102 to memory 104. Bus 136 may include one or more memory buses.


Herein, reference to a computer-readable storage medium encompasses one or more tangible computer-readable storage media possessing structures. As an example and not by way of limitation, a computer-readable storage medium may include a semiconductor-based or other integrated circuit (IC) (such, as for example, a field-programmable gate array (FPGA) or an application-specific IC (ASIC)), a hard disk, an HDD, a hybrid hard drive (HHD), an optical disc, an optical disc drive (ODD), a magneto-optical disc, a magneto-optical drive, a floppy disk, a floppy disk drive (FDD), magnetic tape, a holographic storage medium, a solid-state drive (SSD), a RAM-drive, a SECURE DIGITAL card, a SECURE DIGITAL drive, a flash memory card, a flash memory drive, or any other suitable tangible computer-readable storage medium or a combination of two or more of these, where appropriate.


Particular embodiments may include one or more computer-readable storage media implementing any suitable storage. In particular embodiments, a computer-readable storage medium implements one or more portions of processor 102 (such as, for example, one or more internal registers or caches), one or more portions of memory 104, one or more portions of storage 108, or a combination of these, where appropriate. In particular embodiments, a computer-readable storage medium implements RAM or ROM. In particular embodiments, a computer-readable storage medium implements volatile or persistent memory. In particular embodiments, one or more computer-readable storage media embody encoded software.


Herein, reference to encoded software may encompass one or more applications, bytecode, one or more computer programs, one or more executables, one or more instructions, logic, machine code, one or more scripts, or source code, and vice versa, where appropriate, that have been stored or encoded in a computer-readable storage medium. In particular embodiments, encoded software includes one or more application programming interfaces (APIs) stored or encoded in a computer-readable storage medium. Particular embodiments may use any suitable encoded software written or otherwise expressed in any suitable programming language or combination of programming languages stored or encoded in any suitable type or number of computer-readable storage media. In particular embodiments, encoded software may be expressed as source code or object code. In particular embodiments, encoded software is expressed in a higher-level programming language, such as, for example, C, Perl, or a suitable extension thereof. In particular embodiments, encoded software is expressed in a lower-level programming language, such as assembly language (or machine code). In particular embodiments, encoded software is expressed in JAVA. In particular embodiments, encoded software is expressed in Hyper Text Markup Language (HTML), Extensible Markup Language (XML), or other suitable markup language.


In a typical embodiment, the product-provision system 110 is operable to provide on-demand products to eligible requestors of the on-demand products. The functionality of the product-provision system 110 can be facilitated by the software application 114. In certain embodiments, the software application 114 is operable to execute on the product-provision system 110 in the fashion described above. The software application 114 can include, for example, a fulfillment module 114(1) and an eligibility module 114(2).


In general, the fulfillment module 114(1) can logically encapsulate software that is operable to generate, acquire, and/or provide the on-demand products to requestors thereof. The on-demand products provisioned via the fulfillment module 114(1) may be selected from a number of categories such as, for example, text, graphics, photos, video, audio, code, software applications, documents, access to cloud applications, and the like. The on-demand products can also include content streaming, for example, of video, audio, and the like. By way of further example, on-demand products may include services such as, for example, monitoring services. Other examples of on-demand products will be apparent to one of ordinary skill in the art after reviewing the inventive principles contained herein.


The eligibility module 114(2) logically encapsulates software that determines eligibility for the on-demand products. The eligibility module 114(2) can maintain and access an eligibility token repository 112. In certain embodiments, the eligibility token repository 112 can include eligibility tokens that conform to a configurable eligibility token format. The eligibility token format can define a composition of segments of identifying information deemed to identify, and in some cases uniquely identify, eligible requestors of a particular on-demand product. In an example, the eligibility token format can include PII such as SSNs, bank or credit card account numbers, birth dates, addresses, combinations of same, and/or the like. In another example, the eligibility token can include business identifying information such as employer identification numbers, business addresses, combinations of same, and/or the like.


Advantageously, in certain embodiments, the eligibility token format can include a plurality partial segments, or portions, of identifying information. In an example, a particular eligibility token format could include portions, or substrings, of PII such as SSNs (e.g., last four digits), bank or credit card account numbers (e.g., first three digits), birth dates (e.g., a month portion of a birth date), addresses (e.g., a street-number portion of a home address), combinations of same, and/or the like. A particular eligibility token format can also include a combination of full and partial segments of identifying information.


In various cases, the eligibility token repository 112 can relate to a particular on-demand product, a particular sponsored offer for an on-demand product, combinations of same, and/or the like. In some embodiments, each eligibility token in the eligibility token repository 112 can include segment values corresponding to the segments defined by the eligibility token format. In certain embodiments, the product-provision system 110 can include more than one of the eligibility token repository 112. For example, the product-provision system 110 could maintain an eligibility token repository 112 for each sponsored offer it is configured to handle and/or for each on-demand product it is operable to provide. The eligibility token format implemented by the eligibility token repository 112 can be configured according to information available, for example, to a particular sponsor of an offer for a particular on-demand product.


As illustrated, the eligibility token repository 112 can be stored in the storage 108. The eligibility token repository 112 may be maintained, for example, in a database, flat file, and/or the like. In some cases, the eligibility token repository 112 can be stored or maintained in a data structure such as a hash table.


In a hash table implementation, the eligibility token repository 112 may map a plurality of keys to a plurality of values via a hash function. In an example, the keys can be the eligibility tokens. According to this example, each eligibility token can be computed as a hash of a set of segment values defined by the eligibility token format. Continuing this example, the values can be information about eligible requestors of the on-demand product such as, for example, information sufficient to retrieve additional information about the eligible requestor (e.g. a record ID). For example, in some embodiments, the values can be used to retrieve information from an enrollment repository 122. The enrollment repository 122 can include searchable data about eligible requestors. In certain embodiments, the enrollment repository 122 includes pre-existing information about the eligible requestors that is maintained by the sponsor in the ordinary course of business and which has been shared with the product-provision system 110.


Although the fulfillment module 114(1) and the eligibility module 114(2) are depicted as two separate software components, in various other embodiments, such software components are organized differently. For example, the fulfillment module 114(1) and the eligibility module 114(2) could be merged into a single software component, each be further divided into other software components, or have their collective functionality allocated differently among any number of software components. In addition, although the software application 114 is illustrated singly for illustrative purposes, it should be appreciated that any number of software applications may be utilized to achieve similar functionality.


The one or more client-computing devices 120 are computer systems used by requestors, for example, to request and/or receive the on-demand products. The one or more client-computing devices 120 can include, for example, desktop computers, laptop computers, tablet computers, smart phones, wearable or body-borne computers, and/or the like. The one or more external systems 116 are representative of computer systems from which the product-provision system 110 is operable to interact. For example, in various embodiments, the product-provision system may acquire particular on-demand products from the one or more external systems 116 or obtain information or data necessary to generate or determine eligibility for particular on-demand products. For example, the one or more external systems 116 may provide the information or data via an application programming interface (API).


In operation, the product-provision system 110 interacts with the one or more client-computing devices 120 to receive requests for on-demand products. Upon receipt of a request for an on-demand product, the product-provision system 110 can use the eligibility module 114(2) to determine a requestor's eligibility for the on-demand product. If the requestor is eligible for the on-demand product, the fulfillment module 114(1) can provide the requested on-demand product. Examples will be described with respect to FIGS. 3-4.


Each instance of a system such as, for example, the product-provision system 110 and the one or more external systems 116, may be representative of any combination of computing equipment including, for example, any number of physical or virtual server computers and any number and organization of databases. In addition, it should be appreciated that, in various embodiments, the network 118 can be viewed as an abstraction of multiple distinct networks via which the product-provision system 110 is operable to communicate. For example, the network 118 can include one or multiple communications networks such as, for example, public or private intranets, a public switched telephone network (PSTN), a cellular network, the Internet, or the like.



FIG. 2 illustrates an example of a process 200 for establishing an eligibility token repository. For example, the process 200, in whole or in part, can be implemented by one or more of the product-provision system 110, the software application 114, the fulfillment module 114(1), and/or the eligibility module 114(2). The process 200 can also be performed generally by the system 100. Although any number of systems, in whole or in part, can implement the process 200, to simplify discussion, the process 200 will be described in relation to specific systems or subsystems of the system 100.


At block 202, the eligibility module 114(2) receives a selection of eligible requestors. In an example, the eligible requestors can be intended beneficiaries of a sponsored offer for an on-demand product. The requestors can be selected by a user or administrator associated with a sponsor of the sponsored offer, a user or administrator of the provider acting according to instructions from the sponsor, combinations of same, and/or the like. In an example, the eligible requestors can be selected via receipt of the enrollment repository 122, receipt of information or data for storage in the enrollment repository, etc.


At block 204, the eligibility module 114(2) receives a configuration of an eligibility token format. In certain embodiments, the configuration can be a selection of full and/or partial segments of identifying information related to the eligible requestors. In various cases, the configuration can be received from an administrator or user associated with the provider and/or sponsor. In some embodiments, the configuration can identify a composition of columns of a database table in the enrollment repository 122. An example will be described with respect to FIG. 2.


At block 206, the eligibility module 114(2) generates eligibility tokens for the eligible requestors according to the eligibility token format. In some embodiments, each eligibility token can be a sequential concatenation of segment values according to the eligibility token format. In other embodiments, each eligibility token can be hash of the segment values.


At block 208, the eligibility module 114(2) stores the eligibility tokens in the eligibility token repository 112. In hash table implementations, the block 208 can include storing a key-value pair for each requestor such that the eligibility token is the key. In these implementations, each eligibility token can be mapped to information about a corresponding eligible requestor. The information can be, for example, a record identifier or other data sufficient to lookup the corresponding eligible requestor in the enrollment repository 122 and retrieve additional data.



FIG. 3 illustrates an example 300 of eligibility token generation. As illustrated, an example eligibility token format is shown to include a segment 302(1), a segment 302(2), a segment 302(3), and a segment 302(4) (collectively, segments 302). The segment 302(1) and the segment 302(3) are examples of partial segments of identifying information. In particular, the example 300 illustrates the segment 302(1) as including the last four digits of a SSN and illustrates the segment 302(3) as including a street-number portion of a home address. The segment 302(2) and the segment 302(4) are examples of full segments of identifying information.


The example 300 further shows segment values 304(1), 304(2), 304(3), and 304(4) (collectively, segment values 304). The segment values 304 correspond to the segments 302. As illustrated, an eligibility token 306 can be determined by computing a hash of the segment values 304.



FIG. 4 illustrates an example of a process 400 for determining requestor eligibility for an on-demand product. For example, the process 400, in whole or in part, can be implemented by one or more of the product-provision system 110, the software application 114, the fulfillment module 114(1), and/or the eligibility module 114(2). The process 400 can also be performed generally by the system 100. Although any number of systems, in whole or in part, can implement the process 400, to simplify discussion, the process 400 will be described in relation to specific systems or subsystems of the system 100.


At block 402, the fulfillment module 114(1) receives a request for an on-demand product. In various embodiments, the request can be received via a web interface of the product-provision system 110 that is accessed by the requestor. At block 404, the eligibility module 114(2) determines an eligibility token format applicable to the request. For example, based on the web interface or a web page accessed by the requestor, the eligibility module 114(2) may be able to determine a desired on-demand product, an applicable sponsored offer for the desired on-demand product, and/or the like. Based on this and/or other information, the eligibility module 114(2) may be able to identify the applicable eligibility token format.


At block 406, the eligibility module 114(2) prompts the requestor for segment values defined by the eligibility token format. For example, the eligibility module 114(2) can serve a web page containing fields for each of the segment values. At block 408, the eligibility module 114(2) receives the segment values. At block 410, the eligibility module 114(2) generates an eligibility token from the segment values. For example, in some embodiments, the eligibility token can be a hash of the segment values.


At decision block 412, the eligibility module 114(2) determines whether the requestor is eligible for the on-demand product. In certain embodiments, the requestor's eligibility can be determined based on a lookup of the eligibility token in the eligibility repository 112. In these embodiments, if the eligibility token is found in the eligibility token repository 112, the requestor may be deemed eligible. Otherwise, if the eligibility token is not found in the eligibility token repository 112, the requestor may be deemed ineligible. If it is determined at the decision block 412 that the requestor is not eligible for the on-demand product, the process 400 proceeds to block 413, where the requestor is denied access. After block 413, the process 400 ends. Otherwise, if the requestor is determined to be eligible for the on-demand product, the process 400 proceeds to block 414.


At block 414, the eligibility module 114(2) accesses data associated with the eligibility token. For example, in embodiments in which a hash table is utilized, the eligibility token can be used as a key to retrieve a value. In these embodiments, the value can be used to access the data from the enrollment repository 122 or another data source. The accessed data can include, for example, information used by the product-provision system 110 to enroll requestors for the on-demand product.


At block 416, the fulfillment module 114(1) prepopulates an enrollment form with at least a portion of the accessed data. For example, the fulfillment module 114(1) can select data from the enrollment repository 122 that is useful or required during enrollment for the on-demand product. It should be appreciated that a single enrollment form is described only for simplicity of explanation. In various cases, two or more enrollment forms used in a series or sequence may be prepopulated and used for the enrollment.


At block 418, the fulfillment module 114(1) outputs the enrollment form to the requestor. At block 420, the fulfillment module 114(1) conducts enrollment for the on-demand product. In an example, the enrollment can include any of the enrollment or registration functionality described in U.S. patent application Ser. No. 13/093,663 or U.S. Pat. No. 8,359,278. U.S. patent application Ser. No. 13/093,663 and U.S. Pat. No. 8,359,278 are hereby incorporated by reference. At block 422, the fulfillment module 114(1) provides the on-demand product to the requestor. After block 422, the process 400 ends.


Any suitable combination of various embodiments, or the features thereof, is contemplated. For example, any of the systems or devices disclosed herein can include features of other embodiments. As another example, any blocks or steps disclosed in a process described herein may be used in other processes described herein. Thus, a block of one of the processes described with respect to FIGS. 2-4 may be used in any of the processes described herein.


Depending on the embodiment, certain acts, events, or functions of any of the algorithms described herein can be performed in a different sequence, can be added, merged, or left out altogether (e.g., not all described acts or events are necessary for the practice of the algorithms). Moreover, in certain embodiments, acts or events can be performed concurrently, e.g., through multi-threaded processing, interrupt processing, or multiple processors or processor cores or on other parallel architectures, rather than sequentially. Although certain computer-implemented tasks are described as being performed by a particular entity, other embodiments are possible in which these tasks are performed by a different entity.


Conditional language used herein, such as, among others, “can,” “might,” “may,” “e.g.,” and the like, 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 states. Thus, such conditional language is not generally intended to imply that features, elements and/or states are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without author input or prompting, whether these features, elements and/or states are included or are to be performed in any particular embodiment.


While the above detailed description has shown, described, and pointed out novel features as applied to various embodiments, it will be understood that various omissions, substitutions, and changes in the form and details of the devices or algorithms illustrated can be made without departing from the spirit of the disclosure. As will be recognized, the processes described herein can be embodied within a form that does not provide all of the features and benefits set forth herein, as some features can be used or practiced separately from others. The scope of protection is defined by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.

Claims
  • 1. A computer-implemented method of determining eligibility for accessing an on-demand product, the computer-implemented method comprising: receiving, from a first third party database, first user data for a first plurality of users, wherein the first user data comprises a first set of one or more data fields of identifying information for each user of the first plurality of users;determining, via a first hardware processor device, a first format for generating a first eligibility token that includes: a first selection format for identifying a first selection of a first plurality of segments of identifying information based at least in part on the first set of one or more data fields available in the received first user data; anda first concatenation format for concatenating the first plurality of segments of identifying information into a first string of values;generating, via the first hardware processor device, one or more first eligibility tokens for each of the first plurality of users based at least in part on the first format;storing the generated one or more first eligibility tokens as key values in an eligibility token repository;receiving, from a second third party database, second user data for a second plurality of users, wherein the second user data comprises a second set of one or more data fields of identifying information for each user of the second plurality of users, wherein the second set of one or more data fields includes at least one unique data field that is not included in first set of one or more data fields;determining, via a second hardware processor device, and storing a second format for generating a second eligibility token that includes: a second selection format for identifying a second selection of a second plurality of segments of identifying information based at least in part on the second set of one or more data fields available in the received second user data and including the at least one unique data field; anda second concatenation format for concatenating the second plurality of segments of identifying information into a second string of values;generating, via the second hardware processor device, one or more second eligibility tokens for each of the second plurality of users based at least in part on the second format;storing the generated one or more second eligibility tokens as key values in the eligibility token repository;receiving, from a requestor device via a network interface, an electronic request for an on-demand product which comprises an electronic identifier for a product to be delivered electronically in real-time to the requestor device, wherein the requestor device is associated with a first user;prompting the requestor device to provide encrypted data packets comprising personal information associated with the first user;receiving, from the requestor device via a network interface, the encrypted data packets comprising personal information associated with the first user;determine whether to apply the first format or the second format based at least in part on the electronic request for the on-demand product;generating, via a third hardware processor device, a user eligibility token based at least in part on the encrypted data packets comprising personal information associated with the first user and one of the first format or the second format, wherein the user eligibility token is associated with a key in a key-value pair for the first user and is mapped to at least a portion of the encrypted data packets comprising personal information associated with the first user;performing lookup of the user eligibility token in the eligibility token repository to find a matching token; anddetermining the first user's eligibility for accessing the on-demand product based at least in part on there being a matching eligibility token in the eligibility token repository for the user eligibility token.
  • 2. The computer-implemented method of claim 1, further comprising: accessing data associated with the user eligibility token;prepopulating an enrollment form using at least a portion of the accessed data;outputting the prepopulated enrollment form to the requestor device;receiving enrollment authorization from the requestor device; andresponsive to the enrollment authorization, enrolling the first user for the on-demand product.
  • 3. The computer-implemented method of claim 2, further comprising initiating provision of the on-demand product to the requestor device.
  • 4. The computer-implemented method of claim 1, further comprising: determining that the first user is not eligible for accessing the on-demand product based at least in part on there being no matching eligibility token in the eligibility token repository for the user eligibility token; andbased at least in part on the determination that the first user is not eligible for the on-demand product, denying provision of the on-demand product to the requestor device.
  • 5. The computer-implemented method of claim 1, wherein the first plurality of segments of identifying information and the second plurality of segments of identifying information comprise pluralities of segments of personally identifying information (PII).
  • 6. The computer-implemented method of claim 1, wherein the first plurality of segments of identifying information and the second plurality of segments of identifying information comprise pluralities of segments of business identifying information.
  • 7. The computer-implemented method of claim 1, wherein the first plurality of segments of identifying information and the second plurality of segments of identifying information comprise pluralities of substrings of the identifying information.
  • 8. The computer-implemented method of claim 1, wherein the first format further comprises at least one complete segment of identifying information.
  • 9. The method of claim 1, wherein the first eligibility tokens compromises values generated by a hash function.
  • 10. The method of claim 1, further comprising: receiving, from the first third party database, indicators of on-demand products to be associated with the first plurality of users; andreceiving, from the second third party database, indicators of on-demand products to be associated with the second plurality of users.
  • 11. A system for determining eligibility for accessing an on-demand product, the system comprising: a first third party database;a second third party database;a requestor device associated with a first user;a network interface; andat least one processor, wherein the at least one processor is operable to perform a method comprising: receiving, from the first third party database, first user data for a first plurality of users, wherein the first user data comprises a first set of one or more data fields of identifying information for each user of the first plurality of users;determining, via a first hardware processor device, a first format for generating a first eligibility token that includes: a first selection format for identifying a first selection of a first plurality of segments of identifying information based at least in part on the first set of one or more data fields available in the received first user data; anda first concatenation format for concatenating the first plurality of segments of identifying information into a first string of values;generating, via the first hardware processor device, one or more first eligibility tokens for each of the first plurality of users based at least in part on the first format;storing the generated one or more first eligibility tokens as key values in an eligibility token repository;receiving, from the second third party database, second user data for a second plurality of users, wherein the second user data comprises a second set of one or more data fields of identifying information for each user of the second plurality of users, wherein the second set of one or more data fields includes at least one unique data field that is not included in first set of one or more data fields;determining, via a second hardware processor device, and storing a second format for generating a second eligibility token that includes: a second selection format for identifying a second selection of a second plurality of segments of identifying information based at least in part on the second set of one or more data fields available in the received second user data and including the at least one unique data field; anda second concatenation format for concatenating the second plurality of segments of identifying information into a second string of values;generating, via the second hardware processor device, one or more second eligibility tokens for each of the second plurality of users based at least in part on the second format;storing the generated one or more second eligibility tokens as key values in the eligibility token repository;receiving, from the requestor device via a network interface, an electronic request for an on-demand product which comprises an electronic identifier for a product to be delivered electronically in real-time to the requestor device, wherein the requestor device is associated with a first user;prompting the requestor device to provide encrypted data packets comprising personal information associated with the first user;receiving, from the requestor device via a network interface, the encrypted data packets comprising personal information associated with the first user;determine whether to apply the first format or the second format based at least in part on the electronic request for the on-demand product;generating, via a third hardware processor device, a user eligibility token based at least in part on the encrypted data packets comprising personal information associated with the first user and one of the first format or the second format, wherein the user eligibility token is associated with a key in a key-value pair for the first user and is mapped to at least a portion of the encrypted data packets comprising personal information associated with the first user;performing lookup of the user eligibility token in the eligibility token repository to find a matching token; anddetermining the first user's eligibility for accessing the on-demand product based at least in part on there being a matching eligibility token in the eligibility token repository for the user eligibility token.
  • 12. The system of claim 11, wherein the at least one processor is further operable to perform: accessing data associated with the user eligibility token;prepopulating an enrollment form using at least a portion of the accessed data;outputting the prepopulated enrollment form to the requestor device;receiving enrollment authorization from the requestor device; andresponsive to the enrollment authorization, enrolling the first user for the on-demand product.
  • 13. The system of claim 12, wherein the at least one processor is further operable to perform initiating provision of the on-demand product to the requestor device.
  • 14. The system of claim 11, wherein the at least one processor is further operable to perform: determining that the first user is not eligible for accessing the on-demand product based at least in part on there being no matching eligibility token in the eligibility token repository for the user eligibility token; andbased at least in part on the determination that the requestor is not eligible for the on-demand product, denying provision of the on-demand product to the requestor device.
  • 15. The system of claim 11, wherein the first plurality of segments of identifying information and the second plurality of segments of identifying information comprise pluralities of segments of personally identifying information (PII).
  • 16. The system of claim 11, wherein the first plurality of segments of identifying information and the second plurality of segments of identifying information comprise pluralities of segments of business identifying information.
  • 17. The system of claim 11, wherein the first plurality of segments of identifying information comprises a plurality of substrings of the identifying information.
  • 18. The system of claim 11, wherein the first plurality of segments of identifying information and the second plurality of segments of identifying information comprise pluralities of substrings of the identifying information.
  • 19. A computer-program product comprising a non-transitory computer-usable medium having computer-readable program code embodied therein, the computer-readable program code adapted to be executed to implement a method comprising: receiving, from a first third party database, first user data for a first plurality of users, wherein the first user data comprises a first set of one or more data fields of identifying information for each user of the first plurality of users;determining, via a first hardware processor device, a first format for generating a first eligibility token that includes: a first selection format for identifying a first selection of a first plurality of segments of identifying information based at least in part on the first set of one or more data fields available in the received first user data; anda first concatenation format for concatenating the first plurality of segments of identifying information into a first string of values;generating, via the first hardware processor device, one or more first eligibility tokens for each of the first plurality of users based at least in part on the first format;storing the generated one or more first eligibility tokens as key values in an eligibility token repository;receiving, from a second third party database, second user data for a second plurality of users, wherein the second user data comprises a second set of one or more data fields of identifying information for each user of the second plurality of users wherein the second set of one or more data fields includes at least one unique data field that is not included in first set of one or more data fields;determining, via a second hardware processor device, and storing a second format for generating a second eligibility token that includes: a second selection format for identifying a second selection of a second plurality of segments of identifying information based at least in part on the second set of one or more data fields available in the received second user data and including the at least one unique data field; anda second concatenation format for concatenating the second plurality of segments of identifying information into a second string of values;generating, via the second hardware processor device, one or more second eligibility tokens for each of the second plurality of users based at least in part on the second format;storing the generated one or more second eligibility tokens as key values in the eligibility token repository;receiving, from a requestor device via a network interface, an electronic request for an on-demand product which comprises an electronic identifier for a product to be delivered electronically in real-time to the requestor device, wherein the requestor device is associated with a first user;prompting the requestor device to provide encrypted data packets comprising personal information associated with the first user;receiving, from the requestor device via a network interface, the encrypted data packets comprising personal information associated with the first user;determine whether to apply the first format or the second format based at least in part on the electronic request for the on-demand product;generating, via a third hardware processor device, a user eligibility token based at least in part on the encrypted data packets comprising personal information associated with the first user and one of the first format or the second format, wherein the user eligibility token is associated with a key in a key-value pair for the first user and is mapped to at least a portion of the encrypted data packets comprising personal information associated with the first user;performing lookup of the user eligibility token in the eligibility token repository to find a matching token; anddetermining the first user's eligibility for accessing the on-demand product based at least in part on there being a matching eligibility token in the eligibility token repository for the user eligibility token.
  • 20. The computer-program product of claim 19, wherein the computer-readable program code is further adapted to be executed to: access data associated with the user eligibility token;prepopulate an enrollment form using at least a portion of the accessed data;output the prepopulated enrollment form to the requestor device;receive enrollment authorization from the requestor device; andresponsive to the enrollment authorization, enroll the first user for the on-demand product.
CROSS-REFERENCE TO RELATED APPLICATIONS

This patent application claims priority from U.S. Provisional Patent Application No. 61/984,351. U.S. Provisional Patent Application No. 61/984,351 is hereby incorporated by reference.

US Referenced Citations (1013)
Number Name Date Kind
3752904 Waterbury Aug 1973 A
4795890 Goldman Jan 1989 A
4891503 Jewell Jan 1990 A
4977595 Ohta et al. Dec 1990 A
4989141 Lyons et al. Jan 1991 A
5126936 Champion et al. Jun 1992 A
5351293 Michener et al. Sep 1994 A
5590038 Pitroda Dec 1996 A
5640577 Scharmer Jun 1997 A
5659725 Levy et al. Aug 1997 A
5659731 Gustafson Aug 1997 A
5715314 Payne et al. Feb 1998 A
5719941 Swift et al. Feb 1998 A
5748098 Grace May 1998 A
5754632 Smith May 1998 A
5832068 Smith Nov 1998 A
5844218 Kawan et al. Dec 1998 A
5881131 Farris et al. Mar 1999 A
5903830 Joao et al. May 1999 A
5913196 Talmor et al. Jun 1999 A
5956693 Geerlings Sep 1999 A
5966695 Melchione et al. Oct 1999 A
5999596 Walker et al. Dec 1999 A
6021397 Jones et al. Feb 2000 A
6021943 Chastain Feb 2000 A
6026440 Shrader et al. Feb 2000 A
6038551 Barlow et al. Mar 2000 A
6069941 Byrd et al. May 2000 A
6072894 Payne Jun 2000 A
6073106 Rozen et al. Jun 2000 A
6073140 Morgan et al. Jun 2000 A
6085242 Chandra Jul 2000 A
6119103 Basch et al. Sep 2000 A
6128602 Northington et al. Oct 2000 A
6157707 Baulier et al. Dec 2000 A
6161139 Win et al. Dec 2000 A
6182068 Culliss Jan 2001 B1
6182229 Nielsen Jan 2001 B1
6196460 Shin Mar 2001 B1
6233588 Marchoili et al. May 2001 B1
6247000 Hawkins et al. Jun 2001 B1
6253202 Gilmour Jun 2001 B1
6254000 Degen et al. Jul 2001 B1
6263447 French et al. Jul 2001 B1
6269369 Robertson Jul 2001 B1
6282658 French et al. Aug 2001 B2
6292795 Peters et al. Sep 2001 B1
6311169 Duhon Oct 2001 B2
6321339 French et al. Nov 2001 B1
6327578 Linehan Dec 2001 B1
6343279 Bissonette et al. Jan 2002 B1
6356937 Montville et al. Mar 2002 B1
6397212 Biffar May 2002 B1
6453353 Win et al. Sep 2002 B1
6457012 Jatkowski Sep 2002 B1
6463533 Calamera et al. Oct 2002 B1
6473740 Cockril et al. Oct 2002 B2
6496936 French et al. Dec 2002 B1
6510415 Talmor et al. Jan 2003 B1
6523021 Monberg et al. Feb 2003 B1
6523041 Morgan et al. Feb 2003 B1
6539377 Culliss Mar 2003 B1
6564210 Korda et al. May 2003 B1
6574736 Andrews Jun 2003 B1
6581059 Barrett et al. Jun 2003 B1
6601173 Mohler Jul 2003 B1
6607136 Atsmon et al. Aug 2003 B1
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
6679425 Sheppard et al. Jan 2004 B1
6714944 Shapiro et al. Mar 2004 B1
6725381 Smith et al. Apr 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
6782379 Lee Aug 2004 B2
6795812 Lent et al. Sep 2004 B1
6796497 Benkert et al. Sep 2004 B2
6804346 Mewhinney Oct 2004 B1
6805287 Bishop et al. Oct 2004 B2
6816850 Culliss Nov 2004 B2
6816871 Lee Nov 2004 B2
6823319 Lynch et al. Nov 2004 B1
6829711 Kwok et al. Dec 2004 B1
6845448 Chaganti et al. Jan 2005 B1
6857073 French et al. Feb 2005 B2
6871287 Ellingson Mar 2005 B1
6892307 Wood et al. May 2005 B1
6900731 Kreiner et al. May 2005 B2
6907408 Angel Jun 2005 B2
6908030 Rajasekaran et al. Jun 2005 B2
6910624 Natsuno Jun 2005 B1
6920435 Hoffman et al. Jul 2005 B2
6928487 Eggebraaten et al. Aug 2005 B2
6934714 Meinig Aug 2005 B2
6934849 Kramer et al. Aug 2005 B2
6934858 Woodhill Aug 2005 B2
6947989 Gullotta et al. Sep 2005 B2
6950807 Brock Sep 2005 B2
6950858 Ogami Sep 2005 B2
6965881 Brickell et al. Nov 2005 B1
6968319 Remington et al. Nov 2005 B1
6973462 Dattero et al. Dec 2005 B2
6983381 Jerdonek Jan 2006 B2
6985887 Sunstein et al. Jan 2006 B1
6986461 Geoghegan et al. Jan 2006 B1
6988085 Hedy Jan 2006 B2
6993596 Hinton et al. Jan 2006 B2
6999941 Agarwal Feb 2006 B1
7016907 Boreham et al. Mar 2006 B2
7028013 Saeki Apr 2006 B2
7028052 Chapman et al. Apr 2006 B2
7039607 Watarai et al. May 2006 B2
7043476 Robson May 2006 B2
7058817 Ellmore Jun 2006 B1
7059531 Beenau et al. Jun 2006 B2
7062475 Szabo et al. Jun 2006 B1
7076462 Nelson et al. Jul 2006 B1
7085727 VanOrman Aug 2006 B2
7107241 Pinto Sep 2006 B1
7117172 Black Oct 2006 B1
7121471 Beenau et al. Oct 2006 B2
7124144 Christianson et al. Oct 2006 B2
7154375 Beenau et al. Dec 2006 B2
7155739 Bari et al. Dec 2006 B2
7174454 Roskind Feb 2007 B2
7177846 Moenickheim et al. Feb 2007 B2
7194416 Provost et al. Mar 2007 B1
7200602 Jonas Apr 2007 B2
7203653 McIntosh Apr 2007 B1
7209895 Kundtz et al. Apr 2007 B2
7219107 Beringer May 2007 B2
7222369 Vering et al. May 2007 B2
7225464 Satyavolu et al. May 2007 B2
7231657 Honarvar et al. Jun 2007 B2
7234156 French et al. Jun 2007 B2
7234160 Vogel et al. Jun 2007 B2
7237267 Rayes et al. Jun 2007 B2
7243369 Bhat et al. Jul 2007 B2
7246067 Austin et al. Jul 2007 B2
7246740 Swift et al. Jul 2007 B2
7249113 Continelli et al. Jul 2007 B1
7263497 Wiser et al. Aug 2007 B1
7289971 O'Neil et al. Oct 2007 B1
7303120 Beenau et al. Dec 2007 B2
7310611 Shibuya et al. Dec 2007 B2
7314167 Kiliccote Jan 2008 B1
7328233 Salim et al. Feb 2008 B2
7330871 Barber Feb 2008 B2
7333635 Tsantes et al. Feb 2008 B2
7340042 Cluff et al. Mar 2008 B2
7340679 Botscheck et al. Mar 2008 B2
7343149 Benco Mar 2008 B2
7343295 Pomerance Mar 2008 B2
7356503 Johnson et al. Apr 2008 B1
7356516 Richey et al. Apr 2008 B2
7370044 Mulhern et al. May 2008 B2
7370351 Ramachandran et al. May 2008 B1
7383988 Slonecker, Jr. Jun 2008 B2
7386448 Poss et al. Jun 2008 B1
7389913 Starrs Jun 2008 B2
7403942 Bayliss Jul 2008 B1
7421732 Costa-Requena et al. Sep 2008 B2
7433864 Malik Oct 2008 B2
7437679 Uemura et al. Oct 2008 B2
7438226 Helsper et al. Oct 2008 B2
7444414 Foster et al. Oct 2008 B2
7444518 Dharmarajan et al. Oct 2008 B1
7451113 Kasower Nov 2008 B1
7458508 Shao et al. Dec 2008 B1
7460857 Roach, Jr. Dec 2008 B2
7467401 Cicchitto Dec 2008 B2
7478157 Bohrer et al. Jan 2009 B2
7480631 Merced et al. Jan 2009 B1
7490356 Lieblich et al. Feb 2009 B2
7503489 Heffez Mar 2009 B2
7509117 Yum Mar 2009 B2
7509278 Jones Mar 2009 B2
7512221 Toms Mar 2009 B2
7519558 Ballard et al. Apr 2009 B2
7529698 Joao May 2009 B2
7530097 Casco-Arias 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
7548886 Kirkland et al. Jun 2009 B2
7552080 Willard et al. Jun 2009 B1
7552123 Wade et al. Jun 2009 B2
7552467 Lindsay Jun 2009 B2
7555459 Dhar et al. Jun 2009 B2
7562184 Henmi et al. Jul 2009 B2
7562814 Shao et al. Jul 2009 B1
7571473 Boydstun et al. Aug 2009 B1
7575157 Barnhardt et al. Aug 2009 B2
7577665 Ramer et al. Aug 2009 B2
7577934 Anonsen et al. Aug 2009 B2
7580884 Cook Aug 2009 B2
7581112 Brown et al. Aug 2009 B2
7584126 White Sep 2009 B1
7584146 Duhon Sep 2009 B1
7587366 Grim, III et al. Sep 2009 B2
7587368 Felsher Sep 2009 B2
7603701 Gaucas Oct 2009 B2
7606401 Hoffman et al. Oct 2009 B2
7606725 Robertson et al. Oct 2009 B2
7610216 May et al. Oct 2009 B1
7613600 Krane Nov 2009 B2
7620596 Knudson et al. Nov 2009 B2
7623844 Herrmann et al. Nov 2009 B2
7630932 Danaher et al. Dec 2009 B2
7634737 Beringer et al. Dec 2009 B2
7636941 Blinn et al. Dec 2009 B2
7647344 Skurtovich, Jr. et al. Jan 2010 B2
7653592 Flaxman et al. Jan 2010 B1
7653600 Gustin Jan 2010 B2
7653688 Bittner Jan 2010 B2
7657431 Hayakawa Feb 2010 B2
7672833 Blume et al. Mar 2010 B2
7685096 Margolus et al. Mar 2010 B2
7685209 Norton et al. Mar 2010 B1
7686214 Shao et al. Mar 2010 B1
7689487 Britto et al. Mar 2010 B1
7689505 Kasower Mar 2010 B2
7689563 Jacobson Mar 2010 B1
7690032 Peirce Mar 2010 B1
7698214 Lindgren Apr 2010 B1
7698217 Phillips et al. Apr 2010 B1
7698445 Fitzpatrick et al. Apr 2010 B2
7707271 Rudkin et al. Apr 2010 B2
7708190 Brandt et al. May 2010 B2
7711635 Steele et al. May 2010 B2
7725385 Royer et al. May 2010 B2
7730078 Schwabe et al. Jun 2010 B2
7739139 Robertson et al. Jun 2010 B2
7747494 Kothari et al. Jun 2010 B1
7747520 Livermore et al. Jun 2010 B2
7747521 Serio Jun 2010 B2
7761384 Madhogarhia Jul 2010 B2
7761568 Levi et al. Jul 2010 B1
7765166 Beringer et al. Jul 2010 B2
7765311 Itabashi et al. Jul 2010 B2
7769696 Yoda Aug 2010 B2
7769697 Fieschi et al. Aug 2010 B2
7769998 Lynch et al. Aug 2010 B2
7774270 MacCloskey Aug 2010 B1
7788040 Haskell et al. Aug 2010 B2
7792715 Kasower Sep 2010 B1
7792725 Booraem et al. Sep 2010 B2
7793835 Coggeshall et al. Sep 2010 B1
7797725 Lunt et al. Sep 2010 B2
7801956 Cumberbatch et al. Sep 2010 B1
7802104 Dickinson Sep 2010 B2
7810036 Bales et al. Oct 2010 B2
7818228 Coulter Oct 2010 B1
7827115 Weller et al. Nov 2010 B2
7841004 Balducci et al. Nov 2010 B1
7841008 Cole et al. Nov 2010 B1
7844520 Franklin Nov 2010 B1
7849014 Erikson Dec 2010 B2
7849624 Holt et al. Dec 2010 B2
7853493 DeBie et al. Dec 2010 B2
7853533 Eisen Dec 2010 B2
7853984 Antell et al. Dec 2010 B2
7865958 Lieblich et al. Jan 2011 B2
7870078 Clark et al. Jan 2011 B2
7877304 Coulter Jan 2011 B1
7877784 Chow et al. Jan 2011 B2
7880728 de los Reyes et al. Feb 2011 B2
7908242 Achanta Mar 2011 B1
7909246 Hogg et al. Mar 2011 B2
7912865 Akerman et al. Mar 2011 B2
7930285 Abraham et al. Apr 2011 B2
7930411 Hayward Apr 2011 B1
7941324 Sholtis May 2011 B1
7958046 Doerner et al. Jun 2011 B2
7966192 Pagliari et al. Jun 2011 B2
7970679 Kasower Jun 2011 B2
7975299 Balducci et al. Jul 2011 B1
7979908 Millwee Jul 2011 B2
7983932 Kane Jul 2011 B2
7983979 Holland, IV Jul 2011 B2
7991688 Phelan et al. Aug 2011 B2
8001153 Skurtovich, Jr. et al. Aug 2011 B2
8001235 Russ et al. Aug 2011 B2
8005155 Lee et al. Aug 2011 B1
8011582 Ghafarzadeh Sep 2011 B2
8032932 Speyer et al. Oct 2011 B2
8037097 Guo et al. Oct 2011 B2
8041956 White et al. Oct 2011 B1
8055904 Cato et al. Nov 2011 B1
8060424 Kasower Nov 2011 B2
8060916 Bajaj et al. Nov 2011 B2
8065233 Lee et al. Nov 2011 B2
8078453 Shaw Dec 2011 B2
8078524 Crawford et al. Dec 2011 B2
8078881 Liu Dec 2011 B1
8099341 Varghese Jan 2012 B2
8104679 Brown Jan 2012 B2
8116731 Buhrmann et al. Feb 2012 B2
8116751 Aaron Feb 2012 B2
8127982 Casey et al. Mar 2012 B1
8127986 Taylor et al. Mar 2012 B1
8131777 McCullouch Mar 2012 B2
8151327 Eisen Apr 2012 B2
8175889 Girulat et al. May 2012 B1
8185747 Wood et al. May 2012 B2
8195549 Kasower Jun 2012 B2
8219771 Le Neel Jul 2012 B2
8224723 Bosch et al. Jul 2012 B2
8225395 Atwood et al. Jul 2012 B2
8229810 Butera et al. Jul 2012 B2
8234498 Britti et al. Jul 2012 B2
8239677 Colson Aug 2012 B2
8239929 Kwan et al. Aug 2012 B2
8241369 Stevens Aug 2012 B2
8244848 Narayanan et al. Aug 2012 B1
8255452 Piliouras Aug 2012 B2
8255971 Webb et al. Aug 2012 B1
8260706 Freishtat et al. Sep 2012 B2
8261334 Hazlehurst et al. Sep 2012 B2
8266065 Dilip et al. Sep 2012 B2
8280348 Snyder et al. Oct 2012 B2
8281372 Vidal Oct 2012 B1
8285613 Coulter Oct 2012 B1
8285656 Chang et al. Oct 2012 B1
8291218 Garcia et al. Oct 2012 B2
8291477 Lunt Oct 2012 B2
8295898 Ashfield et al. Oct 2012 B2
8302164 Lunt Oct 2012 B2
8312033 McMillan Nov 2012 B1
8315940 Winbom et al. Nov 2012 B2
8327429 Speyer et al. Dec 2012 B2
8359278 Domenikos et al. Jan 2013 B2
8374634 Dankar et al. Feb 2013 B2
8374973 Herbrich et al. Feb 2013 B2
8406736 Das et al. Mar 2013 B2
8423648 Ferguson et al. Apr 2013 B2
8442886 Haggerty et al. May 2013 B1
8443202 White et al. May 2013 B2
8447016 Kugler et al. May 2013 B1
8456293 Trundle et al. Jun 2013 B1
8464939 Taylor et al. Jun 2013 B1
8468090 Lesandro et al. Jun 2013 B2
8478674 Kapczynski et al. Jul 2013 B1
8484186 Kapczynski et al. Jul 2013 B1
8515828 Wolf et al. Aug 2013 B1
8515844 Kasower Aug 2013 B2
8527357 Ganesan Sep 2013 B1
8527417 Telle et al. Sep 2013 B2
8527773 Metzger Sep 2013 B1
8533118 Weller et al. Sep 2013 B2
8560381 Green et al. Oct 2013 B2
8572391 Golan et al. Oct 2013 B2
8578496 Krishnappa Nov 2013 B1
8588748 Buhrman et al. Nov 2013 B2
8600886 Ramavarjula et al. Dec 2013 B2
8601602 Zheng Dec 2013 B1
8606234 Pei et al. Dec 2013 B2
8606694 Campbell et al. Dec 2013 B2
8630938 Cheng et al. Jan 2014 B2
8646051 Paden et al. Feb 2014 B2
8671115 Skurtovich, Jr. et al. Mar 2014 B2
8688543 Dominquez Apr 2014 B2
8701199 Dotan et al. Apr 2014 B1
8705718 Baniak et al. Apr 2014 B2
8706599 Koenig et al. Apr 2014 B1
8725613 Celka et al. May 2014 B1
8744956 DiChiara et al. Jun 2014 B1
8751388 Chapa Jun 2014 B1
8768914 Scriffignano et al. Jul 2014 B2
8769614 Knox Jul 2014 B1
8781882 Arboletti et al. Jul 2014 B1
8781953 Kasower Jul 2014 B2
8781975 Bennett et al. Jul 2014 B2
8782217 Arone et al. Jul 2014 B1
8782753 Lunt Jul 2014 B2
8793166 Mizhen Jul 2014 B2
8793777 Colson Jul 2014 B2
8800005 Lunt Aug 2014 B2
8806584 Lunt Aug 2014 B2
8818888 Kapczynski et al. Aug 2014 B1
8819793 Gottschalk, Jr. Aug 2014 B2
8826371 Webb et al. Sep 2014 B2
8826393 Eisen Sep 2014 B2
8831564 Ferguson et al. Sep 2014 B2
8839394 Dennis et al. Sep 2014 B2
8856894 Dean et al. Oct 2014 B1
8862514 Eisen Oct 2014 B2
8931058 DiChiara et al. Jan 2015 B2
8954459 McMillan et al. Feb 2015 B1
8972400 Kapczynski et al. Mar 2015 B1
9100400 Lunt Aug 2015 B2
9106691 Burger et al. Aug 2015 B1
9147042 Haller et al. Sep 2015 B1
9185123 Dennis et al. Nov 2015 B2
9195984 Spector Nov 2015 B1
9196004 Eisen Nov 2015 B2
9235728 Gottschalk, Jr. et al. Jan 2016 B2
9246899 Durney et al. Jan 2016 B1
9256624 Skurtovich, Jr. et al. Feb 2016 B2
9269085 Webb et al. Feb 2016 B2
9361597 Britton et al. Jun 2016 B2
9380057 Knauss Jun 2016 B2
9390384 Eisen Jul 2016 B2
9420448 Dankar et al. Aug 2016 B2
9491160 Livesay et al. Nov 2016 B2
9600651 Ryan et al. Mar 2017 B1
9607336 Dean et al. Mar 2017 B1
9626680 Ryan et al. Apr 2017 B1
9633322 Burger Apr 2017 B1
9665854 Burger et al. May 2017 B1
9684905 Haller et al. Jun 2017 B1
9697521 Webb et al. Jul 2017 B2
9710523 Skurtovich, Jr. et al. Jul 2017 B2
9721147 Kapczynski Aug 2017 B1
9734501 Durney et al. Aug 2017 B2
9754256 Britton et al. Sep 2017 B2
9754311 Eisen Sep 2017 B2
9818121 Snyder et al. Nov 2017 B2
10075446 McMillan et al. Sep 2018 B2
10089679 Eisen Oct 2018 B2
10115079 Burger et al. Oct 2018 B1
10169761 Burger Jan 2019 B1
20010029482 Tealdi et al. Oct 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
20010049274 Degraeve Dec 2001 A1
20020004736 Roundtree et al. Jan 2002 A1
20020013827 Edstrom et al. Jan 2002 A1
20020013899 Faul Jan 2002 A1
20020026519 Itabashi et al. Feb 2002 A1
20020032635 Harris et al. Mar 2002 A1
20020033846 Balasubramanian et al. Mar 2002 A1
20020045154 Wood et al. Apr 2002 A1
20020059201 Work May 2002 A1
20020059521 Tasler May 2002 A1
20020069122 Yun et al. Jun 2002 A1
20020077964 Brody et al. Jun 2002 A1
20020087460 Hornung Jul 2002 A1
20020091544 Middeljans et al. Jul 2002 A1
20020091635 Dilip et al. Jul 2002 A1
20020099635 Guiragosian Jul 2002 A1
20020103933 Garon et al. Aug 2002 A1
20020111816 Lortscher et al. Aug 2002 A1
20020120537 Morea et al. Aug 2002 A1
20020120757 Sutherland et al. Aug 2002 A1
20020120846 Stewart et al. Aug 2002 A1
20020128962 Kasower Sep 2002 A1
20020133365 Grey et al. Sep 2002 A1
20020133462 Shteyn Sep 2002 A1
20020138470 Zhou Sep 2002 A1
20020143943 Lee et al. Oct 2002 A1
20020147801 Gullotta et al. Oct 2002 A1
20020157029 French et al. Oct 2002 A1
20020169747 Chapman et al. Nov 2002 A1
20020173994 Ferguson, III Nov 2002 A1
20020174048 Dheer et al. Nov 2002 A1
20020184509 Scheidt et al. Dec 2002 A1
20020198800 Shamrakov Dec 2002 A1
20020198806 Blagg et al. Dec 2002 A1
20020198824 Cook Dec 2002 A1
20030002671 Inchalik et al. Jan 2003 A1
20030009418 Green et al. Jan 2003 A1
20030009426 Ruiz-Sanchez Jan 2003 A1
20030023531 Fergusson Jan 2003 A1
20030036995 Lazerson Feb 2003 A1
20030046311 Baidya et al. Mar 2003 A1
20030046554 Leydier et al. Mar 2003 A1
20030048904 Wang et al. Mar 2003 A1
20030061163 Durfield Mar 2003 A1
20030069839 Whittington et al. Apr 2003 A1
20030069943 Bahrs et al. Apr 2003 A1
20030097342 Whittingtom May 2003 A1
20030097380 Mulhern et al. May 2003 A1
20030105710 Barbara et al. Jun 2003 A1
20030105733 Boreham Jun 2003 A1
20030105742 Boreham et al. Jun 2003 A1
20030115133 Bian Jun 2003 A1
20030131102 Umbreit Jul 2003 A1
20030154162 Danaher et al. Aug 2003 A1
20030158960 Engberg Aug 2003 A1
20030163513 Schaeck et al. Aug 2003 A1
20030163733 Barriga-Caceres et al. Aug 2003 A1
20030171942 Gaito Sep 2003 A1
20030177028 Cooper et al. Sep 2003 A1
20030182214 Taylor Sep 2003 A1
20030187837 Culliss Oct 2003 A1
20030195859 Lawrence Oct 2003 A1
20030200447 Sjoblom Oct 2003 A1
20030204429 Botscheck et al. Oct 2003 A1
20030204752 Garrison Oct 2003 A1
20030208412 Hillestad et al. Nov 2003 A1
20030220858 Lam et al. Nov 2003 A1
20040002878 Hinton Jan 2004 A1
20040006488 Fitall et al. Jan 2004 A1
20040010458 Friedman Jan 2004 A1
20040010698 Rolfe Jan 2004 A1
20040015714 Abraham et al. Jan 2004 A1
20040015715 Brown Jan 2004 A1
20040019549 Gulbrandsen Jan 2004 A1
20040019799 Vering et al. Jan 2004 A1
20040024671 Freund Feb 2004 A1
20040024709 Yu et al. Feb 2004 A1
20040030649 Nelson et al. Feb 2004 A1
20040039586 Garvey et al. Feb 2004 A1
20040044628 Mathew et al. Mar 2004 A1
20040044673 Brady et al. Mar 2004 A1
20040044739 Ziegler Mar 2004 A1
20040078324 Lonnberg et al. Apr 2004 A1
20040083159 Crosby et al. Apr 2004 A1
20040088237 Moenickheim et al. May 2004 A1
20040088255 Zielke et al. May 2004 A1
20040107250 Marciano Jun 2004 A1
20040110119 Riconda et al. Jun 2004 A1
20040111359 Hudock Jun 2004 A1
20040111375 Johnson Jun 2004 A1
20040117302 Weichert et al. Jun 2004 A1
20040122681 Ruvolo et al. Jun 2004 A1
20040122696 Beringer Jun 2004 A1
20040128150 Lundegren Jul 2004 A1
20040128156 Beringer et al. Jul 2004 A1
20040133440 Carolan 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
20040141005 Banatwala et al. Jul 2004 A1
20040143546 Wood et al. Jul 2004 A1
20040143596 Sirkin Jul 2004 A1
20040153521 Kogo Aug 2004 A1
20040158523 Dort Aug 2004 A1
20040158723 Root Aug 2004 A1
20040159700 Khan et al. Aug 2004 A1
20040167793 Masuoka et al. Aug 2004 A1
20040193891 Ollila Sep 2004 A1
20040199789 Shaw et al. Oct 2004 A1
20040210661 Thompson Oct 2004 A1
20040220865 Lozowski et al. Nov 2004 A1
20040220918 Scriffignano et al. Nov 2004 A1
20040225643 Alpha et al. Nov 2004 A1
20040230527 Hansen et al. Nov 2004 A1
20040243514 Wankmueller Dec 2004 A1
20040243518 Clifton et al. Dec 2004 A1
20040243588 Tanner et al. Dec 2004 A1
20040243832 Wilf et al. Dec 2004 A1
20040249811 Shostack Dec 2004 A1
20040250085 Tattan et al. Dec 2004 A1
20040250107 Guo Dec 2004 A1
20040254935 Chagoly et al. Dec 2004 A1
20040255127 Arnouse Dec 2004 A1
20040267714 Frid et al. Dec 2004 A1
20050005168 Dick Jan 2005 A1
20050010513 Duckworth et al. Jan 2005 A1
20050021476 Candella et al. Jan 2005 A1
20050021551 Silva et al. Jan 2005 A1
20050027983 Klawon Feb 2005 A1
20050027995 Menschik et al. Feb 2005 A1
20050055231 Lee Mar 2005 A1
20050058262 Timmins et al. Mar 2005 A1
20050060332 Bernstein et al. Mar 2005 A1
20050071328 Lawrence Mar 2005 A1
20050075985 Cartmell 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
20050105719 Huda May 2005 A1
20050108396 Bittner May 2005 A1
20050108631 Amorin et al. May 2005 A1
20050114335 Wesinger, Jr. et al. May 2005 A1
20050114344 Wesinger, Jr. et al. May 2005 A1
20050114345 Wesinger, Jr. et al. May 2005 A1
20050119978 Ates Jun 2005 A1
20050125291 Demkiw Grayson et al. Jun 2005 A1
20050125397 Gross et al. Jun 2005 A1
20050125686 Brandt Jun 2005 A1
20050137899 Davies et al. Jun 2005 A1
20050138391 Mandalia et al. Jun 2005 A1
20050144452 Lynch et al. Jun 2005 A1
20050154664 Guy et al. Jul 2005 A1
20050154665 Kerr Jul 2005 A1
20050154769 Eckart et al. Jul 2005 A1
20050166262 Beattie et al. Jul 2005 A1
20050171884 Arnott Aug 2005 A1
20050181765 Mark Aug 2005 A1
20050204041 Blinn et al. Sep 2005 A1
20050208461 Krebs et al. Sep 2005 A1
20050216434 Haveliwala et al. Sep 2005 A1
20050216582 Toomey et al. Sep 2005 A1
20050216953 Ellingson Sep 2005 A1
20050216955 Wilkins et al. Sep 2005 A1
20050226224 Lee et al. Oct 2005 A1
20050240578 Biederman et al. Oct 2005 A1
20050256809 Sadri Nov 2005 A1
20050267840 Holm-Blagg et al. Dec 2005 A1
20050273431 Abel et al. Dec 2005 A1
20050288998 Verma et al. Dec 2005 A1
20060004623 Jasti Jan 2006 A1
20060004626 Holmen et al. Jan 2006 A1
20060010072 Eisen Jan 2006 A1
20060010391 Uemura et al. Jan 2006 A1
20060010487 Fierer et al. Jan 2006 A1
20060016107 Davis Jan 2006 A1
20060032909 Seegar Feb 2006 A1
20060036543 Blagg et al. Feb 2006 A1
20060036748 Nusbaum et al. Feb 2006 A1
20060036870 Dasari et al. Feb 2006 A1
20060041464 Powers et al. Feb 2006 A1
20060041670 Musseleck et al. Feb 2006 A1
20060059110 Madhok et al. Mar 2006 A1
20060059362 Paden et al. Mar 2006 A1
20060069635 Ram et al. Mar 2006 A1
20060074986 Mallalieu et al. Apr 2006 A1
20060074991 Lussier et al. Apr 2006 A1
20060079211 Degraeve Apr 2006 A1
20060080230 Freiberg Apr 2006 A1
20060080251 Fried et al. Apr 2006 A1
20060080263 Willis et al. Apr 2006 A1
20060085361 Hoerle et al. Apr 2006 A1
20060101508 Taylor May 2006 A1
20060129419 Flaxer et al. Jun 2006 A1
20060129481 Bhatt et al. Jun 2006 A1
20060129533 Purvis Jun 2006 A1
20060131390 Kim Jun 2006 A1
20060136595 Satyavolu Jun 2006 A1
20060140460 Coutts Jun 2006 A1
20060155573 Hartunian Jul 2006 A1
20060155780 Sakairi et al. Jul 2006 A1
20060161435 Atef et al. Jul 2006 A1
20060161554 Lucovsky et al. Jul 2006 A1
20060173776 Shalley et al. Aug 2006 A1
20060173792 Glass Aug 2006 A1
20060178971 Owen et al. Aug 2006 A1
20060179050 Giang et al. Aug 2006 A1
20060184585 Grear et al. Aug 2006 A1
20060195351 Bayburtian Aug 2006 A1
20060204051 Holland, IV Sep 2006 A1
20060212407 Lyon Sep 2006 A1
20060218407 Toms Sep 2006 A1
20060229943 Mathias et al. Oct 2006 A1
20060229961 Lyftogt et al. Oct 2006 A1
20060235935 Ng Oct 2006 A1
20060239512 Petrillo Oct 2006 A1
20060253358 Delgrosso et al. Nov 2006 A1
20060262929 Vatanen et al. Nov 2006 A1
20060265243 Racho et al. Nov 2006 A1
20060271456 Romain et al. Nov 2006 A1
20060271457 Romain et al. Nov 2006 A1
20060271633 Adler Nov 2006 A1
20060277089 Hubbard et al. Dec 2006 A1
20060282429 Hernandez-Sherrington et al. Dec 2006 A1
20060282660 Varghese et al. Dec 2006 A1
20060282819 Graham et al. Dec 2006 A1
20060287764 Kraft Dec 2006 A1
20060287765 Kraft Dec 2006 A1
20060287766 Kraft Dec 2006 A1
20060287767 Kraft Dec 2006 A1
20060288090 Kraft Dec 2006 A1
20060294199 Bertholf Dec 2006 A1
20070005508 Chiang Jan 2007 A1
20070005984 Florencio et al. Jan 2007 A1
20070022141 Singleton et al. Jan 2007 A1
20070027816 Writer Feb 2007 A1
20070032240 Finnegan et al. Feb 2007 A1
20070038568 Greene et al. Feb 2007 A1
20070043577 Kasower Feb 2007 A1
20070047714 Baniak et al. Mar 2007 A1
20070067297 Kublickis Mar 2007 A1
20070072190 Aggarwal Mar 2007 A1
20070073889 Morris Mar 2007 A1
20070078908 Rohatgi et al. Apr 2007 A1
20070078985 Shao et al. Apr 2007 A1
20070083460 Bachenheimer Apr 2007 A1
20070083463 Kraft Apr 2007 A1
20070093234 Willis et al. Apr 2007 A1
20070094230 Subramaniam et al. Apr 2007 A1
20070094241 Blackwell et al. Apr 2007 A1
20070112667 Rucker May 2007 A1
20070112668 Celano et al. May 2007 A1
20070121843 Atazky et al. May 2007 A1
20070124256 Crooks et al. May 2007 A1
20070143825 Goffin Jun 2007 A1
20070156692 Rosewarne Jul 2007 A1
20070162307 Austin et al. Jul 2007 A1
20070174186 Hokland Jul 2007 A1
20070174448 Ahuja et al. Jul 2007 A1
20070174903 Greff Jul 2007 A1
20070192121 Routson et al. Aug 2007 A1
20070192853 Shraim et al. Aug 2007 A1
20070198432 Pitroda et al. Aug 2007 A1
20070204338 Aiello et al. Aug 2007 A1
20070205266 Carr et al. Sep 2007 A1
20070226122 Burrell et al. Sep 2007 A1
20070240206 Wu et al. Oct 2007 A1
20070244807 Andringa et al. Oct 2007 A1
20070245245 Blue et al. Oct 2007 A1
20070250441 Paulsen et al. Oct 2007 A1
20070250459 Schwarz et al. Oct 2007 A1
20070261108 Lee et al. Nov 2007 A1
20070261114 Pomerantsev Nov 2007 A1
20070266439 Kraft Nov 2007 A1
20070282743 Lovelett Dec 2007 A1
20070288355 Roland et al. Dec 2007 A1
20070288360 Seeklus Dec 2007 A1
20070294195 Curry et al. Dec 2007 A1
20080010203 Grant Jan 2008 A1
20080010206 Coleman Jan 2008 A1
20080010687 Gonen et al. Jan 2008 A1
20080028446 Burgoyne Jan 2008 A1
20080033742 Bernasconi Feb 2008 A1
20080033956 Saha et al. Feb 2008 A1
20080040610 Fergusson Feb 2008 A1
20080047017 Renaud Feb 2008 A1
20080052182 Marshall Feb 2008 A1
20080052244 Tsuei et al. Feb 2008 A1
20080059364 Tidwell et al. Mar 2008 A1
20080066188 Kwak Mar 2008 A1
20080072316 Chang et al. Mar 2008 A1
20080077526 Arumugam Mar 2008 A1
20080082536 Schwabe et al. Apr 2008 A1
20080083021 Doane et al. Apr 2008 A1
20080086431 Robinson et al. Apr 2008 A1
20080091530 Egnatios et al. Apr 2008 A1
20080103800 Domenikos et al. May 2008 A1
20080103972 Lanc May 2008 A1
20080104672 Lunde et al. May 2008 A1
20080109422 Dedhia May 2008 A1
20080109875 Kraft May 2008 A1
20080114670 Friesen May 2008 A1
20080115191 Kim et al. May 2008 A1
20080115226 Welingkar et al. May 2008 A1
20080120569 Mann et al. May 2008 A1
20080120716 Hall et al. May 2008 A1
20080126233 Hogan May 2008 A1
20080141346 Kay et al. Jun 2008 A1
20080148368 Zurko et al. Jun 2008 A1
20080154758 Schattmaier et al. Jun 2008 A1
20080155686 McNair Jun 2008 A1
20080162317 Banaugh et al. Jul 2008 A1
20080162350 Allen-Rouman et al. Jul 2008 A1
20080162383 Kraft Jul 2008 A1
20080175360 Schwarz et al. Jul 2008 A1
20080183480 Carlson et al. Jul 2008 A1
20080183585 Vianello Jul 2008 A1
20080195548 Chu et al. Aug 2008 A1
20080201401 Pugh et al. Aug 2008 A1
20080205655 Wilkins et al. Aug 2008 A1
20080208726 Tsantes et al. Aug 2008 A1
20080208735 Balet et al. Aug 2008 A1
20080208752 Gottlieb et al. Aug 2008 A1
20080208873 Boehmer Aug 2008 A1
20080212845 Lund Sep 2008 A1
20080216156 Kosaka Sep 2008 A1
20080222706 Renaud et al. Sep 2008 A1
20080222722 Navratil et al. Sep 2008 A1
20080229415 Kapoor et al. Sep 2008 A1
20080249869 Angell et al. Oct 2008 A1
20080255992 Lin Oct 2008 A1
20080256613 Grover Oct 2008 A1
20080263058 Peden Oct 2008 A1
20080270295 Lent et al. Oct 2008 A1
20080270299 Peng Oct 2008 A1
20080281737 Fajardo Nov 2008 A1
20080288283 Baldwin, Jr. et al. Nov 2008 A1
20080288299 Schultz Nov 2008 A1
20080301016 Durvasula et al. Dec 2008 A1
20080306750 Wunder et al. Dec 2008 A1
20080319889 Hammad Dec 2008 A1
20090006230 Lyda et al. Jan 2009 A1
20090018986 Alcorn et al. Jan 2009 A1
20090031426 Dal Lago et al. Jan 2009 A1
20090037332 Cheung et al. Feb 2009 A1
20090043691 Kasower Feb 2009 A1
20090055322 Bykov et al. Feb 2009 A1
20090055894 Lorsch Feb 2009 A1
20090064297 Selgas et al. Mar 2009 A1
20090094237 Churi et al. Apr 2009 A1
20090094674 Schwartz et al. Apr 2009 A1
20090100047 Jones et al. Apr 2009 A1
20090106141 Becker Apr 2009 A1
20090106150 Pelegero et al. Apr 2009 A1
20090106846 Dupray et al. Apr 2009 A1
20090119299 Rhodes May 2009 A1
20090125369 Kloostra et al. May 2009 A1
20090125972 Hinton et al. May 2009 A1
20090132347 Anderson et al. May 2009 A1
20090138335 Lieberman May 2009 A1
20090144166 Dickelman Jun 2009 A1
20090150166 Leite et al. Jun 2009 A1
20090150238 Marsh et al. Jun 2009 A1
20090157564 Cross Jun 2009 A1
20090157693 Palahnuk Jun 2009 A1
20090158030 Rasti Jun 2009 A1
20090164232 Chmielewski et al. Jun 2009 A1
20090164380 Brown Jun 2009 A1
20090172788 Veldula et al. Jul 2009 A1
20090172795 Ritari et al. Jul 2009 A1
20090177529 Hadi Jul 2009 A1
20090177562 Peace et al. Jul 2009 A1
20090183259 Rinek et al. Jul 2009 A1
20090199264 Lang Aug 2009 A1
20090199294 Schneider Aug 2009 A1
20090204514 Bhogal et al. Aug 2009 A1
20090204599 Morris et al. Aug 2009 A1
20090210241 Calloway Aug 2009 A1
20090210807 Xiao et al. Aug 2009 A1
20090215431 Koraichi Aug 2009 A1
20090216640 Masi Aug 2009 A1
20090222449 Horn et al. Sep 2009 A1
20090228918 Rolff et al. Sep 2009 A1
20090234665 Conkel Sep 2009 A1
20090234775 Whitney et al. Sep 2009 A1
20090234876 Schigel et al. Sep 2009 A1
20090240624 James et al. Sep 2009 A1
20090247122 Fitzgerald et al. Oct 2009 A1
20090254375 Martinez et al. Oct 2009 A1
20090254476 Sharma et al. Oct 2009 A1
20090254572 Redlich et al. Oct 2009 A1
20090254656 Vignisson et al. Oct 2009 A1
20090254971 Herz et al. Oct 2009 A1
20090260064 Mcdowell et al. Oct 2009 A1
20090307778 Mardikar Dec 2009 A1
20090313562 Appleyard et al. Dec 2009 A1
20090327270 Teevan et al. Dec 2009 A1
20090328173 Jakobson et al. Dec 2009 A1
20100011428 Atwood et al. Jan 2010 A1
20100030578 Siddique et al. Feb 2010 A1
20100030677 Melik-Aslanian et al. Feb 2010 A1
20100042542 Rose et al. Feb 2010 A1
20100043055 Baumgart Feb 2010 A1
20100049803 Ogilvie et al. Feb 2010 A1
20100058404 Rouse Mar 2010 A1
20100063942 Arnott et al. Mar 2010 A1
20100063993 Higgins et al. Mar 2010 A1
20100076836 Giordano et al. Mar 2010 A1
20100077483 Stolfo et al. Mar 2010 A1
20100083371 Bennetts et al. Apr 2010 A1
20100088233 Tattan et al. Apr 2010 A1
20100094768 Miltonberger Apr 2010 A1
20100094910 Bayliss Apr 2010 A1
20100100945 Ozzie et al. Apr 2010 A1
20100114744 Gonen May 2010 A1
20100114776 Weller et al. May 2010 A1
20100121767 Coulter et al. May 2010 A1
20100122324 Welingkar et al. May 2010 A1
20100122333 Noe et al. May 2010 A1
20100130172 Vendrow et al. May 2010 A1
20100136956 Drachev et al. Jun 2010 A1
20100138298 Fitzherald et al. Jun 2010 A1
20100145836 Baker et al. Jun 2010 A1
20100153278 Farsedakis Jun 2010 A1
20100153290 Duggan Jun 2010 A1
20100161816 Kraft et al. Jun 2010 A1
20100169159 Rose et al. Jul 2010 A1
20100174638 Debie et al. Jul 2010 A1
20100174813 Hildreth et al. Jul 2010 A1
20100179906 Hawkes Jul 2010 A1
20100185546 Pollard Jul 2010 A1
20100205076 Parson et al. Aug 2010 A1
20100205662 Ibrahim et al. Aug 2010 A1
20100211445 Bodington Aug 2010 A1
20100211636 Starkenburg et al. Aug 2010 A1
20100217837 Ansari et al. Aug 2010 A1
20100223192 Levine et al. Sep 2010 A1
20100229245 Singhal Sep 2010 A1
20100241493 Onischuk Sep 2010 A1
20100241535 Nightengale et al. Sep 2010 A1
20100250338 Banerjee et al. Sep 2010 A1
20100250410 Song et al. Sep 2010 A1
20100250411 Ogrodski Sep 2010 A1
20100250955 Trevithick et al. Sep 2010 A1
20100257102 Perlman Oct 2010 A1
20100258623 Beemer et al. Oct 2010 A1
20100262932 Pan Oct 2010 A1
20100280914 Carlson Nov 2010 A1
20100281020 Drubner Nov 2010 A1
20100293090 Domenikos et al. Nov 2010 A1
20100299262 Handler Nov 2010 A1
20100325442 Petrone et al. Dec 2010 A1
20100325694 Bhagavatula et al. Dec 2010 A1
20100332393 Weller et al. Dec 2010 A1
20110004498 Readshaw Jan 2011 A1
20110016533 Zeigler et al. Jan 2011 A1
20110023115 Wright Jan 2011 A1
20110029388 Kendall et al. Feb 2011 A1
20110040736 Kalaboukis Feb 2011 A1
20110071950 Ivanovic Mar 2011 A1
20110082768 Eisen Apr 2011 A1
20110083181 Nazarov Apr 2011 A1
20110113084 Ramnani May 2011 A1
20110126024 Beatson et al. May 2011 A1
20110126275 Anderson et al. May 2011 A1
20110131096 Frew et al. Jun 2011 A1
20110131123 Griffin et al. Jun 2011 A1
20110137760 Rudie et al. Jun 2011 A1
20110142213 Baniak et al. Jun 2011 A1
20110145899 Cao et al. Jun 2011 A1
20110148625 Velusamy Jun 2011 A1
20110161218 Swift Jun 2011 A1
20110166988 Coulter Jul 2011 A1
20110167011 Paltenghe et al. Jul 2011 A1
20110173681 Qureshi et al. Jul 2011 A1
20110179139 Starkenburg et al. Jul 2011 A1
20110184780 Alderson et al. Jul 2011 A1
20110184838 Winters et al. Jul 2011 A1
20110196791 Dominguez Aug 2011 A1
20110208601 Ferguson et al. Aug 2011 A1
20110211445 Chen Sep 2011 A1
20110260832 Ross et al. Oct 2011 A1
20110264566 Brown Oct 2011 A1
20110270754 Kelly et al. Nov 2011 A1
20110307397 Benmbarek Dec 2011 A1
20110307957 Barcelo et al. Dec 2011 A1
20120011158 Avner et al. Jan 2012 A1
20120016948 Sinha Jan 2012 A1
20120030216 Churi et al. Feb 2012 A1
20120030771 Pierson et al. Feb 2012 A1
20120047219 Feng et al. Feb 2012 A1
20120054592 Jaffe et al. Mar 2012 A1
20120072382 Pearson et al. Mar 2012 A1
20120084866 Stolfo Apr 2012 A1
20120089438 Tavares et al. Apr 2012 A1
20120108274 Acebo Ruiz et al. May 2012 A1
20120110467 Blake et al. May 2012 A1
20120110677 Abendroth et al. May 2012 A1
20120124498 Santoro et al. May 2012 A1
20120130898 Snyder et al. May 2012 A1
20120136763 Megdal et al. May 2012 A1
20120151045 Anakata et al. Jun 2012 A1
20120173339 Flynt et al. Jul 2012 A1
20120173563 Griffin et al. Jul 2012 A1
20120215682 Lent et al. Aug 2012 A1
20120215719 Verlander Aug 2012 A1
20120216125 Pierce Aug 2012 A1
20120235897 Hirota Sep 2012 A1
20120239497 Nuzzi Sep 2012 A1
20120246060 Conyack, Jr. et al. Sep 2012 A1
20120246730 Raad Sep 2012 A1
20120253852 Pourfallah et al. Oct 2012 A1
20120290660 Rao et al. Nov 2012 A1
20120297484 Srivastava Nov 2012 A1
20120323717 Kirsch Dec 2012 A1
20120331557 Washington Dec 2012 A1
20130004033 Trugenberger et al. Jan 2013 A1
20130006843 Tralvex Jan 2013 A1
20130018811 Britti et al. Jan 2013 A1
20130031109 Roulson et al. Jan 2013 A1
20130031624 Britti et al. Jan 2013 A1
20130041701 Roth Feb 2013 A1
20130066775 Milam Mar 2013 A1
20130080467 Carson et al. Mar 2013 A1
20130085804 Leff et al. Apr 2013 A1
20130085939 Colak et al. Apr 2013 A1
20130110678 Vigier et al. May 2013 A1
20130117087 Coppinger May 2013 A1
20130125010 Strandell May 2013 A1
20130132151 Stibel et al. May 2013 A1
20130139229 Fried et al. May 2013 A1
20130173449 Ng et al. Jul 2013 A1
20130179955 Bekker et al. Jul 2013 A1
20130198525 Spies et al. Aug 2013 A1
20130205135 Lutz Aug 2013 A1
20130246528 Ogura Sep 2013 A1
20130254096 Serio et al. Sep 2013 A1
20130271272 Dhesi et al. Oct 2013 A1
20130279676 Baniak et al. Oct 2013 A1
20130290097 Balestrieri et al. Oct 2013 A1
20130293363 Plymouth Nov 2013 A1
20130298238 Shah et al. Nov 2013 A1
20130332342 Kasower Dec 2013 A1
20130339217 Breslow et al. Dec 2013 A1
20130339249 Weller et al. Dec 2013 A1
20140012733 Vidal Jan 2014 A1
20140025475 Burke Jan 2014 A1
20140032723 Nema Jan 2014 A1
20140046872 Arnott et al. Feb 2014 A1
20140051464 Ryan et al. Feb 2014 A1
20140061302 Hammad Mar 2014 A1
20140089167 Kasower Mar 2014 A1
20140110477 Hammad Apr 2014 A1
20140164112 Kala Jun 2014 A1
20140164398 Smith et al. Jun 2014 A1
20140164519 Shah Jun 2014 A1
20140201100 Rellas et al. Jul 2014 A1
20140258083 Achanta et al. Sep 2014 A1
20140279467 Chapa et al. Sep 2014 A1
20140280945 Lunt Sep 2014 A1
20140283123 Lonstein Sep 2014 A1
20140289812 Wang et al. Sep 2014 A1
20140298485 Gardner Oct 2014 A1
20140317023 Kim Oct 2014 A1
20140331282 Tkachev Nov 2014 A1
20140379600 Chapa et al. Dec 2014 A1
20150067341 Deen Mar 2015 A1
20150249655 Lunt Sep 2015 A1
20150254658 Bondesen Sep 2015 A1
20150326580 McMillan et al. Nov 2015 A1
20160027008 John Jan 2016 A1
20160275476 Artman et al. Sep 2016 A1
20170186012 McNeal Jun 2017 A1
20170200223 Kasower Jul 2017 A1
20170337557 Durney et al. Nov 2017 A1
20180046856 Kapczynski Feb 2018 A1
20180101890 Eisen Apr 2018 A1
20180343265 McMillan et al. Nov 2018 A1
Foreign Referenced Citations (37)
Number Date Country
1 028 401 Aug 2000 EP
1 239 378 Sep 2002 EP
1 301 887 Apr 2003 EP
1 850 278 Oct 2007 EP
2 074 513 Feb 2016 EP
2005-208945 Aug 2005 JP
10-2000-0063313 Nov 2000 KR
10-2002-0039203 May 2002 KR
10-2007-0081504 Aug 2007 KR
256569 Jun 2006 TW
WO 99054803 Oct 1999 WO
WO 99060481 Nov 1999 WO
WO 00030045 May 2000 WO
WO 01009752 Feb 2001 WO
WO 01009792 Feb 2001 WO
WO 01084281 Nov 2001 WO
WO 02029636 Apr 2002 WO
WO 2004031986 Apr 2004 WO
WO 2005033979 Apr 2005 WO
WO 2006019752 Feb 2006 WO
WO 2006050278 May 2006 WO
WO 2006069199 Jun 2006 WO
WO 2006099081 Sep 2006 WO
WO 2007001394 Jan 2007 WO
WO 2007050156 May 2007 WO
WO 2008042614 Apr 2008 WO
WO 2008054849 May 2008 WO
WO 2009064694 May 2009 WO
WO 2009102391 Aug 2009 WO
WO 2009117468 Sep 2009 WO
WO 2010001406 Jan 2010 WO
WO 2010062537 Jun 2010 WO
WO 2010077989 Jul 2010 WO
WO 2010150251 Dec 2010 WO
WO 2011005876 Jan 2011 WO
WO 2012054646 Apr 2012 WO
WO 2015038520 Mar 2015 WO
Non-Patent Literature Citations (122)
Entry
Cheng, F. (2011). Security attack safe mobile and cloud-based one-time password tokens using rubbing encryption encryption algorithm. Mobile Networks and Applications, 16(3), 304-336. doi:http://dx.doi.org/10.1007/s11036-011-0303-9 (Year: 2011).
Target; “Free Credit Monitoring and Identity Theft Protection with Experian's ProtectMyID Now Available”; https://corporate.target.com; Jan. 13, 2014; 2 pages.
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.
Actuate, “Delivering Enterprise Information for Corporate Portals”, White Paper, 2004, pp. 1-7.
“Aggregate and Analyze Social Media Content: Gain Faster and Broader Insight to Market Sentiment,” SAP Partner, Mantis Technology Group, Apr. 2011, pp. 4.
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.
Aktas et al., “Personalizing PageRank Based on Domain Profiles”, WEBKDD workshop: Webmining and Web Usage Analysis, Aug. 22, 2004, pp. 83-90.
Aktas et al., “Using Hyperlink Features to Personalize Web Search”, WEBKDD workshop: Webmining and Web Usage Analysis, Aug. 2004.
“Arizona Company Has Found Key in Stopping ID Theft,” PR Newswire, New York, Aug. 10, 2005 http://proquest.umi.com/pqdweb?did=880104711&sid=1&Fmt=3&clientId=19649&RQT=309&Vname=PQD.
ABC News Now:Money Matters, as broadcasted Nov. 15, 2005 with guest Todd Davis (CEO of Lifelock), pp. 6.
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.
Anonymous, “Feedback”, Credit Management, ABI/INFORM Global, Sep. 2006, pp. 6.
Bielski, Lauren, “Will you Spend to Thwart ID Theft?” ABA Banking Journal, Apr. 2005, pp. 54, 56-57, 60.
BlueCava, “What We Do”, http://www.bluecava.com/what-we-do/, printed Nov. 5, 2012 in 3 pages.
Buxfer, http://www.buxfer.com/ printed Feb. 5, 2014 in 1 page.
Check, http://check.me/ printed Feb. 5, 2014 in 3 pages.
Chores & Allowances, “Do Kids Have Credit Reports?” Oct. 15, 2007, http://choresandallowances.blogspot.com/2007/10/do-kids-have-credit-reports.html, pp. 5.
Comlounge.net, “plonesocial.auth.rpx” http://web.archive.org/web/20101026041841/http://comlounge.net/rpx as captured Oct. 26, 2010 in 9 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.
Cullen, Terri; “The Wall Street Journal Complete Identity Theft Guidebook:How to Protect Yourself from the Most Pervasive Crime in America”; Chapter 3, pp. 59-79; Jul. 10, 2007.
“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.
Day, Jo and Kevin; “ID-ology: A Planner's Guide to Identity Theft”; Journal of Financial Planning:Tech Talk; pp. 36-38; Sep. 2004.
Equifax; “Equifax Credit Watch”; https://www.econsumer.equifax.co.uk/consumer/uk/sitepage.ehtml, dated Jun. 27, 2007 on www.archive.org.
Ettorre, “Paul Kahn on Exceptional Marketing,” Management Review, vol. 83, No. 11, Nov. 1994, pp. 48-51.
Facebook, “Facebook helps you connect and share with the people in your life,” www.facebook.com printed Nov. 16, 2010 in 1 page.
FamilySecure.com, “Frequently Asked Questions”, http://www.familysecure.com/FAQ.aspx as archived Jul. 15, 2007 in 3 pages.
FamilySecure.com; “Identity Theft Protection for the Whole Family | FamilySecure.com” http://www.familysecure.com/, as retrieved on Nov. 5, 2009.
Fenner, Peter, “Mobile Address Management and Billing for Personal Communications”, 1st International Conference on Universal Personal Communications, 1992, ICUPC '92 Proceedings, pp. 253-257.
“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.
Fisher, Joseph, “Access to Fair Credit Reports: Current Practices and Proposed Legislation,” American Business Law Journal, Fall 1981, vol. 19, No. 3, p. 319.
Gibbs, Adrienne; “Protecting Your Children from Identity Theft,” Nov. 25, 2008, http://www.creditcards.com/credit-card-news/identity-ID-theft-and-kids-children-1282.php, pp. 4.
Gordon et al., “Identity Fraud: A Critical National and Global Threat,” LexisNexis, Oct. 28, 2003, pp. 1-48.
Harrington et al., “iOS 4 in Action”, Chapter 17, Local and Push Notification Services, Manning Publications Co., Jun. 2011, pp. 347-353.
Herzberg, Amir, “Payments and Banking with Mobile Personal Devices,” Communications of the ACM, May 2003, vol. 46, No. 5, pp. 53-58.
Hoofnagle, Chris Jay, “Identity Theft: Making the Known Unknowns Known,” Harvard Journal of Law & Technology, Fall 2007, vol. 21, No. 1, pp. 98-122.
ID Analytics, “ID Analytics® Consumer Notification Service” printed Apr. 16, 2013 in 2 pages.
ID Theft Assist, “Do You Know Where Your Child's Credit Is?”, Nov. 26, 2007, http://www.idtheftassist.com/pages/story14, pp. 3.
“ID Thieves These Days Want Your Number, Not Your Name”, The Columbus Dispatch, Columbus, Ohio, http://www.dispatch.com/content/stories/business/2014/08/03/id-thieves-these-days-want-your-number-not-your-name.html, Aug. 3, 2014 in 2 pages.
Identity Theft Resource Center; Fact Sheet 120 A—To Order a Credit Report for a Child; Fact Sheets, Victim Resources; Apr. 30, 2007.
“Identity Thieves Beware: Lifelock Introduces Nation's First Guaranteed Proactive Solution to Identity Theft Protection,” PR Newswire, New York, Jun. 13, 2005 http://proquest.umi.com/pqdweb?did=852869731&sid=1&Fmt=3&clientId=19649&RQT=309&Vname=PQD.
IDEON, Credit-Card Registry that Bellyflopped this Year, Is Drawing some Bottom-Fishers, The Wall Street Journal, Aug. 21, 1995, pp. C2.
Information Brokers of America, “Information Brokers of America Child Identity Theft Protection” http://web.archive.org/web/20080706135451/http://iboainfo.com/child-order.html as archived Jul. 6, 2008 in 1 page.
Information Brokers of America, “Safeguard Your Child's Credit”, http://web.archive.org/web/20071215210406/http://www.iboainfo.com/child-id-protect.html as archived Dec. 15, 2007 in 1 page.
Intelius, “People Search—Updated Daily, Accurate and Fast!” http://www.intelius.com/people-search.html?=&gclid=CJqZIZP7paUCFYK5KgodbCUJJQ printed Nov. 16, 2010 in 1 page.
Iovation, Device Identification & Device Fingerprinting, http://www.iovation.com/risk-management/device-identification printed Nov. 5, 2012 in 6 pages.
Khan, Muhammad Khurram, PhD., “An Efficient and Secure Remote Mutual Authentication Scheme with Smart Cards” IEEE International Symposium on Biometrics & Security Technologies (ISBAST), Apr. 23-24, 2008, pp. 1-6.
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.
Lee, W.A.; “Experian, on Deal Hunt, Nets Identity Theft Insurer”, American Banker: The Financial Services Daily, Jun. 4, 2003, New York, NY, 1 page.
Lefebvre et al., “A Robust Soft Hash Algorithm for Digital Image Signature”, International Conference on Image Processing 2:11 (ICIP), vol. 3, Oct. 2003, pp. 495-498.
Leskovec, Jure, “Social Media Analytics: Tracking, Modeling and Predicting the Flow of Information through Networks”, WWW 2011—Tutorial, Mar. 28-Apr. 1, 2011, Hyderabad, India, pp. 277-278.
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.
LifeLock, “How LifeLock Works,” http://www.lifelock.com/lifelock-for-people printed Mar. 14, 2008 in 1 page.
LifeLock, “LifeLock Launches First ID Theft Prevention Program for the Protection of Children,” Press Release, Oct. 14, 2005, http://www.lifelock.com/about-us/press-room/2005-press-releases/lifelock-protection-for-children.
LifeLock; “How Can LifeLock Protect My Kids and Family?” http://www.lifelock.com/lifelock-for-people/how-we-do-it/how-can-lifelock-protect-my-kids-and-family printed Mar. 14, 2008 in 1 page.
LifeLock, Various Pages, www.lifelock.com/, 2007.
Lobo, Jude, “MySAP.com Enterprise Portal Cookbook,” SAP Technical Delivery, Feb. 2002, vol. 1, pp. 1-13.
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.
Manilla, http://www.manilla.com/how-it-works/ printed Feb. 5, 2014 in 1 page.
Meyers et al., “Using Your Social Networking Accounts to Log Into NPR.org,” NPR.org, Jun. 24, 2010, http://web.archive.org/web/20100627034054/http://www.npr.org/blogs/inside/2010/06/24/128079309/using-your-social-networking-accounts-to-log-into-npr-org in 3 pages.
Micarelli et al., “Personalized Search on the World Wide Web,” The Adaptive Web, LNCS 4321, 2007, pp. 195-230.
Microsoft, “Expand the Reach of Your Business,” Microsoft Business Solutions, 2004, in 16 pages.
Mint.com, http://www.mint.com/how-it-works/ printed Feb. 5, 2013 in 2 pages.
Mvelopes, http://www.mvelopes.com/ printed Feb. 5, 2014 in 2 pages.
My Call Credit http://www.mycallcredit.com/products.asp?product=ALR dated Dec. 10, 2005 on www.archive.org.
My Call Credit http://www.mycallcredit.com/rewrite.asp?display=faq dated Dec. 10, 2005 on www.archive.org.
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.
“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.
National Alert Registry Launches RegisteredOffendersList.org to Provide Information on Registered Sex Offenders, May 16, 2005, pp. 2, http://www.prweb.com/printer/240437.htm accessed on Oct. 18, 2011.
National Alert Registry Offers Free Child Safety “Safe From Harm” DVD and Child Identification Kit, Oct. 24, 2006. pp. 2, http://www.prleap.com/pr/53170 accessed on Oct. 18, 2011.
National Alert Registry website titled, “Does a sexual offender live in your neighborhood”, Oct. 22, 2006, pp. 2, http://web.archive.org/wb/20061022204835/http://www.nationallertregistry.com/ accessed on Oct. 13, 2011.
Next Card: About Us, http://web.cba.neu.edu/˜awatson/NextCardCase/NextCardAboutUs.htm printed Oct. 23, 2009 in 10 pages.
Ogg, Erica, “Apple Cracks Down on UDID Use”, http://gigaom.com/apple/apple-cracks-down-on-udid-use/ printed Nov. 5, 2012 in 5 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.
People Finders, http://www.peoplefinders.com/?CMP=Google&utm_source=google&utm_medium=cpc printed Nov. 16, 2010 in 1 page.
People Lookup, “Your Source for Locating Anyone!” www.peoplelookup.com/people-search.html printed Nov. 16, 2010 in 1 page.
People Search, “The Leading Premium People Search Site on the Web,” http://www.peoplesearch.com printed Nov. 16, 2010 in 2 pages.
PersonalCapital.com, http://www.personalcapital.com/how-it-works printed Feb. 5, 2014 in 5 pages.
Press Release—“Helping Families Protect Against Identity Theft—Experian Announces FamilySecure.com; Parents and guardians are alerted for signs of potential identity theft for them and their children; product features an industry-leading $2 million guarantee”; PR Newswire; Irvine, CA; Oct. 1, 2007.
Privacy Rights Clearinghouse, “Identity Theft: What to do if it Happens to You,” http://web.archive.org/web/19990218180542/http://privacyrights.org/fs/fs17a.htm printed Feb. 18, 1999.
Ramaswamy, Vinita M., Identity-Theft Toolkit, The CPA Journal, Oct. 1, 2006, vol. 76, Issue 10, pp. 66-70.
Rawe, Julie; “Identity Thieves”, Time Bonus Section, Inside Business, Feb. 2002, pp. 2.
Roth, Andrew, “CheckFree to Introduce E-Mail Billing Serving,” American Banker, New York, Mar. 13, 2001, vol. 166, No. 49, pp. 3.
SAS, “SAS® Information Delivery Portal”, Fact Sheet, 2008, in 4 pages.
Scholastic Inc.:Parent's Request for Information http://web.archive.org/web/20070210091055/http://www.scholastic.com/inforequest/index.htm as archived Feb. 10, 2007 in 1 page.
Scholastic Inc.:Privacy Policy http://web.archive.org/web/20070127214753/http://www.scholastic.com/privacy.htm as archived Jan. 27, 2007 in 3 pages.
Securities and Futures Commission, “Guideline on Anti-Money Laundering and Counter-Terrorist Financing”, Jul. 2012, pp. 135.
Singletary, Michelle, “The Littlest Victims of ID Theft”, The Washington Post, The Color of Money, Oct. 4, 2007.
Sun, Hung-Min, “An Efficient Remote Use Authentication Scheme Using Smart Cards”, IEEE Transactions on Consumer Electronics, Nov. 2000, vol. 46, No. 4, pp. 958-961.
“TransUnion—Child Identity Theft Inquiry”, TransUnion, http://www.transunion.com/corporate/personal/fraudIdentityTheft/fraudPrevention/childIDInquiry.page as printed Nov. 5, 2009 in 4 pages.
Truston, “Checking if your Child is an ID Theft Victim can be Stressful,” as posted by Michelle Pastor on Jan. 22, 2007 at http://www.mytruston.com/blog/credit/checking_if_your_child_is_an_id_theft_vi.html.
US Legal, Description, http://www.uslegalforms.com/us/US-00708-LTR.htm printed Sep. 4, 2007 in 2 pages.
Vamosi, Robert, “How to Handle ID Fraud's Youngest Victims,” Nov. 21, 2008, http://news.cnet.com/8301-10789_3-10105303-57.html.
Waggoner, Darren J., “Having a Global Identity Crisis,” Collections & Credit Risk, Aug. 2001, vol. vol. 6, No. 8, pp. 6.
WhatIs.com, “Risk-Based Authentication (RBA)”, https://web.archive.org/web/20121025033106/http://whatis.techtarget.com/definition/risk-based-authentication-RBA, Oct. 23, 2012, pp. 1.
Yahoo! Search, “People Search,” http://people.yahoo/com printed Nov. 16, 2010 in 1 page.
YODLEE | Money Center, https://yodleemoneycenter.com/ printed Feb. 5, 2014 in 2 pages.
You Need a Budget, http://www.youneedabudget.com/features printed Feb. 5, 2014 in 3 pages.
Extended European Search Report for Application No. EP14843372.5, dated May 2, 2017.
International Search Report and Written Opinion for Application No. PCT/US2014/054713, dated Dec. 15, 2014.
International Preliminary Report on Patentability in Application No. PCT/US2014/054713, dated Mar. 24, 2016.
Official Communication in Australian Patent Application No. 2006306790, dated Apr. 29, 2010.
Official Communication in Australian Patent Application No. 2006306790, dated May 19, 2011.
International Search Report and Written Opinion for Application No. PCT/US2006/028006, dated Jul. 27, 2007.
International Preliminary Report on Patentability in Application No. PCT/US2006/028006, dated Apr. 23, 2008.
“Fraud Alert | Learn How”. Fight Identity Theft. http://www.fightidentitytheft.com/flag.html, accessed on Nov. 5, 2009.
LifeLock, “Personal Identity Theft Protection & Identity Theft Products,” http://www.lifelock.com/lifelock-for-people, accessed Nov. 5, 2007.
TheMorningCall.Com, “Cheap Ways to Foil Identity Theft,” www.mcall.com/business/columnists/all-karp.5920748jul01.0 . . . , published Jul. 1, 2007.
Wang et al., “User Identification Based on Finger-vein Patterns for Consumer Electronics Devices”, IEEE Transactions on Consumer Electronics, May 2010, vol. 56, No. 2, pp. 799-804.
Gordon et al., “Using Identity Authentication and Eligibility Assessment to Mitigate the Risk of Improper Payments”, LexisNexis, Jan. 28, 2008, pp. 18. https://risk.lexisnexis.com/-/media/files/government/white-paper/identity_authentication-pdf.pdf.
Official Communication for Application No. EP14843372.5, dated Nov. 29, 2018.
Provisional Applications (1)
Number Date Country
61984351 Apr 2014 US