IP Library Granted Patent US 11,907,407
Granted Patent B2
US 11,907,407 · App. 17/644,503 · Granted Feb 20, 2024

Generating attack graphs in agile security platforms

Inventors: Eitan Hadar (Nesher, IL); Amin Hassanzadeh (Arlington, VA); Anup Nayak (Potomac, MD)
Assignee: Accenture Global Solutions Limited
G06F21/70G06F16/9024G06F21/577H04L41/14H04L43/026H04L63/1433H04L63/20G06F2221/034G06Q10/06315
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,907,407
App. No.
17/644,503
Filed
Dec 15, 2021
Granted
Feb 20, 2024
Kind
B2
Examiner
LI, MENG
Art Unit
2437
USPC
726/25
Abstract

Implementations of the present disclosure include providing a graph representative of a network, a set of nodes representing respective assets, each edge representing one or more lateral paths between assets, the graph data including configurations affecting at least one impact that has an effect on an asset, determining multiple sets of fixes for configurations, each fix having a cost associated therewith, incorporating fix data of the sets of fixes into the graph, defining a set of fixes including one or more fixes from the multiple sets of fixes by defining an optimization problem that identifies one or more impacts that are to be nullified and executing resolving the optimization problem to define the set of fixes, each fix in the set of fixes being associated with a respective configuration in the graph, and scheduling performance of each fix in the set of fixes based on one or more operational constraints.

Claims (51)

1. A computer-implemented method for applying remediations for cyber security in enterprise networks, the method being executed by one or more processors and comprising:

providing, by a security platform, graph data defining a graph that is representative of an enterprise network, the graph comprising nodes and edges between nodes, the nodes comprising:

a set of configuration nodes each representing a condition of an asset of the enterprise network;

a set of rule nodes each representing an attack methodology; and

a set of impact nodes each representing an impact on the enterprise network,

wherein an edge between a configuration node and a rule node indicates that the condition represented by the configuration node enables the attack methodology represented by the rule node, and an edge between a rule node and an impact node indicates that the attack methodology represented by the rule node causes the impact;

identifying, by the security platform, one or more fixes for each of multiple respective conditions represented by configuration nodes of the graph;

incorporating, by the security platform, fix data representative of the identified one or more fixes into the graph, including linking each of the one or more fixes to the configuration node representing the respective condition;

defining, by the security platform and using the graph data, a set of fixes from the identified one or more fixes by executing an optimization problem for nullifying one or more impacts represented by impact nodes of the graph; and

scheduling, by the security platform, performance of each fix in the set of fixes.

2. The method of claim 1 , wherein each impact comprises an effect on an asset within the enterprise network.

3. The method of claim 1 , wherein each fix in the set of fixes has a cost associated therewith, wherein executing the optimization problem comprises optimizing the cost of the set of fixes.

4. The method of claim 3 , wherein the cost comprises one or more of a monetary cost, a temporal cost, and a resource cost.

5. The method of claim 1 , wherein the optimization problem is executed using a greedy algorithm and a coverage matrix.

6. The method of claim 5 , wherein the coverage matrix defines, for each fix of the one or more fixes, one or more impacts that the fix nullifies.

7. The method of claim 6 , wherein the coverage matrix further defines, for each fix of the one or more fixes, a linked impact with respect to one or more impacts affected by the fix.

8. The method of claim 1 , wherein scheduling, by the security platform, performance of each fix in the set of fixes is executed by performing a multi-objective optimization to minimize one or more of risk and cost for a given objective.

9. The method of claim 8 , wherein risk represents a risk of one or more vulnerabilities being exploited over time.

10. The method of claim 1 , wherein each fix is one of an official fix that wholly resolves a vulnerability of a configuration, a work-around fix that works around the vulnerability of the configuration, and a temporary fix that only temporarily resolves the vulnerability of the configuration.

11. The method of claim 1 , wherein assets comprise one or more of information technology (IT) assets and operational technology (OT) assets.

12. 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 applying remediations for cyber security in enterprise networks, the operations comprising:

