A Parallelized Subgraphing Approach to Large-Scale Attack and Compliance Generation
The generation of large-scale graphs encounters unique challenges compared to the exploration of the same large-scale graphs. Attack graphs and compliance graphs can be useful applications of large-scale graphs in order for organizations to understand and analyze their cybersecurity or regulatory standings, but their generation can often be prohibitive. This work introduces a data-parallel distributed approach of large-scale graph generation with the specific application of attack and compliance graphs. This approach aims to distribute the exploratory states of a graph across compute nodes in order to compile groups of subgraphs that will compose the full graph. This work utilizes Message-Passing Interface as the standard for passing messages across nodes in the distributed generator program. Additional experimentation, results, and discussions are also provided regarding the viability of using a Distributed Hash Table. This work presents a first step, naïve approach to subgraphing, and discusses potentially viable alternatives for increased performance.
Authors
- Peter J. Hawrylak (ORCID: https://orcid.org/0000-0003-3268-7452)
- Noah L. Schrick (ORCID: https://orcid.org/0000-0003-0875-8927)
Institutions
- United States Army Corps of Engineers (US)
- Information Technology Laboratory (US)
- University of Tulsa (US)
- U.S. Army Engineer Research and Development Center (US)
Publication Details
- Published
- 2025-03-22
- DOI
- https://doi.org/10.1109/southeastcon56624.2025.10971464
- Primary Topic
- Advanced Malware Detection Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00