Systems and methods for improving a security profile of an entity based on peer security profiles

Information

  • Patent Grant
  • 11265330
  • Patent Number
    11,265,330
  • Date Filed
    Wednesday, July 29, 2020
    4 years ago
  • Date Issued
    Tuesday, March 1, 2022
    3 years ago
Abstract
A computer-implemented method is provided for comparing the security profile of a particular entity to peer entities. The method can include receiving, for a particular entity, (i) a value for at least one feature and (ii) a number of security records of one or more security risk types. The method can include determining peer entities based on the value of the features; obtaining, for each peer entity, a number of security records; and adjusting the number of peer security records based on the number of entity security records. The method can further include comparing, for one or more security risk types, the received number of security records for the particular entity to the respective adjusted number of security records for each peer entity; and comparing a security profile of the particular entity to security profiles of the population of peer entities based on the comparison for the security risk types.
Description
TECHNICAL FIELD

The following disclosure is directed to methods and systems for determining peer entities of a particular entity based on the entity features and comparing a security profile of the particular entity to security profiles of the peer entities to improve the particular entity's security profile.


BACKGROUND

As awareness of cybersecurity risk increases, entities (e.g., organizations, companies, etc.) look to understand their exposure to security threats and, in some cases, seek guidance on the types of protective measures that can be taken to minimize their exposure. Some entities seek to understand how they compare with peer entities in terms of threat exposure and the measures that their peer entities are undertaking to protect themselves. However, due to the substantial variation in entity features, operating procedures, historical records, and security resources among entities, it is difficult to directly or efficiently compare one entity to another entity in the context of cybersecurity risk.


SUMMARY

Disclosed herein are exemplary systems and methods for comparing a particular entity to peer entities so as to enable the particular entity to improve its security profile. For example, the entity may improve its security profile by reducing its exposure to security threats and/or determining the measures the particular entity can take that would have greater impact on its security profile. The exemplary methods and systems described herein efficiently provide this information to stakeholders associated with the particular entity. Note that an entity can include an organization, a company, a group, a school, a government, etc.


In one aspect, the disclosure features a computer-implemented method including receiving, for a particular entity, (i) a value for one or more features of the entity and (ii) a number of security records for the entity, in which each security record being of a security risk type. The method can further include determining a population of peer entities based on the value of the features; obtaining, for each peer entity, a number of security records; and adjusting the number of peer security records based on the number of entity security records. The method can further include comparing, for one or more security risk types, the received number of security records for the particular entity to the respective adjusted number of security records for each peer entity; comparing a security profile of the particular entity to security profiles of the population of peer entities based on the comparison for the security risk types; and presenting the comparison of the security profiles in a user interface.


Various embodiments of the exemplary method can include one or more of the following features. The method can include determining an impact of each security risk type on an entity security profile; and presenting one or more security risk types based on the determined impact. Presenting the security risk types based on the determined impact can include determining a rank of each security risk type for improving the entity security profile; and presenting a ranking of two or more security risk types based on the determined rank of each security risk type. Determining an impact of each security risk type on an entity security profile can include determining a temporal decay for the security risk type; and adjusting the impact of the security risk type based on the temporal decay.


Determining the population of peer entities based on the value of one or more features can include determining the population of peer entities based on a value of a weighted combination of two or more features. The feature(s) can include an industry of an entity; a security rating of an entity; a software platform utilized by an entity; a geographical location of an entity; or a size of an entity. The industry of an entity can include an industry name and/or a sector name. The geographical location of an entity can be based on a physical location and/or an Internet Protocol (IP) address. The software platform utilized by an entity can be for a server system of the entity, a user base of the entity, and/or a website of the entity. The size of an entity can be based on a number of employees of the entity and/or a number of services provided by the entity. The population of peer entities can include at least 100 peer entities.


In another aspect, the disclosure features a system including one or more computer systems programmed to perform operations. The operations can include receiving, for a particular entity, (i) a value for one or more features of the entity and (ii) a number of security records for the entity, in which each security record being of a security risk type. The operations can further include determining a population of peer entities based on the value of the features; obtaining, for each peer entity, a number of security records; and adjusting the number of peer security records based on the number of entity security records. The operations can further include comparing, for one or more security risk types, the received number of security records for the particular entity to the respective adjusted number of security records for each peer entity; comparing a security profile of the particular entity to security profiles of the population of peer entities based on the comparison for the security risk types; and presenting the comparison of the security profiles in a user interface.


Various embodiments of the exemplary system can include one or more of the following features. The operations can include determining an impact of each security risk type on an entity security profile; and presenting one or more security risk types based on the determined impact. Presenting the security risk types based on the determined impact can include determining a rank of each security risk type for improving the entity security profile; and presenting a ranking of two or more security risk types based on the determined rank of each security risk type. Determining an impact of each security risk type on an entity security profile can include determining a temporal decay for the security risk type; and adjusting the impact of the security risk type based on the temporal decay.


Determining the population of peer entities based on the value of one or more features can include determining the population of peer entities based on a value of a weighted combination of two or more features. The feature(s) can include an industry of an entity; a security rating of an entity; a software platform utilized by an entity; a geographical location of an entity; or a size of an entity. The industry of an entity can include an industry name and/or a sector name. The geographical location of an entity can be based on a physical location and/or an Internet Protocol (IP) address. The software platform utilized by an entity can be for a server system of the entity, a user base of the entity, and/or a website of the entity. The size of an entity can be based on a number of employees of the entity and/or a number of services provided by the entity. The population of peer entities can include at least 100 peer entities.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is graphical representation of an exemplary user interface that can include options for the user to select or enter one or more features for a particular entity.



FIG. 2A is a graphical representation of an exemplary user interface for presenting comparisons between the security profile of the particular entity and the security profiles of peer entities. FIG. 2B is a graphical representation of an exemplary user interface for presenting comparisons between the security risk types for the particular entity and the respective security risk types for peer entities. FIGS. 2C-2D are graphical representations of exemplary user interfaces that include detailed peer group information for particular security risk types.



FIG. 3 is a graphical representation of an exemplary user interface for presenting information related to the impact of a security risk type on a security profile of a particular entity.



FIG. 4 is a flowchart of an exemplary method for comparing a security profile of a particular entity to the security profiles of peer entities.



FIGS. 5A-5C are plots illustrating exemplary adjustments of the security record counts of a security risk type for a peer entity group.



FIG. 6 is a block diagram of an exemplary computer system that may be used in implementing the systems and methods described herein.





DETAILED DESCRIPTION

Disclosed herein are exemplary embodiments of systems and methods for comparing a particular entity to peer entities. The exemplary methods may include one or more of the following sub-methods, as described in further detail below:


I. Exemplary methods for determining one or more peer entities of a particular entity based on one or more features of the particular entity; and/or


II. Exemplary methods for adjusting the number of records of peer entities based on the number of records of the particular entity.


Further disclosed herein are exemplary embodiments of systems and methods for improving a security profile of the particular entity based on the comparison to peer entities. The exemplary methods may include one or more of the following sub-methods, as described in further detail below:


III. Exemplary methods for generating improvement plans for a particular entity based on the comparison to peer entities;


IV. Exemplary methods for prioritizing one or more security risk types for improving the security profile of the entity; and/or


V. Exemplary methods for forecasting a security profile of the particular entity based on the security profiles of peer entities.


Entity Features

In some embodiments, the exemplary methods and systems can include determining one or more peer entities of a particular entity based on one or more features of the particular entity (“Entity A”). The exemplary methods can include receiving or obtaining values for one or more features of the entity.


The features of an entity can include an industry; a sub-industry; a North American Industry Classification System (NAILS) code; a Standard Industrial Classification (SIC) code; an industry sector; an entity size; an employee count; a number of services provided by the entity; a security rating (e.g., as provided by BitSight Technologies, Inc. of Boston, Mass., USA); a geographical location of the entity; a location of the entity based on one or more IP addresses associated with the entity (e.g., “geo IP” footprint); a number of Internet Protocol (IP) addresses associated with the entity; the technology used by the entity (e.g., server software, user software, etc.); one or more security risk types of an entity (e.g., refer to the exemplary security risk types under heading “Security Risk Types and Security Records”); and/or known competitors or entities similar to the particular entity based on the web activity of the entity.


Values for one or more of the above-listed entity features may be provided by the entity itself, obtained from third party sources (e.g., a firmographics data source, data from BuiltWith® Pty Ltd), and/or collected or extracted from publicly available information. In some embodiments, the values for one or more entity features can be stored in a database.


Peer Groups

The received value for the feature(s) of the particular entity can be used to determine the peer entities for the particular entity. These peer entities may be referred to herein as a “population of peer entities” or a “peer group”. In some embodiments, to determine the group of peer entities, the system can access a database of entities and corresponding values for various features. The exemplary system can then search the database based on the received value to determine entities that are peers to the particular entity.


