Computer-implemented methods and systems for authentic user-merchant association and services

Information

  • Patent Grant
  • 12236422
  • Patent Number
    12,236,422
  • Date Filed
    Wednesday, January 5, 2022
    3 years ago
  • Date Issued
    Tuesday, February 25, 2025
    2 months ago
Abstract
A system for identifying genuine user-merchant association. The system includes one or more processors and/or transceivers individually or collectively programmed to check the validity or expiration of a certificate from a device from which a request originates to create a certificate score, analyze previous communication from the device from which the request originates across a plurality of entities and regions to create a previous communication score, and conduct a messaging protocol check to create a protocol score. The one or more processors and/or transceivers are also programmed to output a weighted final score comprising a determination of whether to accept or deny the request based at least in part on one or more of the certificate scores, the previous communication score, or the protocol score. The one or more processors and/or transceivers are also programmed to save the weighted final score.
Description
FIELD OF THE INVENTION

The present disclosure generally relates to computer-implemented methods, systems comprising computer-readable media, and electronic devices for authentic user-merchant association and services.


BACKGROUND

Existing user-merchant association and services may be used for merchants to sell subscription services to users. Merchants often offer trial memberships to users, such that a user may test the trial membership prior to purchasing a full membership.


However, existing user-merchant association may be compromised by fraudulent users. For example, a fraudulent user may generate false and/or temporary methods of identification to fraudulently utilize a trial period of a subscription service multiple times and thereby avoid purchasing a full subscription service. Systems and methods for combatting fraudulent behavior are needed.


This background discussion is intended to provide information related to the present invention which is not necessarily prior art.


BRIEF SUMMARY

The following brief summary is provided to indicate the nature of the subject matter disclosed herein. While certain aspects of the present invention are described below, the summary is not intended to limit the scope of the present invention.


A first aspect of the invention concerns a system for identifying genuine user-merchant association. The system includes one or more processors and/or transceivers individually or collectively programmed to check the validity or expiration of a certificate from a device from which a request originates to create a certificate score, analyze previous communication from the device from which the request originates across a plurality of entities and regions to create a previous communication score, and conduct a messaging protocol check to create a protocol score. The one or more processors and/or transceivers are also programmed to output a weighted final score comprising a determination of whether to accept or deny the request based at least in part on one or more of the certificate score, the previous communication score, or the protocol score. The one or more processors and/or transceivers are also programmed to save the weighted final score.


A second aspect of the invention concerns a computer-implemented method for identifying genuine user-merchant association. The method includes checking the validity or expiration of a certificate from a device from which a request originates to create a certificate score. The method also includes analyzing previous communication from the device from which the request originates across a plurality of entities and regions to create a previous communication score. The method also includes conducting a messaging protocol check to create a protocol score. The method also includes outputting a weighted final score comprising a determination of whether to accept or deny the request based at least in part on one or more of the certificate score, the previous communication score, or the protocol score. The method also includes saving the weighted final score.


A third aspect of the invention concerns a computer-implemented method for identifying genuine user-merchant association. The method includes verifying that a telephone address by which a subscription request was submitted belongs to a telephone address carrier, to create a carrier association score. The method also includes analyzing source address information of at least one packet associated with the telephone address to create a source score. The method also includes sending to the telephone address a ping, wherein the ping enables the retrieval of identifying features of the telephone address, to create an identification score. The method also includes outputting a weighted final score comprising a determination of whether to accept or deny the request based at least in part on one or more of the carrier association score, the source score, or the identification score. The method also includes saving the weighted final score.


Advantages of these and other embodiments will become more apparent to those skilled in the art from the following description of the exemplary embodiments which have been shown and described by way of illustration. As will be realized, the present embodiments described herein may be capable of other and different embodiments, and their details are capable of modification in various respects. Accordingly, the drawings and description are to be regarded as illustrative in nature and not as restrictive.





BRIEF DESCRIPTION OF THE DRAWINGS

The Figures described below depict various aspects of systems and methods disclosed therein. It should be understood that each Figure depicts an embodiment of a particular aspect of the disclosed systems and methods, and that each of the Figures is intended to accord with a possible embodiment thereof. Further, wherever possible, the following description refers to the reference numerals included in the following Figures, in which features depicted in multiple Figures are designated with consistent reference numerals.



FIG. 1 illustrates, in schematic and block diagram form, an exemplary system including a fraud manager computing device for authentic user-merchant association and services according to the embodiments of the invention;



FIG. 2 illustrates various components of an exemplary fraud manager computing device shown in block schematic form that may be used with the system of FIG. 1;



FIG. 3 is a flowchart illustrating at least a portion of the steps for running an email check service program in accordance with embodiments of the present invention;



FIG. 4 is a flowchart illustrating at least a portion of the steps for running a mobile check service program in accordance with embodiments of the present invention; and



FIG. 5 is a flowchart illustrating at least a portion of the steps used for generating a score used in connection with determining whether to accept or deny a subscription service request in accordance with embodiments of the present invention.





The Figures depict exemplary embodiments for purposes of illustration only. One skilled in the art will readily recognize from the following discussion that alternative embodiments of the systems and methods illustrated herein may be employed without departing from the principles of the invention described herein.


DETAILED DESCRIPTION


FIG. 1 depicts an exemplary system for authentic user-merchant association and services according to embodiments of the invention. The system may include a plurality of fraud manager computing devices 10, disposable authentication clouds 12, users 14, services servers 16, databases 18, and communication links 20. The fraud manager(s) 10 may comprise computing devices configured to process input and output from the disposable authentication cloud 12, user 14, services server 16, and database 18. The user 14 may be an individual attempting to exhaust a trial membership to a subscription service granted by the services server 16. The user may interface with the disposable authentication cloud 12 to obtain a randomly generated phone number, email address, or other means of online identification. The services server 16 may include a plurality of servers configured to grant or deny access to a trial membership for services (e.g., online services). Such services may relate to ecommerce, ride sharing services, online gaming memberships, or the like. The database 18 may be accessed by the fraud manager 10 and may be configured to store and provide or expose data related to a plurality of attempts to access a subscription service in which previous user(s) were denied access (e.g., by the fraud manager 10).


The fraud managers 10 and the services servers 16 may be located within network boundaries of a large organization, such as a service provider. The disposable authentication cloud 12 may be external to the organization, for example where fraudulent phone numbers or email addresses are generated in connection with accessing subscription services.


The fraud managers 10 may generally include tablet computers, laptop computers, desktop computers, workstation computers, smart phones, smart watches, and the like. In addition, fraud managers 10 may include servers.


Turning to FIG. 2, each fraud manager 10 may respectively include a processing element 200 and a memory element 204. Each fraud manager 10 may also respectively include circuitry capable of wired and/or wireless communication with the disposable authentication cloud 12, users 14, services servers 16, databases 18, and/or an external network via, for example, a transceiver element 202 and communication link 20. Further, the fraud managers 10 may respectively include a software program configured with instructions for performing and/or enabling performance of at least some of the steps set forth herein. In an embodiment, the software comprises programs stored on computer-readable media of memory element 204.


The services server 16 may include a plurality of proxy servers, web servers, communications servers, routers, load balancers, and/or firewall servers, as are commonly known.


The transceiver element 202 generally allows communication between the fraud managers 10 on the one hand and the services servers 16, databases 18, users 14 and the disposable authentication cloud 12 on the other hand. The transceiver element 202 may include signal or data transmitting and receiving circuits, such as antennas, amplifiers, filters, mixers, oscillators, digital signal processors (DSPs), and the like. The transceiver element 202 may establish communication via the communication links 20 wirelessly by utilizing radio frequency (RF) signals and/or data that comply with communication standards such as cellular 2G, 3G, 4G or 5G, Institute of Electrical and Electronics Engineers (IEEE) 802.11 standard such as WiFi, IEEE 802.16 standard such as WiMAX, Bluetooth™, or combinations thereof. In addition, the transceiver element 202 may utilize communication standards such as ANT, ANT+, Bluetooth™ low energy (BLE), the industrial, scientific, and medical (ISM) band at 2.4 gigahertz (GHz), or the like. Alternatively, or in addition, the transceiver element 202 may establish communication through the communication links 20. The communication links 20 may include connectors or couplers that receive metal conductor wires or cables, like Cat 6 or coax cable, which are compatible with networking technologies such as ethernet. In certain embodiments, the communication links 20 may also include optical fiber cables. The transceiver element 202 may respectively be in communication with the processing element 200 and/or the memory element 204, via the communication links 20.


The communication links 20 may include the Internet, cellular communication networks, local area networks, metro area networks, wide area networks, cloud networks, plain old telephone service (POTS) networks, and the like, or combinations thereof. The links 20 may be wired, wireless, or combinations thereof and may include components such as modems, gateways, switches, routers, hubs, access points, repeaters, towers, and the like. The links 20 may enable communication between one or more of the fraud managers 10, disposable authentication cloud 12, users 14, services servers 16, and databases 18. The communication links 20 may include wires, such as electrical cables or fiber optic cables, or wirelessly, such as RF communication using wireless standards such as cellular 2G, 3G, 4G or 5G, Institute of Electrical and Electronics Engineers (IEEE) 802.11 standards such as WiFi, IEEE 802.16 standards such as WiMAX, Bluetooth™, or combinations thereof.


The memory element 204 may include electronic hardware data storage components such as read-only memory (ROM), programmable ROM, erasable programmable ROM, random-access memory (RAM) such as static RAM (SRAM) or dynamic RAM (DRAM), cache memory, hard disks, floppy disks, optical disks, flash memory, thumb drives, universal serial bus (USB) drives, or the like, or combinations thereof. In some embodiments, the memory element 204 may be embedded in, or packaged in the same package as, the processing element 200. The memory element 204 may include, or may constitute, a “computer-readable medium.” The memory element 204 may store the instructions, code, code segments, software, firmware, programs, applications, apps, services, daemons, or the like that are executed by the processing element 200. In an embodiment, the memory element 204 may respectively store the software applications/programs. The memory element 204 may also store settings, data, documents, sound files, photographs, movies, images, databases, and the like.


