Name
Abstract | ||
|---|---|---|
AbstractGrowing multi-stage attacks in computer networks impose significant security risks and necessitate the development of effective defense schemes that are able to autonomously respond to intrusions during vulnerability windows. However, the defender faces several real-world challenges, e.g., unknown likelihoods and unknown impacts of successful exploits. In this article, we leverage reinforcement learning to develop an innovative adaptive cyber defense to maximize the cost-effectiveness subject to the aforementioned challenges. In particular, we use Bayesian attack graphs to model the interactions between the attacker and networks. Then we formulate the defense problem of interest as a partially observable Markov decision process problem where the defender maintains belief states to estimate system states, leverages Thompson sampling to estimate transition probabilities, and utilizes reinforcement learning to choose optimal defense actions using measured utility values. The algorithm performance is verified via numerical simulations based on real-world attacks. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3418897 | ACM Transactions on Privacy and Security |
Keywords | DocType | Volume |
Reinforcement learning, adaptive cyber defense, Thompson sampling | Journal | 24 |
Issue | ISSN | Citations |
1 | 2471-2566 | 1 |
PageRank | References | Authors |
0.35 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhisheng Hu | 1 | 7 | 3.86 |
| Minghui Zhu | 2 | 44 | 12.11 |
| Peng Liu | 3 | 7 | 2.17 |