Systems and methods for managing cybersecurity alerts

Information

  • Patent Grant
  • 12099608
  • Patent Number
    12,099,608
  • Date Filed
    Thursday, June 15, 2023
    a year ago
  • Date Issued
    Tuesday, September 24, 2024
    7 months ago
Abstract
A system and method for setting alert thresholds related to cybersecurity ratings of one or more affiliate entities. An example method includes: obtaining entity data including cybersecurity event data for an affiliate entity; calculating a time-series cybersecurity rating for the affiliate entity based on the entity data; associating an alert reporting threshold with the time-series cybersecurity rating, wherein a comparison of the alert reporting threshold to the time-series cybersecurity rating determines a number of alerts reported for the affiliate entity; applying an alternative alert reporting threshold against the time-series cybersecurity rating to determine an alternative number of alerts reported for the affiliate entity; and updating the alert reporting threshold for the time-series cybersecurity rating to the alternative alert reporting threshold.
Description
TECHNICAL FIELD

The present disclosure generally relates to methods and systems for determining the extent to which certain affiliates of an organization should be monitored. Some embodiments described herein relate specifically to methods and systems for managing a quantity and/or frequency of alerts that are sent to the organization based on cybersecurity risks or threats presented by one or more of the organization's affiliates.


BACKGROUND

Businesses, corporations, or organizations more generally often outsource work to third parties. As a result, organizations are connected to numerous third party affiliates. These connections or relationships leave organizations vulnerable to the security implementations of these third party affiliates. In order to reliably monitor dozens, hundreds, or even thousands of third party affiliates, organizations must dedicate a large amount of resources to manage this task.


For organizations with a large quantity of third party affiliates, monitoring each and every affiliate proves difficult and expensive. Staff dedicated to such monitoring is generally capable of handling only a fraction of an organization's affiliates, and there is no guarantee that they can do so accurately. Typically, hired staff can only monitor a fraction of the affiliates, especially as the organization grows and expands its affiliate network. Hiring more staff to handle the ever expanding affiliate network of a growing organization generally does not provide enough speed and analysis to accurately monitor such affiliates.


Blindly monitoring affiliates can be an overburdensome task for an organization, and can often lead to false positives (e.g., triggering alarms or alerts when unnecessary) and/or false negatives (e.g., missing critical events that warrant further investigation). What is needed is a method and supporting systems to allow organizations to dynamically adjust cybersecurity event reporting thresholds across their network of affiliates.


SUMMARY

In general, the present disclosure relates to systems and methods for generating and sending alerts to a company, organization, individual, or other alert recipient when one or more affiliates of the alert recipient are associated with a high or unreasonable cybersecurity threat or risk. Cybersecurity data for an affiliate entity (or multiple affiliate entities) can be obtained and used to generate a cybersecurity rating for the affiliate entity, as described herein. Based on the value of the cybersecurity rating and/or on a rate at which the value is changing (e.g., a weekly drop rate), an alert can be sent to the alert recipient, to warn the alert recipient of a potential cybersecurity threat or risk associated with the affiliate entity. In some instances, however, the alert recipient may receive an inappropriate number or frequency of alerts. When the number or frequency of alerts is too high, for example, the alert recipient may become numb to the alerts, may stop taking the alerts seriously, and/or may become frustrated by repeated reminders. Alternatively, when the number or frequency of alerts is too low, the alert recipient may not take the alerts seriously, may fail to recognize a cybersecurity threat, and/or may not take appropriate corrective action.


Advantageously, the systems and methods described herein allow alert recipients to manage the number of automated alerts they receive based on cybersecurity ratings of one or more affiliate entities. The systems and methods allow an alert reporting threshold to be optimized, so that a comparison of the alert reporting threshold to a cybersecurity risk presented by an affiliate entity results in a desired number of alerts. In some instances, for example, a security rating time history (also referred to herein as a time-series cybersecurity rating) for an affiliate entity can be generated and compared with the alert reporting threshold, and the alert reporting threshold can be adjusted until a desired number of alerts for the time history is obtained, for example, using automated and/or iterative techniques. The resulting alert reporting threshold can be used to automatically generate and send future alerts (e.g., automated electronic messages) for the affiliate entity. In other words, the disclosed method provides solutions to problems in the software arts. Thus, the improved numerical methods and logical recommendations described herein constitute improvements to computer-related technology for reasons similar to those articulated by the Federal Circuit in Enfish, LLC v. Microsoft Corp, and are not abstract ideas.


In general, one innovative aspect of the subject matter described in the present disclosure can be embodied in a computer-implemented method of setting alert thresholds related to cybersecurity ratings of one or more affiliate entities. The method includes: obtaining entity data including a plurality of entity data sets, each entity data set associated with a respective affiliate entity from a plurality of affiliate entities and including cybersecurity event data associated with each respective affiliate entity; calculating a time-series cybersecurity rating for one or more of the affiliate entities based on the respective entity data set; associating an alert reporting threshold with the time-series cybersecurity rating, wherein a comparison of the alert reporting threshold to the time-series cybersecurity rating determines a number of alerts reported for the one or more affiliate entities; applying an alternative alert reporting threshold against the time-series cybersecurity rating to determine an alternative number of alerts reported for the one or more affiliate entities; and updating the alert reporting threshold for the time-series cybersecurity rating to the alternative alert reporting threshold.


In certain examples, the plurality of affiliate entities can include affiliates of an intended recipient of the alerts. The time-series cybersecurity rating can include a history of cybersecurity ratings during a previous time period. The alert reporting threshold can include a threshold cybersecurity rating. The alert reporting threshold can include a threshold rate of change in the time-series cybersecurity rating. Alerts can be generated periodically while the time-series cybersecurity rating is either above or below the alert reporting threshold. Applying an alternative alert reporting threshold can include iterating on the alert reporting threshold to achieve a desired number of alerts reported for the one or more affiliate entities during a previous time period. Iterating on the alert reporting threshold can include receiving a user-specified desired number of alerts. Applying an alternative alert reporting threshold can include iterating on the alert reporting threshold until a desired number of affiliate entities from the one or more affiliate entities trigger alerts during a previous time period. The method can include sending alerts to an intended recipient during a future time period using the updated alert reporting threshold.


In another aspect, the subject matter described in the present disclosure relates to a system having one or more computer systems programmed to perform operations including: obtaining entity data including a plurality of entity data sets, each entity data set associated with a respective affiliate entity from a plurality of affiliate entities and including cybersecurity event data associated with each respective affiliate entity; calculating a time-series cybersecurity rating for one or more of the affiliate entities based on the respective entity data set; associating an alert reporting threshold with the time-series cybersecurity rating, wherein a comparison of the alert reporting threshold to the time-series cybersecurity rating determines a number of alerts reported for the one or more affiliate entities; applying an alternative alert reporting threshold against the time-series cybersecurity rating to determine an alternative number of alerts reported for the one or more affiliate entities; and updating the alert reporting threshold for the time-series cybersecurity rating to the alternative alert reporting threshold.


In some implementations, the plurality of affiliate entities can include affiliates of an intended recipient of the alerts. The time-series cybersecurity rating can include a history of cybersecurity ratings during a previous time period. The alert reporting threshold can include a threshold cybersecurity rating. The alert reporting threshold can include a threshold rate of change in the time-series cybersecurity rating. Alerts can be generated periodically while the time-series cybersecurity rating is either above or below the alert reporting threshold. Applying an alternative alert reporting threshold can include iterating on the alert reporting threshold to achieve a desired number of alerts reported for the one or more affiliate entities during a previous time period. Iterating on the alert reporting threshold can include receiving a user-specified desired number of alerts. Applying an alternative alert reporting threshold can include iterating on the alert reporting threshold until a desired number of affiliate entities from the one or more affiliate entities trigger alerts during a previous time period. The operations can include sending alerts to an intended recipient during a future time period using the updated alert reporting threshold.


In another aspect, the subject matter described in the present disclosure relates to a non-transitory computer-readable medium having instructions stored thereon that, when executed by one or more computer processors, cause the one or more computer processors to perform operations including: obtaining entity data including a plurality of entity data sets, each entity data set associated with a respective affiliate entity from a plurality of affiliate entities and including cybersecurity event data associated with each respective affiliate entity; calculating a time-series cybersecurity rating for one or more of the affiliate entities based on the respective entity data set; associating an alert reporting threshold with the time-series cybersecurity rating, wherein a comparison of the alert reporting threshold to the time-series cybersecurity rating determines a number of alerts reported for the one or more affiliate entities; applying an alternative alert reporting threshold against the time-series cybersecurity rating to determine an alternative number of alerts reported for the one or more affiliate entities; and updating the alert reporting threshold for the time-series cybersecurity rating to the alternative alert reporting threshold.


Other embodiments of this aspect include corresponding systems, apparatus, and computer programs recorded on one or more computer storage devices, each configured to perform the actions of the method. A system of one or more computers can be configured to perform particular actions by virtue of having software, firmware, hardware, or a combination of them installed on the system (e.g., instructions stored in one or more storage devices) that in operation causes or cause the system to perform the actions. One or more computer programs can be configured to perform particular actions by virtue of including instructions that, when executed by data processing apparatus, cause the apparatus to perform the actions.


The details of one or more embodiments of the subject matter described in this specification are set forth in the accompanying drawings and the description below. Other features, aspects, and advantages of the subject matter will become apparent from the description, the drawings, and the claims.


The foregoing Summary, including the description of some embodiments, motivations therefor, and/or advantages thereof, is intended to assist the reader in understanding the present disclosure, and does not in any way limit the scope of any of the claims.





BRIEF DESCRIPTION OF THE DRAWINGS

In the drawings, like reference characters generally refer to the same parts throughout the different views. Also, the drawings are not necessarily to scale, emphasis instead generally being placed upon illustrating the principles of the invention. In the following description, various embodiments of the present invention are described with reference to the following drawings, in which:



FIG. 1 is a plot of a cybersecurity rating time history, in accordance with certain embodiments.



FIG. 2 is a plot of a cybersecurity rating time history and an alert reporting threshold, in accordance with certain embodiments.



FIG. 3 is a plot of a cybersecurity rating time history and an alert reporting threshold, in accordance with certain embodiments.



FIG. 4 is a plot of a number of cybersecurity alerts sent each week to an alert recipient over time, for various alert reporting thresholds, in accordance with certain embodiments.



FIG. 5 is a plot of a number of weekly cybersecurity alerts versus an alert reporting threshold, in accordance with certain embodiments.



FIG. 6 is a plot of a weekly drop in a cybersecurity rating time history, in accordance with certain embodiments.



FIG. 7 is a plot of a weekly drop in a cybersecurity rating time history and an alert reporting threshold, in accordance with certain embodiments.



FIG. 8 is a plot of a number of cybersecurity alerts sent each week to an alert recipient over time, for various alert reporting thresholds, in accordance with certain embodiments.



FIG. 9 is a plot of a number of weekly cybersecurity alerts versus an alert reporting threshold, in accordance with certain embodiments.



FIG. 10 is a flowchart of a method of setting alert thresholds related to cybersecurity ratings of one or more affiliate entities, in accordance with certain embodiments.



FIG. 11 is a schematic block diagram of an example computer system for determining and sending a desired number or frequency of cybersecurity alerts, in accordance with certain embodiments.





DETAILED DESCRIPTION

As used herein, the term “affiliate” or “affiliate entity” may refer to a company, organization, individual, or other entity that interacts or otherwise conducts business with an alert recipient.


As used herein, “alert recipient” may refer to a company, organization, individual, or other entity that receives alerts corresponding to cybersecurity risks or threats associated with an affiliate or affiliate entity.


As used herein, the term “alert” may refer to a message or notification (e.g., a text message, email, phone call, or letter) sent to an alert recipient. An alert can be generated and sent to the alert recipient when the systems and methods described herein identify a cybersecurity threat or risk associated with an affiliate or affiliate entity.


As used herein, “time series” or “time-series” may refer to a series of parameter values in time order, but not necessarily values that are equally spaced in time. The parameter for the time series may be, for example, a cybersecurity rating or a rate of change (e.g., a weekly drop) in the cybersecurity rating. A time series may also be referred to herein as a “time history.”


In various examples, a security profile of an affiliate entity can reflect the past, present, and/or future security characteristics of the affiliate entity. In some embodiments, the security profile may reflect security risks to which the affiliate entity is exposed balanced by countermeasures that the affiliate entity has taken or can take to mitigate the security risk. As referred to herein, a security profile of an affiliate entity can be or include a security rating (also referred to herein as a “cybersecurity rating”) for the affiliate entity. A security rating may be quantitative or qualitative. For example, a quantitative security rating may be expressed as a number within a predetermined range (e.g., between 300 and 900, as provided by BitSight Technologies, Inc. of Boston, Massachusetts, USA).


