Loading [MathJax]/extensions/MathZoom.js
Optimizing the Maximum Vertex Coverage Attacks Under Knapsack Constraint | IEEE Journals & Magazine | IEEE Xplore

Optimizing the Maximum Vertex Coverage Attacks Under Knapsack Constraint


Abstract:

Only when we understand how hackers think, can we defend against their attacks. Towards this end, this paper studies the cyber-attacks that aim to remove nodes or links f...Show More

Abstract:

Only when we understand how hackers think, can we defend against their attacks. Towards this end, this paper studies the cyber-attacks that aim to remove nodes or links from network topologies. We particularly focus on one type of such attacks called Maximum Vertex Coverage Attacks under Knapsack constraint (MVCAK), in which a hacker has a fixed budget to remove nodes from a network with the nodes involving different costs for removal, and the hacker's goal is to maximize the number of links incident to the nodes removed. Since the MVCAK problem is NP-hard, we firstly propose an optimal solution by Integer Linear Program formulation. Secondly, we give an approximate solution by Linear Programming relaxation that achieves an approximation ratio of 3/4, outperforming the existing 1 - 1/sqrt(e) (about 0.39). Thirdly, since the straightforward implementation of our approximate solution has a high time complexity, we propose two heuristics to significantly reduce its complexity while preserving the approximation ratio. We formally prove the correctness and the effectiveness of these two heuristics. Finally, we conduct extensive experiments on both artificial and real-world networks, showing that our approximate solution produces almost the same results as the optimal solution in practice and has an acceptable running time.
Published in: IEEE/ACM Transactions on Networking ( Volume: 29, Issue: 3, June 2021)
Page(s): 1088 - 1104
Date of Publication: 10 February 2021

ISSN Information:

Funding Agency:

References is not available for this document.

I. Introduction

Infrastructure networks such as Internet backbone and power grids are essential for our everyday lives [2]. Unfortunately, they have become attractive targets for cyber-attacks because (1) they were typically not deployed with security as a major concern initially; (2) undermining them has an enormous impact; and (3) updating/patching them entirely is very difficult due to their large scales. As a result, cyber-attacks on them have occurred frequently in recent years [3]. For example, a DDoS attack on the Domain Name Service provider Dyn Inc. in 2016 made tens of millions of users worldwide lose Internet access for hours [4]; the ’WannaCry’ ransomware attack on UK’s NHS network in 2017 eventually infected about 230,000 computers in 150 countries [5].

