DOE OSTI · 1148631
Graph Coarsening for Path Finding in Cybersecurity Graphs
Abstract
n the pass-the-hash attack, hackers repeatedly steal password hashes and move through a computer network with the goal of reaching a computer with high level administrative privileges. In this paper we apply graph coarsening in network graphs for the purpose of detecting hackers using this attack or assessing the risk level of the network's current state. We repeatedly take graph minors, which preserve the existence of paths in the graph, and take powers of the adjacency matrix to count the paths. This allows us to detect the existence of paths as well as find paths that have high risk of being used by adversaries.
Keep this discovery
Explore connections, maps & timelines
Hogan, Emilie A., Johnson, John R., Halappanavar, Mahantesh. 2013-01-01. Graph Coarsening for Path Finding in Cybersecurity Graphs. https://doi.org/10.1145/2459976.2459984. https://searchnasa.com/record/osti%3A1148631/graph-coarsening-for-path-finding-in-cybersecurity-graphs
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.