In some embodiments, the system can populate a peer entity group with entities that are within a particular range (e.g., within 50%, within 25%, within 10%, etc.) of the feature value of the particular entity. In some embodiments, a threshold can be utilized to ensure that a large enough number of peer entities are included the peer group. For instance, if the particular range for a feature value does not yield a minimum number (e.g., at least 50, at least 100, at least 150, etc.) of entities for the peer group, then a minimum number (e.g., at least 50, at least 100, at least 150, etc.) of entities having feature values similar to that of the particular entity are selected for the peer group.


For the feature of entity size, the received value (e.g., the employee count) of the particular entity can be compared to the corresponding values (e.g., the employee count) of the entities. Therefore, for example, for a particular range of within 50% (also represented as ±50%), if Entity A has 400 employees, entities having between 200 to 600 employees are included in the peer entity group of Entity A. If the particular range does not yield a minimum number of 100 entities, then 100 entities having an employee count closest to Entity A are selected for the peer entity group.


In some embodiments, the peer group can be determined such that the peer entities are selected for values of two or more entities features. If, in such a case, the resulting number of peer entities is below a minimum number (e.g., at least 50, at least 100, at least 150, etc.) of entities for the peer group), then the range of values for one or more features may be relaxed to ensure that the peer group includes at least a minimum number of peers. For example, if the peer group is to be determined based on (1) employee count and (2) geographical location and this determination leads to a peer group of less than the minimum number of peer entities, then the range of employee count of the particular entity and/or the physical radius around the particular entity can be increased to attain the minimum number of peer entities.


In some embodiments, the system can include a user interface to enable a user to enter value for one or more features of the particular entity to determine peer entities for the peer group. Exemplary user interfaces may include drop-down boxes to select from a list, radio buttons to select a single value or value range, check boxes to select one or more values, text fields to enter values, a sliding bar to select a value or value range, etc. FIG. 1 illustrates an exemplary user interface 100 that can include options for the user to select or enter one or more entity features, as described above. For example, a feature option 102 can be used to select an industry of the entity; a feature option 104 can be used select a sub-industry of the entity; a feature option 106 can be used select a range for employee count (e.g., “Similar to Company” or any number of employees); and/or a feature option 108 can be used to select a number of services offered by the entity (e.g., “Similar to Company” or any number of services).


In some embodiments, to determine peer entities for a peer group, a distance measure can be determined between the particular entity and a set of candidate entities (e.g., entities in a database) based on one or more respective values of entity features. For example, a distance measure may be determined for each entity feature between the particular entity and each of the set of entities. In some embodiments, the distance measures can be normalized, e.g., by converting the distance measure to a Z-score (which indicates the number of standard deviations away from a mean value).


In some embodiments, for each candidate entity, the normalized distance measures between the particular entity and the candidate entity can be combined. In some embodiments, the normalized distance measures can be combined in a weighted sum. The weights may be predetermined or provided by a user via a user interface. Of the determined sums of the candidate entities, a subset of candidate entities can be determined for the peer group by selecting sums under a threshold, thereby collecting those entities closest to the particular. The threshold can be predetermined or determined dynamically (e.g., based on a standard deviation). For example, of 300 candidate entities' sums, the 100 smallest candidate entities' sums can be used to select the corresponding 100 peer entities for the peer group.


As discussed above, in some embodiments, this technique of identifying peer entities can be customizable by the user. For example, a user seeking to determine a peer group may be more interested in the software that is commonly used within the peer group. In this way, a user may ultimately be able to determine whether a security risk common to the peer group is due to a particular software used by all the peer entities (as discussed further herein below). In another example, a user may wish to determine how to improve the security profile (including, e.g., the security rating) of the particular entity. Therefore, it may be beneficial to determine peer entities to evaluate comparable security profiles.


In some embodiments, a peer entity group for a particular entity can change over time. This can be true when the features of the entity and/or the features of its peers change over time. Therefore, the comparison between a particular entity and peer entities may change over time. In some embodiments, the method can include determining peer entities for the particular entity periodically or intermittently so as to ‘update’ the peer entity group.


Security Risk Types and Security Records

In some embodiments, determining security profiles of entities uses externally observable information as proxies for (i) the effectiveness of the overall security performance of the policies and controls that entity implements and exercises and/or (ii) the vulnerability of the entity to security risk. This externally observable information can be categorized into observable subject areas, risk types, or “risk vectors”, which can each be independently determined and/or characterized. For example, one possible proxy for entity vulnerability is the number of entity-owned IP addresses which are reported by third parties to be malicious. The greater the number of reports, the more likely the particular entity was vulnerable and had been compromised.


The security profile may include the security practices and/or security record(s) of an entity. The security records can be of a particular security risk type (also referred to herein as a “risk vector”). In various embodiments, the security risk types can include:

    • i. an amount of capital investment in security of the entity;
    • ii. a measure of employee training in security of the entity;
    • iii. a measure of organization of a team dedicated to information security;
    • iv. an amount of budget dedicated to information security;
    • v. a number and/or severity of botnet infection instances of a computer system associated with the entity (referred to herein as “botnet infections”);
    • vi. a number of spam propagation instances originating from a computer network associated with the entity (referred to herein as “Spam Propagation”);
    • vii. a number of malware servers associated with the entity (referred to herein as “Malware Servers”);
    • viii. a number of potentially exploited devices associated with the entity (referred to herein as “Potentially Exploited”);
    • ix. a number of hosts authorized to send emails on behalf of each domain associated with the entity;
    • x. a determination of whether a DomainKeys Identified Mail (DKIM) record exists for each domain associated with the entity and/or a key length of a public key associated with a Domain Name System (DNS) record of each domain associated with the entity (referred to herein as “MUM”);
    • xi. an evaluation of a Secure Sockets Layer (SSL) certificate and/or a Transport Layer Security (TLS) certificate associated with a computer system of the entity (referred to herein as “SSL Certificates”);
    • xii. a number and/or type of service of open ports of a computer network associated with the entity (referred to herein as “Open Ports”);
    • xiii. an evaluation of security-related fields of an header section of HTTP response messages of hosts associated with the entity (referred to herein as “Web Application Headers”);
    • xiv. a rate at which vulnerabilities are patched in a computer network associated with the entity;
    • xv. an evaluation of file sharing traffic originating from a computer network associated with the entity (referred to herein as “File Sharing”);
    • xvi. 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 entity;
    • xvii. 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) (referred to herein as “Unsolicited Communication”), which may occur in some cases due to malware scanning for open network access points on other computers over the Internet;
    • xviii. a signal and/or an indication that TLS/SSL configuration of an entity's server is proper, which can indicate that the security protocol libraries of a server associated with an entity are correctly configured and/or support strong encryption standards when making connections to other computer systems (referred to herein as “SSL Configuration”);
    • xix. a signal and/or an indication that entity's server system has software that is not supported by software vendors and/or is out-of-date (referred to herein as “Server Software”);
    • xx. a presence of Sender Policy Framework (SPF) record(s) in the entity's domain (including subdomains) (e.g., of an entity's mail server system) that have sent or attempted to send an email (referred to herein as “SPIE”);
    • xxi. data indicating the operating system version and/or web browser version of one or more computer systems of the entity (referred to herein as “Desktop Software”);
    • xxii. a number of endpoints (e.g., computer, server, mobile device, media system, and/or appliance having Internet access) of an entity's computer system in communication with an unintended destination (e.g., a web domain that does not exist or not registered) (referred to herein as “Insecure Systems”); and/or
    • xxiii. data indicating the operating system version, device description, web browser version, description of applications of one or more mobile devices in the entity's computer network (referred to herein as “Mobile Software”).


In some embodiments, the exemplary methods can include receiving security records of the particular entity and/or receiving the number of security records for the particular entity. For example, the number of security records can be the number over a time window (e.g., the past five years, past three years, past year, past quarter, past month, etc.) for the particular entity. Note that a security record may be associated with a timestamp for which the record was made. The number of the entity's security records can be used for a ‘like-for-like’ comparison between the security profile of the particular entity and that of its peer entities. For example, a particular entity may have a relatively short history of monitoring its security profile and therefore may have relatively few security records. In another example, a particular entity may be a smaller or larger organization than its peers and therefore its security record count may be proportionally fewer or greater. Therefore, to make a more direct comparison of security profiles between the particular entity and its peers, the security records of the peer entities can be adjusted accordingly. Table 1 below illustrates a simple example of an adjustment of a peer entity's records based on the particular entity's records.









TABLE 1







Exemplary adjustment of the number of peer security records.











# of security
# of security
# of adjusted



records for
records for
security records



Entity A
Peer Entity 1
for Peer Entity 1














Total records
10
100
10


Negative records
2
20
2










Note that ‘negative records’ indicate security records of a risk type for which the value is negative. An example of a negative security record is a record that Entity A experienced a botnet infection at a particular time. Conversely, if there was a security evaluation of Entity A and no botnet infections were uncovered, then a positive security record may be logged. Note also that if the adjusted record number for a peer entity results in a count less than one (1), then the record number may be automatically set to one (1).


In some embodiments, the exemplary methods can include receiving IP addresses of the particular entity and/or receiving the number of IP addresses for the particular entity. For example, the number of IP addresses can be can be the number over a time window (e.g., the past five years, past three years, past year, past quarter, past month, etc.) for the computer system of the particular entity. The number of the entity's IP addresses can be used for a ‘like-for-like’ comparison between the security profile of the particular entity and that of its peer entities.


