A new Cybersecurity Strategy for IoE by Exploiting an Optimization Approach

被引:2
作者
Hamrioui, Sofiane [1 ]
Bokhari, Samira [2 ]
机构
[1] ESAIP Engineer Sch, St Barthelimy Danjou, France
[2] USTHB, Fac Math, LaRoMaD, Algiers, Algeria
来源
2021 12TH INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION SYSTEMS (ICICS) | 2021年
关键词
IoE; Cybersecurity; Cyber-attacks; Investment Strategy; Uncertainty; Modeling; Optimization; Robustness; Iterative method; Meta-heuristics; INFORMATION SECURITY INVESTMENT; IMPACT; GAME;
D O I
10.1109/ICICS52457.2021.9464595
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Today's companies are increasingly relying on Internet of Everything (IoE) to modernize their operations. The very complexes characteristics of such system expose their applications and their exchanged data to multiples risks and security breaches that make them targets for cyber attacks. The aim of our work in this paper is to provide an cybersecurity strategy whose objective is to prevent and anticipate threats related to the IoE. An economic approach is used in order to help to take decisions according to the reduction of the risks generated by the non definition of the appropriate levels of security. The considered problem have been resolved by exploiting a combinatorial optimization approach with a practical case of knapsack. We opted for a bi-objective modeling under uncertainty with a constraint of cardinality and a given budget to be respected. To guarantee a robustness of our strategy, we have also considered the criterion of uncertainty by taking into account all the possible threats that can be generated by a cyber attacks over IoE. Our strategy have been implemented and simulated under MATLAB environement and its performance results have been compared to those obtained by NSGA-II metaheuristic. Our proposed cyber security strategy recorded a clear improvment of efficiency according to the optimization of the security level and cost parametrs.
引用
收藏
页码:23 / 28
页数:6
相关论文
共 27 条
[1]   Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights [J].
Al-Maliky, Ferhan ;
Hifi, Mhand ;
Mhalla, Hedi .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2018, 25 (02) :637-666
[2]   Security Optimization of Dynamic Networks with Probabilistic Graph Modeling and Linear Programming [J].
Almohri, Hussain M. J. ;
Watson, Layne T. ;
Yao, Danfeng ;
Ou, Xinming .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2016, 13 (04) :474-487
[3]  
[Anonymous], 2012, OVERVIEW INTERNET TH, P2
[4]  
[Anonymous], 2014, P INT C OP RES
[5]   Robust optimization - methodology and applications [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2002, 92 (03) :453-480
[6]   Robust discrete optimization and network flows [J].
Bertsimas, D ;
Sim, M .
MATHEMATICAL PROGRAMMING, 2003, 98 (1-3) :49-71
[7]   An iterative method for solving a bi-objective constrained portfolio optimization problem [J].
Bezoui, Madani ;
Moulai, Mustapha ;
Bounceur, Ahcene ;
Euler, Reinhardt .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2019, 72 (02) :479-498
[8]   Decision-theoretic and game-theoretic approaches to IT security investment [J].
Cavusoglu, Huseyin ;
Raghunathan, Srinivasan ;
Yue, Wei T. .
JOURNAL OF MANAGEMENT INFORMATION SYSTEMS, 2008, 25 (02) :281-304
[9]  
Cisco, 2020, ANN INT REP WHIT PAP
[10]   Decision support approaches for cyber security investment [J].
Fielder, Andrew ;
Panaousis, Emmanouil ;
Malacaria, Pasquale ;
Hankin, Chris ;
Smeraldi, Fabrizio .
DECISION SUPPORT SYSTEMS, 2016, 86 :13-23