providing, by a security platform, graph data defining a graph that is representative of an enterprise network, the graph comprising nodes and edges between nodes, each node representing an asset within the enterprise network, and each edge representing at least a portion of one or more lateral paths between assets in the enterprise network, the graph data comprising a set of configurations, each configuration affecting at least one impact;

determining, by the security platform, multiple sets of fixes for respective configurations;

incorporating, by the security platform, fix data representative of the multiple sets of fixes into the graph;

defining, by the security platform, a set of fixes comprising one or more fixes from the multiple sets of fixes by executing an optimization problem for nullifying one or more impacts, wherein the optimization problem is executed using a greedy algorithm and a coverage matrix that defines, for each fix in the multiple sets of fixes, one or more impacts that the fix nullifies; and

scheduling, by the security platform, performance of each fix in the set of fixes.

13. The non-transitory computer-readable storage medium of claim 12 , wherein each impact comprises an effect on an asset within the enterprise network.

14. The non-transitory computer-readable storage medium of claim 12 , wherein each fix in the set of fixes has a cost associated therewith, wherein executing the optimization problem comprises optimizing the cost of the set of fixes.

15. The non-transitory computer-readable storage medium of claim 14 , wherein the cost comprises one or more of a monetary cost, a temporal cost, and a resource cost.

16. The non-transitory computer-readable storage medium of claim 12 , wherein each fix in the set of fixes is associated with a respective configuration in the graph.

17. A system, comprising:

one or more computers; and

a computer-readable storage device coupled to the one or more computers and having instructions stored thereon which, when executed by the one or more computers, cause the one or more computers to perform operations for applying remediations for cyber security in enterprise networks, the operations comprising:

providing, by a security platform, graph data defining a graph that is representative of an enterprise network, the graph comprising nodes and edges between nodes, the nodes comprising:

a set of configuration nodes each representing a condition of an asset of the enterprise network;

a set of rule nodes each representing an attack methodology; and

a set of impact nodes each representing an impact on the enterprise network,

wherein an edge between a configuration node and a rule node indicates that the condition represented by the configuration node enables the attack methodology represented by the rule node, and an edge between a rule node and an impact node indicates that the attack methodology represented by the rule node causes the impact;

identifying, by the security platform, one or more fixes for each of multiple respective conditions represented by configuration nodes of the graph;

incorporating, by the security platform, fix data representative of the identified one or more fixes into the graph, including linking each of the one or more fixes to the configuration node representing the respective condition;

defining, by the security platform and using the graph data, a set of fixes from the identified one or more fixes by executing an optimization problem for nullifying one or more impacts represented by impact nodes of the graph; and

scheduling, by the security platform, performance of each fix in the set of fixes.

18. The system of claim 17 , wherein:

each fix in the set of fixes has a cost associated therewith,

executing the optimization problem comprises optimizing the cost of the set of fixes, and

the cost comprises one or more of a monetary cost, a temporal cost, and a resource cost.

19. The system of claim 17 , wherein:

the optimization problem is executed using a greedy algorithm and a coverage matrix,

the coverage matrix defines, for each fix of the one or more fixes, one or more impacts that the fix nullifies, and

the coverage matrix further defines, for each fix of the one or more fixes, a linked impact with respect to one or more impacts affected by the fix.

20. The system of claim 17 , wherein scheduling, by the security platform, performance of each fix in the set of fixes is executed by performing a multi-objective optimization to minimize one or more of risk and cost for a given objective, wherein risk represents a risk of one or more vulnerabilities being exploited over time.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 15, 2021
From: HADAR, EITAN; HASSANZADEH, AMIN; NAYAK, ANUP
To: ACCENTURE GLOBAL SOLUTIONS LIMITED
Reel/Frame 058401/0662 →
Continuity (4)
Continuation 16556380 · Aug 30, 2019
Provisional Application 62829696 · Apr 5, 2019
Provisional Application 62774516 · Dec 3, 2018
Related Publication 20220129590A1 · Apr 28, 2022
Cited By (2)
US 12,556,587 US 12,682,072