Simplify Attack Graph to Reduce Attack Graph Complexity Using Critical Path Preserving Graph Reduction

Al-Araji, Zaid

doi:10.69513/jncs.v2.i2.a2

	Simplify Attack Graph to Reduce Attack Graph Complexity Using Critical Path Preserving Graph Reduction
Al-Noor Journal for Information Technology and Cybersecurity
Article 2, Volume 2, Issue 2, December 2025, Pages 9-13 PDF (360.66 K)
Document Type: Research paper
DOI: 10.69513/jncs.v2.i2.a2
Author
Zaid Al-Araji^*
Ninevah University, Mosul, Iraq
Abstract
In recent years, network technologies have grown more widely used. The network has security issues that need to be fixed, despite the fact that it is advantageous for people to live and work there. Among these problems are cyberattacks. As more devices connect to the internet, hackers' attack surface expands. Attack graphs are one of the many techniques that have been put forth recently to identify and forecast attacks. Predicting the attack and its next move within the network is the main objective of creating the attack graph. However, there are a few problems with the attack graphs that are currently in use. The primary problem with attack graph construction is scalability. In order to minimise the level of complexity of the attack graph, the present research suggests employing personal agents to shorten the reachability time when calculating between the nodes and the critical path preserving graph reduction technique to eliminate superfluous edges. The outcomes demonstrate that the suggested performance outperforms the attack graph that is currently in use. The attack graph complexity and generation time were decreased by the suggested attack graph
Keywords
Attack Graph; Network Security; Graph Pruning

Statistics Article View: 294 PDF Download: 111