Examples of determining security ratings of affiliate entities can be found in at least U.S. Patent Application Publication No. 2016/0205126 published on Jul. 14, 2016 and titled “Information Technology Security Assessment System,” U.S. Pat. No. 9,973,524 issued on May 15, 2018 and titled “Information Technology Security Assessment System,” U.S. Pat. No. 9,830,569 issued on Nov. 28, 2017 and titled “Security Assessment Using Service Provider Digital Asset Information,” and U.S. patent application Ser. No. 16/514,771 filed on Jul. 17, 2019 and titled “Systems and Methods for Generating Security Improvement Plans for Entities,” each of which is incorporated herein by reference in its entirety. For example, a security rating can be generated by collecting information about an affiliate entity's computer system, e.g., information technology assets that the affiliate entity controls, uses, or is affiliated with. Examples of asset ownership include control and operation of an Internet Protocol (IP) network address range or computer services such as web servers residing within that address block. Information about affiliate entities also includes relationships such as subsidiaries, affiliates, etc., that describe affiliate entity association. External data can be collected and include multiple data types, such as breach disclosures, block lists, configuration parameters, malware servers, reputation metrics, suspicious activity, spyware, white lists, compromised hosts, malicious activity, spam activity, vulnerable hosts, phishing, user behavior, or email viruses. To determine the security rating for an affiliate entity, the system aggregates some or all of the collected data, which can be referred to herein as “entity data.”



FIG. 1 is a plot of an example time-series security rating 100 for an affiliate entity during a time period corresponding to the year 2019. In general, the security rating 100 provides an indication of the cybersecurity risk, threats, and/or vulnerabilities associated with the affiliate entity. In examples described herein, a low security rating 100 is indicative of a high cybersecurity risk or threat, and a high security rating 100 is indicative of a low cybersecurity risk or threat. It is understood, however, that the opposite can be true for the security rating 100, such that a high security rating 100 can be associated with a high risk or threat, and a low security rating 100 can be associated with a low risk or threat. As the figure indicates, the security rating 100 can vary over time, for example, as new cybersecurity event data for the affiliate entity is collected and used to update the security rating 100.


In various examples, it is desirable to monitor the security rating 100 for the affiliate entity and send alerts to one or more alert recipients when the security rating 100 indicates the affiliate entity is associated with a high cybersecurity risk or threat. In such instances, for example, one or more automated alerts can be sent by email, text messaging, phone, and/or other messaging services to the alert recipients. Alternatively, when the cybersecurity risk or threat is low, there may be no need to send or report such alerts.


Referring to FIG. 2, in some examples, an alert reporting threshold 200 can be used to trigger the sending of alerts based on the security rating 100. In the depicted example, the alert reporting threshold 200 has been set to 650, such that alerts are sent when the security rating 100 is below 650, and no alerts are sent when the security rating 100 is at or above 650. By comparison, FIG. 3 depicts an example in which the alert reporting threshold 200 has been set to 350. In this case, alerts are sent when the security rating 100 is below 350, and no alerts are sent when the security rating 100 is at or above 350. As the two figures indicate, a higher threshold 200 results in more instances when the security rating 100 is below the threshold 200, and this generally results in more opportunities for alerts to be sent. For example, if one alert is sent for each day that the security rating 100 is below the threshold 200, the example in FIG. 2 would result in a total of 261 alerts, and the example in FIG. 3 would result in a total of 17 alerts. Likewise, if one alert is sent for each hour that the security rating 100 is below the threshold 200, the example in FIG. 2 would result in a total of about 6300 alerts, and the example in FIG. 3 would result in a total of about 400 alerts. Accordingly, selection of the threshold 200 can have a significant influence on the number of alerts generated and sent to affiliated alert recipients.


In general, alerts can be sent periodically (e.g., hourly, daily, weekly, or monthly) during a time that the security rating 100 is below the threshold 200. In such instances, a frequency at which the alerts are sent can be constant (e.g., once per day). Alternatively or additionally, the frequency can vary over time and/or can be based on a difference between the threshold 200 and a current value of the security rating 100, with a larger difference resulting in a higher alert frequency. In certain examples, an alert can be sent each time the security rating 100 drops from being above the threshold 200 to being below the threshold 200.


In certain implementations, the systems and methods described herein can determine a total number or frequency of alerts that will be sent to an alert recipient based on cybersecurity risks or threats occurring across a portfolio or group of affiliate entities. For example, the systems and methods can determine a number or frequency of alerts that will be sent for each affiliate entity during one or more time periods (e.g., each week in 2019), based on a security rating for each affiliate entity. The systems and methods can then aggregate or sum the number or frequency of alerts for all the affiliate entities to obtain a total number of alerts or an overall alert frequency for the group of affiliate entities during the time periods.


For example, FIG. 4 is a time history of a total number of alerts sent to an alert recipient each week based on security ratings for a group of affiliate entities, for various values of the alert reporting threshold, during a time frame beginning around April 2017 and ending around December 2018. As the figure indicates, an alert threshold of 700 resulted in a total of about 25 alerts per week across all affiliate entities, on average, and a few instances 402 when more than 100 alerts per week were sent for all affiliate entities. By comparison, an alert threshold of 400 resulted in less than 5 alerts per week, on average.



FIG. 5 is a plot of a total number of alerts per week versus the alert reporting threshold, for the same group of affiliate entities and same time frame presented in FIG. 4. As FIG. 5 indicates, the number of alerts generally increases as the alert reporting threshold increases.


In various examples, the systems and methods described herein can allow the alert reporting threshold to be adjusted, so that an optimal or desired number of alerts is generated for one or more affiliate entities, going forward. For example, the systems and methods can adjust the threshold and determine a number of alerts that would have been generated for a security rating during a previous time period, such as the year 2019. Referring again to FIGS. 2 and 3, for example, a user can adjust the threshold 200 for the security rating 100, and the systems and methods can calculate or recalculate a number of alerts that would have been generated for each value of the threshold 200. The calculated number of alerts can be, for example, the total number of alerts generated for 2019. Alternatively or additionally, the calculated number of alerts can be a rate of alert generation, such as a minimum, average, or maximum number of alerts per hour, day, week, or month, during 2019. With this approach, the user can adjust the threshold value (e.g., via trial and error) until a preferred threshold is identified that results in a desired number or frequency of alerts for the security rating 100. The user can then apply the preferred threshold to a future time period, such as the year 2020. For example, the user can set the alert reporting threshold for the affiliate entity (and/or other affiliate entities) to be equal to the preferred threshold, so that future alerts are generated according to the preferred threshold. Additionally or alternatively, in some examples, the alert reporting threshold can be applied across a group of affiliate entities and a total number or frequency of alerts can be determined, for all the affiliate entities during a time period (e.g., 2019). The alert reporting threshold can be varied until a desired number or frequency of alerts is sent for all the affiliate entities. The number or frequency of alerts can be determined daily, weekly, monthly, or for other discrete time periods.


In some instances, this approach of adjusting the threshold until a desired number or frequency of alerts is obtained for a previous time period can be performed automatically. For example, a user can specify a desired number or frequency of alerts, and the systems and methods can adjust the threshold (e.g., in an iterative manner) until a preferred threshold is identified that results in the desired number or frequency of alerts for that time period. The systems and methods can use an iterative technique such as, for example, Newton's method, the bisection method, and/or interpolation to find the preferred threshold. The systems and methods can choose an initial threshold and then automatically adjust the threshold until the desired number of alerts is obtained.


Alternatively or additionally, in some examples, alerts can be generated based on a rate at which the security rating is changing. For example, FIG. 6 is a plot of a time history of a weekly drop 600 in a security rating (e.g., the security rating 100) for the 2019 time period. In the depicted example, the weekly drop 600 represents a fractional drop in the security rating, which can be calculated as follows: Fractional Drop=(Initial Value−Current Value)/Initial Value, where the Current Value is the security rating on the current day, and the Initial Value is the security rating from one week (seven days) ago. The fractional drop can be calculated weekly (as shown in the figure, to obtain the weekly drop 600), hourly, daily, monthly, or for other time intervals. In general, when the weekly drop 600 is positive, the security rating is decreasing, and when the weekly drop is negative, the security rating is increasing. A high weekly drop can indicate the security rating is decreasing rapidly, which can be indicative of an increasing cybersecurity risk or threat. It can be desirable to send or report alerts to affiliated alert recipients during such instances. A threshold value can be used to trigger alerts based on the drop in security rating, such as the weekly drop 600, hourly drop, daily drop, or monthly drop.


For example, FIG. 7 is a plot of the weekly drop 600 in which an alert reporting threshold 700 has been set to 0.1 (or 10%). As the figure indicates, when the weekly drop 600 is above the threshold 700, alerts may be sent. Otherwise, when the weekly drop 600 is below or equal to the threshold 700, no alerts may be sent. A higher value for the threshold 700 generally results in fewer alerts being generated and a lower value of the threshold 700 results in more alerts being generated. In various examples, alerts can be sent periodically (e.g., hourly, daily, weekly, or monthly) during a time when the weekly drop exceeds the threshold 700. In such instances, a frequency at which alerts are sent can be constant (e.g., once per day). Alternatively or additionally, the frequency can vary over time and/or can be based on a difference between the weekly drop 600 and the threshold 700, with a larger difference resulting in a higher alert frequency. In certain examples, an alert can be sent each time the weekly drop 600 transitions from being below the threshold 700 to being above the threshold 700.



FIG. 8 is a time history of a total number of alerts sent to an alert recipient each week based on weekly drop for a group of affiliate entities, for various values of the alert reporting threshold, during a time frame beginning around April 2017 and ending around December 2018. A threshold of 0.03 in this example resulted in about 100 alerts per week across all affiliate entities, on average, and a few instances 802 when more than 200 alerts per week were sent for all affiliate entities. By comparison, an alert threshold of 0.09 resulted in less than about 10 alerts per week, on average, with no large alert spikes.



FIG. 9 is a plot of the number of alerts per week based on weekly drop versus the alert reporting threshold for the same group of affiliate entities and same time frame presented in FIG. 8. As FIG. 9 indicates, the number of alerts generally decreases as the alert reporting threshold increases.


In various examples, the systems and methods described herein can be used to adjust the alert reporting threshold, so that an optimal or desired number of alerts is generated based on weekly drop or other measure of security rating rate of change (e.g., daily drop or monthly drop). For example, the systems and methods can adjust the threshold and determine a number of alerts that would have been generated for a given weekly drop time history during a previous time period, such as the year 2019. Referring again to FIG. 7, for example, a user can adjust the threshold 700 for the weekly drop 600, and the systems and methods can calculate a number of alerts that would have been generated for each value of the threshold 700. The calculated number of alerts can be, for example, the total number of alerts generated for 2019. Alternatively or additionally, the calculated number of alerts can be a rate of alert generation, such as a minimum, average, or maximum number of alerts per hour, day, week, or month, during 2019. With this approach, the user can adjust the threshold value (e.g., via trial and error) until a preferred threshold is identified that results in a desired number or frequency of alerts for the security rating 100. The user can then apply the preferred threshold to a future time period, such as the year 2020. For example, the user can set the alert reporting threshold for the affiliate entity (and/or other affiliate entities) to be equal to the preferred threshold, so that future alerts are generated according to the preferred threshold.


In some instances, this approach of adjusting the threshold until a desired number or frequency of alerts is determined for a previous time period can be performed automatically. For example, a user can specify a desired number or frequency of alerts, and the systems and methods can adjust the threshold (e.g., in an iterative manner) until the preferred threshold is identified that results in the desired number or frequency of alerts. The systems and methods can use, for example, an iterative technique, such as Newton's method, the bisection method, and/or interpolation. The systems and methods can choose an initial threshold and automatically adjust the threshold until the preferred threshold is reached.


Additionally or alternatively, the systems and methods described herein can identify how many of an alert recipient's affiliates result in alerts being triggered during a time period (e.g., a previous week, month, or year), for one or more alert reporting thresholds. For example, a value can be specified for the threshold and the number of alerts for each affiliate entity can be calculated for a previous time period (e.g., a previous month or year). The systems and methods can display the number of calculated alerts for each affiliate entity and/or can determine or display a number or percentage of the affiliates that trigger an alert during the time period. In some examples, the threshold can be adjusted until a desired percentage (e.g., 10%, 20%, or 50%) of the affiliates trigger alerts for the time period. The threshold adjustments can be performed automatically using iterative techniques.



FIG. 10 is a flowchart of a method of setting alert thresholds related to security ratings of one or more affiliate entities. Entity data is obtained (step 1002) that includes a plurality of entity data sets. Each entity data set is associated with a respective affiliate entity from a plurality of affiliate entities and includes cybersecurity event data (e.g., information describing events related to cybersecurity) associated with each respective affiliate entity. A time-series cybersecurity rating is calculated (step 1004) for one of the affiliate entities based on the respective entity data set. An alert reporting threshold is associated (step 1006) with the time-series cybersecurity rating. A comparison of the alert reporting threshold to the time-series cybersecurity rating can be used to determine a number of alerts reported for the one of the affiliate entities during a previous time period. An alternative alert reporting threshold is applied (step 1008) against the time-series cybersecurity rating to determine an alternative number of alerts reported for the one of the affiliate entities during the previous time period. The alert reporting threshold for the time-series cybersecurity rating is updated (step 1010) to the alternative alert reporting threshold.


