Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Automatic Control and Computer Sciences
Published in: Automatic Control and Computer Sciences 8/2020

01-12-2020

A Model of Optimal Complexification of Measures Providing Information Security

Authors: P. D. Zegzhda, V. G. Anisimov, A. F. Suprun, E. G. Anisimov, T. N. Saurenko, V. P. Los’

Published in: Automatic Control and Computer Sciences | Issue 8/2020

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

An optimization mathematical model and an algorithm of complexification of the measures providing information security are presented. As an indicator of complexification efficiency, the level of the costs of execution of the tasks of providing the information security of a protected object is used. Thus, the costs of the elaboration (preparation) of these measures and their implementation costs for the information security system are considered separately. The optimization algorithm is based on the common principles of the branch and bound method. Its feature is the proposed algorithm for estimating the bounds for alternative branches. The model has a universal character and may be used when developing the algorithms for supporting the corresponding management decisions concerning information security for concrete information infrastructures of managerial-technical, social, economic, and other objects.
previous article Specification-Based Classification of Network Protocol Vulnerabilities
next article Ensuring the Information Security of Wireless Dynamic Networks Based on the Game-Theoretic Approach
Literature
1.
Anisimov, V.G., Anisimov, E.G., Zegzhda, P.D., and Suprun, A.F., The problem of innovative development of information security systems in the transport sector, Autom. Control Comput. Sci., 2018, vol. 52, no. 8, pp. 1105–1110.CrossRef
2.
3.
Lavrova, D.S., Alekseev, I.V., and Shtyrkina, A.A., Security analysis based on controlling dependences of network traffic parameters by wavelet transformation, Autom. Control Comput. Sci., 2018, vol. 52, no. 8, pp. 931–935.CrossRef
4.
Anisimov, V.G., Zegzhda, P.D., Anisimov, E.G., and Bazhin, D.A., A risk-oriented approach to the control arrangement of security protection subsystems of information systems, Autom. Control Comput. Sci., 2016, vol. 50, no. 8, pp. 717–721.CrossRef
5.
Kalinin, M.O., Zubkov, E.A., Suprun, A.F., and Pechenkin, A.I., Prevention of attacks on dynamic routing in self-organizing adhoc networks using swarm intelligence, Autom. Control Comput. Sci., 2018, vol. 52, no. 8, pp. 977–983.CrossRef
6.
Anisimov, V.G., Anisimov, E.G., Saurenko, T.N., and Zotova, E.A., Models of forecasting destructive influence risks for information processes in management systems, Inf.-Upr. Sist., 2019, no. 5, pp. 18–23.
7.
Pavlenko, E.Yu., Yarmak, A.V., and Moskvin, D.A., Hierarchical approach to analyzing security breaches in information systems, Autom. Control Comput. Sci., 2017, vol. 51, no. 8, pp. 829–834.CrossRef
8.
Saurenko, T., et al., Justification of financing of measures to prevent accidents in power systems, Adv. Intell. Syst. Comput., 2019, vol. 983, pp. 295–305.
9.
Kalinin, M.O. and Minin, A.A., Security evaluation of a wireless ad-hoc network with dynamic topology, Autom. Control Comput. Sci., 2017, vol. 51, no. 8, pp. 899–901.CrossRef
10.
Anisimov, V.G., Anisimov, E.G., Zegzhda, P.D., Saurenko, T.N., and Prisyazhnyuk, S.P., Indices of the effectiveness of information protection in an information interaction system for controlling complex distributed organizational objects, Autom. Control Comput. Sci., 2017, vol. 51, no. 8, pp. 824–828.CrossRef
11.
Lavrova, D., Zaitceva, E., and Zegzhda, P., Bio-inspired approach to self-regulation for industrial dynamic network infrastructure, CEUR Workshop Proc., 2019, vol. 2603, pp. 34–39.
12.
Gapov, M.R., et al., Strategicheskoe upravlenie innovatsionnoi deyatel’nost’yu: Analiz, planirovanie, modelirovanie, prinyatiya reshenii, organizatsiya, otsenka (Strategic Innovation Management: Analysis, Planning, Modeling, Decision-Making, Organization, and Assessment), St. Petersburg, 2017.
13.
Anisimov, E.G., Anisimov, V.G., and Sonkin, M.A., Mathematical simulation of adaptive allocation of discrete resources, Proceedings of the 2016 Conference on Information Technologies in Science, Management, Social Sphere and Medicine (ITSMSSM 2016), Tomsk, 2016, pp. 282–285.
14.
Novikov, V.E., et al., Modeling of optimization problems of decision support in innovation management, Vestn. Ross. Tamozhen. Akad., 2016, no. 1, pp. 90–98.
15.
Anisimov, V., Anisimov, E., and Sonkin, M., A resource-and-time method to optimize the performance of several interrelated operations, Int. J. Appl. Eng. Res., 2015, vol. 10, no. 17, pp. 38127–38132.
16.
Anisimov, V.G., et al., Model and method for optimizing computational processes in parallel computing systems, Autom. Control Comput. Sci., 2019, vol. 53, no. 8, pp. 1–7.CrossRef
17.
Alekseev, O.G., Modeli raspredeleniya sredstv porazheniya v dinamike boya (Models for Distribution of Weapons of Destruction in the Dynamics of Battle), Leningrad: Minist. Oborony SSSR, 1989.
18.
Anisimov, V.G. and Anisimov, E.G., An optimization model for distribution of renewable resources in the management of economic systems, Vestn. Ross. Tamozhen. Akad., 2007, no. 1, pp. 49–54.
19.
Il’in, I.V., et al., Matematicheskie metody i instrumental’nye sredstva otsenivaniya effektivnosti investitsii v innovatsionnye proekty (Mathematical Methods and Tools for Evaluating the Effeciency of Investments in Innovative Projects), St. Petersburg, 2018.
20.
Yachkula, N.I., et al., Application of Markov chains to the evaluation of the computational complexity of the simplex method, Izv. Akad. Nauk SSSR, Tekh. Kibern., 1988, no. 3, pp. 59–63.
21.
Anisimov, V.G. and Anisimov, E.G., A branch-and-bound algorithm for one class of scheduling problem, Comput. Math. Math. Phys., 1992, vol. 32, no. 12, pp. 1827–1832.MathSciNetMATH
22.
Alekseev, A.O., Alekseev, O.G., Anisimov, V.G., and Anisimov, E.G., The use of duality to increase the effectiveness of the branch and bound method when solving the knapsack problem, Comput. Math. Math. Phys., 1985, vol. 25, no. 6, pp. 50–54.CrossRef
Metadata
Title
A Model of Optimal Complexification of Measures Providing Information Security
Authors
P. D. Zegzhda
V. G. Anisimov
A. F. Suprun
E. G. Anisimov
T. N. Saurenko
V. P. Los’
Publication date
01-12-2020
Publisher
Pleiades Publishing
Published in
Automatic Control and Computer Sciences / Issue 8/2020
Print ISSN: 0146-4116
Electronic ISSN: 1558-108X
DOI
https://doi.org/10.3103/S0146411620080374

Other articles of this Issue 8/2020

Automatic Control and Computer Sciences 8/2020 Go to the issue

OriginalPaper

Optimal Identification for Objects in Problems on Recognition by Unmanned Underwater Vehicles

OriginalPaper

Ensuring Cyber Resilience of Large-Scale Network Infrastructure Using the Ant Algorithm

OriginalPaper

Development of the Intrusion Detection System for the Internet of Things Based on a Sequence Alignment Algorithm

OriginalPaper

A Procedure for Improving Information System Audit Quality by Enhancing Cyberthreat Simulation in Practice

OriginalPaper

Self-Regulation of the Network Infrastructure of Cyberphysical Systems on the Basis of the Genome Assembly Problem

OriginalPaper

Application of Taint Analysis to Study the Safety of Software of the Internet of Things Devices Based on the ARM Architecture