{"title":"Method of Embedding Hidden Data into a Message Stream with Noise-Immune Encoding","authors":"S. V. Belim, S. A. Gorshkov","doi":"10.3103/S0146411624701062","DOIUrl":"10.3103/S0146411624701062","url":null,"abstract":"<p>This article proposes a model of embedding steganographic data into a message stream using noise-immune coding. The embedded data is disguised as noise in the message transmission channel. Extraction of the embedded message is based on the procedure of detecting corrupted bits using error-correcting codes. The presented model is related to key schemes. The stability of the scheme is based on the impossibility for the analyst to obtain complete information about the embedding. The model is universal and can be implemented in any network protocol using noise-immune codes.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 8","pages":"1392 - 1395"},"PeriodicalIF":0.6,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143622207","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. F. Suprun, A. Yu. Garkushev, A. V. Vyvolokina, S. I. Fokina
{"title":"Application of Indicator Functions in Models of Detection and Neutralization of Harmful Information Objects","authors":"A. F. Suprun, A. Yu. Garkushev, A. V. Vyvolokina, S. I. Fokina","doi":"10.3103/S0146411624700883","DOIUrl":"10.3103/S0146411624700883","url":null,"abstract":"<p>This article proposes a new approach to the application of the well-known indicator function method, which is used to simulate the detection and neutralization of suspicious information objects in the information environment of an industrial enterprise, as well as to simulate a security system during operation. Formula dependencies are given for calculating stochastic indicators, allowing us to obtain some objective estimates of the values of time parameters and their influence on the safe functioning of information systems.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 8","pages":"1242 - 1249"},"PeriodicalIF":0.6,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143622005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Concept of Secure Distributed Ledger Technology in the Digital Environment of a Smart City","authors":"M. O. Kalinin, A. S. Konoplev","doi":"10.3103/S0146411624700731","DOIUrl":"10.3103/S0146411624700731","url":null,"abstract":"<p>The security of the main distributed consensus algorithms used in distributed legers in the digital environment of a smart city is analyzed. A new concept for protecting a smart city’s distributed legers is presented, which consists of using a hybrid distributed consensus protocol based on the joint use of a tangle-class algorithm and a proof-of-authority-class algorithm, protected by trusted computing and remote attestation technologies. The proposed protocol compensates for the weaknesses and vulnerabilities of the existing distributed consensus algorithms that are inherent in distributed ledger technology and hinder its widespread use in large digital environments of smart cities.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 8","pages":"1114 - 1118"},"PeriodicalIF":0.6,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143622081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Detecting Defects in Multicomponent Software Using a Set of Universal Graph Representations of the Code","authors":"G. S. Kubrin, D. P. Zegzhda","doi":"10.3103/S0146411624700901","DOIUrl":"10.3103/S0146411624700901","url":null,"abstract":"<p>A comparison of the existing software analysis methods is presented with an assessment of the possibility of identifying defects contained in several components implemented in different programming languages. A set of three universal graph representations of code is proposed for implementing security analysis methods that take into account interactions between software components using different sets of programming languages. For the proposed universal code representations, a concept of a security analysis system and a prototype of the system implementation are developed, supporting cross-language analysis of the software components implemented in the programming languages PHP and C, as well languages using the .NET platform.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 8","pages":"1255 - 1262"},"PeriodicalIF":0.6,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143622166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
L. Kh. Safiullina, A. R. Kasimova, A. A. Alekseeva
{"title":"Analysis of the Reliability of Template Storage When Implementing Modern Biometric Technologies in Information Security Systems","authors":"L. Kh. Safiullina, A. R. Kasimova, A. A. Alekseeva","doi":"10.3103/S0146411624700834","DOIUrl":"10.3103/S0146411624700834","url":null,"abstract":"<p>It can be argued that in certain areas of information technology, classical systems of authentication of the user of a computer system based on passwords and tokens are being completely replaced by biometric technologies. However, biometric systems are vulnerable to various types of security threats. For example, unlike the same passwords and tokens, biometric-based templates cannot be replaced in the event of a compromise. To solve this problem, new protection schemes have been developed. They can be conditionally divided into two groups: biometric cryptography and cancelable biometrics. Biometric cryptography methods show average values of errors of the first and second kind and experimental work in this area is widely known. Cancellable biometrics can be highly reliable, but there are limited experimental data on them. A comparative analysis of the reliability of existing methods is presented. It has been shown that among static biometric parameters, the iris is of greatest interest, and among dynamic ones, keyboard handwriting is of greatest interest. However, the use of these methods, like others, has its own difficulties and risks.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 8","pages":"1204 - 1211"},"PeriodicalIF":0.6,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143622171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using Machine Learning Algorithms and Honeypot Systems to Detect Adversarial Attacks on Intrusion Detection Systems","authors":"P. E. Yugai, D. A. Moskvin","doi":"10.3103/S014641162470086X","DOIUrl":"10.3103/S014641162470086X","url":null,"abstract":"<p>This paper presents adversarial attacks on machine learning (ML) algorithms in intrusion detection systems (IDSs). Some examples of existing IDSs are examined. The existing approaches for detecting these attacks are considered. Requirements are developed to increase the stability of ML algorithms. Two approaches to detect adversarial attacks on ML algorithms are proposed, the first of which is based on a multiclass classifier and a Honeypot system, and the second approach uses a combination of a multiclass and binary classifier. The proposed approaches can be used in further research aimed at detecting adversarial attacks on ML algorithms.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 8","pages":"1226 - 1233"},"PeriodicalIF":0.6,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143622173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Intelligent Mechanisms for Extracting Signs of File Modification in Dynamic Virus Analysis","authors":"S. G. Fomicheva, O. D. Gayduk","doi":"10.3103/S0146411624700810","DOIUrl":"10.3103/S0146411624700810","url":null,"abstract":"<p>This paper proposes machine-learning pipelines that allow automatically generating the relevant feature spaces for virus detectors, detect the presence of viral modifications in JS-files and scripts in real time, and interpret and visualize the automatically obtained machine solution. It is shown that the best quality metrics will be demonstrated by models of an abstract syntactic tree using binary classifiers based on ensembles of decision trees. An explanation of the solution automatically generated by the virus detector is demonstrated.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 8","pages":"1180 - 1191"},"PeriodicalIF":0.6,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143621797","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Graph of Self-Regulation of Various Types of Networks with Adaptive Topology","authors":"E. Yu. Pavlenko, M. A. Pakhomov","doi":"10.3103/S0146411624701244","DOIUrl":"10.3103/S0146411624701244","url":null,"abstract":"<p>Approaches used for the self-regulation of networks with adaptive network topology based on graph theory are presented. These approaches are limited to networks whose nodes do not change their position in space: peer-to-peer and heterogeneous sensor networks, as well as industrial networks, such as Smart Grid. For each type of network, a generalized target function is described, conditions for self-regulation are formulated, and the process of self-regulation is formally described.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 8","pages":"1442 - 1449"},"PeriodicalIF":0.6,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143622011","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Detecting Synthesized Audio Files Using Graph Neural Networks","authors":"O. A. Izotova, D. S. Lavrova","doi":"10.3103/S0146411624700846","DOIUrl":"10.3103/S0146411624700846","url":null,"abstract":"<p>The problem of generalization of multimodal data in the detection of artificially synthesized audio files is studied. As a solution to the problem, a method is proposed that combines a one-time analysis of the characteristics of an audio file and its semantic component, presented in the form of text. The approach is based on graph neural networks and algorithmic approaches based on keyword and text sentiment analysis. The conducted experimental studies confirmed the validity and effectiveness of the proposed approach.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 8","pages":"1212 - 1217"},"PeriodicalIF":0.6,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143622169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Formal Statement of the Problem of Morphing Executive Code in Software Operation","authors":"N. V. Gololobov","doi":"10.3103/S0146411624700895","DOIUrl":"10.3103/S0146411624700895","url":null,"abstract":"<p>A formal formulation of the problem of modifying executable code during execution is presented based on morphing used in computer animation. During the research, the need for developing a morphing method for software (SW) is substantiated, the basic principles used in computer animation are adapted for the field of cybersecurity, and the vectors for further research in this direction are determined. The results obtained during adaptation should be used in the design and implementation of the method of morphing executable code.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 8","pages":"1250 - 1254"},"PeriodicalIF":0.6,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143622167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}