Visible to the public Concurrency Strategies for Attack Graph Generation

TitleConcurrency Strategies for Attack Graph Generation
Publication TypeConference Paper
Year of Publication2019
AuthorsLi, Ming, Hawrylak, Peter, Hale, John
Conference Name2019 2nd International Conference on Data Intelligence and Security (ICDIS)
Keywordsattack graph, attack graph generation, Attack Graphs, composability, Computational modeling, Concurrency, concurrency control, concurrency strategies, Concurrent computing, cyber-physical system, Cyber-physical systems, cyberphysical, Generators, graph theory, Instruction sets, large-scale graph, message passing, Metrics, Multi-threaded Programming, network attack graph, Network security, network state space, OpenMP, OpenMP-based programming implementation, parallel algorithms, Predictive Metrics, pubcrawl, resilience, Resiliency, Scalability, scalable attack graphs, security, security of data, storage costs, storage management, telecommunication security
Abstract

The network attack graph is a powerful tool for analyzing network security, but the generation of a large-scale graph is non-trivial. The main challenge is from the explosion of network state space, which greatly increases time and storage costs. In this paper, three parallel algorithms are proposed to generate scalable attack graphs. An OpenMP-based programming implementation is used to test their performance. Compared with the serial algorithm, the best performance from the proposed algorithms provides a 10X speedup.

DOI10.1109/ICDIS.2019.00033
Citation Keyli_concurrency_2019