Impulsive Artificial Defense Against Advanced Persistent Threat

被引:6
作者
Sun, Hao [1 ]
Yang, Xiaofan [1 ]
Yang, Lu-Xing [2 ]
Huang, Kaifan [1 ]
Li, Gang [2 ]
机构
[1] Chongqing Univ, Sch Big Data & Software Engn, Chongqing 400044, Peoples R China
[2] Deakin Univ, Sch Informat Technol, Melbourne, Vic 3125, Australia
基金
中国国家自然科学基金;
关键词
Advanced persistent threat; impulsive artificial APT defense; IAD problem; state evolutionary model; optimal impulsive control model; optimality system; iterative algorithm; convergence; effectiveness; GAME;
D O I
10.1109/TIFS.2023.3284564
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Advanced persistent threat (APT) as a new type of cyber espionage poses a severe threat to modern organizations. Artificial APT defense, in which an organization engages experienced cybersecurity experts to artificially check if there exist rootkits implanted by APT actors within the organizational internet and, if so, artificially remove the discovered rootkits, is recognized as an indispensable part of APT defense. There are two different ways of artificial APT defenses: continuous artificial defense (CAD), where the defense work is conducted at all time points, and impulsive artificial defense (IAD), where the defense work is conducted at a scheduled sequence of time points. IAD is superior to CAD in terms of the overall service cost. In the context of IAD, we refer to each sequence of service costs as an IAD policy. This paper addresses the problem of developing a cost-effective IAD policy (the IAD problem). First, by introducing an impulsive state evolutionary model for the organizational intranet, the IAD problem is reduced to an optimal impulsive control model (the IAD model). Second, by deriving the optimality system for the IAD model, an iterative algorithm for solving the IAD model (the IAD algorithm) is presented. Next, the convergence and effectiveness of the IAD algorithm are validated through numerical experiments. Finally, the effect of some factors is inspected. To our knowledge, this is the first time IAD is inspected from the perspective of optimal impulsive control theory.
引用
收藏
页码:3506 / 3516
页数:11
相关论文
共 50 条
[1]  
Alpcan T., 2010, Network Security: A Decision and Game Theoretic Approach
[2]   A Survey on Advanced Persistent Threats: Techniques, Solutions, Challenges, and Research Opportunities [J].
Alshamrani, Adel ;
Myneni, Sowmya ;
Chowdhary, Ankur ;
Huang, Dijiang .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2019, 21 (02) :1851-1877
[3]   IMPULSIVE OPTIMAL-CONTROL WITH FINITE OR INFINITE TIME HORIZON [J].
BLAQUIERE, A .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1985, 46 (04) :431-439
[4]  
Blaquiere A., 1977, Proceedings of a Workshop on Differential Games and Applications, P34, DOI 10.1007/BFb0009063
[5]  
Blaquiere A., 1979, NECESSARY SUFFICIENT
[6]  
Brewer Ross, 2014, Network Security, V2014, P5, DOI 10.1016/S1353-4858(14)70040-6
[7]   A tutorial on the deterministic Impulse Control Maximum Principle: Necessary and sufficient optimality conditions [J].
Chahim, Mohammed ;
Hartl, Richard F. ;
Kort, Peter M. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 219 (01) :18-26
[8]   Security as a Service for Cloud-Enabled Internet of Controlled Things Under Advanced Persistent Threats: A Contract Design Approach [J].
Chen, Juntao ;
Zhu, Quanyan .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2017, 12 (11) :2736-2750
[9]   Optimization of APT attack detection based on a model combining ATTENTION and deep learning [J].
Cho Do Xuan ;
Duc Duong .
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2022, 42 (04) :4135-4151
[10]  
Cole E., 2013, Advanced persistent threat: Understanding the danger and how to protect your organization