Optimal Timing of Moving Target Defense: A Stackelberg Game Model
| Autor: | Zizhan Zheng, Henger Li |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
Structure (mathematical logic)
FOS: Computer and information sciences 0209 industrial biotechnology Mathematical optimization Focus (computing) Sequence Computer science Markov process 02 engineering and technology symbols.namesake 020901 industrial engineering & automation Computer Science - Computer Science and Game Theory 0202 electrical engineering electronic engineering information engineering Stackelberg competition symbols 020201 artificial intelligence & image processing Moving target defense Game theory Computer Science and Game Theory (cs.GT) |
| Zdroj: | MILCOM |
| Popis: | As an effective approach to thwarting advanced attacks, moving target defense (MTD) has been applied to various domains. Previous works on MTD, however, mainly focus on deciding the sequence of system configurations to be used and have largely ignored the equally important timing problem. Given that both the migration cost and attack time vary over system configurations, it is crucial to jointly optimize the spatial and temporal decisions in MTD to better protect the system from persistent threats. In this work, we propose a Stackelberg game model for MTD where the defender commits to a joint migration and timing strategy to cope with configuration-dependent migration cost and attack time distribution. The defender's problem is formulated as a semi-Markovian decision process and a nearly optimal MTD strategy is derived by exploiting the unique structure of the game. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|