In various examples, the entity data for an affiliate entity can relate to and/or be used to determine cybersecurity risks associated with the affiliate entity. The entity data can be, include, and/or represent, for example, one or more of the following, in any combination: an amount of capital investment in security of the affiliate entity; a measure of employee training in security of the affiliate entity; a measure of organization of a team dedicated to information security; an amount of budget dedicated to information security; a number and/or severity of botnet infection instances of a computer system associated with the affiliate entity; a number of spam propagation instances originating from a computer network associated with the affiliate entity; a number of malware servers associated with the affiliate entity; a number of potentially exploited devices associated with the affiliate entity; a number of hosts authorized to send emails on behalf of each domain associated with the affiliate entity; a determination of whether a DomainKeys Identified Mail (DKIM) record exists for each domain associated with the affiliate entity and/or a key length of a public key associated with a Domain Name System (DNS) record of each domain associated with the affiliate entity; an evaluation of a Secure Sockets Layer (SSL) certificate and/or a Transport Layer Security (TLS) certificate associated with a computer system of the affiliate entity; a number and/or type of service of open ports of a computer network associated with the affiliate entity; an evaluation of security-related fields of an header section of HTTP response messages of hosts associated with the affiliate entity; a rate at which vulnerabilities are patched in a computer network associated with the affiliate entity; an evaluation of file sharing traffic originating from a computer network associated with the affiliate entity; a number of lost records and/or sensitivity of information in the lost records in a data breach of a computer system associated with the affiliate entity; a signal and/or an indication that a host has attempted to contact a service on another host without solicitation (e.g., attempt is unexpected or the service is unsupported), which may occur in some cases due to malware scanning for open network access points on other computers over the Internet; a signal and/or an indication that TLS/SSL configuration of an affiliate entity's server is proper, which can indicate that the security protocol libraries of a server associated with an affiliate entity are correctly configured and/or support strong encryption standards when making connections to other computer systems; a signal and/or an indication that affiliate entity's server system has software that is not supported by software vendors and/or is out-of-date; a presence of Sender Policy Framework (SPF) record(s) in the affiliate entity's domain (including subdomains) (e.g., of an affiliate entity's mail server system) that have sent or attempted to send an email; data indicating the operating system version and/or web browser version of one or more computer systems of the affiliate entity; a number of endpoints (e.g., computer, server, mobile device, media system, and/or appliance having Internet access) of an affiliate entity's computer system in communication with an unintended destination (e.g., a web domain that does not exist or not registered); and/or data indicating the operating system version, device description, web browser version, description of applications of one or more mobile devices in the affiliate entity's computer network. The event data can include or describe one or more cybersecurity events associated with an affiliate entity, such as, for example, an occurrence of a botnet infection of a computer system associated with the affiliate entity; a propagation of spam originating from a computer network associated with the affiliate entity; usage of a malware server associated with the affiliate entity; a signal and/or an indication that TLS/SSL configuration of an affiliate entity's server is proper; a signal and/or an indication that the affiliate entity is or is not using strong or proper encryption standards when making connections to other computer systems; a signal and/or an indication that affiliate entity's server system has software that is not supported by software vendors and/or is out-of-date. Other types of entity data and cybersecurity event data are possible.


In various examples, the subject matter of this application is related to the subject matter of U.S. patent application Ser. No. 15/377,574 titled “Methods and Systems for Creating, De-Duplicating, and Accessing Data Using an Object Storage System” and filed on Dec. 13, 2016 (now U.S. Pat. No. 9,705,932); U.S. patent application Ser. No. 14/021,585 titled “Security Risk Management” and filed on Sep. 9, 2013 (now U.S. Pat. No. 9,438,615); U.S. patent application Ser. No. 13/240,572 titled “Information Technology Security Assessment System” and filed on Sep. 22, 2011 under; U.S. patent application Ser. No. 14/944,484 titled “Information Technology Security Assessment System” and filed on Nov. 18, 2015 (now U.S. Pat. No. 9,973,524); U.S. patent application Ser. No. 15/142,677 titled “Security Assessment Using Service Provider Digital Asset Information” and filed on Apr. 29, 2016 (now U.S. Pat. No. 9,830,569); U.S. patent application Ser. No. 16/015,686 titled “Methods for Mapping IP Addresses and Domains to Organizations using User Activity Data” and filed on Jun. 22, 2018 (now U.S. Pat. No. 10,425,380); U.S. patent application Ser. No. 16/549,764 titled “Systems and Methods for Inferring Entity Relationships via Network Communications of Users or User Devices” and filed on Aug. 23, 2019; U.S. patent application Ser. No. 16/583,991 titled “Systems and Methods for Network Asset Discovery and Association thereof with Entities” and filed on Sep. 26, 2019; U.S. patent application Ser. No. 16/514,771 titled “Systems and methods for generating security improvement plans for entities” and filed on Jul. 17, 2019; and U.S. patent application Ser. No. 16/802,232 titled “Systems and Methods for Improving a Security Profile of an Entity Based on Peer Security Profiles” and filed on Feb. 26, 2020, each of which is hereby incorporated by reference herein in its entirety.


Computer-Based Implementations

In some examples, some or all of the processing described above can be carried out on a personal computing device, on one or more centralized computing devices, or via cloud-based processing by one or more servers. Some types of processing can occur on one device and other types of processing can occur on another device. Some or all of the data described above can be stored on a personal computing device, in data storage hosted on one or more centralized computing devices, and/or via cloud-based storage. Some data can be stored in one location and other data can be stored in another location. In some examples, quantum computing can be used and/or functional programming languages can be used. Electrical memory, such as flash-based memory, can be used.



FIG. 11 is a block diagram of an example computer system 1100 that may be used in implementing the technology described herein. General-purpose computers, network appliances, mobile devices, or other electronic systems may also include at least portions of the system 1100. The system 1100 includes a processor 1110, a memory 1120, a storage device 1130, and an input/output device 1140. Each of the components 1110, 1120, 1130, and 1140 may be interconnected, for example, using a system bus 1150. The processor 1110 is capable of processing instructions for execution within the system 1100. In some implementations, the processor 1110 is a single-threaded processor. In some implementations, the processor 1110 is a multi-threaded processor. The processor 1110 is capable of processing instructions stored in the memory 1120 or on the storage device 1130.


The memory 1120 stores information within the system 1100. In some implementations, the memory 1120 is a non-transitory computer-readable medium. In some implementations, the memory 1120 is a volatile memory unit. In some implementations, the memory 1120 is a nonvolatile memory unit.


The storage device 1130 is capable of providing mass storage for the system 1100. In some implementations, the storage device 1130 is a non-transitory computer-readable medium. In various different implementations, the storage device 1130 may include, for example, a hard disk device, an optical disk device, a solid-state drive, a flash drive, or some other large capacity storage device. For example, the storage device may store long-term data (e.g., database data, file system data, etc.). The input/output device 1140 provides input/output operations for the system 1100. In some implementations, the input/output device 1140 may include one or more network interface devices, e.g., an Ethernet card, a serial communication device, e.g., an RS-232 port, and/or a wireless interface device, e.g., an 802.11 card, a 3G wireless modem, or a 4G wireless modem. In some implementations, the input/output device may include driver devices configured to receive input data and send output data to other input/output devices, e.g., keyboard, printer and display devices 1160. In some examples, mobile computing devices, mobile communication devices, and other devices may be used.


In some implementations, at least a portion of the approaches described above may be realized by instructions that upon execution cause one or more processing devices to carry out the processes and functions described above. Such instructions may include, for example, interpreted instructions such as script instructions, or executable code, or other instructions stored in a non-transitory computer readable medium. The storage device 1130 may be implemented in a distributed way over a network, such as a server farm or a set of widely distributed servers, or may be implemented in a single computing device.


Although an example processing system has been described in FIG. 11, embodiments of the subject matter, functional operations and processes described in this specification can be implemented in other types of digital electronic circuitry, in tangibly-embodied computer software or firmware, in computer hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Embodiments of the subject matter described in this specification can be implemented as one or more computer programs, i.e., one or more modules of computer program instructions encoded on a tangible nonvolatile program carrier for execution by, or to control the operation of, data processing apparatus. Alternatively or in addition, the program instructions can be encoded on an artificially generated propagated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal that is generated to encode information for transmission to suitable receiver apparatus for execution by a data processing apparatus. The computer storage medium can be a machine-readable storage device, a machine-readable storage substrate, a random or serial access memory device, or a combination of one or more of them.


The term “system” may encompass all kinds of apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. A processing system may include special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit). A processing system may include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them.


A computer program (which may also be referred to or described as a program, software, a software application, a module, a software module, a script, or code) can be written in any form of programming language, including compiled or interpreted languages, or declarative or procedural languages, and it can be deployed in any form, including as a standalone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program may, but need not, correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.


The processes and logic flows described in this specification can be performed by one or more programmable computers executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).


Computers suitable for the execution of a computer program can include, by way of example, general or special purpose microprocessors or both, or any other kind of central processing unit. Generally, a central processing unit will receive instructions and data from a read-only memory or a random access memory or both. A computer generally includes a central processing unit for performing or executing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not have such devices. Moreover, a computer can be embedded in another device, e.g., a mobile telephone, a personal digital assistant (PDA), a mobile audio or video player, a game console, a Global Positioning System (GPS) receiver, or a portable storage device (e.g., a universal serial bus (USB) flash drive), to name just a few.


Computer readable media suitable for storing computer program instructions and data include all forms of nonvolatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.


To provide for interaction with a user, embodiments of the subject matter described in this specification can be implemented on a computer having a display device, e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor, for displaying information to the user and a keyboard and a pointing device, e.g., a mouse or a trackball, by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, or tactile input. In addition, a computer can interact with a user by sending documents to and receiving documents from a device that is used by the user; for example, by sending web pages to a web browser on a user's user device in response to requests received from the web browser.


Embodiments of the subject matter described in this specification can be implemented in a computing system that includes a back end component, e.g., as a data server, or that includes a middleware component, e.g., an application server, or that includes a front end component, e.g., a client computer having a graphical user interface or a Web browser through which a user can interact with an implementation of the subject matter described in this specification, or any combination of one or more such back end, middleware, or front end components. The components of the system can be interconnected by any form or medium of digital data communication, e.g., a communication network. Examples of communication networks include a local area network (“LAN”) and a wide area network (“WAN”), e.g., the Internet.


The computing system can include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.


While this specification contains many specific implementation details, these should not be construed as limitations on the scope of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments. Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable sub-combination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a sub-combination or variation of a sub-combination.


Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.


Particular embodiments of the subject matter have been described. Other embodiments are within the scope of the following claims. For example, the actions recited in the claims can be performed in a different order and still achieve desirable results. As one example, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In certain implementations, multitasking and parallel processing may be advantageous. Other steps or stages may be provided, or steps or stages may be eliminated, from the described processes. Accordingly, other implementations are within the scope of the following claims.


Terminology

The phraseology and terminology used herein is for the purpose of description and should not be regarded as limiting.


The term “approximately”, the phrase “approximately equal to”, and other similar phrases, as used in the specification and the claims (e.g., “X has a value of approximately Y” or “X is approximately equal to Y”), should be understood to mean that one value (X) is within a predetermined range of another value (Y). The predetermined range may be plus or minus 20%, 10%, 5%, 3%, 1%, 0.1%, or less than 0.1%, unless otherwise indicated.


The indefinite articles “a” and “an,” as used in the specification and in the claims, unless clearly indicated to the contrary, should be understood to mean “at least one.” The phrase “and/or,” as used in the specification and in the claims, should be understood to mean “either or both” of the elements so conjoined, i.e., elements that are conjunctively present in some cases and disjunctively present in other cases. Multiple elements listed with “and/or” should be construed in the same fashion, i.e., “one or more” of the elements so conjoined. Other elements may optionally be present other than the elements specifically identified by the “and/or” clause, whether related or unrelated to those elements specifically identified. Thus, as a non-limiting example, a reference to “A and/or B”, when used in conjunction with open-ended language such as “comprising” can refer, in one embodiment, to A only (optionally including elements other than B); in another embodiment, to B only (optionally including elements other than A); in yet another embodiment, to both A and B (optionally including other elements); etc.


As used in the specification and in the claims, “or” should be understood to have the same meaning as “and/or” as defined above. For example, when separating items in a list, “or” or “and/or” shall be interpreted as being inclusive, i.e., the inclusion of at least one, but also including more than one, of a number or list of elements, and, optionally, additional unlisted items. Only terms clearly indicated to the contrary, such as “only one of or “exactly one of,” or, when used in the claims, “consisting of,” will refer to the inclusion of exactly one element of a number or list of elements. In general, the term “or” as used shall only be interpreted as indicating exclusive alternatives (i.e. “one or the other but not both”) when preceded by terms of exclusivity, such as “either,” “one of,” “only one of,” or “exactly one of.” “Consisting essentially of,” when used in the claims, shall have its ordinary meaning as used in the field of patent law.


As used in the specification and in the claims, the phrase “at least one,” in reference to a list of one or more elements, should be understood to mean at least one element selected from any one or more of the elements in the list of elements, but not necessarily including at least one of each and every element specifically listed within the list of elements and not excluding any combinations of elements in the list of elements. This definition also allows that elements may optionally be present other than the elements specifically identified within the list of elements to which the phrase “at least one” refers, whether related or unrelated to those elements specifically identified. Thus, as a non-limiting example, “at least one of A and B” (or, equivalently, “at least one of A or B,” or, equivalently “at least one of A and/or B”) can refer, in one embodiment, to at least one, optionally including more than one, A, with no B present (and optionally including elements other than B); in another embodiment, to at least one, optionally including more than one, B, with no A present (and optionally including elements other than A); in yet another embodiment, to at least one, optionally including more than one, A, and at least one, optionally including more than one, B (and optionally including other elements); etc.