The processing element 200 may include electronic hardware components such as processors. The processing element 200 may include a digital processing unit. The processing element 200 may include microprocessors (single-core and multi-core), microcontrollers, digital signal processors (DSPs), field-programmable gate arrays (FPGAs), analog and/or digital application-specific integrated circuits (ASICs), or the like, or combinations thereof. The processing element 200 may generally execute, process, or run instructions, code, code segments, software, firmware, programs, applications, apps, processes, services, daemons, or the like. For instance, the processing element 200 may respectively execute the software applications/programs. The processing element 200 may also include hardware components such as finite-state machines, sequential and combinational logic, and other electronic circuits that can perform the functions necessary for the operation of the current invention. The processing element 200 may be in communication with the other electronic components through serial or parallel links that include universal busses, address busses, data busses, control lines, and the like.


Through hardware, software, firmware, or various combinations thereof, the processing element 200 may—alone or in combination with other processing elements—be configured to perform the operations of embodiments of the present invention. Specific embodiments of the technology will now be described in connection with the attached drawing figures. The embodiments are intended to describe aspects of the invention in sufficient detail to enable those skilled in the art to practice the invention. Other embodiments can be utilized, and changes can be made without departing from the scope of the present invention. The system may include additional, less, or alternate functionality and/or device(s), including those discussed elsewhere herein. The following detailed description is, therefore, not to be taken in a limiting sense. The scope of the present invention is defined only by the appended claims, along with the full scope of equivalents to which such claims are entitled.


Exemplary Method for Authentic User-Merchant Association and Services



FIGS. 3-5 depict block flow diagrams associated with exemplary computer-implemented method(s) for ensuring authentic user-merchant association and services. Some steps may be performed concurrently as opposed to sequentially and may in some cases be performed in a different order. In addition, some steps may be optional. The computer-implemented method(s) are described below, for ease of reference, as being executed by exemplary devices and components introduced with the embodiments illustrated in FIGS. 1 and 2. For example, the steps of the computer-implemented method(s) may be performed by the fraud managers 10, services servers 16, and databases 18 described above, at least in part through the utilization of processors, transceivers, hardware, software, firmware, or combinations thereof. In one or more embodiments, the steps set out below for a single fraud manager 10, services server 16, and database 18 are repeated in connection with the operation of a plurality of fraud managers 10, services servers 16, and databases 18 within the same general vicinity, at the same premises, or connected to a shared network. A person having ordinary skill will also appreciate that responsibility for all or some of such actions may be distributed differently among such devices or other computing devices without departing from the spirit of the present invention.


One or more computer-readable medium(s) may also be provided. The computer-readable medium(s) may include one or more executable programs, such as a controller program, stored thereon, wherein the program(s) instruct one or more processing elements to perform all or certain steps outlined herein. The program(s) stored on the computer-readable medium(s) may instruct the processing element(s) to perform additional, fewer, or alternative actions, including those discussed elsewhere herein.


Referring to FIG. 3, an email check service program may be executed to ensure authentic user-merchant association between a user and a subscription service. The email check service program may be stored and executed on a fraud manager computing device and may ensure an authentic user merchant association exists prior to the consumption of services provided by a subscription service. Likewise, the email check service program may detect fraudulent (non-authentic) user merchant association in order to deny a request for access to a subscription service, and/or may forward the request to a merchant (alone or in combination with a recommendation) such that the merchant may determine whether to accept or deny the request.


Steps 302-312 may be executed by or in connection with the email check service program. Step 302-306 may relate to primary parameters, and steps 308-312 may relate to secondary parameters. Referring more specifically to step 302, the email check service program conducts a domain validation via a network certificate. The email check service program may retrieve a network certificate from or in connection with a request for services and verify, either internally or via a third party, whether the network certificate is a valid network certificate and/or whether the network certificate has expired. The certificate may be an SSL/TSL certificate used in connection with an existing DNS. The DNS (domain name system) is the decentralized method to identify computers, services, and other resources reachable via the World Wide Web. The result(s) of step 302 may be taken into account by the email check service program. In one or more embodiments, the results of step 302 may be scored and weighted relative to other parameters of method 300 discussed in more detail below, e.g., at a weight of 20% relative to the other parameters. For example, a valid and unexpired network certificate from the request may be less indicative of fraud. In another example, an invalid or expired network certificate from the request may be more indicative of fraud.


Referring to step 304, the email check service program may conduct a communication formatting use check across multiple merchants and regions. Step 304 may include analyzing email headers and return paths of emails from an IP address associated with the request for services to determine whether the request deviated—for example, with respect to an expected pattern or one or more data elements—from prior requests created by the same IP address. The result(s) of step 304 may be taken into consideration by the email check service program. In one or more embodiments, the results of step 304 may be scored and weighted relative to other parameters of method 300 discussed in more detail elsewhere herein, e.g., at a weight of 20% relative to the other parameters. For example, consistently formatted headers and consistent return paths originating from the same IP address associated with a plurality of requests may be more indicative of fraud, with the indication of fraud increasing with the number of requests with such headers and return paths.


Referring to step 306, the email check service program may conduct a messaging protocol check. The messaging protocol check may include determining whether a server associated with the request is connected to the World Wide Web, determining whether a firewall is blocking communication from the associated server, determining whether the server associated with the request is allowing for the relaying of the particular domain used in requesting the service subscription, determining whether the server associated with the request is responding with an adequate hostname, and determining whether a connection to the server associated with the request works outside of the connection established with the email check service program. The result(s) of step 306 may be taken into consideration by the email check program. In one or more embodiments, the results of step 306 may be scored and weighted relative to other parameters of method 300 discussed in more detail elsewhere herein, e.g., at a weight of 20% relative to the other parameters. For example, a request passing the messaging protocol check may be less indicative of fraud. In another example, a request failing the messaging protocol check may be more indicative of fraud. As a request fails more of the aforementioned criteria listed in the messaging protocol check, the indication of fraud may also increase.


Referring to step 308, the email check service program may conduct host and domain greylisting. In connection with greylisting, the email check service program may temporarily reject an email from a sender that the email check service program does not recognize. If the email is legitimate, a server from which the email originated may attempt to send the email again after a sufficient delay.


In one or more embodiments, the actions in connection with greylisting may be conducted by a software application for describing, executing, and enabling the greylisting program sequences and communications, such as those used and transmitted, and made available under SPAMHAUS® (a registered trademark of the Spamhaus Project SLU), SPAMCO® (a registered trademark of Cisco Systems, Inc.), and URIBL® (a registered trademark of uribl.com) as of the date of initial filing of the present disclosure. One of ordinary skill will appreciate that the greylisting communication may be achieved according to other greylisting standards and technologies without departing from the spirit of the present invention. In one or more embodiments, the processing element 200 and communication element 202 may use signals corresponding to one or more greylisting standard(s) to process, route, connect, establish, or disconnect to and/or from other third-party devices when greylisting emails and requests.


The results of step 308 may be taken into consideration by the email check program. In one or more embodiments, the results of step 308 may be scored and weighted relative to other parameters of method 300 discussed in more detail elsewhere herein, e.g., at a weight of 20% relative to the other parameters. For example, a subsequent request may be more indicative of fraud if the subsequent request matches the format of a temporarily rejected request.


Referring to step 310, the email check service program may conduct an alias email check to determine whether an email address from which a request for access to the subscription service originated is registered as an alias email address for one or more other email addresses that have either exhausted the trial period of the subscription service, have been denied access to the subscription service, and/or have been blacklisted from the subscription service. The result of step 310 may be taken into consideration by the email check program. In one or more embodiments, the results of step 310 may be scored and weighted relative to other parameters of method 300 discussed in more detail elsewhere herein, e.g., at a weight of 10% relative to the other parameters. For example, a request is more indicative of fraud if the request is registered as an alias email address for the one or more email addresses that have either exhausted the trail period of the subscription service, have been denied access to the subscription service, and/or have been blacklisted from the subscription service.


Referring to step 312, the email check service program may conduct an email activity check. The email activity check may include determining the number of emails received in a pre-determined span of time immediately prior to receiving an email from the email address requesting access to the subscription service. The result of step 312 may be taken into consideration by the email check program. In one or more embodiments, the results of step 312 may be scored and weighted relative to other parameters of method 300 discussed in more detail elsewhere herein, e.g., at a weight of 10% relative to the other parameters. For example, a request may be more indicative of fraud if a higher volume of requests were received in the pre-determined span of time.


Referring to step 314, the email check service program may generate a weighted final score based at least in part on the results of steps 302-312. The weighted final score may be used to accept or deny the subscription service request, depending on, for example, a threshold of the corresponding merchant or service provider for accepting or denying requests. Also, or alternatively, the weighted final score may help the merchant or service decide whether the corresponding user is allowed to be associated with the subscription service in the future.


Referring to step 316, the email check service program may store any combination of scores or denials to a database, along with identifying features of the request (e.g., the email address, the user, and other identifying information). The database may store any score and denial among other scores and denials in the database such that the database may enable searches for all previous scores and denials during a future subscription service request from an unknown email address or otherwise utilize the data to inform similar determinations.


Referring to FIG. 4, a mobile check service program may be executed to ensure authentic user-merchant association between a user and a subscription service. The mobile check service program may be stored and executed on a fraud manager computing device and may ensure an authentic user merchant association exists prior to the consumption of services provided by a subscription service. Likewise, the mobile check service program may detect fraudulent (non-authentic) user merchant association in order to deny a request for subscription service use, and/or may forward the request to a merchant (alone or in combination with a recommendation and/or the results of steps 302-312 discussed above), such that the merchant may determine whether to accept or deny the request.


