关键词: 最小关键策略集, 二进制粒子群算法, 攻击图, 防御代价

Abstract: Attack graph is a common tool for qualitative analysis of network security, which provides important basis for network security administrators to prevent malicious?intrusions. To evaluate the security of network and perform active defense, the paper presents a defense graph model and an improved binary particle swarm optimization algorithm. It builds defense measure set with weights based on each intrusion action in the attack graph, intends to highlight the defense costs. In order to minimize the cost to prevent malicious attacks, it introduces and improves binary particle swarm optimization algorithm BPSO, and obtains the minimum critical measure set of the attack graph. Simulation results show that it can effectively obtain the optimization solution of the minimum critical measure set, and through the comparison with traditional greedy algorithm experiments, it proves that it is a more efficient optimization algorithm.

Key words: minimum critical measure set, Binary Particle Swarm Optimization（BPSO）, attack graph, defence cost