Infected endpoint containment using aggregated security status information
US-9124636-B1 · Sep 1, 2015 · US
US9712554B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9712554-B2 |
| Application number | US-201514841227-A |
| Country | US |
| Kind code | B2 |
| Filing date | Aug 31, 2015 |
| Priority date | Apr 9, 2015 |
| Publication date | Jul 18, 2017 |
| Grant date | Jul 18, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Methods, systems, and apparatus, including computer programs encoded on computer storage media, for transforming representations of network activity data. A data structure that represents communication events between computing devices of one or more networks is received. The data structure is analyzed and a set of potential attack paths represented in the data structure is determined. A score is assigned to each potential attack path in the set of potential attack paths. Potential attack paths that have scores that do not meet a predetermined threshold are removed from the set of potential attack paths. Potential attack paths that remain in the set of potential attack paths are ranked, based on each score assigned to each potential attack path, and the data structure that includes a ranked set of potential attack paths is provided.
Opening claim text (preview).
What is claimed is: 1. A computer-implemented method for detecting potential attack paths in two or more network domains, the method being executed by one or more processors and comprising: receiving a data structure that represents communication events between computing devices of the two or more network domains, wherein the data structure is a directed graph stored in a graph database; analyzing the data structure and determining a set of potential attack paths represented in the data structure, each potential attack path being based on the communication events between computing devices and including a respective sequence of computing devices proceeding from an originating computing device to a destination computing device, wherein the originating computing device and the destination computing device of at least one potential attack path exist on different network domains; assigning a score to each potential attack path in the set of potential attack paths, based on the computing devices included in the potential attack path, communication events between the computing devices, or both; removing potential attack paths from the set of potential attack paths that have scores that do not meet a predetermined threshold; ranking potential attack paths that remain in the set of potential attack paths, based on each score assigned to each potential attack path; and providing the data structure that includes a ranked set of potential attack paths. 2. The method of claim 1 , wherein the computing devices of the two or more network domains are represented by nodes of the directed graph, and the communication events are represented by directed edges between the nodes of the directed graph. 3. The method of claim 2 , wherein determining the set of potential attack paths represented in the data structure includes traversing the directed graph based on timestamp information associated with the directed edges between the nodes to determine a plurality of node sequences, each node sequence proceeding from an originating node to a destination node. 4. The method of claim 3 , wherein determining the set of potential attack paths represented in the data structure includes determining all possible node sequences of two or more linked nodes within the data structure. 5. The method of claim 1 , wherein analyzing the data structure includes receiving information provided by a rule or pattern-based threat intelligence data source. 6. The method of claim 1 , wherein analyzing the data structure includes determining a meshedness coefficient for the data structure that indicates whether one or more potential attack paths represented in the data structure are looped. 7. The method of claim 6 , wherein determining the set of potential attack paths represented in the data structure includes converting looped potential attack paths to non-looped potential attack paths. 8. The method of claim 1 , wherein assigning the score to each potential attack path in the set of potential attack paths includes determining, for each potential attack path, two or more component scores including two or more of a spatial component score, a temporal component score, and an importance component score, and wherein the score for the potential attack path is an aggregation of the two or more component scores. 9. The method of claim 8 , wherein the spatial component score represents a distance between computing devices within the two or more network domains. 10. The method of claim 8 , wherein the spatial component score represents a number of logical system boundaries crossed by the potential attack path. 11. The method of claim 8 , wherein the temporal component score represents a function of the rate at which communication events associated with the attack path occur. 12. The method of claim 8 , wherein the importance component score represents an importance of one or more computing devices associated with the potential attack path. 13. The method of claim 12 , wherein determining the importance component score includes receiving information related to the one or more computing devices associated with the potential attack path from a configuration management system. 14. The method of claim 8 , wherein the importance component score represents an importance of one or more communication events associated with the potential attack path. 15. The method of claim 14 , wherein determining the importance component score includes receiving information related to the one or more communication events associated with the potential attack path from a network security sensor. 16. A system, comprising: one or more processors; and a computer-readable storage device coupled to the one or more processors and having instructions stored thereon which, when executed by the one or more processors, cause the one or more processors to perform operations for detecting potential attack paths in two or more network domains, the operations comprising: receiving a data structure that represents communication events between computing devices of the two or more network domains, wherein the data structure is a directed graph stored in a graph database; analyzing the data structure and determining a set of potential attack paths represented in the data structure, each potential attack path being based on the communication events between computing devices and including a respective sequence of computing devices proceeding from an originating computing device to a destination computing device, wherein the originating computing device and the destination computing device of at least one potential attack path exist on different network domains; assigning a score to each potential attack path in the set of potential attack paths, based on the computing devices included in the potential attack path, communication events between the computing devices, or both; removing potential attack paths from the set of potential attack paths that have scores that do not meet a predetermined threshold; ranking potential attack paths that remain in the set of potential attack paths, based on each score assigned to each potential attack path; and providing the data structure that includes a ranked set of potential attack paths. 17. The system of claim 16 , wherein the computing devices of the two or more network domains are represented by nodes of the directed graph, and the communication events are represented by directed edges between the nodes of the directed graph. 18. The system of claim 16 , wherein analyzing the data structure includes receiving information provided by a rule or pattern-based threat intelligence data source. 19. The system of claim 16 , wherein assigning the score to each potential attack path in the set of potential attack paths includes determining, for each potential attack path, two or more component scores including two or more of a spatial component score, a temporal component score, and an importance component score, and wherein the score for the potential attack path is an aggregation of the two or more component scores. 20. A non-transitory computer-readable storage medium coupled to one or more processors and having instructions stored thereon which, when executed by the one or more processors, cause the one or more processors to perform operations for detecting potential attack paths in two or more network domains, the operations comprising: receiving a data structure that represents communication events between computing devices of the two or more network domains, wherein the data s
Vulnerability analysis · CPC title
by monitoring network traffic (monitoring network traffic per se H04L43/00) · CPC title
Traffic logging, e.g. anomaly detection · CPC title
in which an application is distributed across nodes in the network (software deployment G06F8/60; multiprogramming arrangements G06F9/46) · CPC title
Filtering policies (mail message filtering H04L51/212) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.