The use of “including,” “comprising,” “having,” “containing,” “involving,” and variations thereof, is meant to encompass the items listed thereafter and additional items.


Use of ordinal terms such as “first,” “second,” “third,” etc., in the claims to modify a claim element does not by itself connote any priority, precedence, or order of one claim element over another or the temporal order in which acts of a method are performed. Ordinal terms are used merely as labels to distinguish one claim element having a certain name from another element having a same name (but for use of the ordinal term), to distinguish the claim elements.

Claims
  • 1. A computer-implemented method of setting alert thresholds related to cybersecurity ratings, the method comprising: calculating a cybersecurity rating for an affiliate entity during a previous time period;comparing an alert reporting threshold to the cybersecurity rating to determine a first number of alerts that would have been generated for the affiliate entity during the previous time period;adjusting the alert reporting threshold to identify a revised alert reporting threshold that results in a second number of alerts for the previous time period, wherein the second number of alerts is different from the first number of alerts; andusing the revised alert reporting threshold to generate future alerts for the affiliate entity.
  • 2. The method of claim 1, wherein the affiliate entity comprises an affiliate of an intended recipient of the alerts.
  • 3. The method of claim 1, wherein the alert reporting threshold comprises a threshold cybersecurity rating.
  • 4. The method of claim 1, wherein the alert reporting threshold comprises a threshold rate of change in the cybersecurity rating.
  • 5. The method of claim 1, wherein the first number of alerts are generated when the cybersecurity rating is either above or below the alert reporting threshold.
  • 6. The method of claim 1, wherein the first number of alerts are generated when a rate of change in the cybersecurity rating is either above or below the alert reporting threshold.
  • 7. The method of claim 1, wherein the adjusting the alert reporting threshold comprises iterating on the alert reporting threshold until the second number of alerts is achieved.
  • 8. The method of claim 1, wherein the adjusting the alert reporting threshold comprises receiving a user-specified number of alerts.
  • 9. The method of claim 1, wherein the adjusting the alert reporting threshold comprises applying an alternative alert reporting threshold against the cybersecurity rating to determine an alternative number of alerts reported for the affiliate entity.
  • 10. The method of claim 1, further comprising sending the future alerts to an intended recipient.
  • 11. A system comprising: one or more computer systems programmed to perform operations comprising: calculating a cybersecurity rating for an affiliate entity during a previous time period;comparing an alert reporting threshold to the cybersecurity rating to determine a first number of alerts that would have been generated for the affiliate entity during the previous time period;adjusting the alert reporting threshold to identify a revised alert reporting threshold that results in a second number of alerts for the previous time period, wherein the second number of alerts is different from the first number of alerts; andusing the revised alert reporting threshold to generate future alerts for the affiliate entity.
  • 12. The system of claim 11, wherein the affiliate entity comprises an affiliate of an intended recipient of the alerts.
  • 13. The system of claim 11, wherein the alert reporting threshold comprises a threshold cybersecurity rating.
  • 14. The system of claim 11, wherein the alert reporting threshold comprises a threshold rate of change in the cybersecurity rating.
  • 15. The system of claim 11, wherein the first number of alerts are generated when the cybersecurity rating is either above or below the alert reporting threshold.
  • 16. The system of claim 11, wherein the first number of alerts are generated when a rate of change in the cybersecurity rating is either above or below the alert reporting threshold.
  • 17. The system of claim 11, wherein the adjusting the alert reporting threshold comprises iterating on the alert reporting threshold until the second number of alerts is achieved.
  • 18. The system of claim 11, wherein the adjusting the alert reporting threshold comprises receiving a user-specified number of alerts.
  • 19. The system of claim 11, wherein the operations further comprise sending the future alerts to an intended recipient.
  • 20. A non-transitory computer-readable medium having instructions stored thereon that, when executed by one or more computer processors, cause the one or more computer processors to perform operations comprising: calculating a cybersecurity rating for an affiliate entity during a previous time period;comparing an alert reporting threshold to the cybersecurity rating to determine a first number of alerts that would have been generated for the affiliate entity during the previous time period;adjusting the alert reporting threshold to identify a revised alert reporting threshold that results in a second number of alerts for the previous time period, wherein the second number of alerts is different from the first number of alerts; andusing the revised alert reporting threshold to generate future alerts for the affiliate entity.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 17/236,594, filed on Apr. 21, 2021, which is a continuation of U.S. patent application Ser. No. 16/884,607, filed May 27, 2020, each of which is hereby incorporated by reference herein in its entirety.

