Abstract

An optimization algorithm for reducing the scale of attack graphs and an attack path prediction method are presented herein to cover the difficulty of predicting the attack path in traditional attack graphs. Firstly, a new distance cost attack graph model is generated and converted into a marked attack graph via the algorithm. Secondly, the original attack graph is optimized by introducing an attack distance weight value and a path redundancy coefficient in order to determine the possible attack paths and calculate the cost of path attack behavior. Finally, the preferred attack path is determined based on an evaluation function. According to the experimental results, the above scheme eliminated the path redundancy of attack graphs and achieved comprehensive prediction of attack paths.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.