TY - GEN
T1 - Establishing an optimal network defense system
T2 - 1st International Conference on Science of Cyber Security, SciSec 2018
AU - Zhang, Zhengyuan
AU - Lv, Kun
AU - Hu, Changzhen
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2018.
PY - 2018
Y1 - 2018
N2 - 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.
AB - 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.
KW - Attack graph
KW - Game theory
KW - Monte Carlo Graph Search
KW - Network defense system
KW - Network security
UR - http://www.scopus.com/inward/record.url?scp=85057868799&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-03026-1_13
DO - 10.1007/978-3-030-03026-1_13
M3 - Conference contribution
AN - SCOPUS:85057868799
SN - 9783030030254
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 181
EP - 190
BT - Science of Cyber Security - 1st International Conference, SciSec 2018, Revised Selected Papers
A2 - Liu, Feng
A2 - Yung, Moti
A2 - Xu, Shouhuai
PB - Springer Verlag
Y2 - 12 August 2018 through 14 August 2018
ER -