Abstract
Establishing a complete network defense system is one of the hot research directions in recent years. Some approaches are based on attack graphs and heuristic algorithms, and others involve game theory. However, some of these algorithms lack clear key parameters, some are much affected by the structure of the graph. In this paper, we propose an algorithm called Monte Carlo Graph Search algorithm (MCGS) based on Monte Carlo Tree Search algorithm, a classic algorithm of game theory. Compared with other methods, our method is generally superior on the cost of time and space and barely affected by the structure of a graph. In addition, the steps of ours are more concise and work well for a graph. We design a system model of multiple attackers and one defender and combine it with our algorithm. A weight vector is designed for each host to describe its key information. After a number of iterations, the algorithm comes to an end along with an established optimal defense system. Experiments show that the algorithm is efficient and able to solve more problems since it is not limited to the structure of graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Dewri, R., Ray, I., Poolsappasit, N., Whitley, D.: Optimal security hardening on attack tree models of networks: a cost-benefit analysis. Int. J. Inf. Secur. 11(3), 167–188 (2012)
Nandi, A.K., Medal, H.R., Vadlamani, S.: Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model. Comput. Oper. Res. 75, 118–131 (2016)
Kozelek, T.: Methods of MCTS and the game Arimaa. Master’s thesis, Charles University in Prague (2009)
Roy, A., Kim, D.S., Trivedi, K.S.: Cyber security analysis using attack countermeasure trees. In: Proceedings of the Sixth Annual Workshop on Cyber Security and Information Intelligence Research, CSIIRW 2010. ACM, NewYork (2010)
Lippmann, R., et al.: Validating and restoring defense in depth using attack graphs. In: 2006 IEEE Military Communications Conference, MILCOM 2006. IEEE, pp. 1–10, October 2006
Lippmann, R.P., Ingols, K.W.: An annotated review of past papers on attack graphs. Technical report PR-A-1, Massachusetts Institute of Technology, Lincoln Lab, Lexington (2005)
Alderson, D.L., Brown, G.G., Carlyle, W.M.: Assessing and improving operational resilience of critical infrastructures and other systems. Tutor. Oper. Res. 180–215 (2014)
Alhomidi, M., Reed, M.: Finding the minimum cut set in attack graphs using genetic algorithms. In: 2013 ICCAT. IEEE, pp. 1–6 (2013)
Nandi, A.K., Medal, H.R.: Methods for removing links in network to minimize the spread of infections. Comput. Oper. Res. 69, 10–24 (2016)
Zonouz, S.A., Khurana, H., Sanders, W.H., Yardley, T.M.: RRE: a game-theoretic intrusion response and recovery engine. In: IEEE/IFIP International Conference on Dependable Systems and Networks. DSN 2009. IEEE, June 2009, pp. 439–448 (2009)
Wang, S., Zhang, Z.: Exploring attack graph for costbenefit security harding: a probabilistic approach. Comput. Secur. 32, 158–169 (2013)
Watson, J.-P., Murray, R., Hart, W.E.: Formulation and optimization of robust sensor placement problems for drinking water contamination warning systems. J. Infrastruct. Syst. 15(4), 330–339 (2009)
Nehme, M.V.: Two-person games for stochastic network interdiction: models, methods, and complexities. Ph.D. thesis. The University of Texas at Austin (2009)
Chen, F., Zhamg, Y., Su, J., Han, W.: Two formal analyses of attack graphs. J. Softw. 21(4), 838–848 (2010)
Medková, J., Čeleda, P.: Network defence using attacker-defender interaction modelling. In: Badonnel, R., Koch, R., Pras, A., Drašar, M., Stiller, B. (eds.) AIMS 2016. LNCS, vol. 9701, pp. 127–131. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-39814-3_12
Acknowledgment
This work is supported by funding from Basic Scientific Research Program of Chinese Ministry of Industry and Information Technology (Grant No. JCKY2016602B001).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Zhang, Z., Lv, K., Hu, C. (2018). Establishing an Optimal Network Defense System: A Monte Carlo Graph Search Method. In: Liu, F., Xu, S., Yung, M. (eds) Science of Cyber Security. SciSec 2018. Lecture Notes in Computer Science(), vol 11287. Springer, Cham. https://doi.org/10.1007/978-3-030-03026-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-03026-1_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03025-4
Online ISBN: 978-3-030-03026-1
eBook Packages: Computer ScienceComputer Science (R0)