A partition matching method for optimal attack path analysis

Hui Xie, Kun Lv, Changzhen Hu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

Optimal attack path planning has a significant impact on network security. According to an optimal attack path, an attacker can quickly and efficiently attack the target host. This article proposes a partition matching method (PM) to infer the optimal attack path. PM can avoid the problem of path loss and get the result quickly. PM has two steps: network partition and local path matching. The target of the network partition is to divide the network into certain parts and find out the key nodes. The local path matching aims to splice the local paths in partitioned networks into a full path. In the target network, every host has a weight matrix which includes host connect number, CVSS value and their respective priorities. A cost function is proposed to calculate evaluation values of optimal local paths and the evaluation value of full optimal attack path based on the weight matrix. Results of our experiment demonstrate the capabilities of PM which can generate an optimal attack path in one single run. The results obtained by PM show good performance and are compared with other methods.

Original languageEnglish
Title of host publicationProceedings - 16th IEEE International Symposium on Parallel and Distributed Processing with Applications, 17th IEEE International Conference on Ubiquitous Computing and Communications, 8th IEEE International Conference on Big Data and Cloud Computing, 11th IEEE International Conference on Social Computing and Networking and 8th IEEE International Conference on Sustainable Computing and Communications, ISPA/IUCC/BDCloud/SocialCom/SustainCom 2018
EditorsJinjun Chen, Laurence T. Yang
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages120-126
Number of pages7
ISBN (Electronic)9781728111414
DOIs
Publication statusPublished - 2 Jul 2018
Event16th IEEE International Symposium on Parallel and Distributed Processing with Applications, 17th IEEE International Conference on Ubiquitous Computing and Communications, 8th IEEE International Conference on Big Data and Cloud Computing, 11th IEEE International Conference on Social Computing and Networking and 8th IEEE International Conference on Sustainable Computing and Communications, ISPA/IUCC/BDCloud/SocialCom/SustainCom 2018 - Melbourne, Australia
Duration: 11 Dec 201813 Dec 2018

Publication series

NameProceedings - 16th IEEE International Symposium on Parallel and Distributed Processing with Applications, 17th IEEE International Conference on Ubiquitous Computing and Communications, 8th IEEE International Conference on Big Data and Cloud Computing, 11th IEEE International Conference on Social Computing and Networking and 8th IEEE International Conference on Sustainable Computing and Communications, ISPA/IUCC/BDCloud/SocialCom/SustainCom 2018

Conference

Conference16th IEEE International Symposium on Parallel and Distributed Processing with Applications, 17th IEEE International Conference on Ubiquitous Computing and Communications, 8th IEEE International Conference on Big Data and Cloud Computing, 11th IEEE International Conference on Social Computing and Networking and 8th IEEE International Conference on Sustainable Computing and Communications, ISPA/IUCC/BDCloud/SocialCom/SustainCom 2018
Country/TerritoryAustralia
CityMelbourne
Period11/12/1813/12/18

Keywords

  • Dynamic programming
  • Network security
  • Optimal attack path
  • Partition matching method

Fingerprint

Dive into the research topics of 'A partition matching method for optimal attack path analysis'. Together they form a unique fingerprint.

Cite this