Strategic Defense against Stealthy Link Flooding Attacks: A Signaling Game Approach
Not on the map. Why?
Abstract (arXiv)
With the increasing diversity of Distributed Denial-of-Service (DDoS) attacks, it is becoming extremely challenging to design a fully protected network. For instance, Stealthy Link Flooding Attack (SLFA) is a variant of DDoS attacks that strives to block access to a target area by flooding a small set of links, and it is shown that it can bypass traditional DDoS defense mechanisms. One potential solution to tackle such SLFAs is to apply Moving Target Defense (MTD) techniques in which network settings are dynamically changed to confuse/deceive attackers, thus making it highly expensive to launch a successful attack. However, since MTD comes with some overhead to the network, to find the best strategy (i.e., when and/or to what extent) of applying it has been a major challenge. The strategy is significantly influenced by the attacker's behavior that is often difficult to guess. In this work, we address the challenge of obtaining the optimal MTD strategy that effectively mitigates SLFAs while incurs a minimal overhead. We design the problem as a signaling game considering the network defender and the attacker as players. A belief function is established throughout the engagement of the attacker and the defender during this SLFA campaign, which is utilized to pick the best response/action for each player. We analyze the game model and derive a defense mechanism based on the equilibria of the game. We evaluate the technique on a Mininet-based network environment where an attacker is performing SLFAs and a defender applies MTD based on equilibria of the game. The results show that our signaling game-based dynamic defense mechanism can provide a similar level of protection against SLFAs like the extensive MTD solution, however, causing a significantly reduced overhead.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Dec 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 2.
4 papers.
- 2023Learning Near-Optimal Intrusion Responses Against Dynamic Attackerscited by 13
- 2024Automated Security Response through Online Learning with Adaptive Conjecturescited by 13
- 2024Optimal Defender Strategies for CAGE-2 using Causal Modeling and Tree Searchcited by 12
- 2022Learning Security Strategies through Game Play and Optimal Stoppingcited by 5
- 2024Optimal Defender Strategies for CAGE-2 using Causal Modeling and Tree Search12 Jul 2024
- 2024Automated Security Response through Online Learning with Adaptive Conjectures19 Feb 2024
- 2023Learning Near-Optimal Intrusion Responses Against Dynamic Attackers11 Jan 2023
- 2022Learning Security Strategies through Game Play and Optimal Stopping29 May 2022