Name
Abstract | ||
|---|---|---|
In this paper, we investigate a model where a defender and an attacker simultaneously and repeatedly adjust the defenses and attacks. Under this model, we propose two iterative reinforcement learning algorithms which allow the defender to identify optimal defenses when the information about the attacker is limited. With probability one, the adaptive reinforcement learning algorithm converges to the best response with respect to the attacks when the attacker diminishingly explores the system. With a probability arbitrarily close to one, the robust reinforcement learning algorithm converges to the min-max strategy despite that the attacker persistently explores the system. The algorithm convergence is formally proven and the algorithm performance is verified via numerical simulations. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2663474.2663481 | MTD@CCS |
Keywords | Field | DocType |
algorithms,insurance,security,unauthorized access | Heartbleed,Computer science,Computer security,Best response,Algorithm,Cyber defense,Artificial intelligence,Algorithm convergence,Reinforcement learning algorithm,Reinforcement learning | Conference |
Citations | PageRank | References |
5 | 0.46 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Minghui Zhu | 1 | 44 | 12.11 |
| Zhisheng Hu | 2 | 7 | 3.86 |
| Peng Liu | 3 | 7 | 2.17 |