In some embodiments, the exemplary methods can include adjusting the number of security records and/or their impact on an entity's profile based on the age associated with the particular security record. For example, a negative security record in the distant history (e.g., five years ago) for entity may be deemphasized or not as equally weighted as a more recent security record (e.g., within the last six months). In some embodiments, the age of a security record of a peer entity may be adjusted as follows:







A
temporal

=


(

1
+



i



(




t
present

-

t
record_i



t
interval


*

N
record


)



)

/

(



i



(

N
record

)


)







where Atemporal is the temporal adjustment, tpresent is the present date, trecord_i is the timestamp of the security record, tinterval is the time over the interval of interest (e.g., a month, a quarter, a year, etc.), and Nrecord is the number of records in the interval of interest.


In some embodiments, adjusting the number of security records and/or their impact on an entity's profile can be based on (i) the age associated with the particular security record and (ii) an entity feature (see examples of entity features described above). For example, the security record count of a peer entity for both age and employee count may be adjusted as follows:







N
adjusted_peer

=


N
record_peer

*



N

e

mployee_peer





N

employee_entit

y




*


A
temporal_peer


A

temporal_entit

y









where Nadjusted_peer is the adjusted peer record count, Nemployee_peer is the peer employee count, Nemployee_entity is the employee count for the particular entity, Atemporal_peer is the temporal adjustment for the peer security records (e.g., as determined by the equation for Atemporal above), and Atemporal_entity is the temporal adjustment for the security records of the particular entity (e.g., as determined by the equation for Atemporal above).


Security Profile

A security profile of an entity may reflect the past, present, and/or future security characteristics of an entity. In some embodiments, the security profile may reflect security risks to which the entity is exposed balanced by the countermeasures that the entity has taken or can take to mitigate the security risk. As referred to herein, a security profile of an entity can include a security rating for the 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, Mass., USA).


Examples of determining security ratings of entities based on the security risk types can be found in at least U.S. 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”, all of which are incorporated herein by reference in their entireties.


In some embodiments, received data for an entity can include two or more security risk types (e.g., of those listed above). In some cases, determining the security rating for an entity can include determining the relationship between the first security risk type and the second security risk type. This relationship can be stored in a database and accessed for use. For example, the number of botnet infections of an entity may be correlated with the number of potentially exploited devices associated with the entity. This correlation can be stored and referenced in the future. In some embodiments, the security profile of an entity is associated with, related to, or equal to the security rating of that entity (e.g., on a scale from 300 to 900, as provided by BitSight Technologies, Inc., Boston, Mass., USA).


In some embodiments, to compute the security ratings for an entity, obtained data pertaining to the IT assets owned by that entity may be aggregated. For example, IT assets can include the IP addresses controlled by the entity and obtained data can include the activity associated with those IP addresses. To determine externally observable information about IP address-based assets, one or more IP addresses can be associated with an entity. The data may be processed to determine additional information. For example, processing may yield a list of IP addresses for an entity that has demonstrated suspicious or malicious behavior or fails to follow best security practices for the given reference data point. Similar methods can be used for other types of assets, e.g., domain-based assets, or other information for which an asset can be determined to be associated to an organization. Using these techniques, information about that asset can be associated with the entity.


The exemplary security ratings systems and methods may be configured to account for differences in data sources and types. Given each data source's potentially unique insight of an entity, there can be two or more techniques used to take advantage of the respective data. Data source-specific modeling techniques may be applied to some or all of the data sources to demonstrate feasibility and validate the approach for each data source and modeling technique.


In some embodiments, the combination of two or more vectors may produce a security rating that reflects the effectiveness of an entity's security efforts. The determination of individual vectors and the overall security rating can be influenced by security best-practices as promoted by standardized and accepted cybersecurity frameworks. In some embodiments, evidence of security compromise can be used to understand the specific impact the individual vectors have on the security rating of the entity. For instance, correlation between sources of externally observed information can be used to determine the impact of vectors. For example, the vectors representing evidence of compromised workstations (owned or controlled by an entity) may represent a significant portion of the entity's ability to implement security controls correctly, and thus may influence the entity's security rating more than other types of information.


An improved security rating reflects improvements made to the security profile of the entity. Specifically, the security profile of an entity may be based on records of one or more security risk types, as described above. These input parameters are typically modifiable in that an entity can change or improve the value of the parameter, thereby improving its security rating. For example, an entity can strive to decrease the number of botnet infections or decrease the number of malware-infected servers. By doing so, an entity's security rating may increase, e.g., from 680 to 720, indicating an improved ability to withstand or prevent cybersecurity attacks. An improved security rating can also increase confidence of various stakeholders of the entity that the entity is more secure and/or protected from cybersecurity risks that it had previously been. Examples of improving security ratings of an entity can be found in 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, which is incorporated herein by reference in its entirety.


In some embodiments, improving an entity's security profile can include determining which security risk types (refer to discussion under heading “Security Risk Types and Security Records” above) the entity should focus on mitigating. Various security risk types may have different impacts on the security profile of an entity. For example, security records of a first risk type may have a greater impact on the entity's security profile than a record of a second risk type. Therefore, the exemplary method may include determining the impact of the security risk type on the entity's security profile. In some embodiments, the impact that a security record has may depend on the security risk type, the amount of time passed since the security record, and/or the temporal decay associated with the security risk type.


In some embodiments, the comparison between a particular entity's security ratings and peer entities' security ratings can be used in forecasting security ratings for the particular entity. Forecasting security ratings for entities by taking into account future security events can aid entities in realistically managing their cybersecurity vulnerabilities. Additionally, forecasts of security ratings can help third parties, such as insurance providers or business partners, in evaluating an organization's exposure to and ability to address cyber threats into the future. In some embodiments, using comparable data of peer entities' security profiles enables more accurate forecasts of security ratings and, in some instances, specific forecasts of the security risk types that the entity may encounter based on its peers' historical record.


In some embodiments, in forecasting security ratings for a particular entity for a time period, the possible range of future security ratings that the particular entity can have can be based on the historical security ratings of the peer entities. For instance, the future security ratings of the particular entity can be bound by an upper limit and/or a lower limit based on peer entities' historical security ratings. In some embodiments, these upper and lower limits may be symmetrical. For example, future security ratings can be within a range determined by a lower limit of 5th percentile, 10th percentile, 20th percentile, etc. and an upper limit of 95th percentile, 90th percentile, 80th percentile, etc., respectively. In some embodiments, the upper and lower limits may be asymmetrical. For example, the upper limit may be 10th percentile while the lower limit may be 20th percentile. In some embodiments, the upper and lower limits may be expressed as a standard deviation from a mean or median of peer entities' security ratings. In some embodiments, the future time period (e.g., a month, quarter, half year, year, etc.) of the particular entity for which the security ratings are being forecasted can correspond to the historical time period (e.g., a month, quarter, half year, year, etc.) of the peer entities. For example, a historical time period of the past four months of peer entities' security ratings can be used to determine a future four month time period of security ratings for the particular entity.


In some embodiments, to more accurately forecast security ratings for a particular entity, the constituent peer entities of a peer group may be adjusted. For example, if a particular entity has a security rating of 600 at a particular time to and wants to attain a security rating of 750 in a year or more, peer entities having a security rating of 600 a year ago (t0-t365) are selected for comparison. In this way, a more realistic comparison between the particular entity and the peer entities can be made. Further, such a peer group can provide a more realistic future projection for the particular entity's security rating. In the above example, peer entities that were able to improve their security rating from 600 to 750 over a time period of a year can be useful in determining how to improve the particular entity's security rating, e.g., by determining which security risk types to mitigate or resolve.


In another example, a particular entity (“Entity A”) with a letter grade F (depending on the particular entity compares to its peer group percentile) can compare its security profile to peer entities in its peer group. An example peer entity (“Peer Entity 1”) having a letter grade B may be twice the size of Entity A (e.g., in terms of employee count or service count) and/or may have had different security records (e.g., at different times, of different security risk types, and/or of a different number) over a past time period. The security records of Peer Entity 1 can be adjusted using the techniques described herein to more accurately inform Entity A how best to set future goals (e.g., by managing their own security records) for achieving a better letter grade in their peer group. Examples of forecasting security ratings for entities can be found in U.S. patent application Ser. No. 16/360,641 titled “Systems and Methods for Forecasting Cybersecurity Ratings based on Event-Rate Scenarios” and filed on Mar. 21, 2019, which is incorporated herein by reference in its entirety.


Exemplary User Interfaces


FIG. 2A illustrates an exemplary user interface 200a that includes a comparison between a particular entity's security ratings and the peer entities' security ratings. For example, the user interface 200a can include a plot 202 (e.g., a bar chart, a histogram, a line graph, a dot graph, etc.) of the percentage of the peer group as a function of security ratings (e.g., in a rating range). Peer entities may be determined using the exemplary methods described herein and bucketed into security rating ranges for comparison to the particular entity. In this example, Entity A has a security rating of 520, which is comparably less than its peers, the bottom 25% of which averages at a security rating of 690, the median of which averages at a security rating of 730, and the top 25% of which averages at a security rating of 760.