US Referenced Citations (498)
Number Name Date Kind
5867799 Lang et al. Feb 1999 A
6016475 Miller et al. Jan 2000 A
6745150 Breiman Jun 2004 B1
6785732 Bates et al. Aug 2004 B1
6792401 Nigro et al. Sep 2004 B1
7062572 Hampton Jun 2006 B1
D525264 Chotai et al. Jul 2006 S
D525629 Chotai et al. Jul 2006 S
7100195 Underwood Aug 2006 B1
7124055 Breiman Oct 2006 B2
7194769 Lippmann et al. Mar 2007 B2
7290275 Baudoin et al. Oct 2007 B2
7389262 Lange Jun 2008 B1
D604740 Matheny et al. Nov 2009 S
7650570 Torrens et al. Jan 2010 B2
7747778 King et al. Jun 2010 B1
7748038 Olivier et al. Jun 2010 B2
7827607 Sobel et al. Nov 2010 B2
D630645 Tokunaga et al. Jan 2011 S
7971252 Lippmann et al. Jun 2011 B2
8000698 Wolman et al. Aug 2011 B2
D652048 Joseph Jan 2012 S
8150538 Dubinsky Apr 2012 B2
D667022 LoBosco et al. Sep 2012 S
8359651 Wu et al. Jan 2013 B1
8370933 Buckler Feb 2013 B1
8370938 Daswani et al. Feb 2013 B1
8429630 Nickolov et al. Apr 2013 B2
D682287 Cong et al. May 2013 S
D688260 Pearcy et al. Aug 2013 S
8504556 Rice et al. Aug 2013 B1
8505094 Xuewen et al. Aug 2013 B1
D691164 Lim et al. Oct 2013 S
D694252 Helm Nov 2013 S
D694253 Helm Nov 2013 S
8584233 Yang et al. Nov 2013 B1
8601575 Mullarkey Dec 2013 B2
8621621 Burns et al. Dec 2013 B1
8661146 Alex et al. Feb 2014 B2
D700616 Chao Mar 2014 S
8677481 Lee Mar 2014 B1
8683584 Daswani et al. Mar 2014 B1
8752183 Heiderich et al. Jun 2014 B1
8775402 Baskerville et al. Jul 2014 B2
8806646 Daswani et al. Aug 2014 B1
8825662 Kingman et al. Sep 2014 B1
8898776 Molnar et al. Nov 2014 B2
8949988 Adams et al. Feb 2015 B2
8966639 Roytman et al. Feb 2015 B1
D730918 Park et al. Jun 2015 S
9053210 Elnikety et al. Jun 2015 B2
9075990 Yang Jul 2015 B1
D740847 Yampolskiy et al. Oct 2015 S
D740848 Bolts et al. Oct 2015 S
D741351 Kito et al. Oct 2015 S
D746832 Pearcy et al. Jan 2016 S
9241252 Dua et al. Jan 2016 B2
9244899 Greenbaum Jan 2016 B1
9294498 Yampolskiy et al. Mar 2016 B1
D754690 Park et al. Apr 2016 S
D754696 Follett et al. Apr 2016 S
9323930 Satish Apr 2016 B1
D756371 Bertnick et al. May 2016 S
D756372 Bertnick et al. May 2016 S
D756392 Yun et al. May 2016 S
D759084 Yampolskiy et al. Jun 2016 S
D759689 Olson et al. Jun 2016 S
9372994 Yampolskiy et al. Jun 2016 B1
9373144 Ng et al. Jun 2016 B1
D760782 Kendler et al. Jul 2016 S
9384206 Bono et al. Jul 2016 B1
9401926 Dubow et al. Jul 2016 B1
9407658 Kuskov et al. Aug 2016 B1
9420049 Talmor et al. Aug 2016 B1
9424333 Bisignani et al. Aug 2016 B1
9432383 Johns et al. Aug 2016 B2
9479526 Yang Oct 2016 B1
D771103 Eder Nov 2016 S
D771695 Yampolskiy et al. Nov 2016 S
D772276 Yampolskiy et al. Nov 2016 S
9501647 Yampolskiy et al. Nov 2016 B2
D773507 Sagrillo et al. Dec 2016 S
D775635 Raji et al. Jan 2017 S
D776136 Chen et al. Jan 2017 S
D776153 Yampolskiy et al. Jan 2017 S
D777177 Chen et al. Jan 2017 S
9548988 Roundy et al. Jan 2017 B1
9560072 Xu Jan 2017 B1
D778927 Bertnick et al. Feb 2017 S
D778928 Bertnick et al. Feb 2017 S
D779512 Kimura et al. Feb 2017 S
D779514 Baris et al. Feb 2017 S
D779531 List et al. Feb 2017 S
D780770 Sum et al. Mar 2017 S
D785009 Lim et al. Apr 2017 S
D785010 Bachman et al. Apr 2017 S
D785016 Berwick et al. Apr 2017 S
9620079 Curtis Apr 2017 B2
D787530 Huang May 2017 S
D788128 Wada May 2017 S
9641547 Yampolskiy et al. May 2017 B2
9646110 Byrne et al. May 2017 B2
D789947 Sun Jun 2017 S
D789957 Wu et al. Jun 2017 S
9680855 Schultz et al. Jun 2017 B2
9680858 Boyer et al. Jun 2017 B1
D791153 Rice et al. Jul 2017 S
D791834 Eze et al. Jul 2017 S
D792427 Weaver et al. Jul 2017 S
D795891 Kohan et al. Aug 2017 S
9736019 Hardison et al. Aug 2017 B2
D796523 Bhandari et al. Sep 2017 S
D801989 Iketsuki et al. Nov 2017 S
D803237 Wu et al. Nov 2017 S
D804528 Martin et al. Dec 2017 S
D806735 Olsen et al. Jan 2018 S
D806737 Chung et al. Jan 2018 S
D809523 Lipka et al. Feb 2018 S
D809989 Lee et al. Feb 2018 S
D812633 Saneii Mar 2018 S
D814483 Gavaskar et al. Apr 2018 S
D815119 Chalker et al. Apr 2018 S
D815148 Martin et al. Apr 2018 S
D816105 Rudick et al. Apr 2018 S
D816116 Selassie Apr 2018 S
9954893 Zhao et al. Apr 2018 B1
D817970 Chang et al. May 2018 S
D817977 Kato et al. May 2018 S
D818475 Yepez et al. May 2018 S
D819687 Yampolskiy et al. Jun 2018 S
10044750 Livshits et al. Aug 2018 B2
10079854 Scott et al. Sep 2018 B1
10084817 Saher et al. Sep 2018 B2
10142364 Baukes et al. Nov 2018 B2
D835631 Yepez et al. Dec 2018 S
10180966 Lang et al. Jan 2019 B1
10185924 McClintock et al. Jan 2019 B1
10210329 Malik et al. Feb 2019 B1
10217071 Mo et al. Feb 2019 B2
10230753 Yampolskiy et al. Mar 2019 B2
10230764 Ng et al. Mar 2019 B2
10235524 Ford Mar 2019 B2
10242180 Haefner et al. Mar 2019 B2
D847169 Sombreireiro et al. Apr 2019 S
10257219 Geil et al. Apr 2019 B1
10305854 Alizadeh-Shabdiz et al. May 2019 B2
10331502 Hart Jun 2019 B1
10339321 Tedeschi Jul 2019 B2
10339484 Pai et al. Jul 2019 B2
10348755 Shavell et al. Jul 2019 B1
10412083 Zou et al. Sep 2019 B2
D863335 Hardy et al. Oct 2019 S
D863345 Hardy et al. Oct 2019 S
10453142 Mun Oct 2019 B2
10469515 Helmsen et al. Nov 2019 B2
10491619 Yampolskiy et al. Nov 2019 B2
10491620 Yampolskiy et al. Nov 2019 B2
10521583 Bagulho Monteiro Pereira Dec 2019 B1
D872574 Deylamian et al. Jan 2020 S
10540374 Singh et al. Jan 2020 B2
D874506 Kang et al. Feb 2020 S
10572945 McNair Feb 2020 B1
D880512 Greenwald et al. Apr 2020 S
D894939 Braica Sep 2020 S
10764298 Light et al. Sep 2020 B1
10776483 Bagulho Monteiro Pereira Sep 2020 B2
10796260 Brannon et al. Oct 2020 B2
D903693 Li et al. Dec 2020 S
D905712 Li et al. Dec 2020 S
D908139 Hardy et al. Jan 2021 S
10896394 Brannon et al. Jan 2021 B2
10909488 Hecht et al. Feb 2021 B2
D918955 Madden, Jr. et al. May 2021 S
D920343 Bowland May 2021 S
D920353 Boutros et al. May 2021 S
D921031 Tessier et al. Jun 2021 S
D921662 Giannino et al. Jun 2021 S
D921674 Kmak et al. Jun 2021 S
D921677 Kmak et al. Jun 2021 S
D922397 Modi et al. Jun 2021 S
D924909 Nasu et al. Jul 2021 S
11126723 Bagulho Monteiro Pereira Sep 2021 B2
11334832 Dumoulin et al. May 2022 B2
11379773 Vescio Jul 2022 B2
11455322 Yang et al. Sep 2022 B2
11727114 Bagulho Monteiro Pereira Aug 2023 B2
20010044798 Nagral et al. Nov 2001 A1
20020083077 Vardi Jun 2002 A1
20020133365 Grey et al. Sep 2002 A1
20020164983 Raviv et al. Nov 2002 A1
20030011601 Itoh et al. Jan 2003 A1
20030050862 Bleicken et al. Mar 2003 A1
20030074248 Braud et al. Apr 2003 A1
20030123424 Jung Jul 2003 A1
20030187967 Walsh et al. Oct 2003 A1
20040003284 Campbell et al. Jan 2004 A1
20040010709 Baudoin et al. Jan 2004 A1
20040024859 Bloch et al. Feb 2004 A1
20040088570 Roberts et al. May 2004 A1
20040098375 DeCarlo May 2004 A1
20040111358 Lange et al. Jun 2004 A1
20040133561 Burke Jul 2004 A1
20040133689 Vasisht Jul 2004 A1
20040193907 Patanella Sep 2004 A1
20040193918 Green et al. Sep 2004 A1
20040199791 Poletto et al. Oct 2004 A1
20040199792 Tan et al. Oct 2004 A1
20040221296 Ogielski et al. Nov 2004 A1
20040250122 Newton Dec 2004 A1
20040250134 Kohler et al. Dec 2004 A1
20050065807 DeAngelis et al. Mar 2005 A1
20050066195 Jones Mar 2005 A1
20050071450 Allen et al. Mar 2005 A1
20050076245 Graham et al. Apr 2005 A1
20050080720 Betz et al. Apr 2005 A1
20050108415 Turk et al. May 2005 A1
20050131830 Juarez et al. Jun 2005 A1
20050138413 Lippmann et al. Jun 2005 A1
20050160002 Roetter et al. Jul 2005 A1
20050234767 Bolzman et al. Oct 2005 A1
20050278726 Cano et al. Dec 2005 A1
20060036335 Banter et al. Feb 2006 A1
20060107226 Matthews et al. May 2006 A1
20060173992 Weber et al. Aug 2006 A1
20060212925 Shull et al. Sep 2006 A1
20060253581 Dixon et al. Nov 2006 A1
20060271564 Meng Muntz et al. Nov 2006 A1
20070016948 Dubrovsky et al. Jan 2007 A1
20070067845 Wiemer et al. Mar 2007 A1
20070113282 Ross May 2007 A1
20070136622 Price et al. Jun 2007 A1
20070143851 Nicodemus et al. Jun 2007 A1
20070179955 Croft et al. Aug 2007 A1
20070198275 Malden et al. Aug 2007 A1
20070214151 Thomas et al. Sep 2007 A1
20070282730 Carpenter et al. Dec 2007 A1
20080017526 Prescott et al. Jan 2008 A1
20080033775 Dawson et al. Feb 2008 A1
20080047018 Baudoin et al. Feb 2008 A1
20080091834 Norton Apr 2008 A1
20080097980 Sullivan Apr 2008 A1
20080140495 Bhamidipaty et al. Jun 2008 A1
20080140728 Fraser et al. Jun 2008 A1
20080148408 Kao et al. Jun 2008 A1
20080162931 Lord et al. Jul 2008 A1
20080172382 Prettejohn Jul 2008 A1
20080175266 Alperovitch et al. Jul 2008 A1
20080208995 Takahashi et al. Aug 2008 A1
20080209565 Baudoin et al. Aug 2008 A2
20080222287 Bahl et al. Sep 2008 A1
20080262895 Hofmeister et al. Oct 2008 A1
20080270458 Gvelesiani Oct 2008 A1
20090044272 Jarrett Feb 2009 A1
20090064337 Chien Mar 2009 A1
20090094265 Vlachos et al. Apr 2009 A1
20090125427 Atwood et al. May 2009 A1
20090132861 Costa et al. May 2009 A1
20090161629 Purkayastha et al. Jun 2009 A1
20090193054 Karimisetty et al. Jul 2009 A1
20090204235 Dubinsky Aug 2009 A1
20090216700 Bouchard et al. Aug 2009 A1
20090228830 Herz et al. Sep 2009 A1
20090265787 Baudoin et al. Oct 2009 A9
20090276835 Jackson et al. Nov 2009 A1
20090293128 Lippmann et al. Nov 2009 A1
20090299802 Brennan Dec 2009 A1
20090300768 Krishnamurthy et al. Dec 2009 A1
20090319420 Sanchez et al. Dec 2009 A1
20090323632 Nix Dec 2009 A1
20090328063 Corvera et al. Dec 2009 A1
20100017880 Masood Jan 2010 A1
20100024033 Kang et al. Jan 2010 A1
20100042605 Cheng et al. Feb 2010 A1
20100057582 Arfin et al. Mar 2010 A1
20100114634 Christiansen et al. May 2010 A1
20100114757 Jeng et al. May 2010 A1
20100186088 Banerjee et al. Jul 2010 A1
20100205042 Mun Aug 2010 A1
20100218256 Thomas et al. Aug 2010 A1
20100262444 Atwal et al. Oct 2010 A1
20100275263 Bennett et al. Oct 2010 A1
20100281124 Westman et al. Nov 2010 A1
20100281151 Ramankutty et al. Nov 2010 A1
20100309206 Xie et al. Dec 2010 A1
20110137704 Mitra et al. Jun 2011 A1
20110145168 Dirnstorfer et al. Jun 2011 A1
20110145576 Bettan Jun 2011 A1
20110148880 De Peuter Jun 2011 A1
20110185403 Dolan et al. Jul 2011 A1
20110185427 Aciicmez et al. Jul 2011 A1
20110213742 Lemmond et al. Sep 2011 A1
20110219455 Bhagwan et al. Sep 2011 A1
20110225085 Takeshita et al. Sep 2011 A1
20110231395 Vadlamani et al. Sep 2011 A1
20110239300 Klein et al. Sep 2011 A1
20110249002 Duplessis et al. Oct 2011 A1
20110282997 Prince et al. Nov 2011 A1
20110296519 Ide et al. Dec 2011 A1
20120008974 Kawai et al. Jan 2012 A1
20120036263 Madden et al. Feb 2012 A1
20120036580 Gorny et al. Feb 2012 A1
20120059823 Barber et al. Mar 2012 A1
20120089745 Turakhia Apr 2012 A1
20120158725 Molloy et al. Jun 2012 A1
20120166458 Laudanski et al. Jun 2012 A1
20120174219 Hernandez et al. Jul 2012 A1
20120198558 Liu et al. Aug 2012 A1
20120215892 Wanser et al. Aug 2012 A1
20120221376 Austin Aug 2012 A1
20120254993 Sallam Oct 2012 A1
20120255021 Sallam Oct 2012 A1
20120255027 Kanakapura et al. Oct 2012 A1
20120290498 Jones Nov 2012 A1
20120291129 Shulman et al. Nov 2012 A1
20130014253 Neou et al. Jan 2013 A1
20130055386 Kim et al. Feb 2013 A1
20130060351 Imming et al. Mar 2013 A1
20130080505 Nielsen et al. Mar 2013 A1
20130086521 Grossele et al. Apr 2013 A1
20130086687 Chess et al. Apr 2013 A1
20130091574 Howes et al. Apr 2013 A1
20130124644 Hunt et al. May 2013 A1
20130124653 Vick et al. May 2013 A1
20130142050 Luna Jun 2013 A1
20130173791 Longo Jul 2013 A1
20130212479 Willis et al. Aug 2013 A1
20130227078 Wei et al. Aug 2013 A1
20130227697 Zandani Aug 2013 A1
20130238527 Jones Sep 2013 A1
20130263270 Cote et al. Oct 2013 A1
20130276056 Epstein Oct 2013 A1
20130282406 Snyder et al. Oct 2013 A1
20130291105 Yan Oct 2013 A1
20130298244 Kumar et al. Nov 2013 A1
20130305368 Ford Nov 2013 A1
20130333038 Chien Dec 2013 A1
20130347116 Flores et al. Dec 2013 A1
20140006129 Heath Jan 2014 A1
20140019196 Wiggins et al. Jan 2014 A1
20140052998 Bloom et al. Feb 2014 A1
20140101006 Pitt Apr 2014 A1
20140108474 David et al. Apr 2014 A1
20140114755 Mezzacca Apr 2014 A1
20140114843 Klein et al. Apr 2014 A1
20140130158 Wang et al. May 2014 A1
20140137254 Ou et al. May 2014 A1
20140137257 Martinez et al. May 2014 A1
20140146370 Banner et al. May 2014 A1
20140173066 Newton et al. Jun 2014 A1
20140173736 Liu Jun 2014 A1
20140189098 MaGill et al. Jul 2014 A1
20140189864 Wang et al. Jul 2014 A1
20140204803 Nguyen et al. Jul 2014 A1
20140237545 Mylavarapu et al. Aug 2014 A1
20140244317 Roberts et al. Aug 2014 A1
20140282261 Ranz et al. Sep 2014 A1
20140283056 Bachwani et al. Sep 2014 A1
20140283067 Call et al. Sep 2014 A1
20140283068 Call et al. Sep 2014 A1
20140288996 Rence et al. Sep 2014 A1
20140304816 Klein et al. Oct 2014 A1
20140330616 Lyras Nov 2014 A1
20140334336 Chen et al. Nov 2014 A1
20140337086 Asenjo et al. Nov 2014 A1
20140337633 Yang et al. Nov 2014 A1
20140344332 Giebler Nov 2014 A1
20150033331 Stern et al. Jan 2015 A1
20150033341 Schmidtler et al. Jan 2015 A1
20150052607 Al Hamami Feb 2015 A1
20150074579 Gladstone et al. Mar 2015 A1
20150081860 Kuehnel et al. Mar 2015 A1
20150088783 Mun Mar 2015 A1
20150156084 Kaminsky et al. Jun 2015 A1
20150180883 Aktas et al. Jun 2015 A1
20150195299 Zoldi et al. Jul 2015 A1
20150207776 Morin et al. Jul 2015 A1
20150248280 Pillay et al. Sep 2015 A1
20150261955 Huang et al. Sep 2015 A1
20150264061 Ibatullin et al. Sep 2015 A1
20150288706 Marshall Oct 2015 A1
20150288709 Singhal et al. Oct 2015 A1
20150310188 Ford et al. Oct 2015 A1
20150310213 Ronen et al. Oct 2015 A1
20150317672 Espinoza et al. Nov 2015 A1
20150331932 Georges et al. Nov 2015 A1
20150347754 Born Dec 2015 A1
20150347756 Hidayat et al. Dec 2015 A1
20150350229 Mitchell Dec 2015 A1
20150381649 Schultz et al. Dec 2015 A1
20160014081 Don, Jr. et al. Jan 2016 A1
20160023639 Cajiga et al. Jan 2016 A1
20160036849 Zakian Feb 2016 A1
20160065613 Cho et al. Mar 2016 A1
20160078382 Watkins et al. Mar 2016 A1
20160088015 Sivan et al. Mar 2016 A1
20160104071 Brueckner Apr 2016 A1
20160119373 Fausto et al. Apr 2016 A1
20160140466 Sidebottom et al. May 2016 A1
20160147992 Zhao et al. May 2016 A1
20160162602 Bradish et al. Jun 2016 A1
20160171415 Yampolskiy et al. Jun 2016 A1
20160173520 Foster Jun 2016 A1
20160173522 Yampolskiy et al. Jun 2016 A1
20160182537 Tatourian et al. Jun 2016 A1
20160189301 Ng et al. Jun 2016 A1
20160191554 Kaminsky Jun 2016 A1
20160205126 Boyer et al. Jul 2016 A1
20160212101 Reshadi et al. Jul 2016 A1
20160241560 Reshadi et al. Aug 2016 A1
20160248797 Yampolskiy et al. Aug 2016 A1
20160253500 Alme et al. Sep 2016 A1
20160259945 Yampolskiy et al. Sep 2016 A1
20160337387 Hu et al. Nov 2016 A1
20160344769 Li Nov 2016 A1
20160344801 Akkarawittayapoom Nov 2016 A1
20160364496 Li Dec 2016 A1
20160373485 Kamble Dec 2016 A1
20160378978 Singla Dec 2016 A1
20170048267 Yampolskiy et al. Feb 2017 A1
20170063901 Muddu et al. Mar 2017 A1
20170104783 Vanunu et al. Apr 2017 A1
20170142148 Bu Er et al. May 2017 A1
20170161253 Silver Jun 2017 A1
20170161409 Martin Jun 2017 A1
20170213292 Sweeney et al. Jul 2017 A1
20170221072 AthuluruTlrumala et al. Aug 2017 A1
20170223002 Sabin et al. Aug 2017 A1
20170236078 Rasumov Aug 2017 A1
20170237764 Rasumov Aug 2017 A1
20170264623 Ficarra et al. Sep 2017 A1
20170277892 MacDermid Sep 2017 A1
20170279843 Schultz et al. Sep 2017 A1
20170289109 Caragea Oct 2017 A1
20170300911 Alnajem Oct 2017 A1
20170316324 Barrett et al. Nov 2017 A1
20170318045 Johns et al. Nov 2017 A1
20170324555 Wu et al. Nov 2017 A1
20170324766 Gonzalez Nov 2017 A1
20170337487 Nock et al. Nov 2017 A1
20180013716 Connell et al. Jan 2018 A1
20180088968 Myhre et al. Mar 2018 A1
20180103043 Kupreev et al. Apr 2018 A1
20180121659 Sawhney et al. May 2018 A1
20180123934 Gissing et al. May 2018 A1
20180124091 Sweeney et al. May 2018 A1
20180124110 Hunt et al. May 2018 A1
20180139180 Napchi et al. May 2018 A1
20180146004 Belfiore, Jr. et al. May 2018 A1
20180157468 Stachura Jun 2018 A1
20180191768 Broda et al. Jul 2018 A1
20180218157 Price Aug 2018 A1
20180285414 Kondiles et al. Oct 2018 A1
20180322584 Crabtree et al. Nov 2018 A1
20180324201 Lowry et al. Nov 2018 A1
20180332076 Callahan et al. Nov 2018 A1
20180336348 Ng et al. Nov 2018 A1
20180337938 Kneib et al. Nov 2018 A1
20180337941 Kraning et al. Nov 2018 A1
20180349641 Barday et al. Dec 2018 A1
20180365519 Pollard et al. Dec 2018 A1
20180375896 Wang et al. Dec 2018 A1
20190034845 Mo et al. Jan 2019 A1
20190065545 Hazel et al. Feb 2019 A1
20190065748 Foster Feb 2019 A1
20190079869 Baldi et al. Mar 2019 A1
20190089711 Faulkner Mar 2019 A1
20190098025 Lim Mar 2019 A1
20190124091 Ujiie et al. Apr 2019 A1
20190140925 Pon et al. May 2019 A1
20190141060 Lim May 2019 A1
20190147378 Mo et al. May 2019 A1
20190166152 Steele et al. May 2019 A1
20190166156 King-Wilson May 2019 A1
20190179490 Barday et al. Jun 2019 A1
20190215331 Anakata et al. Jul 2019 A1
20190238439 Pugh et al. Aug 2019 A1
20190297106 Geil et al. Sep 2019 A1
20190303574 Lamay et al. Oct 2019 A1
20190362280 Vescio Nov 2019 A1
20190379632 Dahlberg et al. Dec 2019 A1
20190391707 Ristow et al. Dec 2019 A1
20190392252 Fighel et al. Dec 2019 A1
20200012794 Saldanha et al. Jan 2020 A1
20200053127 Brotherton et al. Feb 2020 A1
20200065213 Poghosyan et al. Feb 2020 A1
20200074084 Dorrans et al. Mar 2020 A1
20200092172 Kumaran et al. Mar 2020 A1
20200097845 Shaikh et al. Mar 2020 A1
20200104488 Li et al. Apr 2020 A1
20200106798 Lin Apr 2020 A1
20200125734 Light et al. Apr 2020 A1
20200183655 Barday et al. Jun 2020 A1
20200186546 Dichiu et al. Jun 2020 A1
20200272763 Brannon et al. Aug 2020 A1
20200285737 Kraus et al. Sep 2020 A1
20200356689 McEnroe et al. Nov 2020 A1
20200356695 Brannon et al. Nov 2020 A1
20210064746 Koide et al. Mar 2021 A1
Foreign Referenced Citations (2)
Number Date Country
WO-2017142694 Jan 2019 WO
WO-2019023045 Jan 2019 WO
Non-Patent Literature Citations (219)
Entry
U.S. Appl. No. 14/021,585 U.S. Pat. No. 9,438,615, Security Risk Management, filed Sep. 9, 2013.
U.S. Appl. No. 15/216,955 U.S. Pat. No. 10,326,786 Published as: US 2016/0330231, Methods for Using Organizational Behavior for Risk Ratings, filed Jul. 22, 2016.
U.S. Appl. No. 17/025,930 Published as: US2021/0006581, Methods for Using Organizational Behavior for Risk Ratings, filed Sep. 18, 2020.
U.S. Appl. No. 18/297,863, Methods for Using Organizational Behavior for Risk Ratings, filed Apr. 10, 2023.
U.S. Appl. No. 17/069,151 Published as: US2021/0211454, Information Technology Security Assessment System, filed Oct. 13, 2020.
U.S. Appl. No. 29/598,299 U.S. Pat. No. D818,475, Computer Display With Security Ratings Graphical User Interface, filed Mar. 24, 2017.
U.S. Appl. No. 29/599,622 U.S. Pat. No. D847,169, Computer Display With Security Ratings Graphical User Interface, filed Apr. 5, 2017.
U.S. Appl. No. 29/599,620 U.S. Pat. No. D846,562, Computer Display With Security Ratings Graphical User Interface, filed Apr. 5, 2017.
U.S. Appl. No. 16/543,075 U.S. Pat. No. 10,554,619 Published as: US2019/0379632, Methods for Mapping IP Addresses and Domains to Organizations Using User Activity Data, filed Aug. 16, 2019.
U.S. Appl. No. 17/146,064 Published as: US2021/0218702, Methods for Mapping IP Addresses and Domains to Organizations Using User Activity Data, filed Jan. 11, 2021.
U.S. Appl. No. 17/179,630 Published as US2021/0176269, Correlated Risk in Cybersecurity, filed Feb. 19, 2021.
U.S. Appl. No. 17/401,683 Published as: US2021/0374243, Systems and Methods for Remote Detection of Software Through Browser Webinjects, filed Aug. 13, 2021.
U.S. Appl. No. 18/333,768, Systems and Methods for Remote Detection of Software Through Browser Webinjects, filed Jun. 13, 2023.
U.S. Appl. No. 17/014,495 Published as: US2020/0404017, Systems and Methods for External Detection of Misconfigured Systems, filed Sep. 8, 2020.
U.S. Appl. No. 18/302,925, Systems and Methods for External Detection of Misconfigured Systems, filed Apr. 19, 2023.
U.S. Appl. No. 17/085,550 U.S. Pat. No. 11,329,878 Publihsed as: US2021/0099347, Systems and Methods for Network Asset Discovery and Association Thereof With Entities, filed Oct. 30, 2020.
U.S. Appl. No. 17/523,166 Published as: US2022/0121753, Systems and Methods for Forecasting Cybersecurity Ratings Based on Event-Rate Scenarios, filed Nov. 2021.
U.S. Appl. No. 17/307,577 Published as: US2021/0211454, Systems and Methods for Generating Security Improvement Plans For Entities, filed May 4, 2021.
U.S. Appl. No. 18/138,803, Systems and Methods for Generating Security Improvement Plans For Entities, filed Apr. 25, 2023.
U.S. Appl. No. 17/346,970, Systems and Methods for Assessing Cybersecurity State of Entities Based on Computer Network Characterization, filed 14, 2021.
U.S. Appl. No. 17/132,512 Published as: US2021/0243221, Systems and Methods for Rapidly Generating Security Ratings, filed Dec. 23, 2020.
U.S. Appl. No. 18/158,594, Systems and Methods for Rapidly Generating Security Ratings, filed Jan. 24, 2023.
U.S. Appl. No. 29/815,855, Computer Display With a Graphical User Interface for Cybersecurity Risk Management, filed Nov. 17, 2021.
U.S. Appl. No. 17/392,521 Published as US 2022/0191232, Systems and Methods for Cybersecurity Risk Mitigation and Management, filed Aug. 3, 2021.
U.S. Appl. No. 18/141,654, Systems and Methods for Cybersecurity Risk Mitigation and Management, filed May 1, 2023.
U.S. Appl. No. 17/236,594 Published as: US2021/0374246, Systems and Methods for Managing Cybersecurity Alerts, filed Apr. 21, 2021.
U.S. Appl. No. 18/162,154, Systems and Methods for Assessment of Cyber Resilience, filed Jan. 31, 2023.
“Agreed Upon Procedures,” Version 4.0, BITS, The Financial Institution Shared Assessments Program, Assessment Guide, Sep. 2008, 56 pages.
“Amazon Mechanical Turk,” accessed on the internet at https://www.mturk.com/, (Nov. 9, 2018), 7 pages.
“An Executive View of IT Governance,” IT Governance Institute, 2009, 32 pages.
“Assessing Risk in Turbulent Times,” A Workshop for Information Security Executives, Glassmeyter/McNamee Center for Digital Strategies, Tuck School of Business at Dartmouth, Institute for Information Infrastructure Protection, 2009, 17 pages.
“Assuring a Trusted and Resilient Information and Communications Infrastructure,” Cyberspace Policy Review, May 2009, 76 pages.
“Computer Network Graph,” http://www.opte.org, accessed on the internet at http://www.opte.org, (Nov. 9, 2018), 1 page.
“Creating Transparency with Palantir,” accessed on the internet at https://www.youtube.com/watch?v=8cbGChfagUA; Jul. 5, 2012; 1 page.
“Master Security Criteria,” Version 3.0, BITS Financial Services Security Laboratory, Oct. 2001, 47 pages.
“Neo4j (neo4j.com),” accessed on the internet at https://web.archive.org/web/20151220150341/http://neo4j.com:80/developer/guide-data-visualization/; Dec. 20, 2015; 1 page.
“Palantir Cyber: Uncovering malicious behavior at petabyte scale,” accessed on the internet at https://www.youtube.com/watch?v= EhYezV06EE; Dec. 21, 2012; 1 page.
“Palantir.com,” accessed on the internet at http://www.palantir.com/; Dec. 2015; 2 pages.
“Plugging the Right Holes,” Lab Notes, MIT Lincoln Library, Posted Jul. 2008, retrieved Sep. 14, 2010 from http://www.ll.miLedufpublicationsflabnotesfpluggingtherightho! . . . , 2 pages.
“Rapid7 Nexpose Vulnerability Scanner,” accessed on the internet at https://web.archive.org/web/20170520082737/https://www.rapid7.com/products/nexpose/; May 20, 2017.
“Report on Controls Placed in Operation and Test of Operating Effectiveness,” EasCorp, Jan. 1 through Dec. 31, 2008, prepared by Crowe Horwath, 58 pages.
“Shared Assessments: Getting Started,” BITS, 2008, 4 pages.
“Tenable Nessus Network Vulnerability Scanner,” accessed on the internet at https://www.tenable.com/products/nessus/nessus-professional, (Nov. 9, 2018), 13 pages.
“Twenty Critical Controls for Effective Cyber Defense: Consensus Audit,” Version 2.3, Nov. 13, 2009, retrieved on Apr. 9, 2010 from http://www.sans.org/critical-security-controls/print.php., 52 pages.
2009 Data Breach Investigations Report, study conducted by Verizon Business RISK Team, 52 pages.
Application as filed, and pending claims of U.S. Appl. No. 13/240,572.
Artz, Michael Lyle, “NetSPA: A Network Security Planning Architecture,” Massachusetts Institute of Technology, May 24, 2002, 97 pages.
Azman, Mohamed et al. Wireless Daisy Chain and Tree Topology Networks for Smart Cities. 2019 IEEE International Conference on Electrical, Computer and Communication Technologies (ICECCT). https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber= 8869252 (Year: 2019).
Basinya, Evgeny A.; Yushmanov, Anton A. Development of a Comprehensive Security System. 2019 Dynamics of Systems, Mechanisms and Machines (Dynamics). https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8944700 (Year: 2019).
Bhilare et al., “Protecting Intellectual Property and Sensitive Information in Academic Campuses from Trusted Insiders: Leveraging Active Directory”, SIGUCC, Oct. 2009 (5 pages).
BitSight, “Cyber Security Myths Versus Reality: How Optimism Bias Contributes to Inaccurate Perceptions of Risk”, Jun. 2015, Dimensional Research, pp. 1-9.
Borgatti, et al., “On Social Network Analysis in a Supply Chain Context,” Journal of Supply Chain Management; 45(2): 5-22; Apr. 2009, 18 pages.
Boyer, Stephen, et al., Playing with Blocks: SCAP-Enable Higher-Level Analyses, MIT Lincoln Laboratory, 5th Annual IT Security Automation Conference, Oct. 26-29, 2009, 35 pages.
Browne, Niall, et al., “Shared Assessments Program AUP and SAS70 Frequently Asked Questions,” BITS, 4 pages.
Buckshaw, Donald L., “Use of Decision Support Techniques for Information System Risk Management,” submitted for publication in Wiley's Encyclopedia of Quantitative Risk Assessment in Jan. 2007, 11 pages.
Buehler, Kevin S., et al., “Running with risk,” The Mckinsey Quarterly, No. 4, 2003, pp. 40-49.
Camelo, “Botnet Cluster Identification,” Sep. 2014, 90 pages.
Camelo, “Condenser: A Graph-based Approach for Detecting Botnets,” AnubisNetworks R&D, Amadora, Portugal and Centria, Universidade Nova de Lisboa, Portugal, 8 pages, (Oct. 31, 2014).
Carstens, et al., “Modeling Company Risk and Importance in Supply Graphs,” European Semantic Web Conference 2017: The Semantic Web, pp. 18-31, (May 7, 2017).
Chernyshev, M. et al., “On 802.11 Access Point Locatability and Named Entity Recognition in Service Set Identifiers”, IEEE Trans. on Info. and Sec., vol. 11 No. 3 (Mar. 2016).
Chu, Matthew, et al., “Visualizing Attack Graphs, Reachability, and Trust Relationships with Navigator, ” MIT Lincoln Library, VizSEC '10, Ontario, Canada, Sep. 14, 2010, 12 pages.
Chuvakin, “SIEM: Moving beyond compliance”, RSA White Paper (2010) (16 pages).
Computer Network Graph-Bees, http://bioteams.com/2007/04/30/visualizing_complex_networks.html, date accessed Sep. 28, 2016, 2 pages.
Computer Network Graph-Univ. of Michigan, http://people.cst.cmich.edu/liao1q/research.shtml, date accessed Sep. 28, 2016, 5 pages.
Crowther, Kenneth G., et al., “Principles for Better Information Security through More Accurate, Transparent Risk Scoring,” Journal of Homeland Security and Emergency Management, vol. 7, Issue 1, Article 37, 2010, 20 pages.
Davis, Lois M., et al., “The National Computer Security Survey (NCSS) Final Methodology,” Technical report prepared for the Bureau of Justice Statistics, Safety and Justice Program, Rand Infrastructure, Safety and Environment (ISE), 2008, 91 pages.
Dillon-Merrill, PhD., Robin L, et al., “Logic Trees: Fault, Success, Attack, Event, Probability, and Decision Trees,” Wiley Handbook of Science and Technology for Homeland Security, 13 pages, (Mar. 15, 2009).
Dun & Bradstreet Corp. Stock Report, Standard & Poor's, Jun. 6, 2009, 8 pages.
Dun & Bradstreet, The DUNSRight Quality Process: Power Behind Quality Information, 24 pages.
Edmonds, Robert, “ISC Passive DNS Architecture”, Internet Systems Consortium, Inc., Mar. 2012, 18 pages.
Equifax Inc. Stock Report, Standard & Poor's, Jun. 6, 2009, 8 pages.
Gephi (gephi.org), accessed on the internet at https://web.archive.org/web/20151216223216/https://gephi.org/; Dec. 16, 2015; 1 page.
Gilgur, et al., “Percentile-Based Approach to Forecasting Workload Growth” Proceedings of CMG'15 Performance and Capacity International Conference by the Computer Measurement Group. No. 2015 (Year:2015), 16 pages.
Gundert, Levi, “Big Data in Security—Part III: Graph Analytics,” accessed on the Internet at https://blogs.cisco.com/security/big-data-in-security-part-iii-graph-analytics; Cisco Blog, Dec. 2013, 8 pages.
Hachem, Sara; Toninelli, Alessandra; Pathak, Animesh; Issany, Valerie. Policy-Based Access Control in Mobile Social Ecosystems. 2011 IEEE International Symposium on Policies for Distributed Systems and Networks (Policy). Http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=5976796. 8 pages, (Jun. 6, 2011).
Hacking Exposed 6, S. McClure et al., copyright 2009, 37 pages.
Ingols, Kyle, et al., “Modeling Modern Network Attacks and Countermeasures Using Attack Graphs,” MIT Lincoln Laboratory, 16 pages, (Dec. 7, 2009).
Ingols, Kyle, et al., “Practical Attack Graph Generation for Network Defense,” MIT Lincoln Library, IEEE Computer Society, Proceedings of the 22nd Annual Computer Security Applications Conference (ACSAC'06), 2006, 10 pages.
Ingols, Kyle, et al., “Practical Experiences Using SCAP to Aggregate CND Data,” MIT Lincoln Library, Presentation to NIST SCAP Conference, Sep. 24, 2008, 59 pages.
Jean, “Cyber Security: How to use graphs to do an attack analysis,” accessed on the internet at https://linkurio.us/blog/cyber-security-use-graphs-attack-analysis/; Aug. 2014, 11 pages.
Jin et al., “Identifying and tracking suspicious activities through IP gray space analysis”, MineNet, Jun. 12, 2007 (6 pages).
Johnson, Eric, et al., “Information Risk and the Evolution of the Security Rating Industry,” Mar. 24, 2009, 27 pages.
Joslyn, et al., “Massive Scale Cyber Traffic Analysis: A Driver for Graph Database Research,” Proceedings of the First International Workshop on Graph Data Management Experience and Systems (Grades 2013), 6 pages.
KC Claffy, “Internet measurement and data analysis: topology, workload, performance and routing statistics,” accessed on the Internet at http://www.caida.org/publications/papers/1999/Nae/Nae.html., Nae '99 workshop, 1999, 22 pages.
Li et al., “Finding the Linchpins of the Dark Web: a Study on Topologically Dedicated Hosts on Malicious Web Infrastructures”, IEEE, 2013 (15 pages).
Lippmann, Rich, et al., NetSpa: a Network Security Planning Architecture, MIT Lincoln Laboratory, 11 pages.
Lippmann, Richard, et al., “Validating and Restoring Defense in Depth Using Attack Graphs,” MIT Lincoln Laboratory, 10 pages, (Oct. 23, 2006).
Lippmann, RP., et al., “An Annotated Review of Papers on Attack Graphs,” Project Report IA-1, Lincoln Laboratory, Massachusetts Institute of Technology, Mar. 31, 2005, 39 pages.
Lippmann, RP., et al., “Evaluating and Strengthening Enterprise Network Security Using Attack Graphs,” Project Report IA-2, MIT Lincoln Laboratory, Oct. 5, 2005, 96 pages.
Luo, Hui; Henry, Paul. A Secure Public Wireless LAN Access Technique That Supports Walk-Up Users. Globecom '03. IEEE Global Telecommunications Conference. https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber= 1258471 (Year: 2003).
Maltego XL, accessed on the Internet at https://www.paterva.com/web7/buy/maltego-clients/maltego-xl.php, 5 pages, (Nov. 7, 2018).
Massimo Candela, “Real-time BGP Visualisation with BGPlay,” accessed on the Internet at https://labs.ripe.net/Members/massimo_candela/real-time-bgp-visualisationwith-bgplay), Sep. 30, 2015, 8 pages.
MaxMind, https://www.maxmind.com/en/about-maxmind, https://www.maxmind.com/en/geoip2-isp-database, date accessed Sep. 28, 2016, 3 pages.
McNab, “Network Security Assessment,” copyright 2004, 13 pages.
McNab, “Network Security Assessment,” copyright 2004, 56 pages.
Method Documentation, CNSS Risk Assessment Tool Version 1.1, Mar. 31, 2009, 24 pages.
Mile 2 CPTE Maltego Demo, accessed on the internet at https://www.youtube.com/watch?v=o2oNKOUzPOU; Jul. 12, 2012; 1 page.
Moradi, et al., “Quantitative Models for Supply Chain Management,” IGI Global, 2012, 29 pages.
Morningstar Direct, dated to Nov. 12, 2020, morningstardirect.com [online]. Retrieved Feb. 26, 2021 from internet URL:https://web.archive.org/web/20201112021943/https://www.morningstar.com/products/direct, (Year: 2020).
Netcraft, www.netcraft.com, date accessed Sep. 28, 2016, 2 pages.
NetScanTools Pro, http://www.netscantools.com/nstpromain.html, date accessed Sep. 28, 2016, 2 pages.
Noel, et al., “Big-Data Architecture for Cyber Attack Graphs, Representing Security Relationships in NoSQL Graph Databases,” The Mitre Corporation, 2014, 6 pages.
Nye, John, “Avoiding Audit Overlap,” Moody's Risk Services, Presentation, Source Boston, Mar. 14, 2008, 19 pages.
U.S. Appl. No. 14/021,585.
U.S. Appl. No. 13/240,572 and pending claims.
U.S. Appl. No. 13/240,572, application as filed and pending claims.
U.S. Appl. No. 14/021,585 and pending claims.
U.S. Appl. No. 14/021,585 and application as filed.
U.S. Appl. No. 14/944,484 and pending claims.
U.S. Appl. No. 61/386,156.
Application as filed and pending claims for U.S. Appl. No. 13/240,572.
Application as filed and pending claims for U.S. Appl. No. 14/944,484.
Paxson, Vern, “How The Pursuit of Truth Led Me To Selling Viagra,” EECS Department, University of California, International Computer Science Institute, Lawrence Berkeley National Laboratory, Aug. 13, 2009, 68 pages.
Proposal and Award Policies and Procedures Guide, Part I—Proposal Preparation & Submission Guidelines GPG, The National Science Foundation, Feb. 2009, 68 pages.
Provos et al., “The Ghost In the Browser Analysis of Web-based Malware”, 2007 (9 pages).
Rare Events, Oct. 2009, Jason, The Mitre Corporation, Oct. 2009, 104 pages.
Rees, L. P. et al., “Decision support for cybersecurity risk planning.” Decision Support Systems 51.3 (2011): pp. 493-505.
Report to the Congress on Credit Scoring and Its Effects on the Availability and Affordability of Credit, Board of Governors of the Federal Reserve System, Aug. 2007, 304 pages.
RFC 1834, https://tools.ietf.org/html/rfc1834, date accessed Sep. 28, 2016, 7 pages.
RFC 781, https://tools.ietf.org/html/rfc781, date accessed Sep. 28, 2016, 3 pages.
RFC 950, https://tools.ietf.org/html/rfc950, date accessed Sep. 28, 2016, 19 pages.
RFC 954, https://tools.ietf.org/html/rfc954, date accessed Sep. 28, 2016, 5 pages.
SamSpade Network Inquiry Utility, https://www.sans.org/reading-room/whitepapers/tools/sam-spade-934, date accessed Sep. 28, 2016, 19 pages.
Santos, J. R. et al., “A framework for linking cybersecurity metrics to the modeling of macroeconomic interdependencies.” Risk Analysis: An International Journal (2007) 27.5, pp. 1283-1297.
SBIR Phase I: Enterprise Cyber Security Scoring, CyberAnalytix, LLC, http://www.nsf.gov/awardsearch/showAward. do?AwardNumber=1013603, Apr. 28, 2010, 2 pages.
Search Query Report form IP.com (performed Apr. 27, 2020).
Search Query Report from IP.com (performed Jul. 29, 2022).
Security Warrior, Cyrus Peikari, Anton, Chapter 8: Reconnaissance, 6 pages, (Jan. 2004).
Seigneur et al., A Survey of Trust and Risk Metrics for a BYOD Mobile Worker World: Third International Conference on Social Eco-Informatics, 2013, 11 pages.
Seneviratne et al., “SSIDs in the Wild: Extracting Semantic Information from WiFi SSIDs” HAL archives-ouvertes.fr, HAL Id: hal-01181254, Jul. 29, 2015, 5 pages.
Snort Intrusion Monitoring System, http://archive.oreilly.com/pub/h/1393, date accessed Sep. 28, 2016, 3 pages.
Srivastava, Divesh; Velegrakis, Yannis. Using Queries to Associate Metadata with Data. IEEE 23rd International Conference on Data Engineering. Pub. Date: 2007. http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4221823, 3 pages.
Stone-Gross, Brett, et al., “FIRE: Finding Rogue Networks,” 10 pages, (Dec. 7, 2009).
Taleb, Nassim N., et al., “The Six Mistakes Executives Make in Risk Management,” Harvard Business Review, Oct. 2009, 5 pages.
The CIS Security Metrics vl.0.0, The Center for Internet Security, May 11, 2009, 90 pages.
The Fair Credit Reporting Act (FCRA) of the Federal Trade Commission (FTC), Jul. 30, 2004, 86 pages.
The Financial Institution Shared Assessments Program, Industry Positioning and Mapping Document, BITS, Oct. 2007, 44 pages.
Wagner, et al., “Assessing the vulnerability of supply chains using graph theory,” Int. J. Production Economics 126 (2010) 121-129.
Wikipedia, https://en.wikipedia.org/wiki/Crowdsourcing, date accessed Sep. 28, 2016, 25 pages.
Williams, Leevar, et al., “An Interactive Attack Graph Cascade and Reachability Display,” MIT Lincoln Laboratory, 17 pages, (Jan. 2007).
Williams, Leevar, et al., “Garnet: A Graphical Attack Graph and Reachability Network Evaluation Tool,” MIT Lincoln Library, VizSEC 2009, pp. 44-59, (Sep. 15, 2008).
Winship, C., “Models for sample selection bias”, Annual review of sociology, 18(1) (Aug. 1992), pp. 327-350.
U.S. Appl. No. 15/271,655 Published as: US 2018/0083999, Self-Published Security Risk Management, filed Sep. 21, 2016.
U.S. Appl. No. 15/377,574 U.S. Pat. No. 9,705,932, Methods and Systems for Creating, De-Duplicating, and Accessing Data Using an Object Storage System, filed Dec. 13, 2016.
U.S. Appl. No. 14/021,585 U.S. Pat. No. 9,438,615 Published as: US2015/0074579, Security Risk Management, filed Sep. 9, 2013.
U.S. Appl. No. 15/216,955 U.S. Pat. No. 10,326,786 Published a: US 2016/0330231, Methods for Using Organizational Behavior for Risk Ratings, filed Jul. 22, 2016.
U.S. Appl. No. 15/239,063 U.S. Pat. No. 10,341,370 Published as: US2017/0093901, Security Risk Management, filed Aug. 17, 2016.
U.S. Appl. No. 16/405,121 U.S. Pat. No. 10,785,245 Published as: US2019/0260791, Methods for Using Organizational Behavior for Risk Ratings, filed May 7, 2019.
U.S. Appl. No. 17/025,930 U.S. Pat. No. 11,652,834 Published as: US2021/0006581, Methods for Using Organizational Behavior for Risk Ratings, filed Sep. 18, 2020.
U.S. Appl. No. 18/297,863 Published as: US2023/0247041, Methods for Using Organizational Behavior for Risk Ratings, filed Apr. 10, 2023.
U.S. Appl. No. 13/240,572 U.S. Pat. No. 10,805,331 Published as: US2016/0205126, Information Technology Security Assessment System, filed Sep. 22, 2011.
U.S. Appl. No. 14/944,484 U.S. Pat. No. 9,973,524 Published as: US2016/0323308, Information Technology Security Assessment System, filed Nov. 18, 2015.
U.S. Appl. No. 17/069,151 U.S. Pat. No. 11,777,976 Published as: US2021/0211454, Information Technology Security Assessment System, filed Oct. 13, 2020.
U.S. Appl. No. 18/453,488 Published as: US2023/0403295, Information Technology Security Assessment System, filed Aug. 22, 2023.
U.S. Appl. No. 18/461,087 Published as: US2023/0421600, Information Technology Security Assessment System, filed Sep. 5, 2023.
U.S. Appl. No. 15/142,677 U.S. Pat. No. 9,830,569 Published as: US2016/0239772, Security Assessment Using Service Provider Digital Asset Information, filed Apr. 29, 2016.
U.S. Appl. No. 15/134,845 U.S. Pat. No. 9,680,858, Annotation Platform for a Security Risk System, filed Apr. 21, 2016.
U.S. Appl. No. 15/044,952 U.S. Pat. No. 11,182,720 Published as: US2017/0236077, Relationships Among Technology Assets and Services and the Entities Responsible for Them, filed Feb. 16, 2016.
U.S. Appl. No. 15/089,375 U.S. Pat. No. 10,176,445 Published as: US2017/0236079, Relationships Among Technology Assets and Services and the Entities Responsible for Them, filed Apr. 1, 2016.
U.S. Appl. No. 29/598,298 U.S. Pat. No. D835,631, Computer Display Screen With Graphical User Interface, filed Mar. 24, 2017.
U.S. Appl. No. 29/598,299 U.S. Pat. No. D818,475, Computer Display Screen With Graphical User Interface, filed Mar. 24, 2017.
U.S. Appl. No. 29/599,622 U.S. Pat. No. D847,169, Computer Display Screen With Graphical User Interface, filed Apr. 5, 2017.
U.S. Appl. No. 29/599,620 U.S. Pat. No. S846,562, Computer Display Screen With Graphical User Interface, filed Apr. 5, 2017.
U.S. Appl. No. 16/015,686 U.S. Pat. No. 10,425,380 Published as: US2018/0375822, Methods for Mapping IP Addresses and Domains to Organizations Using User Activity Data, filed Jun. 22, 2018.
U.S. Appl. No. 16/543,075 U.S. Pat. No. 10,554,619 Published as: US Published as: US2019/0379632, Methods for Mapping IP Addresses and Domains to Organizations Using User Activity Data, filed Aug. 16, 2019.
U.S. Appl. No. 16/738,825 U.S. Pat. No. 10,893,021 Published as: US2020/0153787, Methods for Mapping IP Addresses and Domains to Organizations Using User Activity Data, filed Jan. 9, 2020.
U.S. Appl. No. 17/146,064 U.S. Pat. No. 11,627,109 Published as: US2021/0218702, Methods for Mapping IP Addresses and Domains to Organizations Using User Activity Data, filed Jan. 11, 2021.
U.S. Appl. No. 15/918,286 U.S. Pat. No. 10,257,219, Correlated Risk in Cybersecurity, filed Mar. 12, 2018.
U.S. Appl. No. 16/292,956 U.S. Pat. No. 10,594,723 Published as: US2019/0297106, Correlated Risk in Cybersecurity, filed Mar. 5, 2019.
U.S. Appl. No. 16/795,056 U.S. Pat. No. 10,931,705 Published as: US2020/0195681, Correlated Risk in Cybersecurity, filed Feb. 19, 2020.
U.S. Appl. No. 17/179,630 U.S. Pat. No. 11,770,401 Published as: US2021/0176269, Correlated Risk in Cybersecurity, filed Feb. 19, 2021.
U.S. Appl. No. 18/365,384 Published as: US2023/0396644, Correlated Risk in Cybersecurity, filed Aug. 4, 2023.
U.S. Appl. No. 16/170,680 U.S. Pat. No. 10,521,583, Systems and Methods for Remote Detection of Software Through Browser Webinjects, filed Oct. 25, 2018.
U.S. Appl. No. 16/688,647 U.S. Pat. No. 10,776,483 Published as: US2020/0134174, Systems and Methods for Remote Detection of Software Through Browser Webinjects, filed Nov. 19, 2019.
U.S. Appl. No. 17/000,135 U.S. Pat. No. 11,126,723 Published as: US2021/0004457, Systems and Methods for Remote Detection of Software Through Browser Webinjects, filed Aug. 21, 2020.
U.S. Appl. No. 17/401,683 U.S. Pat. No. 11,727,114 Published as: US2021/0374243, Systems and Methods for Remote Detection of Software Through Browser Webinjects, filed Aug. 13, 2021.
U.S. Appl. No. 18/333,768 Published as: US2023/0325502, Systems and Methods for Remote Detection of Software Through Browser Webinjects, filed Jun. 13, 2023.
U.S. Appl. No. 15/954,921 U.S. Pat. No. 10,812,520 Published as: US2019/0319979, Systems and Methods for External Detection of Misconfigured Systems, filed Apr. 17, 2018.
U.S. Appl. No. 17/014,495 U.S. Pat. No. 11,671,441 Published as: US2020/0404017, Systems and Methods for External Detection of Misconfigured Systems, filed Sep. 8, 2020.
U.S. Appl. No. 18/302,925 Published as: US2023/0269267, Systems and Methods for External Detection of Misconfigured Systems, filed Apr. 19, 2023.
U.S. Appl. No. 16/549,764 Published as: US2021/0058421, Systems and Methods for Inferring Entity Relationships via Network Communications of Users or User Devices, filed Aug. 23, 2019.
U.S. Appl. No. 16/787,650 U.S. Pat. No. 10,749,893, Systems and Methods for Inferring Entity Relationships via Network Communications of Users or User Devices. filed Feb. 11, 2020.
U.S. Appl. No. 16/583,991 U.S. Pat. No. 10,848,382, Systems and Methods for Network Asset Discovery and Association Thereof With Entities, filed Sep. 26, 2019.
U.S. Appl. No. 17/085,550 U.S. Pat. No. 11,329,878 Published as: US2021/0099347, Systems and Methods for Network Asset Discovery and Association Thereof With Entities, filed Oct. 30, 2020.
U.S. Appl. No. 29/666,942 U.S. Pat. No. D892,135, Computer Display With Graphical User Interface, filed Oct. 17, 2018.
U.S. Appl. No. 16/360,641 U.S. Pat. No. 11,200,323 Published as: US2020/0125734, Systems and Methods for Forecasting Cybersecurity Ratings Based on Event-Rate Scenarios, filed Mar. 21, 2019.
U.S. Appl. No. 17/523,166 U.S. Pat. No. 11,783,052 Published as: US2022/0121753, Systems and Methods for Forecasting Cybersecurity Ratings Based on Event-Rate Scenarios, filed Nov. 10, 2021.
U.S. Appl. No. 18/455,838, Systems and Methods for Forecasting Cybersecurity Ratings Based on Event-Rate Scenarios, filed Aug. 25, 2023.
U.S. Appl. No. 16/514,771 U.S. Pat. No. 10,726,136, Systems and Methods for Generating Security Improvement Plans for Entities, filed Jul. 17, 2019.
U.S. Appl. No. 16/922,673 U.S. Pat. No. 11,030,325 Published as: US2021/0019424, Systems and Methods for Generating Security Improvement Plans for Entities, filed Jul. 7, 2020.
U.S. Appl. No. 17/307,577 U.S. Pat. No. 11,675,912 Published as: US2021/0211454, Systems and Methods for Generating Security Improvement Plans for Entities, filed May 4, 2021.
U.S. Appl. No. 18/138,803 Published as US2023/0267215, Systems and Methods for Generating Security Improvement Plans for Entities, filed Apr. 25, 2023.
U.S. Appl. No. 29/677,306 U.S. Pat. No. D905,702, Computer Display Screen With Corporate Hierarchy Graphical User Interface, filed Jan. 18, 2019.
U.S. Appl. No. 16/775,840 U.S. Pat. No. 10,791,140, Systems and Methods for Assessing Cybersecurity State of Entities Based on Computer Network Characterization, filed Jan. 29, 2020.
U.S. Appl. No. 17/018,587 U.S. Pat. No. 11,050,779, Systems and Methods for Assessing Cybersecurity State of Entities Based on Computer Network Characterization, filed Sep. 11, 2020.
U.S. Appl. No. 16/779,437 U.S. Pat. No. 10,893,067 Published as: US2021/0243221, Systems and Methods for Rapidly Generating Security Ratings, filed Jan. 31, 2020.
U.S. Appl. No. 17/132,512 U.S. Pat. No. 11,595,427 Published as: US2021/0243221, Systems and Methods for Rapidly Generating Security Ratings, filed Dec. 23, 2020.
U.S. Appl. No. 18/158,594 U.S. Pat. No. 11,777,983, Systems and Methods for Rapidly Generating Security Ratings, filed Jan. 24, 2023.
U.S. Appl. No. 18/454,959, Systems and Methods for Rapidly Generating Security Ratings, filed Aug. 24, 2023.
U.S. Appl. No. 17/119,822 U.S. Pat. No. 11,122,073, Systems and Methods for Cybersecurity Risk Mitigation and Management, filed Dec. 11, 2020.
U.S. Appl. No. 29/815,855 U.S. Pat. No. D1010666, Computer Display With a Graphical User Interface for Cybersecurity Risk Management, filed Nov. 17, 2021.
U.S. Appl. No. 17/392,521 U.S. Pat. No. 11,689,555 Published as US 2022/0191232, Systems and Methods for Cybersecurity Risk Mitigation and Management, filed Aug. 3, 2021.
U.S. Appl. No. 18/141,654 Published as: US2023/0269265, Systems and Methods for Cybersecurity Risk Mitigation and Management, filed May 1, 2023.
U.S. Appl. No. 29/916,503, Computer Display With a Graphical User Interface, filed Nov. 13, 2023.
U.S. Appl. No. 29/916,519, Computer Display With a Graphical User Interface, filed Nov. 13, 2023.
U.S. Appl. No. 16/802,232 U.S. Pat. No. 10,764,298, Systems and Methods for Improving a Security Profile of an Entity Based on Peer Security Profiles, filed Feb. 26, 2020.
U.S. Appl. No. 16/942,452 U.S. Pat. No. 11,265,330 Published as: US2021/0266324, Systems and Methods for Improving a Security Profile of an Entity Based on Peer Security Profiles, filed Jul. 29, 2020.
U.S. Appl. No. 29/725,724, Computer Display With Risk Vectors Graphical User Interface, filed Feb. 26, 2020.
U.S. Appl. No. 29/736,641 U.S. Pat. No. D937,870, Computer Display With Peer Analytics Graphical User Interface, filed Jun. 2, 2020.
U.S. Appl. No. 17/039,675 U.S. Pat. No. 11,032,244 Published as: US2021/0099428, Systems and Methods for Determining Asset Importance in Security Risk Management, filed Sep. 30, 2020.
U.S. Appl. No. 17/320,997 Published as US 2021/0344647, Systems and Methods for Determining Asset Importance in Security Risk Management, filed May 14, 2021.
U.S. Appl. No. 16/884,607 U.S. Pat. No. 11,023,585, Systems and Methods for Managing Cybersecurity Alerts, filed May 27, 2020.
U.S. Appl. No. 17/236,594 U.S. Pat. No. 11,720,679 Published as: US2021/0374246, Systems and Methods for Managing Cybersecurity Alerts, filed Apr. 21, 2021.
U.S. Appl. No. 17/710,168 Published as: US2022/0318400, Systems and Methods for Assessing Cybersecurity Risk in a Work From Home Environment, filed Mar. 31, 2022.
U.S. Appl. No. 17/945,337 Published as US2023/0091953, Systems and Methods for Precomputation of Digital Asset Inventories, filed Sep. 15, 2022.
U.S. Appl. No. 18/359,183, Systems and Methods for Assessing Cybersecurity Efficacy of Entities Against Common Control and Maturity Frameworks Using Externally-Observed Datasets, filed Jul. 26, 2023.
U.S. Appl. No. 17/856,217 Published as: US2023/0004655, Systems and Methods for Accelerating Cybersecurity Assessments, filed Jul. 1, 2022.
U.S. Appl. No. 18/162,154 Published as: US2023/0244794, Systems and Methods for Assessment of Cyber Resilience, filed Jan. 31, 2023.
U.S. Appl. No. 18/328,142, Systems and Methods for Modeling Cybersecurity Breach Costs, filed Jun. 2, 2023.
Related Publications (1)
Number Date Country
20230325505 A1 Oct 2023 US
Continuations (2)
Number Date Country
Parent 17236594 Apr 2021 US
Child 18335384 US
Parent 16884607 May 2020 US
Child 17236594 US