Finding Optimal Attack Path Using Attack Graphs: A Survey
Supriya Khaitan1, Supriya Raheja2
1Supriya Khaitan, CSE Department, Sharda University, Greater Noida, India.
2Supriya Raheja, CSE Department, ITM University, Gurgaon, India.
Manuscript received on June 15, 2011. | Revised Manuscript received on June 25, 2011. | Manuscript published on July 05, 2011. | PP: 33-36 | Volume-1 Issue-3, July 2011. | Retrieval Number: C048051311
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: As the traditional methods, the result of vulnerability scanning can’t directly reflect complex attack routes existing in network, so the concept of attack graph comes. After analyzing host computer, devices link relation and the characteristic of attack, the model of network security status was built. Attack graphs are one of the important tools for analyzing security. A lot of research has been done on issues such as scalable and time efficient ways of generation of attack graphs. The intent of this paper is to study different ways to generate an attack graph and to provide future scope for research on these attack graphs.
Keywords: Attack Graph, Attack Path, Network Security, optimal attack path.