A Novel Model of Mimic Defense Based on Minimal L-Order Error Probability

Abstract

Mimic defense is an active defense theory, which aims to fundamentally change the "easy to attack and difficult to defend" situation of network security. In this paper, we propose an evaluation method based on the minimum probability of successful attack, and improve the evaluation scheme of historical confidence. We combine the two evaluation schemes with the TOPSIS (technique for order performance by similarity to ideal solution) algorithm, and finally form a complete heterogeneous variant dynamic scheduling model. Different from traditional multi-mode voting algorithm, the effect of heterogeneous degree in voting is considered, and we use Bayesian estimation to obtain the optimal result in the probabilistic sense. Finally, simulation results show that the proposed algorithm can effectively enhance the dynamic and security of the mimic defense model, and give full play to the characteristics of mimic defense.

An Optimal Seed Scheduling Strategy Algorithm Applied to Cyberspace Mimic Defense

“…Although the introduction of a feedback mechanism into the scheduling strategy algorithm is of great help to improving the defense performance of the mimic defense system, it is pity that there is still lacking a reliable feedback mechanism in the field of mimic defense scheduling algorithms. For example, Wu proposed a qualitative setting standard for feedback indicator in [27], but he did not give a specific quantitative setting method; Gao et al simply increase or decrease the feedback index value by the same factor in [41], which is disable to effectively reflect the real-time security of each executor by that feedback mechanism; In [49], Guoxi Chen et al proposed a feedback method that comprehensively considering the online hours and historical breached times of each executor. Although the mechanism is dynamic to a certain extent, it is still difficult to effectively prevent network attackers from repeating the previous successful attacks to online executors.…”