2013 · 41 citations · 2 references
ComputingComputer ScienceCybersecurityComputer SecurityNetwork SecurityVulnerability AnalysisCyber-physical SecurityDynamic Network AnalysisNetwork Security ArchitectureSecurity MetricsThreat AnalysisThreat ModelingAttack Graph AnalysisAttack Path AnalysisDeterrenceGraph-based Vulnerability DetectionNetwork Risk AssessmentPrivilege Escalation TechniquesSubgraph IsomorphismVulnerability
This paper introduces a novel graph analytic metric that can be used to measure the potential vulnerability of a cyber network to specific types of attacks that use lateral movement and privilege escalation such as the well-known Pass The Hash, (PTH). The metric is computed from an oriented subgraph of the underlying cyber network induced by selecting only those edges for which a given property holds between the two vertices of the edge. The metric with respect to a select node on the subgraph is defined as the likelihood that the select node is reachable from another arbitrary node in the graph. This metric can be calculated dynamically from the authorization and auditing layers during the network security authorization phase and will potentially enable predictive deterrence against attacks such as PTH.
2
Sparsification—a technique for speeding up dynamic graph algorithms
David Eppstein, Zvi Galil, Giuseppe F. Italiano et al. · Journal of the ACM · 1997 · 290 citations · Full text
Query preserving graph compression
Wenfei Fan, Jianzhong Li, Xin Wang et al. · 2012 · 204 citations