Steps 402-410 may be used in connection with the mobile check service program. Step 402-406 may relate to primary parameters, and steps 408-410 may relate to secondary parameters. Referring to step 402, the mobile check service program may conduct a voice over internet protocol (VOIP) telephone address verification. As part of the VOIP telephone address verification, the mobile check service program may identify telephone addresses commonly associated with a plurality of carriers to determine whether the telephone address requesting a subscription service is similar to the telephone addresses commonly associated with the plurality of carriers.


In one or more embodiments, the mobile check service program may run an API in connection with step 402. The API may include authentication measures and callouts used and transmitted in accordance with standards put forth by Vonage Holdings Corporation under the marks Vonage Communications API™ and VERIFY API™. One of ordinary skill will appreciate that the mobile number verification conducted by the API may be achieved according to other standards and technologies without departing from the spirit of the present invention. In one or more embodiments, the processing element 200 and communication element 202 may use signals corresponding to one or more mobile number verification standard(s) to process, route, connect, establish, or disconnect to and/or from other third-party devices when verifying mobile numbers. The result(s) of step 402 may be taken into consideration by the mobile check service program. In one or more embodiments, the results of step 402 may be weighted relative to other parameters of method 400 discussed in more detail elsewhere below, e.g., at a weight of 25% relative to the other parameters. For example, a telephone address found to be associated with a carrier may be less indicative of fraud. In another example, a telephone address found not to be associated with a carrier may be more indicative of fraud.


Referring to step 404, the mobile check service program may analyze packets associated with the VOIP telephone address for source IP address and validation of the IP address of the VOIP number for fraud association. The result of step 404 may be taken into consideration by the mobile check service program. In one or more embodiments, the results of step 404 may be weighted relative to other parameters of method 400 discussed in more detail elsewhere herein, e.g., at a weight of 20% relative to the other parameters. For example, packets from a request originating from a flagged IP address may be more indicative of fraud.


Referring to step 406, the mobile check service program may verify a caller ID associated with the telephone address requesting a subscription service. To verify the caller ID, the mobile check service program may send to the carrier network associated with the telephone address requesting a subscription service a ping in order to retrieve a calling name value. The calling name value may be named information tied to a telephone address and may display on devices that receive a call from the telephone address. Additionally, the calling name value may indicate a geographical location of the telephone address, and the carrier network associated with the telephone address. The sequences in connection with step 406 may include authentication measures and callouts used and transmitted in accordance with standards put forth by IPQualityScore LLC or Searchbug. One of ordinary skill will appreciate that the mobile number verification conducted by the API may be achieved according to other standards and technologies without departing from the spirit of the present invention. In one or more embodiments, the processing element 200 and communication element 202 may use signals corresponding to one or more telephone address verification standard(s) to process, route, connect, establish, or disconnect to and/or from other third-party devices when verifying telephone addresses. The result(s) of step 406 may be taken into consideration by the mobile check service program. In one or more embodiments, the results of step 406 may be weighted relative to other parameters of method 400 discussed in more detail elsewhere herein, e.g., at a weight of 25% relative to the other parameters. For example, a request with a calling name value outside of a geographical region approved for subscription services may be more indicative of fraud. In another example, a request with a calling name value including the name of a previously identified fraudulent user may be more indicative of fraud. In another example, a calling name value with a telephone address of a previously identified fraudulent user may be more indicative of fraud.


Referring to step 408, the mobile check service program may identify the carrier associated with the telephone address requesting a subscription service. To identify the carrier, the mobile check service program may call the telephone address for a predetermined duration of time. In one or more embodiments, audio from the mobile check service program to the telephone address may be muted. The mobile check service program may listen for and/or record, during the predetermined duration of time, audible feedback from the call. The result of step 408 may be taken into consideration by the mobile check service program. In one or more embodiments, the results of step 408 may be weighted relative to other parameters of method 400 discussed in more detail elsewhere herein, e.g., at a weight of 15% relative to the other parameters. For example, no feedback from the call may be more indicative of fraud. In another example, feedback from the call may be more indicative of fraud if the feedback does not include a standardized dial tone. In another example, feedback from the call may be more indicative of fraud if the feedback includes a message indicating that a verified user is not associated with the telephone address from which the request originates.


Referring to step 410, the mobile check service program may search for similar telephone addresses with slight variations from those either stored in the database or previously submitted to the subscription service in question. The result of step 410 may be taken into consideration by the mobile check service program. In one or more embodiments, the results of step 410 may be weighted relative to other parameters of method 400 discussed in more detail elsewhere herein, e.g., at a weight of 15% relative to the other parameters. For example, a telephone address is more indicative of fraud if the telephone address from which the request originates contains single-digit variations from those either stored in the database or previously submitted to the subscription service, with the indication of fraud decreasing with more variations of single digits.


Referring to step 412, the mobile check service program may generate a weighted final score based at least in part on the results of step 402-410. The weighted final score may be used to accept or deny the subscription service request depending on, for example, a threshold of the corresponding merchant or service provider for accepting or denying requests. Also, or alternatively, the weighted final score may help the merchant or service decide whether the corresponding user is allowed to be associated with the subscription service in the future.


Referring to step 414, the mobile check service program may store a denial to a database, along with identifying features of the request (e.g., the email address, the user, and other identifying information). The database may store the denial among other denials in the database such that the database may search for all previous denials during a future subscription service request from an unknown email address, or otherwise utilize the data to inform similar determinations.


Turning now to FIG. 5, an AI model may be used, executed and/or implemented by the fraud manager 10 noted above to generate a score, wherein the score may indicate whether a subscription service request should be accepted or denied. The score may include an aggregation of primary and secondary factors between an email check service program and/or a mobile check service program.


Referring to step 502, the AI model may inquire into whether the percentages of the primary factors are greater than 75%. If the percentages of the primary factors added together are greater than 75%, the AI model may immediately accept the subscription request in step 504 without further action.


Referring to step 506, the AI model may determine that the fraud manager computing device could not locate data for the primary factors, i.e., that all primary factor scores for the email check service program and/or the mobile check service program are unavailable. If the AI model finds that no data was found for the primary factors, the AI model may accept the request in step 504 if the secondary factors are greater than 80%, as determined pursuant to step 508. Alternatively, the AI model may, after step 506, determine that the fraud manager computing device could not locate data for the secondary factors in step 510. In that case, the AI model may instruct the merchant to make the final decision regarding the acceptance or denial of the subscription in step 512 (e.g., without the benefit of a recommendation or result from the AI model).


The preferred forms of the invention described above are to be used as illustrations only and should not be utilized in a limiting sense in interpreting the scope of the present invention. Obvious modifications to the exemplary embodiments, as hereinabove set forth, could be readily made by those skilled in the art without departing from the spirit of the present invention.


ADDITIONAL CONSIDERATIONS

In this description, references to “one embodiment”, “an embodiment”, or “embodiments” mean that the feature or features being referred to are included in at least one embodiment of the technology. Separate references to “one embodiment”, “an embodiment”, or “embodiments” in this description do not necessarily refer to the same embodiment and are also not mutually exclusive unless so stated and/or except as will be readily apparent to those skilled in the art from the description. For example, a feature, structure, act, etc. described in one embodiment may also be included in other embodiments but is not necessarily included. Thus, the current technology can include a variety of combinations and/or integrations of the embodiments described herein.


Throughout this specification, plural instances may implement components, operations, or structures described as a single instance. Although individual operations of one or more methods are illustrated and described as separate operations, one or more of the individual operations may be performed concurrently, and nothing requires that the operations be performed in the order illustrated. Structures and functionality presented as separate components in example configurations may be implemented as a combined structure or component. Similarly, structures and functionality presented as a single component may be implemented as separate components. These and other variations, modifications, additions, and improvements fall within the scope of the subject matter herein.


Certain embodiments are described herein as including logic or a number of routines, subroutines, applications, or instructions. These may constitute either software (e.g., code embodied on a machine-readable medium or in a transmission signal) or hardware. In hardware, the routines, etc., are tangible units capable of performing certain operations and may be configured or arranged in a certain manner. In example embodiments, one or more computer systems (e.g., a standalone, client or server computer system) or one or more hardware modules of a computer system (e.g., a processor or a group of processors) may be configured by software (e.g., an application or application portion) as computer hardware that operates to perform certain operations as described herein.


In various embodiments, computer hardware, such as a processing element, may be implemented as special purpose or as general purpose. For example, the processing element may comprise dedicated circuitry or logic that is permanently configured, such as an application-specific integrated circuit (ASIC), or indefinitely configured, such as an FPGA, to perform certain operations. The processing element may also comprise programmable logic or circuitry (e.g., as encompassed within a general-purpose processor or other programmable processor) that is temporarily configured by software to perform certain operations. It will be appreciated that the decision to implement the processing element as special purpose, in dedicated and permanently configured circuitry, or as general purpose (e.g., configured by software) may be driven by cost and time considerations.


Accordingly, the term “processing element” or equivalents should be understood to encompass a tangible entity, be that an entity that is physically constructed, permanently configured (e.g., hardwired), or temporarily configured (e.g., programmed) to operate in a certain manner or to perform certain operations described herein. Considering embodiments in which the processing element is temporarily configured (e.g., programmed), each of the processing elements need not be configured or instantiated at any one instance in time. For example, where the processing element comprises a general-purpose processor configured using software, the general-purpose processor may be configured as respective different processing elements at different times. Software may accordingly configure the processing element to constitute a particular hardware configuration at one instance of time and to constitute a different hardware configuration at a different instance of time.


Computer hardware components, such as transceiver elements, memory elements, processing elements, and the like, may provide information to, and receive information from, other computer hardware components. Accordingly, the described computer hardware components may be regarded as being communicatively coupled. Where multiple of such computer hardware components exist contemporaneously, communications may be achieved through signal transmission (e.g., over appropriate circuits and buses) that connect the computer hardware components. In embodiments in which multiple computer hardware components are configured or instantiated at different times, communications between such computer hardware components may be achieved, for example, through the storage and retrieval of information in memory structures to which the multiple computer hardware components have access. For example, one computer hardware component may perform an operation and store the output of that operation in a memory device to which it is communicatively coupled. A further computer hardware component may then, at a later time, access the memory device to retrieve and process the stored output. Computer hardware components may also initiate communications with input or output devices, and may operate on a resource (e.g., a collection of information).