FIG. 2B illustrates an exemplary user interface 200b that includes a graphical comparison between a particular entity's security risk types (also referred to as “risk vectors”) and the peer entities' security risk types. The interface 200b can include a graph (e.g., a half circle chart, a circle chart, a pie chart, a line chart, a dot chart, etc.) illustrating how the entity compares to its peers with respect to one or more security risk types. In this example, Entity A is worse than its peers for seven security risk types, in line with its peers for four security risk types, and better than its peers for 5 security risk types. Some or all of these risk types can be presented in portions 206 and/or 208 of interface 200b. For example, the ‘worse’ risk types include Botnet Infections, File Sharing, and Spam Propagation, as illustrated in portion 206. The ‘better’ risk types include Malware Servers, Unsolicited Communications, and Server Software, as illustrated in portion 208.



FIGS. 2C-2D illustrate exemplary user interfaces 200c and 200d that include one or more portions for detailed peer group information for particular security risk types. For example, portion 210 includes Botnet Infection types for the peer group and indicates whether the given type affects the particular entity (referred to as “Company” or “Entity A”). In another example, portion 212 includes Open Port types for the peer group. In another example, portion 214 includes Vulnerability types for the peer group. In another example, portion 216 includes Unsupported Software types for the peer group. In some embodiments, user interfaces 200a, 200b, 200c, and/or 200d can be included in a single user interface. For example, interface 200a can be arranged on top of (and adjacent to) interface 200b in a single interface. In another example, interface 200a can be arranged on top of (and adjacent to) interface 200b, which can be arranged on top of (and adjacent to) interface 200c, which can be arranged on top of (and adjacent to) 200d.



FIG. 3 illustrates an exemplary user interface 300 for presenting information related to the impact of a security risk type on a security profile (e.g., security rating) of a particular entity (in this example, “Entity A”). For example, the user interface 300 can include a portion 302 listing one or more security risk types (also referred to as “risk vectors”) which impact the security profile of the entity. For example, in column 304, security risk types including “Botnet infections”, “File Sharing”, “Spam Propagation”, “Potentially Exploited”, “Open Ports”, “Web Applications”, and/or “SSL Configurations” can be listed. The exemplary portion 302 may also include information related to how the particular Entity A compares to its peer group (as discussed above). For example, in column 306, the comparison between a particular and its peer group may be quantified as a percentile (e.g., “Bottom 3% of the Peer Group”; “Better than 51% of the Peer Group”; etc.). In column 308, the comparison may be qualitatively presented as a letter grade (e.g., grades A through F). For example, grade A may be indicated for high degree of mitigation of the security risk type while grade F may be indicated for poor mitigation. Exemplary column 308 can include a letter grade for the entity (labelled “Company”), a letter grade for the median of the peer group, and/or a letter grade for the top 25% of the peer group with respect to the particular security risk type.


Because security risk types can have differing impacts on an entity's security profile, in some embodiments, security risk types may be ranked according to their impact on an entity's security profile. The security risk types may be ranked numerically or in categories. Referring to portion 302, the exemplary security risk types may be ranked “Low”, “Medium”, or “High”. Exemplary column 304 can include a rank indicator and/or a priority indicator for the particular security risk type. For example, Botnet Infections may be considered to have a high impact on an entity's security profile and therefore may be listed higher on the list or marked as such. The priority indicator (e.g., “Low”, “Medium”, “High”, or “Very High”) in column 304 can indicate how high the entity should prioritize the mitigation of the particular security risk type to improve its security profile.


In some embodiments, a user interface may include a graphical representation of the impact that risk types have on an entity's security profile. For example, interface 300 includes a portion 310 that presents risk types as a function of (i) the comparison of the entity to its peer group, (ii) ranking according to its impact on an entity's security profile, and/or (iii) a priority indicator to indicate how high the entity should prioritize the mitigation of the particular security risk type to improve its security profile. In this example, these functions are presented as a matrix 312. The matrix 312 can include spaces or slots for presenting the various risk types. Various techniques can be used to present the ranking and/or prioritization of the security risk types, including colors, placement, sounds, patterns, animations, etc. In this example, the matrix 312 can be shaded or colored to indicate the priority from “Low” (e.g., matrix block 314a), “Medium” (e.g., matrix block 314b), “High” (e.g., matrix block 314c), to “Very High” (e.g., matrix block 314d). The various security risk types may be arranged in the matrix 312 in the bottom row (“Low” rank of impact), middle row (“Medium” rank of impact), or top row (“High” rank of impact). The various security risk types may be arranged in the matrix 312 in the left column (“Better than most of Peer Group (in Top 25%)”), middle column (“In Line with Peer Group), or right column (“Worse than most of Peer Group (in Bottom 25%)”).


Exemplary Methods


FIG. 4 is a flowchart illustrating an exemplary method 400 for comparing a security profile of an entity to the security profiles of peer entities. In step 402, the method includes receiving, for a particular entity, (i) a value for one or more features of the entity and (ii) a number of security records for the entity. The security record can be of a security risk type, as described above. Additionally or alternatively, the method may include receiving a number of IP addresses for the particular entity.


In step 404, the method can include determining a population of peer entities (e.g., a peer group) based on the respective values of the entity features, as described above under heading “Peer Groups”.


In step 406, the method can include obtaining, for each peer entity, a number of security records. Additionally or alternatively, the method may include obtaining, for each peer entity, a number of IP addresses.


In step 408, the method can include adjusting the number of peer security records based on the number of security records of the particular entity. Additionally or alternatively, the method may include adjusting the number of peer security records based on the temporal decay (see discussion above). Additionally or alternatively, the method may include adjusting the number of peer IP addresses based on the number of entity IP addresses.



FIGS. 5A-5C illustrate the adjustment of the security record counts of a security risk type for a peer entity group. Note that the key of letter grades A, B, C, D, and F corresponds to percentiles into which peer entities fall. For example, peer entities that are in the 91st to 100th percentile of the peer group attain a letter grade A; peer entities that are in the 71st to 90th percentile of the peer group attain a letter grade B; peer entities that are in the 41st to 70th percentile of the peer group attain a letter grade C; peer entities that are in the 21st to 40th percentile of the peer group attain a letter grade D; peer entities that are in the 20th and below percentile of the peer group attain a letter grade F. FIG. 5A is a plot of peer security records for the security risk type “Botnet Infections” in which no adjustment was made to the security records. FIG. 5B is a plot of peer security records of FIG. 5A in which the security records are adjusted for employee count. As compared to the unadjusted records in FIG. 5A, the adjustment in FIG. 5B can cause a wider redistribution of the security records among the letter grades. FIG. 5C is a plot of peer security records of FIG. 5A in which the security records are adjusted for employee count and for temporal decay. The redistribution of the records in FIG. 5C can be more pronounced due to the additional adjustment.


In step 410, the method can include comparing, for one or more security risk types, the received number of security records for the particular entity to the respective adjusted number of security records for each peer entity. Additionally or alternatively, the method may include comparing the number of entity IP addresses based on the adjusted number of IP addresses for each peer entity.


In some embodiments, the method can include determining an impact of each security risk type on the security profile of a particular entity. In some embodiments, the method can include determining a temporal decay for the security risk type, as described above. The method can further include adjusting the impact of the security risk type based on the temporal decay.


In some embodiments, the method can include determining a rank of each security risk type for improving the security profile (e.g., security rating) of the particular entity. The impact and/or ranking of the security risk types may be presented, as described above and illustrated in FIG. 3.


In step 412, the method can include comparing a security profile of the particular entity security profiles of the population of peer entities based on the comparison for respective security risk types.


In step 414, the method can include presenting the comparison of the security profiles in a user interface, as described above.


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. In some examples, some types of processing occur on one device and other types of processing occur on another device. In some examples, 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, or via cloud-based storage. In some examples, some data are stored in one location and other data are stored in another location. In some examples, quantum computing can be used. In some examples, functional programming languages can be used. In some examples, electrical memory, such as flash-based memory, can be used.



FIG. 6 is a block diagram of an example computer system 600 that may be used in implementing the technology described in this document. General-purpose computers, network appliances, mobile devices, or other electronic systems may also include at least portions of the system 600. The system 600 includes a processor 610, a memory 620, a storage device 630, and an input/output device 640. Each of the components 610, 620, 630, and 640 may be interconnected, for example, using a system bus 650. The processor 610 is capable of processing instructions for execution within the system 600. In some implementations, the processor 610 is a single-threaded processor. In some implementations, the processor 610 is a multi-threaded processor. The processor 610 is capable of processing instructions stored in the memory 620 or on the storage device 630.


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


