Intrusive intention recognition based on attack path graph

Wu Peng*, Chang Zhen Hu, Shu Ping Yao

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

In order to predict an attacker's high level goals and assess network security situation, an intrusive intention recognition method is presented in this paper. Concept and taxonomy of intrusive intention are introduced at first. Then, to reduce complexity of understanding and analysis, a method of hierarchical attack path graph generation is proposed to recognize intrusive intention. Based on the attack path graph, the algorithms for evaluating quantitatively intention accessibility, reliable probability, attack path prediction and possible minimum attack path are developed. Next, economical and effective protective measures are addressed to block attackers' intention to be achieved, by applying minimum vertex cut set theory to directed graph. Finally several experiments are done to prove the feasibility and validity of this method.

Original languageEnglish
Pages (from-to)1077-1081
Number of pages5
JournalBeijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology
Volume30
Issue number9
Publication statusPublished - Sept 2010

Keywords

  • Attack path graph
  • Intrusive intention recognition
  • Minimum cut set theory

Fingerprint

Dive into the research topics of 'Intrusive intention recognition based on attack path graph'. Together they form a unique fingerprint.

Cite this

Peng, W., Hu, C. Z., & Yao, S. P. (2010). Intrusive intention recognition based on attack path graph. Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology, 30(9), 1077-1081.