The various operations of example methods described herein may be performed, at least partially, by one or more processing elements that are temporarily configured (e.g., by software) or permanently configured to perform the relevant operations. Whether temporarily or permanently configured, such processing elements may constitute processing element-implemented modules that operate to perform one or more operations or functions. The modules referred to herein may, in some example embodiments, comprise processing element-implemented modules.


Similarly, the methods or routines described herein may be at least partially processing element-implemented. For example, at least some of the operations of a method may be performed by one or more processing elements or processing element-implemented hardware modules. The performance of certain of the operations may be distributed among the one or more processing elements, not only residing within a single machine, but deployed across a number of machines. In some example embodiments, the processing elements may be located in a single location (e.g., within a home environment, an office environment or as a server farm), while in other embodiments the processing elements may be distributed across a number of locations.


Unless specifically stated otherwise, discussions herein using words such as “processing,” “computing,” “calculating,” “determining,” “presenting,” “displaying,” or the like may refer to actions or processes of a machine (e.g., a computer with a processing element and other computer hardware components) that manipulates or transforms data represented as physical (e.g., electronic, magnetic, or optical) quantities within one or more memories (e.g., volatile memory, non-volatile memory, or a combination thereof), registers, or other machine components that receive, store, transmit, or display information.


As used herein, the terms “comprises,” “comprising,” “includes,” “including,” “has,” “having” or any other variation thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, article, or apparatus that comprises a list of elements is not necessarily limited to only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Further, unless expressly stated to the contrary, “or” refers to an inclusive or and not to an exclusive or. For example, a condition A or B is satisfied by any one of the following: A is true (or present), and B is false (or not present), A is false (or not present), and B is true (or present), and both A and B are true (or present).


The patent claims at the end of this patent application are not intended to be construed under 35 U.S.C. § 112(f) unless traditional means-plus-function language is expressly recited, such as “means for” or “step for” language being explicitly recited in the claim(s).


Although the invention has been described with reference to the embodiments illustrated in the attached drawing figures, it is noted that equivalents may be employed and substitutions made herein without departing from the scope of the invention as recited in the claims.

Claims
  • 1. A system for identifying genuine user-merchant association, the system comprising one or more processors and/or transceivers individually or collectively programmed to: check the validity or expiration of a network certificate associated with a request to create a certificate score, the request being from a user and for access to a trial subscription service of a merchant;analyze previous communication from the user from which the request originates across a plurality of entities and regions to create a previous communication score, the analysis including a determination that multiple previous communications from the user embody a consistent header formatting and a common internet protocol (IP) address, the previous communication score reflecting higher fraud likelihood for consistent header formatting of the multiple previous communications from the common IP address, the consistency being indicative of attempted repeated fraudulent utilization of the trial subscription service;conduct a messaging protocol check for a server associated with the request to create a protocol score, the messaging protocol check including and the protocol score being based on one or more of the following factors—firewall of the server associated with the request, relay of a domain associated with the request by the server associated with the request, response with a hostname by the server associated with the request, or connection with the server associated with the request that is outside an established connection;temporarily reject an unrecognized request to create an unrecognized request score;output a weighted final score comprising a determination of whether to accept or deny the request based at least in part on the unrecognized request score and on one or more of the certificate score, the previous communication score, and the protocol score, the weighted final score incorporating a weighting toward denying the request based on the determination of the consistent header formatting and the common IP address; andbased on the determination of whether to accept or deny the request, generate a corresponding recommendation to the merchant to accept or deny the request from the user.
  • 2. The system of claim 1, the one or more processors and/or transceivers being further individually or collectively programmed to determine whether an identity from which the request originates is not associated with a plurality of previously rejected requests to create a previous rejection score, wherein the weighted final score is further based at least in part on the previous rejection score.
  • 3. The system of claim 1, the one or more processors and/or transceivers being further individually or collectively programmed to determine, within a preset period of time, activity performed on the account from which the request originates to create an activity score, wherein the weighted final score is further based at least in part on the activity score.
  • 4. The system of claim 1, wherein the system— accepts the request if the weighted final score of the request is within a threshold of weighted final scores the merchant has configured to accept the request, ordenies the request if the weighted final score of the request is outside a threshold of weighted final scores the merchant has configured to accept the request.
  • 5. The system of claim 1, the one or more processors and/or transceivers being further individually or collectively programmed to pass the decision to accept or deny the request to the merchant.
  • 6. The system of claim 1, wherein the weighted final score is saved in a manner suited for retrieval and use in analyzing a plurality of future requests.
  • 7. A computer-implemented method for identifying genuine user-merchant association, the method comprising: checking the validity or expiration of a network certificate associated with a request to create a certificate score, the request being from a user and for access to a trial subscription service of a merchant;analyzing previous communication from the user from which the request originates across a plurality of entities and regions to create a previous communication score, the analysis including a determination that multiple previous communications from the user embody a consistent header formatting and a common internet protocol (IP) address, the previous communication score reflecting higher fraud likelihood for consistent header formatting of the multiple previous communications from the common IP address, the consistency being indicative of attempted repeated fraudulent utilization of the trial subscription service;conducting a messaging protocol check for a server associated with the request to create a protocol score, the messaging protocol check including and the protocol score being based on one or more of the following factors—firewall of the server associated with the request, relay of a domain associated with the request by the server associated with the request, response with a hostname by the server associated with the request, or connection with the server associated with the request that is outside an established connection;temporarily rejecting an unrecognized request to create an unrecognized request score;outputting a weighted final score comprising a determination of whether to accept or deny the request based at least in part on the unrecognized request score and on one or more of the certificate score, the previous communication score, and the protocol score, the weighted final score incorporating a weighting toward denying the request based on the determination of the consistent header formatting and the common IP address; andbased on the determination of whether to accept or deny the request, generate a corresponding recommendation to the merchant to accept or deny the request from the user.
  • 8. The computer-implemented method of claim 7, the method further comprising temporarily rejecting an unrecognized request to create an unrecognized request score, wherein the weighted final score is further based at least in part on the unrecognized request score.
  • 9. The computer-implemented method of claim 8, wherein after temporarily rejecting the unrecognized request, the method allows for the reception of the unrecognized request after a sufficient delay.
  • 10. The computer-implemented method of claim 7, the method further comprising determining whether an identity from which the request originates is not associated with a plurality of previously rejected requests to create a previous rejection score, wherein the weighted final score is further based at least in part on the previous rejection score.
  • 11. The computer-implemented method of claim 7, the method further comprising determining, within a preset period of time, activity performed on the account from which the request originates to create an activity score, wherein the weighted final score is further based at least in part on the activity score.
  • 12. The computer-implemented method of claim 7, the method further comprising accessing the weighted final score for a plurality of future requests, such that the method can more easily identify genuine user-merchant association.
  • 13. Non-transitory computer-readable storage media having computer-executable instructions for identifying genuine user-merchant association stored thereon, wherein when executed by at least one processor the computer-executable instructions cause the at least one processor to: check the validity or expiration of a network certificate associated with a request to create a certificate score, the request being from a user and for access to a trial subscription service of a merchant;analyze previous communication from the user from which the request originates across a plurality of entities and regions to create a previous communication score, the analysis including a determination that multiple previous communications from the user embody a consistent header formatting and a common internet protocol (IP) address, the previous communication score reflecting higher fraud likelihood for consistent header formatting of the multiple previous communications from the common IP address, the consistency being indicative of attempted repeated fraudulent utilization of the trial subscription service;conduct a messaging protocol check for a server associated with the request to create a protocol score, the messaging protocol check including and the protocol score being based on one or more of the following factors—firewall of the server associated with the request, relay of a domain associated with the request by the server associated with the request, response with a hostname by the server associated with the request, or connection with the server associated with the request that is outside an established connection;temporarily reject an unrecognized request to create an unrecognized request score;output a weighted final score comprising a determination of whether to accept or deny the request based at least in part on the unrecognized request score and on one or more of the certificate score, the previous communication score, and the protocol score, the weighted final score incorporating a weighting toward denying the request based on the determination of the consistent header formatting and the common IP address; andbased on the determination of whether to accept or deny the request, generate a corresponding recommendation to the merchant to accept or deny the request from the user.
  • 14. The non-transitory computer-readable storage media of claim 13, wherein when executed by the at least one processor the computer-executable instructions cause the at least one processor to determine whether an identity from which the request originates is not associated with a plurality of previously rejected requests to create a previous rejection score, wherein the weighted final score is further based at least in part on the previous rejection score.
  • 15. The non-transitory computer-readable storage media of claim 13, wherein when executed by the at least one processor the computer-executable instructions cause the at least one processor to determine, within a preset period of time, activity performed on the account from which the request originates to create an activity score, wherein the weighted final score is further based at least in part on the activity score.
  • 16. The non-transitory computer-readable storage media of claim 13, wherein when executed by the at least one processor the computer-executable instructions cause the at least one processor— accept the request if the weighted final score of the request is within a threshold of weighted final scores the merchant has configured to accept the request, ordeny the request if the weighted final score of the request is outside a threshold of weighted final scores the merchant has configured to accept the request.
  • 17. The non-transitory computer-readable storage media of claim 13, wherein when executed by the at least one processor the computer-executable instructions cause the at least one processor to pass the decision to accept or deny the request to the merchant.
  • 18. The non-transitory computer-readable storage media of claim 13, wherein the weighted final score is saved in a manner suited for retrieval and use in analyzing a plurality of future requests.