The storage device 630 is capable of providing mass storage for the system 600. In some implementations, the storage device 630 is a non-transitory computer-readable medium. In various different implementations, the storage device 630 may include, for example, a hard disk device, an optical disk device, a solid-date 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 640 provides input/output operations for the system 600. In some implementations, the input/output device 640 may include one or more of a 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 660. 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 630 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. 6, 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 comprising: receiving, for a particular entity, (i) a value for at least one feature of the entity and (ii) a number of security records for the entity, each security record being of a security risk type;determining a population of peer entities based on the value of the at least one feature;obtaining, for each peer entity, a number of security records;adjusting the number of peer security records based on the number of entity security records;comparing, for at least one security risk type, the received number of security records for the particular entity to the respective adjusted number of security records for each peer entity;presenting the comparison in a user interface;determining an impact of each security risk type on an entity security profile, wherein the entity security profile is based on two or more security risk types; andpresenting at least one security risk type based on the determined impact.
  • 2. The method of claim 1, wherein presenting the at least one security risk type based on the determined impact comprises: determining a rank of each security risk type for improving the entity security profile; andpresenting a ranking of at least two security risk types based on the determined rank of each security risk type.
  • 3. The method of claim 1, wherein determining the impact of each security risk type on the entity security profile comprises: determining a temporal decay for the security risk type; andadjusting the impact of the security risk type based on the temporal decay.
  • 4. The method of claim 1, wherein determining the population of peer entities based on the value of the at least one feature comprises: determining the population of peer entities based on a value of a weighted combination of at least two features.
  • 5. The method of claim 1, wherein the at least one feature comprises: an industry of an entity;a security rating of an entity;a software platform utilized by an entity;a geographical location of an entity; ora size of an entity.
  • 6. The method of claim 5, wherein the industry of an entity comprises at least one of: an industry name or a sector name.
  • 7. The method of claim 5, wherein the geographical location of an entity is based on at least one of: a physical location or an Internet Protocol (IP) address.
  • 8. The method of claim 5, wherein the software platform utilized by an entity is for least one of: a server system of the entity, a user base of the entity, or a website of the entity.
  • 9. The method of claim 5, wherein the size of an entity is based on at least one of: a number of employees of the entity or a number of services provided by the entity.
  • 10. The method of claim 1, wherein the population of peer entities comprises at least 100 peer entities.
  • 11. A system comprising: one or more computer systems programmed to perform operations comprising: receiving, for a particular entity, (i) a value for at least one feature of the entity and (ii) a number of security records for the entity, each security record being of a security risk type;determining a population of peer entities based on the value of the at least one feature;obtaining, for each peer entity, a number of security records;adjusting the number of peer security records based on the number of entity security records;comparing, for at least one security risk type, the received number of security records for the particular entity to the respective adjusted number of security records for each peer entity;presenting the comparison in a user interface;determining an impact of each security risk type on an entity security profile, wherein the entity security profile is based on two or more security risk types; andpresenting at least one security risk type based on the determined impact.
  • 12. The system of claim 11, wherein presenting the at least one security risk type based on the determined impact comprises: determining a rank of each security risk type for improving the entity security profile; andpresenting a ranking of at least two security risk types based on the determined rank of each security risk type.
  • 13. The system of claim 11, wherein determining the impact of each security risk type on the entity security profile comprises: determining a temporal decay for the security risk type; andadjusting the impact of the security risk type based on the temporal decay.
  • 14. The system of claim 11, wherein determining the population of peer entities based on the value of the at least one feature comprises: determining the population of peer entities based on a value of a weighted combination of at least two features.
  • 15. The system of claim 11, wherein the at least one feature comprises: an industry of an entity;a security rating of an entity;a software platform utilized by an entity;a geographical location of an entity; ora size of an entity.
  • 16. The system of claim 15, wherein the industry of an entity comprises at least one of: an industry name or a sector name.
  • 17. The system of claim 15, wherein the geographical location of an entity is based on at least one of: a physical location or an Internet Protocol (IP) address.
  • 18. The system of claim 15, wherein the software platform utilized by an entity is for least one of: a server system of the entity, a user base of the entity, or a website of the entity.
  • 19. The system of claim 15, wherein the size of an entity is based on at least one of: a number of employees of the entity or a number of services provided by the entity.
  • 20. The system of claim 11, wherein the population of peer entities comprises at least 100 peer entities.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of U.S. patent application Ser. No. 16/802,232 filed Feb. 26, 2020 and titled “System and Methods For Improving A Security Profile of An Entity Based On Peer Security Profiles,” the entirety of which is incorporated herein by reference.

