EUVIMEDOntdek EUVIMED
Open access · CC BY 4.0

Optimizing the Effectiveness of Moving Target Defense in a Probabilistic Attack Graph: A Deep Reinforcement Learning Approach

Qiuxiang Li, Jianping Wu

Electronics · 2024-09-28 · 13 (19) · 3855

DOI: 10.3390/electronics13193855 ↗

At a glance

Journal article in Electronics, published online on 2024-09-28. Written by Qiuxiang Li and 1 co-authors. Cited 8 times so far (Crossref); 26 references. The full text is freely available (open access, CC BY 4.0).

SamenvattingBibliografische gegevensCiteRelated studies

Abstract (original language)

Moving target defense (MTD) technology baffles potential attacks by dynamically changing the software in use and/or its configuration while maintaining the application’s running states. But it incurs a deployment cost and various performance overheads, degrading performance. An attack graph is capable of evaluating the balance between the effectiveness and cost of an MTD deployment. In this study, we consider a network scenario in which each node in the attack graph can deploy MTD technology. We aim to achieve MTD deployment effectiveness optimization (MTD-DO) in terms of minimizing the network security loss under a limited budget. The existing related works either considered only a single node for deploying an MTD or they ignored the deployment cost. We first establish a non-linear MTD-DO formulation. Then, two deep reinforcement learning-based algorithms are developed, namely, deep Q-learning (DQN) and proximal policy optimization (PPO). Moreover, two metrics are defined in order to effectively evaluate MTD-DO algorithms with varying network scales and budgets. The experimental results indicate that both PPO- and DQN-based algorithms perform better than Q-learning-based and random algorithms. The DQN-based algorithm converges more quickly and performs, in terms of reward, marginally better than the PPO-based algorithm.

Cite

APA

Li, Q., & Wu, J. (2024). Optimizing the Effectiveness of Moving Target Defense in a Probabilistic Attack Graph: A Deep Reinforcement Learning Approach. Electronics, 13(19), 3855. https://doi.org/10.3390/electronics13193855

Vancouver

Li Q, Wu J. Optimizing the Effectiveness of Moving Target Defense in a Probabilistic Attack Graph: A Deep Reinforcement Learning Approach. Electronics. 2024;13(19):3855. doi:10.3390/electronics13193855

BibTeX
@article{Li2024,
  author = {Li, Qiuxiang and Wu, Jianping},
  title = {Optimizing the Effectiveness of Moving Target Defense in a Probabilistic Attack Graph: A Deep Reinforcement Learning Approach},
  journal = {Electronics},
  year = {2024},
  volume = {13},
  number = {19},
  pages = {3855},
  doi = {10.3390/electronics13193855}
}
Start for free →