US Referenced Citations (807)
Number Name Date Kind
4093276 Debe Jun 1978 A
4205852 Wayman Jun 1980 A
4299578 Wayman Nov 1981 A
4306724 Brzezinski Dec 1981 A
5143378 Joel Sep 1992 A
5215309 Joel Jun 1993 A
6058484 Chapman May 2000 A
6119103 Basch Sep 2000 A
6311214 Rhoads Oct 2001 B1
6418436 Degen Jul 2002 B1
6473794 Guheen Oct 2002 B1
6536037 Guheen Mar 2003 B1
6606744 Mikurak Aug 2003 B1
6615166 Guheen Sep 2003 B1
6650761 Rodriguez Nov 2003 B1
6671818 Mikurak Dec 2003 B1
6721713 Guheen Apr 2004 B1
6751734 Uchida Jun 2004 B1
6835135 Silverbrook Dec 2004 B1
6850252 Hoffberg Feb 2005 B1
6941285 Sarcanin Sep 2005 B2
6957186 Guheen Oct 2005 B1
7031945 Donner Apr 2006 B1
7124101 Mikurak Oct 2006 B1
7165041 Guheen Jan 2007 B1
7216109 Donner May 2007 B1
7315826 Guheen Jan 2008 B1
7337119 Geschwender Feb 2008 B1
7386517 Donner Jun 2008 B1
7617136 Lessing Nov 2009 B1
7716077 Mikurak May 2010 B1
7959074 Chopra Jun 2011 B1
8020763 Kowalchyk Sep 2011 B1
8027930 Smith Sep 2011 B2
8032409 Mikurak Oct 2011 B1
8050983 Eakin Nov 2011 B1
8086533 Maglaque Dec 2011 B1
8121874 Guheen Feb 2012 B1
8234494 Bansal Jul 2012 B1
8297501 Kowalchyk Oct 2012 B1
8327131 Hardjono Dec 2012 B1
8346672 Weiner Jan 2013 B1
8370313 Snow Feb 2013 B2
8380709 Diller Feb 2013 B1
8504309 Spoor Aug 2013 B1
8639629 Hoffman Jan 2014 B1
8768838 Hoffman Jul 2014 B1
8788407 Singh Jul 2014 B1
8965796 Gala Feb 2015 B1
8984640 Emigh Mar 2015 B1
9037499 Singhal May 2015 B2
9189788 Robinson Nov 2015 B1
9246923 Terribilini Jan 2016 B1
9342831 Davis May 2016 B1
9367844 Hu Jun 2016 B1
9547870 Bradford Jan 2017 B1
9875347 Baghdasaryan Jan 2018 B2
9888037 Sharifi Mehr Feb 2018 B1
9898739 Monastyrsky Feb 2018 B2
9912486 Sharifi Mehr Mar 2018 B1
9961077 Lindemann May 2018 B2
9978067 Sadaghiani May 2018 B1
10007900 Royyuru Jun 2018 B2
10169746 Atwal Jan 2019 B2
10282533 Lindemann May 2019 B2
10282728 Avegliano May 2019 B2
10334062 Benson Jun 2019 B2
10380703 Chrapko Aug 2019 B2
10410220 Miltonberger Sep 2019 B2
10438176 Johnson Oct 2019 B2
10438202 Neighman Oct 2019 B2
10438205 Van Os Oct 2019 B2
10447682 Du Lac Oct 2019 B1
10453011 Briggs Oct 2019 B1
10454689 Sharifi Mehr Oct 2019 B1
10467122 Doyle Nov 2019 B1
10469504 Dandekar Nov 2019 B1
10475025 Zarakas Nov 2019 B2
10510057 Priebatsch Dec 2019 B2
10567402 Comeaux Feb 2020 B1
10586227 Makhdumi Mar 2020 B2
10592882 Viswanath Mar 2020 B1
10628827 Gailloux Apr 2020 B1
10636019 Abrons Apr 2020 B1
10650332 Sinha May 2020 B1
10652030 Levy May 2020 B1
10708256 Kane-Parry Jul 2020 B1
10726440 Bradford Jul 2020 B1
10755273 Groarke Aug 2020 B2
10769635 Lindemann Sep 2020 B2
10789594 Moshir Sep 2020 B2
10796294 Van Os Oct 2020 B2
10796363 Kim Oct 2020 B1
10810290 Minter Oct 2020 B2
10825012 Senci Nov 2020 B1
10853895 O'Neal Dec 2020 B1
10902705 Rose Jan 2021 B1
10949918 Fidanza Mar 2021 B2
10956916 Abreu Mar 2021 B1
11037129 Chen Jun 2021 B1
11063745 Du Jul 2021 B1
11068898 Allen Jul 2021 B2
11089160 Chen Aug 2021 B1
11113665 Rose Sep 2021 B1
11113712 Hoque Sep 2021 B2
11132686 Nightengale Sep 2021 B2
11138657 Boeder Oct 2021 B1
11139955 So Oct 2021 B1
11144957 Raak Oct 2021 B1
11151279 Townsend, III Oct 2021 B1
11164163 Viidu Nov 2021 B1
11170120 Sampemane Nov 2021 B1
11170323 Lowe Nov 2021 B2
11170377 Green Nov 2021 B2
11176533 Maxwell Nov 2021 B2
11176556 Song Nov 2021 B2
11221744 Van Os Jan 2022 B2
11227325 Baral Jan 2022 B1
11257049 Durazo Almeida Feb 2022 B1
11257073 Padmanabhan Feb 2022 B2
11257123 Bebawy Feb 2022 B1
11263603 Dhodapkar Mar 2022 B1
11269627 Kim Mar 2022 B1
11270312 Jass Mar 2022 B1
11277437 Burgis Mar 2022 B1
11282087 Henderson Mar 2022 B2
11288280 Padmanabhan Mar 2022 B2
11288669 Kim Mar 2022 B1
11314998 Sanderson Apr 2022 B1
11315193 Kim Apr 2022 B1
11321709 Kolchin May 2022 B1
11321718 Narendranathan May 2022 B1
11321726 Pandhi May 2022 B1
11328309 Sahibzada May 2022 B1
11334883 Auerbach May 2022 B1
11341523 Jacoby May 2022 B1
11354668 Senci Jun 2022 B2
11423373 Book Aug 2022 B1
11436068 Naidu Sep 2022 B2
11436603 Roche Sep 2022 B2
11449844 Harris Sep 2022 B1
11449922 Chacko Sep 2022 B2
11456882 Kravitz Sep 2022 B2
11461815 Durairaj Oct 2022 B1
11470074 Lacey Oct 2022 B2
11475489 Schwarz, Jr. Oct 2022 B1
11522700 Auerbach Dec 2022 B1
11526934 Rostami Dec 2022 B2
11545245 Dubey Jan 2023 B1
11564266 Kahn Jan 2023 B1
11567852 Tatum Jan 2023 B1
11593743 Makhija Feb 2023 B2
11610204 Osterkamp Mar 2023 B1
11610207 Chowdhury Mar 2023 B1
11657399 Sahni May 2023 B1
11663675 Estes May 2023 B1
11676154 Bungert Jun 2023 B2
11676195 Erickson Jun 2023 B1
11741401 Cella Aug 2023 B2
11748720 Miller Sep 2023 B2
11775977 Kruse Oct 2023 B1
11797961 Chen Oct 2023 B2
11803849 Lawrence Oct 2023 B1
11823162 Mayers Nov 2023 B2
11823195 Hayes, Jr. Nov 2023 B2
11830011 Banipal Nov 2023 B2
11847623 Bowers Dec 2023 B1
11868975 Chapman Jan 2024 B1
11868995 Lindemann Jan 2024 B2
11869006 Rahimi Jan 2024 B1
11875349 Gosset Jan 2024 B2
11875400 Padmanabhan Jan 2024 B2
11876910 Padmanabhan Jan 2024 B2
11899817 Padmanabhan Feb 2024 B2
11900455 Lawrence Feb 2024 B1
11909860 So Feb 2024 B1
11922495 Hernandez Mar 2024 B1
11979521 Steckel May 2024 B2
12002055 Miller Jun 2024 B1
20010018660 Sehr Aug 2001 A1
20020034721 McManus Mar 2002 A1
20020038291 Petersen Mar 2002 A1
20020052782 Landesmann May 2002 A1
20020056050 Heiden May 2002 A1
20020082067 Mckay Jun 2002 A1
20020099649 Lee Jul 2002 A1
20020120846 Stewart Aug 2002 A1
20020143692 Heimermann Oct 2002 A1
20030003434 Gruber Jan 2003 A1
20030040957 Rodriguez Feb 2003 A1
20030077558 Wood Apr 2003 A1
20030104867 Kobayashi Jun 2003 A1
20030154406 Honarvar Aug 2003 A1
20030175677 Kuntz Sep 2003 A1
20040033834 Silverbrook Feb 2004 A1
20040064351 Mikurak Apr 2004 A1
20040122747 Jimenez Jun 2004 A1
20040128514 Rhoads Jul 2004 A1
20040138975 Engel Jul 2004 A1
20040150662 Beigel Aug 2004 A1
20040159212 Terada Aug 2004 A1
20040181665 Houser Sep 2004 A1
20050013462 Rhoads Jan 2005 A1
20050037326 Kuntz Feb 2005 A1
20050096143 Anton May 2005 A1
20050111047 Rhoads May 2005 A1
20050133588 Williams Jun 2005 A1
20050137975 Williams Jun 2005 A1
20050149438 Williams Jul 2005 A1
20050177442 Sullivan Aug 2005 A1
20060015722 Rowan Jan 2006 A1
20060069697 Shraim Mar 2006 A1
20060157559 Levy Jul 2006 A1
20060161435 Atef Jul 2006 A1
20060178918 Mikurak Aug 2006 A1
20060178984 Anderson Aug 2006 A1
20060246901 Sivakumar Nov 2006 A1
20060282309 Zhang Dec 2006 A1
20060282660 Varghese Dec 2006 A1
20070011032 Bregante Jan 2007 A1
20070038568 Greene Feb 2007 A1
20070061393 Moore Mar 2007 A1
20070105084 Kuntz May 2007 A1
20070106754 Moore May 2007 A1
20070143629 Hardjono Jun 2007 A1
20070168461 Moore Jul 2007 A1
20070169182 Wolfond Jul 2007 A1
20070174082 Singh Jul 2007 A1
20070196803 Goodrich Aug 2007 A1
20070265095 Jonishi Nov 2007 A1
20070288380 Starrs Dec 2007 A1
20080040151 Moore Feb 2008 A1
20080060210 Trout Mar 2008 A1
20080082662 Dandliker Apr 2008 A1
20080109473 Dixon May 2008 A1
20080125229 Jonishi May 2008 A1
20080147630 Chu Jun 2008 A1
20080168274 Natanzon Jul 2008 A1
20080189164 Wiseman Aug 2008 A1
20080208760 Keithley Aug 2008 A1
20080238610 Rosenberg Oct 2008 A1
20080288324 Graczynski Nov 2008 A1
20080288405 John Nov 2008 A1
20080306839 Starrs Dec 2008 A1
20080319804 Pulnikova Dec 2008 A1
20090024663 McGovern Jan 2009 A1
20090089860 Forrester Apr 2009 A1
20090089869 Varghese Apr 2009 A1
20090093300 Lutnick Apr 2009 A1
20090106557 Leonard Apr 2009 A1
20090132689 Zaltzman May 2009 A1
20090132813 Schibuk May 2009 A1
20090171756 De Zilwa Jul 2009 A1
20090222379 Choudhuri Sep 2009 A1
20090234711 Ramer Sep 2009 A1
20090240568 Ramer Sep 2009 A1
20090254499 Deyo Oct 2009 A1
20090254971 Herz Oct 2009 A1
20090278841 Hamilton, II Nov 2009 A1
20090281743 Hamilton, II Nov 2009 A1
20100030578 Siddique Feb 2010 A1
20100031347 Ohto Feb 2010 A1
20100048302 Lutnick Feb 2010 A1
20100063877 Soroca Mar 2010 A1
20100076994 Soroca Mar 2010 A1
20100094878 Soroca Apr 2010 A1
20100125470 Chisholm May 2010 A1
20100125523 Solomon May 2010 A1
20100145777 Ghosh Jun 2010 A1
20100153185 Ghosh Jun 2010 A1
20100153329 Ghosh Jun 2010 A1
20100153404 Ghosh Jun 2010 A1
20100165887 Ristock Jul 2010 A1
20100169192 Zoldi Jul 2010 A1
20100169265 Ristock Jul 2010 A1
20100169430 Ristock Jul 2010 A1
20100169499 Ristock Jul 2010 A1
20100169641 Ristock Jul 2010 A1
20100228652 Koraichi Sep 2010 A1
20100274720 Carlson Oct 2010 A1
20100303211 Hartig Dec 2010 A1
20110055100 Perreault Mar 2011 A1
20110065490 Lutnick Mar 2011 A1
20110091845 Dorschner Apr 2011 A1
20110111856 White May 2011 A1
20110131131 Griffin Jun 2011 A1
20110238575 Nightengale Sep 2011 A1
20110258049 Ramer Oct 2011 A1
20110258118 Ciurea Oct 2011 A1
20110275432 Lutnick Nov 2011 A1
20110302011 Yoder Dec 2011 A1
20120023567 Hammad Jan 2012 A1
20120041880 Shai Feb 2012 A1
20120077174 DePaul Mar 2012 A1
20120078699 Carlson Mar 2012 A1
20120089617 Frey Apr 2012 A1
20120096516 Sobel Apr 2012 A1
20120136793 Valin May 2012 A1
20120173367 Soroca Jul 2012 A1
20120173370 Soroca Jul 2012 A1
20120173373 Soroca Jul 2012 A1
20120173379 Soroca Jul 2012 A1
20120179563 Soroca Jul 2012 A1
20120179564 Soroca Jul 2012 A1
20120179567 Soroca Jul 2012 A1
20120190386 Anderson Jul 2012 A1
20120197711 Zhou Aug 2012 A1
20120227109 Dimuro Sep 2012 A1
20120254092 Malov Oct 2012 A1
20120254243 Zeppenfeld Oct 2012 A1
20120264101 Krohner Oct 2012 A1
20120296455 Ohnemus Nov 2012 A1
20120303425 Katzin Nov 2012 A1
20120310831 Harris Dec 2012 A1
20120310838 Harris Dec 2012 A1
20130054334 Ross Feb 2013 A1
20130055097 Soroca Feb 2013 A1
20130102372 Lutnick Apr 2013 A1
20130110722 Boding May 2013 A1
20130116032 Lutnick May 2013 A1
20130124417 Spears May 2013 A1
20130144785 Karpenko Jun 2013 A1
20130185354 Seligstein Jul 2013 A1
20130191213 Beck Jul 2013 A1
20130197991 Basu Aug 2013 A1
20130211858 Ohnemus Aug 2013 A1
20130215116 Siddique Aug 2013 A1
20130218765 Hammad Aug 2013 A1
20130246300 Fischer Sep 2013 A1
20130268536 Nachiappan Oct 2013 A1
20130275308 Paraskeva Oct 2013 A1
20130282819 Mehta Oct 2013 A1
20130291060 Moore Oct 2013 A1
20130332361 Ciurea Dec 2013 A1
20130332362 Ciurea Dec 2013 A1
20140079297 Tadayon Mar 2014 A1
20140080148 Spanholtz Mar 2014 A1
20140101146 Scriffignano Apr 2014 A1
20140135592 Ohnemus May 2014 A1
20140143133 Benson May 2014 A1
20140156996 Heppe Jun 2014 A1
20140170177 Zuniga Jun 2014 A1
20140172706 Condry Jun 2014 A1
20140180826 Boal Jun 2014 A1
20140188752 White Jul 2014 A1
20140201126 Zadeh Jul 2014 A1
20140236713 Gotanda Aug 2014 A1
20140237582 Niemela Aug 2014 A1
20140279513 Dodds-Brown Sep 2014 A1
20140282977 Madhu Sep 2014 A1
20140283054 Janjua Sep 2014 A1
20140283065 Teddy Sep 2014 A1
20140283066 Teddy Sep 2014 A1
20140289853 Teddy Sep 2014 A1
20140304059 Wang Oct 2014 A1
20140304148 Flanagan Oct 2014 A1
20140304505 Dawson Oct 2014 A1
20140337089 Tavares Nov 2014 A1
20140337171 Sivashanmugam Nov 2014 A1
20140351137 Chisholm Nov 2014 A1
20140373093 Wood Dec 2014 A1
20150046216 Adjaoute Feb 2015 A1
20150046224 Adjaoute Feb 2015 A1
20150066771 Adjaoute Mar 2015 A1
20150073907 Purves Mar 2015 A1
20150073989 Green Mar 2015 A1
20150074390 Stoback Mar 2015 A1
20150074407 Palmeri Mar 2015 A1
20150086946 Mandina Mar 2015 A1
20150095990 Ranganathan Apr 2015 A1
20150106265 Stubblefield Apr 2015 A1
20150134528 Fineman May 2015 A1
20150150107 Piliouras May 2015 A1
20150213449 Morrison Jul 2015 A1
20150213460 Anderson Jul 2015 A1
20150220835 Wilson Aug 2015 A1
20150220836 Wilson Aug 2015 A1
20150220929 Monk Aug 2015 A1
20150221055 Comanescu Aug 2015 A1
20150229666 Foster Aug 2015 A1
20150242601 Griffiths Aug 2015 A1
20150242605 Du Aug 2015 A1
20150249677 Tucker Sep 2015 A1
20150254672 Huesch Sep 2015 A1
20150262189 Vergeer Sep 2015 A1
20150269433 Amtrup Sep 2015 A1
20150310510 Kelly Oct 2015 A1
20150332304 Wright Nov 2015 A1
20150347734 Beigi Dec 2015 A1
20150365436 Shenefiel Dec 2015 A1
20160004820 Moore Jan 2016 A1
20160036593 Saboori Feb 2016 A1
20160048937 Mathura Feb 2016 A1
20160050203 Hefetz Feb 2016 A1
20160070704 Yu Mar 2016 A1
20160078247 Tucker Mar 2016 A1
20160078444 Tomasofsky Mar 2016 A1
20160086184 Carpenter Mar 2016 A1
20160092879 Lasersohn Mar 2016 A1
20160104132 Abbatiello Apr 2016 A1
20160104133 Davis Apr 2016 A1
20160104159 Butterfield Apr 2016 A1
20160104387 Bakker Apr 2016 A1
20160117670 Davis Apr 2016 A1
20160125306 Jihn May 2016 A1
20160140439 Adderly May 2016 A1
20160140445 Adderly May 2016 A1
20160140446 Adderly May 2016 A1
20160140453 Adderly May 2016 A1
20160140561 Cowan May 2016 A1
20160140858 Adderly May 2016 A1
20160147875 Adderly May 2016 A1
20160148093 Adderly May 2016 A1
20160149900 Justin May 2016 A1
20160180084 Spurlock Jun 2016 A1
20160180325 Davis Jun 2016 A1
20160196558 Mercille Jul 2016 A1
20160203490 Gupta Jul 2016 A1
20160203491 Ranganathan Jul 2016 A1
20160210602 Siddique Jul 2016 A1
20160217486 Waters Jul 2016 A1
20160219079 Justin Jul 2016 A1
20160225278 Leddy Aug 2016 A1
20160267447 Davis Sep 2016 A1
20160271501 Balsbaugh Sep 2016 A1
20160275503 George Sep 2016 A1
20160275518 Bowles Sep 2016 A1
20160277192 Kaliski, Jr. Sep 2016 A1
20160277193 Sabin Sep 2016 A1
20160292745 Jayanthi Oct 2016 A1
20160294846 Sharov Oct 2016 A1
20160330236 Reddy Nov 2016 A1
20160335551 Droll Nov 2016 A1
20160344544 Biesinger Nov 2016 A1
20160364678 Cao Dec 2016 A1
20160364679 Cao Dec 2016 A1
20160364812 Cao Dec 2016 A1
20160364823 Cao Dec 2016 A1
20160371685 Smith Dec 2016 A1
20160373433 Rivers Dec 2016 A1
20170005805 Wang Jan 2017 A1
20170012967 Holloway Jan 2017 A1
20170017800 Comanescu Jan 2017 A1
20170032374 Doddamani Feb 2017 A1
20170061129 Bektchiev Mar 2017 A1
20170069215 Borofsky Mar 2017 A1
20170083881 Sardela Bianchi Mar 2017 A1
20170083953 Arora Mar 2017 A1
20170083985 Lacoss-Arnold Mar 2017 A1
20170098219 Peram Apr 2017 A1
20170109818 Amtrup Apr 2017 A1
20170116611 Dhar Apr 2017 A1
20170124570 Nidamanuri May 2017 A1
20170134173 Kern May 2017 A1
20170154336 Marshall Jun 2017 A1
20170171230 Leiderfarb Jun 2017 A1
20170178093 Bull Jun 2017 A1
20170178124 Havilio Jun 2017 A1
20170178135 Bull Jun 2017 A1
20170193506 Karnati Jul 2017 A1
20170195125 Heppe Jul 2017 A1
20170200015 Gonzalez Jul 2017 A1
20170206557 Abrol Jul 2017 A1
20170232300 Tran Aug 2017 A1
20170253067 Nelson Sep 2017 A1
20170262842 Subbarayan Sep 2017 A1
20170308702 Liu Oct 2017 A1
20170353482 Sommer Dec 2017 A1
20180032997 Gordon Feb 2018 A1
20180039990 Lindemann Feb 2018 A1
20180040064 Grigg Feb 2018 A1
20180053114 Adjaoute Feb 2018 A1
20180060981 Sher Mar 2018 A1
20180078843 Tran Mar 2018 A1
20180096329 Hamilton Apr 2018 A1
20180096330 Hamilton Apr 2018 A1
20180117446 Tran May 2018 A1
20180117447 Tran May 2018 A1
20180158062 Kohli Jun 2018 A1
20180174137 Subbarayan Jun 2018 A1
20180174138 Subbarayan Jun 2018 A1
20180191750 Moradi Jul 2018 A1
20180204111 Zadeh Jul 2018 A1
20180232820 Kohli Aug 2018 A1
20180247312 Loganathan Aug 2018 A1
20180253730 Vohra Sep 2018 A1
20180264347 Tran Sep 2018 A1
20180268387 Bradley Sep 2018 A1
20180295518 Alloche Oct 2018 A1
20180315051 Hurley Nov 2018 A1
20180322597 Sher Nov 2018 A1
20180330814 Auer Nov 2018 A1
20180365666 Kakino Dec 2018 A1
20190007381 Isaacson Jan 2019 A1
20190018968 Ronca Jan 2019 A1
20190020635 Selway Jan 2019 A1
20190074081 Easton Mar 2019 A1
20190095924 Adjaoute Mar 2019 A1
20190130407 Adjaoute May 2019 A1
20190132308 Graham May 2019 A1
20190140847 Piel May 2019 A1
20190143527 Favis May 2019 A1
20190147431 Galebach May 2019 A1
20190164156 Lindemann May 2019 A1
20190197616 Dogin Jun 2019 A1
20190205887 Kimmel Jul 2019 A1
20190213585 Patni Jul 2019 A1
20190213658 Bhattacherjee Jul 2019 A1
20190220863 Novick Jul 2019 A1
20190230070 Isaacson Jul 2019 A1
20190236594 Ehrlich-Quinn Aug 2019 A1
20190251589 VanFleet Aug 2019 A1
20190259108 Bongartz Aug 2019 A1
20190279218 Adjaoute Sep 2019 A1
20190281036 Eisen Sep 2019 A1
20190287116 Karantzis Sep 2019 A1
20190306082 Horvath Oct 2019 A1
20190306137 Isaacson Oct 2019 A1
20190318358 Chamberlain Oct 2019 A1
20190331655 Jahns Oct 2019 A1
20190332637 Yoo Oct 2019 A1
20190361917 Tran Nov 2019 A1
20190370813 Bravick Dec 2019 A1
20190379642 Simons Dec 2019 A1
20190384932 Pratt Dec 2019 A1
20190385170 Arrabothu Dec 2019 A1
20190386986 O'Brien Dec 2019 A1
20190392457 Kuntagod Dec 2019 A1
20190392489 Tietzen Dec 2019 A1
20200027089 Kuchar Jan 2020 A1
20200044851 Everson Feb 2020 A1
20200052908 Thitron Feb 2020 A1
20200067944 Dave Feb 2020 A1
20200082484 Cho Mar 2020 A1
20200097817 Harris Mar 2020 A1
20200104852 Douglas, Jr. Apr 2020 A1
20200118131 Diriye Apr 2020 A1
20200120107 McGrew Apr 2020 A1
20200134143 Deole Apr 2020 A1
20200137221 DelloStritto Apr 2020 A1
20200151707 Mohamed May 2020 A1
20200153821 Cao May 2020 A1
20200162491 Correa Bahnsen May 2020 A1
20200175516 Trim Jun 2020 A1
20200184153 Bongartz Jun 2020 A1
20200184278 Zadeh Jun 2020 A1
20200184480 Wang Jun 2020 A1
20200184556 Cella Jun 2020 A1
20200193168 Zhao Jun 2020 A1
20200211075 Kumar Jul 2020 A1
20200225655 Cella Jul 2020 A1
20200226285 Bulleit Jul 2020 A1
20200244716 Mehta Jul 2020 A1
20200258181 Song Aug 2020 A1
20200265416 Tomasofsky Aug 2020 A1
20200265514 Suzuki Aug 2020 A1
20200273040 Novick Aug 2020 A1
20200285768 Hodges, Sr. Sep 2020 A1
20200287888 Moore Sep 2020 A1
20200288315 Hanley Sep 2020 A1
20200294128 Cella Sep 2020 A1
20200302496 Todd Sep 2020 A1
20200311736 Song Oct 2020 A1
20200327546 Pennington Oct 2020 A1
20200334685 Yan Oct 2020 A1
20200342411 Yakubenkov Oct 2020 A1
20200342461 Quentin Oct 2020 A1
20200348662 Cella Nov 2020 A1
20200357080 Bogaard Nov 2020 A1
20200358619 Ding Nov 2020 A1
20200364322 Guo Nov 2020 A1
20200372507 Liu Nov 2020 A1
20200380538 Chau Dec 2020 A1
20200382480 Isaacson Dec 2020 A1
20200402058 Zhou Dec 2020 A1
20200402195 Rossides Dec 2020 A1
20200410820 Ellis Dec 2020 A1
20210011741 Bartfai-Walcott Jan 2021 A1
20210012254 Campbell Jan 2021 A1
20210019727 Edwards Jan 2021 A1
20210020168 Dame Jan 2021 A1
20210027404 de Bold Jan 2021 A1
20210042741 Lu Feb 2021 A1
20210056562 Hart Feb 2021 A1
20210056581 Kumar Feb 2021 A1
20210058377 Khan Feb 2021 A1
20210058392 Leddy, III Feb 2021 A1
20210065174 Singh Mar 2021 A1
20210089761 Tyomkin Mar 2021 A1
20210103932 Turgeon Apr 2021 A1
20210110369 Hamasako Apr 2021 A1
20210117515 Bartfai-Walcott Apr 2021 A1
20210133722 Hoffman May 2021 A1
20210142591 Liu May 2021 A1
20210157312 Cella May 2021 A1
20210158360 Somani May 2021 A1
20210173674 Rose Jun 2021 A1
20210174321 Rose Jun 2021 A1
20210174347 Rose Jun 2021 A1
20210176274 Ben David Jun 2021 A1
20210176340 Rose Jun 2021 A1
20210194883 Badhwar Jun 2021 A1
20210201291 Brody Jul 2021 A1
20210201328 Gunther Jul 2021 A1
20210203690 Nunes Jul 2021 A1
20210203691 Pratt Jul 2021 A1
20210203692 Nunes Jul 2021 A1
20210203693 Clausen Jul 2021 A1
20210209600 Fontana Jul 2021 A1
20210216991 Grassadonia Jul 2021 A1
20210226921 Rose Jul 2021 A1
20210241256 Caldwell Aug 2021 A1
20210248594 Yantis Aug 2021 A1
20210256355 Chen Aug 2021 A1
20210256489 Jivan Aug 2021 A1
20210256509 Gulati Aug 2021 A1
20210264455 Way Aug 2021 A1
20210279762 Eklund Sep 2021 A1
20210281569 Soon-Shiong Sep 2021 A1
20210287264 Sherif Sep 2021 A1
20210288951 Rose Sep 2021 A1
20210294287 Valin Sep 2021 A1
20210297448 Keith, Jr. Sep 2021 A1
20210304206 Juneja Sep 2021 A1
20210304226 Johnson Sep 2021 A1
20210312026 Rose Oct 2021 A1
20210312379 Mimassi Oct 2021 A1
20210312440 Badal-Badalian Oct 2021 A1
20210312441 Dawson, V Oct 2021 A1
20210312466 Thomason Oct 2021 A1
20210319385 Chau Oct 2021 A1
20210319424 Shah Oct 2021 A1
20210320917 Rose Oct 2021 A1
20210326476 Su Oct 2021 A1
20210334814 Sawant Oct 2021 A1
20210342836 Cella Nov 2021 A1
20210342841 Pham Nov 2021 A1
20210345001 Rustamov Nov 2021 A1
20210350011 Ashlock Nov 2021 A1
20210350262 Song Nov 2021 A1
20210350357 Lafontaine Nov 2021 A1
20210352478 Hauser Nov 2021 A1
20210357892 Srivastava Nov 2021 A1
20210358032 Cella Nov 2021 A1
20210365897 Bansal Nov 2021 A1
20210365916 Benkreira Nov 2021 A1
20210365968 Narula Nov 2021 A1
20210368316 Tiwari Nov 2021 A1
20210374749 Vukich Dec 2021 A1
20210377303 Bui Dec 2021 A1
20210377304 Ma Dec 2021 A1
20210386987 Azdoud Dec 2021 A1
20210389854 Rose Dec 2021 A1
20210390200 Goodsitt Dec 2021 A1
20210390549 Rule Dec 2021 A1
20210390550 Liao Dec 2021 A1
20210390556 Bermudez Dec 2021 A1
20210390649 Cho Dec 2021 A1
20210398090 Yan Dec 2021 A1
20210398099 Adato Dec 2021 A1
20210398100 Gabriele Dec 2021 A1
20210398133 Zhu Dec 2021 A1
20210398136 Cebertowicz Dec 2021 A1
20210398188 Jafa Dec 2021 A1
20210406003 Crabtree Dec 2021 A1
20210406613 More Dec 2021 A1
20210406942 Lilley Dec 2021 A1
20210409374 Boding Dec 2021 A1
20220005092 Agrawal Jan 2022 A1
20220012672 Inman Jan 2022 A1
20220012682 Koritala Jan 2022 A1
20220012743 Snell Jan 2022 A1
20220012803 Walters Jan 2022 A1
20220012817 Singh Jan 2022 A1
20220020087 Sundarajan Jan 2022 A1
20220027915 Cameron Jan 2022 A1
20220027935 Lee Jan 2022 A1
20220028513 Gangaikondan-Iyer Jan 2022 A1
20220036324 Renke Feb 2022 A1
20220036326 Varma Feb 2022 A1
20220036450 Sanghvi Feb 2022 A1
20220044180 Murao Feb 2022 A1
20220044269 Silberman-Sais Feb 2022 A1
20220050751 Hazra Feb 2022 A1
20220051214 Edwards Feb 2022 A1
20220057918 Rose Feb 2022 A1
20220058633 Yantis Feb 2022 A1
20220058638 Edwards Feb 2022 A1
20220058723 Swett Feb 2022 A1
20220067687 Hay Mar 2022 A1
20220075825 Helms Mar 2022 A1
20220084111 Ladzik Mar 2022 A1
20220092627 Woodrick Mar 2022 A1
20220101321 Jones Mar 2022 A1
20220101326 Kim Mar 2022 A1
20220108262 Cella Apr 2022 A1
20220108291 Cain, Jr. Apr 2022 A1
20220108301 Gupta Apr 2022 A1
20220114593 Johnson Apr 2022 A1
20220114594 Nunes Apr 2022 A1
20220114664 Curtis Apr 2022 A1
20220116398 Rose Apr 2022 A1
20220116415 Burgis Apr 2022 A1
20220116736 Williams Apr 2022 A1
20220121884 Zadeh Apr 2022 A1
20220122076 Braun Apr 2022 A1
20220122087 Gosset Apr 2022 A1
20220122090 Patne Apr 2022 A1
20220138753 Wright May 2022 A1
20220147815 Conwell May 2022 A1
20220148107 Chaudhary May 2022 A1
20220150275 McNee May 2022 A1
20220159056 Rose May 2022 A1
20220164740 Winborne May 2022 A1
20220164796 Kollamparambil May 2022 A1
20220174066 Rose Jun 2022 A1
20220180333 Kim Jun 2022 A1
20220188391 Pai Jun 2022 A1
20220188833 May Jun 2022 A1
20220198562 Cella Jun 2022 A1
20220207575 Wilson Jun 2022 A1
20220222662 Ketharaju Jul 2022 A1
20220222750 Lebow Jul 2022 A1
20220245546 Castinado Aug 2022 A1
20220245574 Cella Aug 2022 A1
20220245641 Wintle Aug 2022 A1
20220261818 Litvak-Hinenzon Aug 2022 A1
20220270168 Daya Aug 2022 A1
20220277252 Serafina Sep 2022 A1
20220277295 Robinson-Morgan Sep 2022 A1
20220292513 Bungert Sep 2022 A1
20220309507 Ross Sep 2022 A1
20220351192 McGregor Nov 2022 A1
20220353275 Syngal Nov 2022 A1
20220358193 Chaudhary Nov 2022 A1
20220360663 Kempson Nov 2022 A1
20220366358 Perez Nov 2022 A1
20220366430 Steckel Nov 2022 A1
20220366494 Cella Nov 2022 A1
20220374855 Balaoro Nov 2022 A1
20220383325 Hoffman Dec 2022 A1
20220383385 Costello Dec 2022 A1
20220391720 Dande Dec 2022 A1
20220391910 Thams Dec 2022 A1
20220391987 Allogia Dec 2022 A1
20220414664 Liu Dec 2022 A1
20230010257 Chauhan Jan 2023 A1
20230011209 Fenichel Jan 2023 A1
20230032497 Zevetchin Feb 2023 A1
20230033490 Yeh Feb 2023 A1
20230049335 Lowe Feb 2023 A1
20230051225 Nair Feb 2023 A1
20230057996 Pawelkiewicz Feb 2023 A1
20230058572 Moritz Feb 2023 A1
20230065289 Kapur Mar 2023 A1
20230066272 Patel Mar 2023 A1
20230069223 Patel Mar 2023 A1
20230075741 Medvinsky Mar 2023 A1
20230078448 Cella Mar 2023 A1
20230083724 Cella Mar 2023 A1
20230084684 Kartik Mar 2023 A1
20230092596 Kartoun Mar 2023 A1
20230098602 Cella Mar 2023 A1
20230099266 Horan Mar 2023 A1
20230100394 Atkin Mar 2023 A1
20230102048 Cella Mar 2023 A1
20230106368 Tanaka Apr 2023 A1
20230106639 Wagener Apr 2023 A1
20230107711 Crews, Jr. Apr 2023 A1
20230109761 Hatter Apr 2023 A1
20230111784 Yuki Apr 2023 A1
20230113793 Yuki Apr 2023 A1
20230123322 Cella Apr 2023 A1
20230128845 Brodsky Apr 2023 A1
20230133569 Kadry May 2023 A1
20230139465 Nyati May 2023 A1
20230145127 Barnum May 2023 A1
20230153830 Frensch May 2023 A1
20230154222 Desai May 2023 A1
20230164570 Khandare May 2023 A1
20230173395 Cella Jun 2023 A1
20230176557 Cella Jun 2023 A1
20230177501 Coughlan Jun 2023 A1
20230184579 Gettle Jun 2023 A1
20230186201 Cella Jun 2023 A1
20230196230 Cella Jun 2023 A1
20230206329 Cella Jun 2023 A1
20230214841 Ratnakaram Jul 2023 A1
20230214846 Chetal Jul 2023 A1
20230214925 Cella Jul 2023 A1
20230222454 Cella Jul 2023 A1
20230222531 Cella Jul 2023 A1
20230252548 Kawase Aug 2023 A1
20230281527 Cella Sep 2023 A1
20230298007 Gupta Sep 2023 A1
20230325814 Vijayan Oct 2023 A1
20230334491 Leddy, III Oct 2023 A1
20230342679 Wagenaar Oct 2023 A1
20230421377 Jakobsson Dec 2023 A1
20240005296 Stankoulov Jan 2024 A1
20240005376 Estes Jan 2024 A1
20240013168 Oei Jan 2024 A1
20240013177 Sindi Jan 2024 A1
20240013221 Kruse Jan 2024 A1
20240046318 Muriqi Feb 2024 A1
20240118702 Cella Apr 2024 A1
20240144141 Cella May 2024 A1
Non-Patent Literature Citations (11)
Entry
Bujlow “A Survey on Web Tracking: Mechanisms, Implications and Defenses,” Proceedings of the IEEE, vol. 105, No. 8, pp. 1476-1510 (Year: 2017).
Patil et al “An Efficient, Secure and Delegable Micro-Payment System,” Proceedings of the 2014 IEEE International Conference on e-Technology, e-Commerce and e-Service, IEEE Computer Society, pp. 1-11 (Year: 2004).
Guo et al “Fraud Risk Monitoring System for E-Banking Transactions,” 2018 IEEE 16th Int. Conf. on Dependable, Autonomic & Secure Comp., 16th Int. Conf on Pervasive Intelligence & Comp, 4th Int. Conf on Big Data Intelligence & Comp, and 3rd Cyber Sci & Tech Cong, IEEE Computer Society, pp. 100-105 (Year: 2018).
Prasad et al Machine Learning Techniques to Detect Fraud in Credit Cards on the HPCC Systems Platform.
Wu et al “Detecting in Situ Identity Fraud on Social Network Services: A Case Study with Facebook,” IEEE Systems Journal, vol. 11. No: 4, pp. 2432-2443 (Year: 2015).
Narhar et al “Highly Secure Authentication Scheme,” 2015 International Conference on Computing Communication Control and Automation, IEEE Computer Society, pp. 270-274 (Year: 2015).
Chukwoucha et al “Trust and Scalable Blockchain-Based Message Exchanging Scheme on Vanet,” Springer, pp. 3092-3109 (Year: 2021).
Cao et al “Using Machine Learning To Create a Credit Scoring Model in Banking and Finance,” IEEE, pp. 1-5 (Year: 2021).
Mohebali et al “An Evolutionary Framework for Real-Time Fraudulent Credit Detection,” IEEE, pp. 1999-2006 (Year: 2021).
Niu et al “A Real-Time Fraud Detection Algorithm Based on Intelligent Scoring for the Telecom Industry,” IEEE, pp. 303-306 (Year: 2016).
Boubker et al “A Comprehensive Study on Credit Card Fraud Prevention and Detection,” IEEE, pp. 1-8 (Year: 2021).
Related Publications (1)
Number Date Country
20230214822 A1 Jul 2023 US