US Referenced Citations (364)
Number Name Date Kind
5867799 Lang et al. Feb 1999 A
6016475 Miller et al. Jan 2000 A
6792401 Nigro et al. Sep 2004 B1
7062572 Hampton Jun 2006 B1
D525264 Chotai Jul 2006 S
D525629 Chotai Jul 2006 S
7100195 Underwood Aug 2006 B1
7194769 Lippmann et al. Mar 2007 B2
7290275 Baudoin et al. Oct 2007 B2
D604740 Matheny Nov 2009 S
7650570 Torrens Jan 2010 B2
7747778 King Jun 2010 B1
7748038 Olivier et al. Jun 2010 B2
7827607 Sobel et al. Nov 2010 B2
D630645 Tokunaga Jan 2011 S
7971252 Lippmann et al. Jun 2011 B2
D652048 Joseph Jan 2012 S
D667022 LoBosco Sep 2012 S
8370933 Buckler Feb 2013 B1
8429630 Nickolov et al. Apr 2013 B2
D682287 Cong May 2013 S
D688260 Pearcy Aug 2013 S
8504556 Rice et al. Aug 2013 B1
D691164 Lim Oct 2013 S
D694252 Helm Nov 2013 S
D694253 Helm Nov 2013 S
8584233 Yang et al. Nov 2013 B1
8621621 Burns et al. Dec 2013 B1
8661146 Alex et al. Feb 2014 B2
D700616 Chao Mar 2014 S
8677481 Lee Mar 2014 B1
8775402 Baskerville Jul 2014 B2
8825662 Kingman et al. Sep 2014 B1
D730918 Park Jun 2015 S
9053210 Elnikety Jun 2015 B2
9075990 Yang Jul 2015 B1
D740847 Yampolskiy et al. Oct 2015 S
D740848 Bolts Oct 2015 S
D741351 Kito Oct 2015 S
D746832 Pearcy Jan 2016 S
9241252 Dua et al. Jan 2016 B2
9244899 Greenbaum Jan 2016 B1
9294498 Yampolskiy et al. Mar 2016 B1
D754690 Park Apr 2016 S
D754696 Follett Apr 2016 S
D756371 Bertnick May 2016 S
D756372 Bertnick May 2016 S
D756392 Yun May 2016 S
D759084 Yampolskiy et al. Jun 2016 S
D759689 Olson Jun 2016 S
9372994 Yampolskiy et al. Jun 2016 B1
9373144 Ng et al. Jun 2016 B1
D760782 Kendler 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 Aug 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 Dec 2016 S
D775635 Raji Jan 2017 S
D776136 Chen Jan 2017 S
D776153 Yampolskiy et al. Jan 2017 S
D777177 Chen Jan 2017 S
9560072 Xu Jan 2017 B1
D778927 Bertnick Feb 2017 S
D778928 Bertnick Feb 2017 S
D779512 Kimura Feb 2017 S
D779514 Baris Feb 2017 S
D779531 List Feb 2017 S
D780770 Sum Mar 2017 S
D785009 Lim Apr 2017 S
D785010 Bachman Apr 2017 S
D785016 Berwick 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 May 2017 B2
D789947 Sun Jun 2017 S
D789957 Wu Jun 2017 S
9680858 Boyer et al. Jun 2017 B1
D791153 Rice Jul 2017 S
D791834 Eze Jul 2017 S
D792427 Weaver Jul 2017 S
D795891 Kohan Aug 2017 S
D796523 Bhandari Sep 2017 S
D801989 Iketsuki Nov 2017 S
D803237 Wu Nov 2017 S
D804528 Martin Dec 2017 S
D806735 Olsen Jan 2018 S
D806737 Chung Jan 2018 S
D809523 Lipka Feb 2018 S
D809989 Lee et al. Feb 2018 S
D812633 Saneii Mar 2018 S
D814483 Gavaskar Apr 2018 S
D815119 Chalker Apr 2018 S
D815148 Martin Apr 2018 S
D816105 Rudick Apr 2018 S
D816116 Selassie Apr 2018 S
9954893 Zhao et al. Apr 2018 B1
D817970 Chang May 2018 S
D817977 Kato 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
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
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
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
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
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
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
20030050862 Bleicken et al. Mar 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
20040098375 DeCarlo May 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
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 Dec 2005 A1
20060036335 Banter Feb 2006 A1
20060107226 Matthews May 2006 A1
20060173992 Weber et al. Aug 2006 A1
20060212925 Shull et al. Sep 2006 A1
20060253581 Dixon et al. Nov 2006 A1
20070016948 Dubrovsky et al. Jan 2007 A1
20070067845 Wiemer et al. Mar 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
20080033775 Dawson et al. Feb 2008 A1
20080047018 Baudoin et al. Feb 2008 A1
20080091834 Norton Apr 2008 A1
20080140495 Bhamidipaty et al. Jun 2008 A1
20080140728 Fraser 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
20090044272 Jarrett Feb 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
20090216700 Bouchard et al. Aug 2009 A1
20090265787 Baudoin et al. Oct 2009 A9
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
20100042605 Cheng et al. Feb 2010 A1
20100057582 Arfin Mar 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
20110137704 Mitra Jun 2011 A1
20110145576 Bettan Jun 2011 A1
20110185403 Dolan et al. Jul 2011 A1
20110213742 Lemmond et al. Sep 2011 A1
20110219455 Bhagwan et al. Sep 2011 A1
20110231395 Vadlamani Sep 2011 A1
20110239300 Klein et al. Sep 2011 A1
20110282997 Prince et al. Nov 2011 A1
20110296519 Ide et al. Dec 2011 A1
20120036263 Madden 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
20120198558 Liu et al. Aug 2012 A1
20120215892 Wanser Aug 2012 A1
20120255027 Kanakapura et al. Oct 2012 A1
20120291129 Shulman et al. Nov 2012 A1
20130014253 Vivian 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 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
20130227078 Wei et al. Aug 2013 A1
20130282406 Snyder Oct 2013 A1
20130291105 Zheng Oct 2013 A1
20130298244 Kumar et al. Nov 2013 A1
20130305368 Ford Nov 2013 A1
20130333038 Chien Dec 2013 A1
20130347116 Flores Dec 2013 A1
20140006129 Heath Jan 2014 A1
20140019196 Wiggins Jan 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
20140146370 Banner et al. May 2014 A1
20140189098 MaGill 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
20140283068 Call et al. Sep 2014 A1
20140288996 Rence et al. Sep 2014 A1
20140304816 Klein et al. Oct 2014 A1
20140334336 Chen et al. Nov 2014 A1
20140337633 Yang et al. Nov 2014 A1
20150033331 Stern et al. Jan 2015 A1
20150033341 Schmidtler et al. Jan 2015 A1
20150074579 Gladstone et al. Mar 2015 A1
20150081860 Kuehnel et al. Mar 2015 A1
20150156084 Kaminsky et al. Jun 2015 A1
20150180883 Aktas et al. Jun 2015 A1
20150248280 Pillay et al. Sep 2015 A1
20150261955 Huang et al. Sep 2015 A1
20150264061 Ibatullin 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
20150347756 Hidayat et al. Dec 2015 A1
20150350229 Mitchell Dec 2015 A1
20150381649 Schultz et al. Dec 2015 A1
20160036849 Zakian Feb 2016 A1
20160065613 Cho et al. Mar 2016 A1
20160088015 Sivan et al. Mar 2016 A1
20160119373 Fausto et al. Apr 2016 A1
20160140466 Sidebottom May 2016 A1
20160147992 Zhao et al. May 2016 A1
20160162602 Bradish et al. Jun 2016 A1
20160171415 Yampolskiy et al. 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
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
20160344801 Akkarawittayapoom Nov 2016 A1
20160364496 Li Dec 2016 A1
20160373485 Kamble Dec 2016 A1
20170048267 Yampolskiy et al. Feb 2017 A1
20170063901 Muddu et al. Mar 2017 A1
20170142148 Buer et al. May 2017 A1
20170161409 Martin Jun 2017 A1
20170221072 AthuluruTlrumala et al. Aug 2017 A1
20170236078 Rasumov Aug 2017 A1
20170237764 Rasumov Aug 2017 A1
20170279843 Schultz et al. Sep 2017 A1
20170300911 Alnajem Oct 2017 A1
20170316324 Barrett et al. Nov 2017 A1
20170318045 Johns et al. Nov 2017 A1
20170324766 Gonzalez Nov 2017 A1
20170337487 Nock et al. Nov 2017 A1
20180013716 Connell et al. Jan 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 May 2018 A1
20180124110 Hunt et al. May 2018 A1
20180139180 Napchi et al. May 2018 A1
20180157468 Stachura Jun 2018 A1
20180285414 Kondiles et al. Oct 2018 A1
20180322584 Crabtree 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
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
20190179490 Barday et al. Jun 2019 A1
20190215331 Anakata et al. Jul 2019 A1
20190303574 Lamay et al. Oct 2019 A1
20190379632 Dahlberg et al. Dec 2019 A1
20190391707 Ristow et al. Dec 2019 A1
20190392252 Fighel et al. Dec 2019 A1
20200053127 Brotherton et al. Feb 2020 A1
20200074084 Dorrans et al. Mar 2020 A1
20200183655 Barday et al. Jun 2020 A1
20200272763 Brannon et al. Aug 2020 A1
20200356695 Brannon et al. Nov 2020 A1
Foreign Referenced Citations (2)
Number Date Country
WO-2017142694 Aug 2017 WO
WO-2019023045 Jan 2019 WO
Non-Patent Literature Citations (218)
Entry
“Agreed Upon Procedures,” Version 4.0, BITS, The Financial Institution Shared Assessments Program, Assessment Guide, Sep. 2008, 56 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.
“Master Security Criteria,” Version 3.0, BITS Financial Services Security Laboratory, Oct. 2001, 47 pages.
“Plugging the Right Holes,” Lab Notes, MIT Lincoln Library, Posted Jul. 2008, retrieved Sep. 14, 2010 from http://www.ll.miLedufpublicationsflabnotesfpluggingtherightho! . . . , 2 pages.
“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.
“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.
Artz, Michael Lyle, “NetSPA: A Network Security Planning Architecture,” Massachusetts Institute of Technology, May 24, 2002, 97 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.
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.
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 pagse.
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.
The 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.
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.
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.
Johnson, Eric, et al., “Information Risk and the Evolution of the Security Rating Industry,” Mar. 24, 2009, 27 pages.
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.
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.
MaxMind, https://www.maxmind.com/en/about-maxmind, https://www.maxmind.com/en/geoip2-isp-database, date accessed Sep. 28, 20116, 3 pages.
Method Documentation, CNSS Risk Assessment Tool Version 1.1, Mar. 31, 2009, 24 pages.
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.
Network Security Assessment, C. McNab, copyright 2004, 13 pages.
Nye, John, “Avoiding Audit Overlap,” Moody's Risk Services, Presentation, Source Boston, Mar. 14, 2008, 19 pages.
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 1—Proposal Preparation & Submission Guidelines GPG, The National Science Foundation, Feb. 2009, 68 pages.
Rare Events, Oct. 2009, JASON, The MITRE Corporation, Oct. 2009, 104 pages.
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 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.
RFC 1834, https://tools.ietf.org/html/rfc1834, date accessed Sep. 28, 2016, 7 pages.
SamSpade Network Inquiry Utility, https://www.sans.org/reading-room/whitepapers/tools/sam-spade-934, date accessed Sep. 28, 2016, 19 pages.
SBIR Phase I: Enterprise Cyber Security Scoring, CyberAnalytix, LLC, http://www.nsf.gov/awardsearch/showAward. do?AwardNumber=I013603, Apr. 28, 2010, 2 pages.
Security Warrior, Cyrus Peikari, Anton, Chapter 8: Reconnaissance, 6 pages.
Snort Intrusion Monitoring System, http://archive.oreilly.com/pub/h/1393, date accessed Sep. 28, 2016, 3 pages.
Stone-Gross, Brett, et al., “FIRE: Finding Rogue Networks,” 10 pages.
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.
Wikipedia, https://en.wikipedia.org/wiki/Crowdsourcing, date accessed Sep. 28, 2016, 25 pages.
Williams, Leevar, et al., “GARNET: A Graphical Attack Graph and Reachability Network Evaluation Tool,” MIT Lincoln Library, VizSEC 2009, pp. 44-59.
Williams, Leevar, et al., “An Interactive Attack Graph Cascade and Reachability Display,” MIT Lincoln Laboratory, 17 pages.
BitSight, “Cyber Security Myths Versus Reality: How Optimism Bias Contributes to Inaccurate Perceptions of Risk”, Jun. 2015, Dimensional Research, pp. 1-9.
U.S. Appl. No. 13/240,572.
U.S. Appl. No. 61/386,156 as of Oct. 7, 2015.
Provos et al., “The Ghost In the Browser Analysis of Web-based Malware”, 2007 (9 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).
Bhilare et al., “Protecting Intellectual Property and Sensitive Information in Academic Campuses from Trusted Insiders: Leveraging Active Directory”, SIGUCC, Oct. 2009 (5 pages).
Jin et al., “Identifying and tracking suspicious activities through IP gray space analysis”, MineNet, Jun. 12, 2007 (6 pages).
Chuvakin, “SIEM: Moving beyond compliance”, RSA White Paper (2010) (16 pages).
U.S. Appl. No. 14/021,585.
U.S. Appl. No. 14/944,484.
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.
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.
Gephi (gephi.org), accessed on the internet at https://web.archive.org/web/20151216223216/https://gephi.org/; Dec. 16, 2015; 1 page.
Mile 2 CPTE Maltego Demo, accessed on the internet at https://www.youtube.com/watch?v=o2oNKOUzPOU; Jul. 12, 2012; 1 page.
“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.
“Creating Transparency with Palantir,” accessed on the internet at https://www.youtube.com/watch?v=8cbGChfagUA; Jul. 5, 2012; 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.
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.
Carstens, et al., “Modeling Company Risk and Importance in Supply Graphs,” European Semantic Web Conference 2017: The Semantic Web pp. 18-31.
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.
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.
“Palantir.com,” accessed on the internet at http://www.palantir.com/; Dec. 2015; 2 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.
“Maltego XL,” accessed on the Internet at https://www.paterva.com/web7/buy/maltegoclients/maltego-xl.php, 5 pages.
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.
Noel, et al., “Big-Data Architecture for Cyber Attack Graphs, Representing Security Relationships in NoSQL Graph Databases,” The MITRE Corporation, 2014, 6 pages.
Wagner, et al., “Assessing the vulnerability of supply chains using graph theory,” Int. J. Production Economics 126 (2010) 121-129.
Moradi, et al., “Quantitative Models for Supply Chain Management,” IGI Global, 2012, 29 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.
“About Neo4j,” 1 page.
“Amazon Mechanical Turk,” accessed on the internet at https://www.mturk.com/; 7 pages.
“Rapid7 Nexpose Vulnerability Scanner,” accessed on the internet at https://www.rapid7.com/products/nexpose/download/, 3 pages.
“Tenable Nessus Network Vulnerability Scanner,” accessed on the internet at https://www.tenable.com/products/nessus/nessus-professional; 13 paqes.
“Computer Network Graph,” http://www.opte.org; 1 page.
Mcnab, “Network Security Assessment,” copyright 2004, 56 pages.
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).
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.
Search Query Report form IP.com (performed Apr. 27, 2020), 5 pages.
Camelo et al., “CONDENSER: A Graph-Based Approach for Detecting Botnets,” AnubisNetworks R&D, Amadora, Portugal, 8 pages.
Camelo, “Botnet Cluster Identification,” Sep. 2014, 2 pages.
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.
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. 16/015,686, Methods for Mapping IP Addresses and Domains to Organizations Using User Acitivity Data, filed Jun. 22, 2018.
U.S. Appl. No. 16/543,075, Methods for Mapping IP Addresses and Domains to Organizations Using User Acitivity Data, filed Aug. 16, 2019.
U.S. Appl. No. 16/738,825, Methods for Mapping IP Addresses and Domains to Organizations Using User Acitivity Data, filed Jan. 9, 2020.
U.S. Appl. No. 16/405,121, the Office Action dated Aug. 1, 2019 and dated Nov. 21, 2019, and the Notice of Allowance dated Jul. 10, 2020.
U.S. Appl. No. 13/240,572, the Office Actions dated Nov. 21, 2013, dated Jun. 16, 2014, dated Feb. 27, 2015, dated Jun. 3, 2015, dated Oct. 26, 2015, dated Mar. 10, 2016, dated Feb. 13, 2017 and the Notice of Allowance dated Jun. 1, 2020.
U.S. Appl. No. 15/134,845, now U.S. Pat. No. 9,680,858, and Office Actions dated Jul. 19, 2016 and dated Jan. 26, 2017, and the Notices of Allowance dated Apr. 27, 2017 and May 9, 2017.
U.S. Appl. No. 15/044,952, the Office Actions dated Jul. 8, 2019 and dated Feb. 21, 2020.
U.S. Appl. No. 16/543,075, the Notice of Allowance dated Sep. 25, 2019.
U.S. Appl. No. 16/738,825, the Office Actions dated Jul. 8, 2019 and dated Feb. 21, 2020.
U.S. Appl. No. 15/918,286, now U.S. Pat. No. 10/527,219, the Office Action dated Aug. 7, 2018 and the Notice of Allowance dated Nov. 29, 2018.
U.S. Appl. No. 16/292,956, the Office Action dated Jul. 10, 2019 and the Notices of Allowance dated Jan. 8, 2020 and dated Jan. 27, 2020.
U.S. Appl. No. 16/795,056, the Office Action dated May 1, 2020.
U.S. Appl. No. 16/170,680, the Office Action dated Mar. 26, 2019; the Notices of Allowance dated Oct. 29, 2019 and Aug. 27, 2019.
U.S. Appl. No. 16/688,647, the Office Action dated Jan. 29, 2020; the Notice of Allowance dated May 12, 2020.
U.S. Appl. No. 15/954,921, the Office Actions dated Sep. 4, 2018, dated Jan. 3, 2019, dated Aug. 19, 2019, and dated Dec. 5, 2019; Advisory Action dated Mar. 3, 2020, and the Notice of Allowance dated Jul. 7, 2020.
U.S. Appl. No. 16/549,764.
U.S. Appl. No. 16/787,650, the Notice of Allowance dated Apr. 7, 2020.
U.S. Appl. No. 16/583,991, the Office Action dated Jan. 13, 2020.
U.S. Appl. No. 29/666,942, the Notice of Allowance dated Apr. 30, 2020.
U.S. Appl. No. 16/360,641, the Office Action dated Aug. 7, 2019 and dated Feb. 20, 2020.
U.S. Appl. No. 16/514,771, the Office Action dated Dec. 4, 2019; the Notice of Allowance dated Mar. 18, 2020.
U.S. Appl. No. 16/775,840, the Notice of Allowance dated May 19, 2020; and.
U.S. Appl. No. 16/802,232, the Notice of Allowance dated Apr. 24, 2020.
U.S. Appl. No. 15/271,655 Published as: US2018/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 and 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 Published as: US2016/0330231, Methods for Using Organizational Behavior for Risk Ratings, filed Jul. 22, 2016.
U.S. Appl. No. 15/239,063 Published as: US2017/0093901, Security Risk Management, filed Aug. 17, 2016.
U.S. Appl. No. 16/405,121 Published as: US2019/0260791, Methods for Using Organizational Behavior for Risk Ratings, filed May 7, 2019.
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. 13/240,572 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. 15/142,677 U.S. Pat. No. 9,830,569 Published as: US/2016/0239772, Security Assessment Using Service Provider Digital Asset Information, filed Apr. 29, 2016.
U.S. Appl. No. 17/069,151, Information Technology Security Assessment System, filed Oct. 13, 2020.
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 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 D835,631, Computer Display Screen With Graphical User Interface, filed Mar. 24, 2017.
U.S. Appl. No. 29/598,299 D818,475, Computer Display With Security Ratings Graphical User Interface, filed Mar. 24, 2017.
U.S. Appl. No. 29/599,622, Computer Display With Security Ratings Graphical User Interface, filed Apr. 5, 2017.
U.S. Appl. No. 29/599,620, Computer Display With Security Ratings Graphical User Interface, filed Apr. 5, 2017.
U.S. Appl. No. 16/015,686, Methods for Mapping IP Addresses and Domains to Organizations Using User Activity Data, filed Jun. 22, 2018.
U.S. Appl. No. 16/543,075, Methods for Mapping IP Addresses and Domains to Organizations Using User Activity Data, filed Aug. 16, 2019.
U.S. Appl. No. 16/738,825, Methods for Mapping IP Addresses and Domains to Organizations Using User Activity Data, filed Jan. 9, 2020.
U.S. Appl. No. 17/146,064, Methods for Mapping IP Addresses and Domains to Organizations Using User Activity Data, filed Jan. 11, 2021.
U.S. Appl. No. 15/918,286, Correlated Risk in Cybersecurity, filed Mar. 12, 2018.
U.S. Appl. No. 16/292,956, Correlated Risk in Cybersecurity, filed May 5, 2019.
U.S. Appl. No. 16/795,056, Correlated Risk in Cybersecurity, filed Feb. 19, 2020.
U.S. Appl. No. 17/179,630, Correlated Risk in Cybersecurity, filed Feb. 19, 2021.
U.S. Appl. No. 16/170,680, Systems and Methods for Remote Detection of Software Through Browser Webinjects, filed Oct. 25, 2018.
U.S. Appl. No. 16/688,647, Systems and Methods for Remote Detection of Software Through Browser Webinjects, filed Nov. 19, 2019.
U.S. Appl. No. 17/000,135, Systems and Methods for Remote Detection of Software Through Browser Webinjects, filed Aug. 21, 2020.
U.S. Appl. No. 15/954,921, Systems and Methods for External Detection of Misconfigured Systems, filed Apr. 17, 2018.
U.S. Appl. No. 17/014,495, Systems and Methods for External Detection of Misconfigured Systems, filed Sep. 8, 2020.
U.S. Appl. No. 16/549,764, 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, 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, Systems and Methods for Network Asset Discovery and Association Thereof With Entities, filed Sep. 26, 2019.
U.S. Appl. No. 17/085,550, Systems and Methods for Network Asset Discovery and Association Thereof With Entities, filed Oct. 30, 2020.
U.S. Appl. No. 29/666,942, Computer Display With Graphical User Interface, filed Oct. 17, 2018.
U.S. Appl. No. 16/360,641, Systems and Methods for Forecasting Cybersecurity Ratings Based on Event-Rate Scenarios, filed Mar. 21, 2019.
U.S. Appl. No. 16/514,771, Systems and Methods for Generating Security Improvement Plans for Entities, filed Jul. 17, 2019.
U.S. Appl. No. 16/922,273, Systems and Methods for Generating Security Improvement Plans for Entities, filed Jul. 7, 2020.
U.S. Appl. No. 29/677,306, Computer Display With Corporate Hierarchy Graphical User Interface Computer Display With Corporate Hierarchy Graphical User Interface, filed Jan. 18, 2019.
U.S. Appl. No. 16/775,840, 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, 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, Systems and Methods for Rapidly Generating Security Ratings, filed Jan. 31, 2020.
U.S. Appl. No. 17/132,512, Systems and Methods for Rapidly Generating Security Ratings, filed Dec. 23, 2020.
U.S. Appl. No. 16/802,232, Systems and Methods for Improving a Security Profile of an Entity Based on Peer Security Profiles, filed Feb. 26, 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, Computer Display With Peer Analytics Graphical User Interface, filed Jun. 2, 2020.
U.S. Appl. No. 17/039,675, Systems and Methods for Determining Asset Importance in Security Risk Management, filed Sep. 30, 2020.
U.S. Appl. No. 16/884,607, Systems and Methods for Managing Cybersecurity Alerts, filed May 27, 2020.
U.S. Appl. No. 17/236,594, Systems and Methods for Managing Cybersecurity Alerts, filed Apr. 21, 2021.
U.S. Appl. No. 15/271,655, the Office Actions dated Feb. 21, 2017 and dated Aug. 18, 2017.
U.S. Appl. No. 15/377,574, now U.S. Pat. No. 9,705,932, the Office Action dated Mar. 2, 2017 and the Notice of Allowance dated Jun. 1, 2017.
U.S. Appl. No. 14/021,585, now U.S. Pat. No. 9,438,615, the Office Action dated Mar. 11,2016 and the Notice of Allowance dated Aug. 9, 2016.
U.S. Appl. No. 15/216,955, now U.S. Pat. No. 10,326,786, the Office Actions dated Nov. 4, 2016, dated Mar. 9, 2017, dated Jun. 6, 2017, dated Dec. 5, 2017, and dated Aug. 29, 2018, and the Notice of Allowance dated Feb. 6, 2019.
U.S. Appl. No. 15/239,063, now U.S. Pat. No. 10,341,370, the Office Action dated Mar. 21, 2018 and the Notice of Allowance dated Jan. 14, 2019.
U.S. Appl. No. 16/405,121, now U.S. Pat. No. 10,785,245, the Office Actions dated Aug. 1, 2019 and Nov. 21, 2019 and the Notices of Allowance dated May 22, 2020 and dated Jul. 10, 2020.
U.S. Appl. No. 13/240,572, now U.S. Pat. No. 10,805,331, the Office Actions dated Nov. 21, 2013, dated Jun. 16, 2014, dated Feb. 27, 2015, dated Jun. 3, 2015, dated Oct. 26, 2015, dated Mar. 10, 2016 dated Feb. 13, 2017; and the Notice of Allowance dated Jun. 1, 2020.
U.S. Appl. No. 14/944,484, now U.S. Pat. No. 9,973,524, the Office Actions dated Mar. 11, 2016, dated Jul. 5, 2016, and dated Jan. 17, 2017 and the Notice of Allowance dated Oct. 20, 2017.
U.S. Appl. No 15/142,677, now U.S. Pat. No. 9,830,569, the Office Actions dated Jul. 26, 2016, and dated Apr. 24, 2017 and the Notice of Allowance dated Oct. 11, 2017.
U.S. Appl. No. 15/134,845, now U.S. Pat. No. 9,680,858, the Office Actions dated Jul. 19, 2016 and dated Jan. 26, 2017, and the Notices of Allowance dated Apr. 27, 2017 and dated May 9, 2017.
U.S. Appl. No. 15/044,952, the Office Actions dated Jul. 8, 2019, dated Feb. 21, 2020, and dated Sep. 30, 2020.
U.S. Appl. No. 15/089,375, now U.S. Pat. No. 10,176,445, the Office Actions dated Sep. 9, 2016, dated May 17, 2017, and dated Nov. 17, 2017 and the Notice of Allowance dated Aug. 9, 2018.
U.S. Appl. No. 29/598,298, now U.S. Pat. No. D835,631, the Notice of Allowance dated Aug. 15, 2018.
U.S. Appl. No. 29/598,299, now U.S. Pat. No. D818,475, the Notice of Allowance dated Jan. 2, 2018.
U.S. Appl. No. 29/599,622, now U.S. Pat. No. D847,169, the Notice of Allowance dated Dec. 11, 2018.
U.S. Appl. No. 29/599,620, now U.S. Pat. No. D846,562, the Office Action dated May 3, 2018, the Notice of Allowance dated Nov. 27, 2018.
U.S. Appl. No. 16/015,686, now U.S. Pat. No. 10,425,380, the Office Action dated Nov. 16, 2018 and the Notice of Allowance dated May 10, 2019.
U.S. Appl. No. 16/543,075, now U.S. Pat. No. 10,554,619, the Notice of Allowance dated Sep. 25, 2019.
U.S. Appl. No. 16/738,825, now U.S. Pat. No. 10,893,021, the Office Action dated Feb. 26, 2020 and the Notice of Allowance dated Sep. 9, 2020.
U.S. Appl. No. 15/918,286, now U.S. Pat. No. 10,257,219, the Office Action dated Aug. 7, 2018 and the Notice of Allowance dated Nov. 29, 2018.
U.S. Appl. No. 16/292,956, now U.S. Pat. No. 10,594,723, the Office Action dated Jul. 10, 2019 and the Notices of Allowance dated Jan. 8, 2020 and dated Jan. 27, 2020.
U.S. Appl. No. 16/795,056, now U.S. Pat. No. 10,931,705, the Office Action dated May 1, 2020 and the Notice of Allowance dated Oct. 29, 2020.
U.S. Appl. No. 16/170,680, now U.S. Pat. No. 10,521,583, the Office Action dated Mar. 26, 2019; and the Notice of Allowance dated Oct. 29, 2019 and dated Aug. 27, 2019.
U.S. Appl. No. 16/688,647, now U.S. Pat. No. 10,776,483, the Office Action dated Jan. 29, 2020; the Notice of Allowance dated May 12, 2020.
U.S. Appl. No. 17/000,135, the Office Action dated Feb. 2, 2021.
U.S. Appl. No. 15/954,921, now U.S. Pat. No. 10,812,520, the Office Actions dated Sep. 4, 2018, dated Jan. 3, 2019, dated Aug. 19, 2019, and dated Dec. 5, 2019; Advisory Action dated Mar. 3, 2020, and the Notice of Allowance dated Jul. 7, 2020.
U.S. Appl. No. 16/787,650, now U.S. Pat. No. 10,749,893, the Notice of Allowance dated Apr. 7, 2020.
U.S. Appl. No. 16/583,991, now U.S. Pat. No. 10,848,382, the Office Action dated Jan. 13, 2020, and the Notice of Allowance dated Jul. 22, 2020.
U.S. Appl. No. 29/666,942, now U.S. Pat. No. D892135, the Notice of Allowance dated Apr. 30, 2020.
U.S. Appl. No. 16/360,641, the Office Action dated Aug. 7, 2019, dated Feb. 20, 2020, dated Sep. 4, 2020, and dated Apr. 15, 2021.
U.S. Appl. No. 16/514,771, now U.S. Pat. No. 10,726,136, the Office Action dated Dec. 4, 2019; the Notice of Allowance dated Mar. 18, 2020.
U.S. Appl. No. 16/922,673, the Office Action dated Sep. 15, 2020 and the Notices of Alowance dated Jan. 22, 2021 and dated Feb. 11, 2021.
U.S. Appl. No. 29/677,306, now U.S. Pat. No. D905702, the Notice of Allowance dated Aug. 20, 2020.
U.S. Appl. No. 16/775,840, now U.S. Pat. No. 10,791,140, the Notice of Allowance dated May 19, 2020.
U.S. Appl. No. 17/018,587, the Office Action dated Nov. 17, 2020, and the Notice of Allowance dated Feb. 25, 2021.
U.S. Appl. No. 16/779,437, now U.S. Pat. No. 10,893,067, the Notice of Allowance dated Aug. 12, 2020, dated Oct. 26, 2020 and dated Nov. 9, 2020.
U.S. Appl. No. 16/802,232, now U.S. Pat. No. 10,764,298, the Notice of Allowance dated Apr. 24, 2020.
U.S. Appl. No. 17/039,675, the Notice of Allowance dated Feb. 3, 2021.
U.S. Appl. No. 16/884,607, the Notice of Allowance dated Jan. 25, 2021; and.
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).
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).
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.
Morningstar Direct, dated to Nov. 12, 202, morningstardirect.com [online]. Retrieved Feb. 26, 2021 from Internet <URL:https://web.archive.org/web/20201112021943/https://www.morningstar.com/products/direct> (Year: 2020).
Related Publications (1)
Number Date Country
20210266324 A1 Aug 2021 US
Continuations (1)
Number Date Country
Parent 16802232 Feb 2020 US
Child 16942452 US