Skip to main content

Optimal Attack Path Generation Based on Supervised Kohonen Neural Network

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 10394))

Abstract

Attack graph is a general paradigm to model the weakness of an information system network and all possible attack sequences that attackers can obtain specific targets. In real systems, a vast majority of attack graph generation methods suffer from the states explosion issue. However, if we can predict which attack actions will own the maximum probability to be exploited by intruders precisely, namely finding the optimal attack path, we can solve this problem. In this paper, we propose an attack graph generation algorithm based on supervised Kohonen neural network. Using this method, we can presage the attack success rate and attack status types which would be attained if attackers successfully exploit vulnerabilities. Based on these results and the network topology, a probabilistic matrix and an optimal atomic attack matrix are proposed by us. Finally, the two matrices can be effectively used to generate the optimal attack path. After modeling the optimal path, the core nodes in the target network can be located, and network administrators can enact a series of effective defense strategies according to them.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Kaynar, K., Sivrikaya, F.: Distributed attack graph generation. IEEE Trans. Dependable Secure Comput. 13(5), 519–532 (2016)

    Article  Google Scholar 

  2. Shaik, A., Chandulal, J.A., Nageswara Rao, K., Kumar, S.G.: Improving network security using machine learning techniques. In: IEEE International Conference on Computational Intelligence and Computing Research, vol. 7363, pp. 1–5 (2012)

    Google Scholar 

  3. Wu, D., Feng, D.G., Lian, Y.F., Chen, K.: Efficiency evaluation model of system security measures in the given vulnerabilities set. J. Softw. 23(7), 1880–1898 (2012). (in Chinese with English abstract)

    Article  Google Scholar 

  4. Mehta, V., Bartzis, C., Zhu, H., Clarke, E., Wing, J.: Ranking attack graphs. In: Zamboni, D., Kruegel, C. (eds.) RAID 2006. LNCS, vol. 4219, pp. 127–144. Springer, Heidelberg (2006). doi:10.1007/11856214_7

    Chapter  Google Scholar 

  5. Haykin, S.: Neural Networks and Learning Machines, 3rd edn. Prentice Hall Press, Inc., Upper Saddle River (2009)

    Google Scholar 

  6. Kohonen, T.: Self-organization and Associative Memory, vol. 8(1), pp. 3406–3409. Springer, Berlin (1989)

    Book  Google Scholar 

  7. Common vulnerabilities and exposures. http://cve.mitre.org

  8. Common vulnerability scoring system (CVSS). Version 3.0. https://www.first.org/cvss

  9. Zhang, Y.Z., Yun, X.C., Hu, M.Z.: Research on privilege-escalating based vulnerability taxonomy with multidimensional quatitative attribute. J. China Inst. Commun. 25(7), 7–14 (2004). (in Chinese with English abstract)

    Google Scholar 

  10. National vulnerability database. http://nvd.nist.gov/

  11. Wang, H.S., Gui, X.L.: A new network security model based on Machine Learning. In: International Conference on Control Engineering and Communication Technology, pp. 860–865 (2012)

    Google Scholar 

  12. Zomlot, L., Chandran, S., Caragea, D., Ou, X.M.: Aiding intrusion analysis using machine learning. In: 12th International Conference on Machine Learning and Applications, pp. 40–47 (2013)

    Google Scholar 

  13. Bi, K., Han, D.Z., Wang, J.: K maximum probability attack paths dynamic generation algorithm. Comput. Sci. Inf. Syst. 13(2), 677–689 (2016)

    Article  Google Scholar 

  14. Wang, S., Zhang, Z., Kadobayashi, Y.: Exploring attack graph for cost-benefit security hardening: a probabilistic approach. Comput. Secur. 32(1), 158–169 (2013)

    Article  Google Scholar 

  15. Lu, L., Safavi-Naini, R., Hagenbuchner, M., Susilo, W., Horton, J., Yong, S.L., Tsoi, A.C.: Ranking attack graphs with graph neural networks. In: Bao, F., Li, H., Wang, G. (eds.) ISPEC 2009. LNCS, vol. 5451, pp. 345–359. Springer, Heidelberg (2009). doi:10.1007/978-3-642-00843-6_30

    Chapter  Google Scholar 

Download references

Acknowledgements

This work is supported by funding from Basic Scientific Research Program of Chinese Ministry of Industry and Information Technology (Grant No. JCKY2016602B001) and National Key R&D Program of China (Grant No. 2016YFB0800700).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kun Lv .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Chen, Y., Lv, K., Hu, C. (2017). Optimal Attack Path Generation Based on Supervised Kohonen Neural Network. In: Yan, Z., Molva, R., Mazurczyk, W., Kantola, R. (eds) Network and System Security. NSS 2017. Lecture Notes in Computer Science(), vol 10394. Springer, Cham. https://doi.org/10.1007/978-3-319-64701-2_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-64701-2_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-64700-5

  • Online ISBN: 978-3-319-64701-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics