Optimal <italic>k Cut-Sets</italic> in Attack/Defense Strategies on Networks
The paper investigates the most critical k cut-sets to target in the context of attacks on networks. The targeted network fails if the attack successfully disables a full cut-set. The attack process is dynamic and targets one link at a time. We assume perfect information, so that the attacker picks...
Main Authors: | Mehdi Mrad, Umar S. Suryahatmaja, Asma Ben Yaghlane, M. Naceur Azaiez |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9142185/ |
Similar Items
-
Attack Strategies on Networks With a Budget Constraint
by: Mehdi Mrad, et al.
Published: (2021-01-01) -
On the independent set interdiction problem
by: Gholam Hassan Shirdel, et al.
Published: (2015-10-01) -
ELS: A Fast Parameter-Free Edition Algorithm With Natural Neighbors-Based Local Sets for <italic>k</italic> Nearest Neighbor
by: Suwen Zhao, et al.
Published: (2020-01-01) -
Impersonation Attack-Defense Tree
by: Yusep Rosmansyah, et al.
Published: (2020-10-01) -
Generalized Meet in the Middle Cryptanalysis of Block Ciphers With an Automated Search Algorithm
by: Siavash Ahmadi, et al.
Published: (2020-01-01)