Select All
1.
T. Zhao, "Optimising maximum vertex coverage attacks under knapsack constraint", 2019, [online] Available: https://www.researchgate.net/publication/340435568_Optimising_Maximum_Vertex_Coverage_ Attacks_under_Knapsack_Constraint.
2.
J. Zhang, E. Modiano and D. Hay, "Enhancing network robustness via shielding", IEEE/ACM Trans. Netw., vol. 25, no. 4, pp. 2209-2223, Apr. 2017.
3.
M.-E. Paté-Cornell, M. Kuypers, M. Smith and P. Keller, "Cyber risk management for critical infrastructure: A risk analysis model and three case studies", Risk Anal., vol. 38, no. 2, pp. 226-241, Feb. 2018.
4.
Distributed Denial-of-Service Attacks (DDOS Attacks) on DNS Provider DYN, 2019, [online] Available: https://en.wikipedia.org/wiki/2016_Dyn_cyberattack.
5.
Wannacry Ransomware Attack, 2019, [online] Available: https://en.wikipedia.org/wiki/WannaCry_ransomware_attack.
6.
Y. Deng, J. Wu, Y. Xiao, M. Zhang, Y. Yu and Y. Zhang, "Optimal disintegration strategy with heterogeneous costs in complex networks", IEEE Trans. Syst. Man Cybern. Syst., vol. 50, no. 8, pp. 2905-2913, Aug. 2020.
7.
X. Chen, R. Wang, M. Tang, S. Cai, E. Stanley and L. Braunstein, "Suppressing epidemic spreading in multiplex networks with social-support", New J. Phys., vol. 20, pp. 1-15, Jan. 2018.
8.
G. Giakkoupis, F. Mallmann-Trenn and H. Saribekyan, "How to spread a rumor: Call your neighbors or take a walk?", Proc. ACM Symp. Princ. Distrib. Comput., pp. 24-33, Jul. 2019.
9.
R. Albert, H. Jeong and A.-L. Barabási, "Error and attack tolerance of complex networks", Nature, vol. 406, no. 6794, pp. 378-382, Jul. 2000.
10.
P. Holme, B. J. Kim, C. N. Yoon and S. K. Han, "Attack vulnerability of complex networks", Phys. Rev. E Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top., vol. 65, no. 5, May 2002.
11.
S. Zhang, W. Si, T. Qiu and Q. Cao, "Toward more effective centrality-based attacks on network topologies", Proc. IEEE Int. Conf. Commun. (ICC), pp. 1-6, Jun. 2020.
12.
Y. Deng, J. Wu and Y.-J. Tan, "Optimal attack strategy of complex networks based on tabu search", Phys. A Stat. Mech. Appl., vol. 442, pp. 74-81, Jan. 2016.
13.
Y. Deng, J. Wu, M. Qi and Y. Tan, "Optimal disintegration strategy in spatial networks with disintegration circle model", Chaos An Interdiscipl. J. Nonlinear Sci., vol. 29, no. 6, pp. 1-10, 2019.
14.
R.-H. Li, J. X. Yu, X. Huang, H. Cheng and Z. Shang, "Measuring robustness of complex networks under MVC attack", Proc. 21st ACM Int. Conf. Inf. Knowl. Manage. (CIKM), pp. 1512-1516, 2012.
15.
R.-H. Li, J. X. Yu, X. Huang, H. Cheng and Z. Shang, "Measuring the impact of MVC attack in large complex networks", Inf. Sci., vol. 278, pp. 685-702, Sep. 2014.
16.
C. M. Schneider, A. A. Moreira, J. S. Andrade, S. Havlin and H. J. Herrmann, "Mitigation of malicious attacks on networks", Proc. Nat. Acad. Sci. USA, vol. 108, no. 10, pp. 3838-3841, 2011.
17.
T. Qiu, A. Zhao, F. Xia, W. Si and D. O. Wu, "ROSE: Robustness strategy for scale-free wireless sensor networks", IEEE/ACM Trans. Netw., vol. 25, no. 5, pp. 2944-2959, Oct. 2017.
18.
T. Qiu, J. Liu, W. Si and D. O. Wu, "Robustness optimization scheme with multi-population co-evolution for scale-free wireless sensor networks", IEEE/ACM Trans. Netw., vol. 27, no. 3, pp. 1028-1042, Jun. 2019.
19.
S. Shen, J. C. Smith and R. Goli, "Exact interdiction models and algorithms for disconnecting networks via node deletions", Discrete Optim., vol. 9, no. 3, pp. 172-188, Aug. 2012.
20.
S. Shen and J. C. Smith, "Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs", Networks, vol. 60, no. 2, pp. 103-119, Sep. 2012.
21.
D. Williamson and D. Shmoys, The Design of Approximation Algorithms, Cambridge, U.K.:Cambridge Univ. Press, 2011.
22.
A. A. Ageev and M. I. Sviridenko, "Pipage rounding: A new method of constructing algorithms with proven performance guarantee", J. Combinat. Optim., vol. 8, no. 3, pp. 307-328, Sep. 2004.
23.
Submodular Set Function, Sep. 2019, [online] Available: https://en.wikipedia.org/wiki/Submodular_set_function.
24.
P. Hart, N. Nilsson and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths", IEEE Trans. Syst. Sci. Cybern., vol. SSC-4, no. 2, pp. 100-107, Jul. 1968.
25.
T. Cormen, C. Leiserson, R. Rivest and C. Stein, Introduction to Algorithms, Cambridge, MA, USA:MIT Press, 2009.
26.
J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen and N. Glance, "Cost-effective outbreak detection in networks", Proc. 13th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining (KDD), pp. 420-429, 2007.
27.
P. M. Vaidya, "Speeding-up linear programming using fast matrix multiplication", Proc. 30th Annu. Symp. Found. Comput. Sci., pp. 332-337, 1989.
28.
Harmonic Series, 2019, [online] Available: https://en.wikipedia.org/wiki/Harmonic_series_(mathematics).
29.
Stirling’s Approximation, 2019, [online] Available: https://en.wikipedia.org/wiki/Stirling%27s_approximation.
30.
Markov’s Inequality, 2020, [online] Available: https://en.wikipedia.org/wiki/Markov_inequality.
Contact IEEE to Subscribe

References

References is not available for this document.