Zero-determinant Strategy for Moving Target Defense: Existence, Performance, and Computation
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909026862759936 |
|---|---|
| author | Cheng, Zhaoyang Chen, Guanpu Hong, Yiguang Cao, Ming Skoglund, Mikael |
| author_facet | Cheng, Zhaoyang Chen, Guanpu Hong, Yiguang Cao, Ming Skoglund, Mikael |
| contents | Moving Target Defense (MTD) is commonly formulated as a repeated security game to mitigate persistent threats. Although the strong Stackelberg equilibrium (SSE) characterizes the defender's optimal strategy in the leader-follower framework, computing the SSE often incurs high computational complexity, which significantly limits its practical deployment in MTD problems with multiple targets. This paper proposes adopting a zero-determinant (ZD) strategy for constructing an MTD strategy that achieves both high defensive performance and substantially low computational complexity. We first derive a necessary and sufficient condition for the existence of ZD strategies and investigate the performance of ZD strategies, which shows their upper-bound performance matches that of the SSE strategy. We then formulate two programs to find the optimal ZD strategy parameters under different conditions. Moreover, we design an algorithm to compute the proposed ZD strategies, along with the computational complexity analysis in comparison with the traditional SSE computation. Finally, we conduct experiments on two practical applications to verify our results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_07854 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Zero-determinant Strategy for Moving Target Defense: Existence, Performance, and Computation Cheng, Zhaoyang Chen, Guanpu Hong, Yiguang Cao, Ming Skoglund, Mikael Computer Science and Game Theory Cryptography and Security Moving Target Defense (MTD) is commonly formulated as a repeated security game to mitigate persistent threats. Although the strong Stackelberg equilibrium (SSE) characterizes the defender's optimal strategy in the leader-follower framework, computing the SSE often incurs high computational complexity, which significantly limits its practical deployment in MTD problems with multiple targets. This paper proposes adopting a zero-determinant (ZD) strategy for constructing an MTD strategy that achieves both high defensive performance and substantially low computational complexity. We first derive a necessary and sufficient condition for the existence of ZD strategies and investigate the performance of ZD strategies, which shows their upper-bound performance matches that of the SSE strategy. We then formulate two programs to find the optimal ZD strategy parameters under different conditions. Moreover, we design an algorithm to compute the proposed ZD strategies, along with the computational complexity analysis in comparison with the traditional SSE computation. Finally, we conduct experiments on two practical applications to verify our results. |
| title | Zero-determinant Strategy for Moving Target Defense: Existence, Performance, and Computation |
| topic | Computer Science and Game Theory Cryptography and Security |
| url | https://arxiv.org/abs/2605.07854 |