Unified security graph

At a computing device, a method for generating an interconnected security graph, the method comprising:

• obtaining two or more security graphs that at least partially overlap, each security graph comprising a data structure defining a plurality of nodes and at least one edge that connects two or more of the plurality of nodes, and wherein the at least one edge represents a potential security vulnerability between the two or more nodes;
• classifying, as a permission scope node or a floating node, each node of the plurality of nodes of the two or more security graphs;
• sorting each of the permission scope nodes into a respective permission scope profile;
• for each floating node that matches another floating node, unifying such matching floating nodes into a unified floating node;
• defining a set of edges that connects the sorted permission scope nodes and the unified floating nodes based on the at least one edge of each security graph of the two or more security graphs;
• and
• outputting an interconnected security graph comprising the sorted permission scope nodes, the unified floating nodes, and the set of edges.

A computing system, comprising:

• one or more processors configured to,
• obtain two or more security graphs that at least partially overlap, each security graph comprising a data structure defining a plurality of nodes and at least one edge that connects two or more of the plurality of nodes, and wherein the at least one edge represents a potential security vulnerability between the two or more nodes;
• classify, as a permission scope node or a floating node, each node of the plurality of nodes of the two or more security graphs;
• sort each of the permission scope nodes into a respective permission scope profile;
• for each floating node that matches another floating node, unify such matching floating nodes into a unified floating node;
• define a set of edges that connects the sorted permission scope nodes and the unified floating nodes based on the at least one edge of each security graph of the two or more security graphs;
• generate an interconnected security graph comprising the sorted permission scope nodes, the unified floating nodes, and the set of edges;
• traverse the interconnected security graph from a selected node to thereby identify one or more nodes connected to the selected node;
• and
• output, to the selected node, a restricted security graph, wherein the restricted security graph comprises a subset of the interconnected security graph that includes the one or more nodes connected to the selected node along a restricted path.