Year Year arrow
arrow-active-down-0
Publisher Publisher arrow
arrow-active-down-1
Journal
1
Journal arrow
arrow-active-down-2
Institution Institution arrow
arrow-active-down-3
Institution Country Institution Country arrow
arrow-active-down-4
Publication Type Publication Type arrow
arrow-active-down-5
Field Of Study Field Of Study arrow
arrow-active-down-6
Topics Topics arrow
arrow-active-down-7
Open Access Open Access arrow
arrow-active-down-8
Language Language arrow
arrow-active-down-9
Filter Icon Filter 1
Year Year arrow
arrow-active-down-0
Publisher Publisher arrow
arrow-active-down-1
Journal
1
Journal arrow
arrow-active-down-2
Institution Institution arrow
arrow-active-down-3
Institution Country Institution Country arrow
arrow-active-down-4
Publication Type Publication Type arrow
arrow-active-down-5
Field Of Study Field Of Study arrow
arrow-active-down-6
Topics Topics arrow
arrow-active-down-7
Open Access Open Access arrow
arrow-active-down-8
Language Language arrow
arrow-active-down-9
Filter Icon Filter 1
Export
Sort by: Relevance
  • Research Article
  • 10.3103/s0146411625700944
Lattice-Based Commitment Scheme for Proving Linear Relations between Hidden Values
  • Dec 1, 2025
  • Automatic Control and Computer Sciences
  • E B Aleksandrova + 1 more

A hybrid lattice-based commitment scheme is proposed for anonymous proofs between hidden values. The method is based on a modification of the BDLOP zero-knowledge proof (ZKP) scheme by replacing the learning with errors (LWE) problem with a learning with rounding (LWR) problem, which theoretically makes it possible to reduce the size of the parameters and reduce the complexity of parameter selection. It is shown that the proposed scheme preserves the property of additive homomorphism, which makes it possible to apply it to prove linear relations. The obtained results can be applied to construct electronic voting protocols or conduct anonymous transactions.

  • Research Article
  • 10.3103/s0146411625700798
Automated Software Security Analysis for the Android OS
  • Dec 1, 2025
  • Automatic Control and Computer Sciences
  • E Yu Pavlenko + 1 more

This article presents methods for the automated security analysis of Android applications, which can be used to search for cryptographic vulnerabilities, vulnerabilities in third-party software components, authentication, and authorization, as well as to identify the storage and transmission of sensitive information in clear text. The accuracy of searching for the given types of vulnerabilities using automated vulnerability search tools and a software prototype is analyzed.

  • Research Article
  • 10.3103/s0146411625701019
Using Entropy Metrics to Detect Data Integrity Attacks in Real Time
  • Dec 1, 2025
  • Automatic Control and Computer Sciences
  • T D Ovasapyan + 2 more

Existing methods for detecting attacks on data integrity in file systems are studied. A detection method based on the use of several entropy metrics is proposed. The effectiveness of the proposed method is evaluated using the example of detecting existing ransomware programs.

  • Research Article
  • Cite Count Icon 1
  • 10.3103/s0146411625701093
Artificial Immunization in Hierarchical and Peer-to-Peer Networks to Protect Against Cyber Threats
  • Dec 1, 2025
  • Automatic Control and Computer Sciences
  • E Yu Pavlenko + 1 more

Immunization approaches for cyber-physical systems based on hierarchical and peer-to-peer network topologies are described. A systematic analysis of existing immunization methods based on graph theory is carried out, together with theoretical formalization and experimentation. The approach demonstrates sufficient effectiveness of artificial immunization using global strategies for cyber-physical systems based on a hierarchical network infrastructure.

  • Research Article
  • 10.3103/s0146411625701032
Construction of a Semantic Space of Intentionalities Using Generative Pretrained Models to Solve the Problem of Spam Filtering
  • Dec 1, 2025
  • Automatic Control and Computer Sciences
  • I Yu Zhukov + 3 more

One of the key elements in solving spam filtering problems is the text vectorization method. This article proposes a vectorization method based on matching text to pairs of intentionalities. A list of intentionality pairs is extracted and a synthetic dataset is generated from text utterances. A neural network is designed and trained to determine the degree to which each intentionality belongs to the textual expression provided as the input of the model. The developed method is tested on the problem of filtering spam messages using logistic regression and the Enron dataset and SMS dataset.

  • Research Article
  • 10.3103/s0146411625700889
Detection of Honeypot Systems Based on a Comprehensive Analysis of Node Performance Indicators
  • Dec 1, 2025
  • Automatic Control and Computer Sciences
  • T D Ovasapyan + 3 more

The principles of construction and operation of honeypot systems are studied. Existing detection methods are analyzed, and their advantages and disadvantages are highlighted. A detection method based on the analysis of command execution delays is proposed. A universal detection method based on combining the results of the methods is proposed. A software prototype of the detection system is developed and tested.

  • Research Article
  • 10.3103/s0146411625700762
Trust-Model-Based Method for Protecting Global Models in Federated Learning Systems
  • Dec 1, 2025
  • Automatic Control and Computer Sciences
  • V M Krundyshev + 2 more

The problem of ensuring the security of a global computational model in federated learning systems is considered. A method is proposed that is based on data verification using a trusted group of nodes and ensures that only correct updates are taken into account during the global model aggregation process. It is experimentally demonstrated that the developed method ensures accurate identification and isolation of adversaries implementing label-flipping and noise-injection threats.

  • Research Article
  • 10.3103/s0146411625701007
Intelligent Data Analysis and Processing for Detecting Insider Data Confidentiality Breaches in a DBMS
  • Dec 1, 2025
  • Automatic Control and Computer Sciences
  • M A Poltavtseva + 1 more

This paper studies the detection of intrusions and breaches of data confidentiality stored in database management systems (DBMSs) based on behavioral analysis. A major challenge in this domain lies in considering not only the syntax of the query but also the semantic relationships of the data, since syntactic and contextual approaches fail to detect all types of attacks. Based on an analysis of well-known studies, a method for detecting anomalies in user behavior is proposed based on the author’s behavior assessment metrics and the scope of the requested data. The proposed method develops a well-known work, while significantly improving the detection of certain types of behavioral deviations. An important part of this study involves identifying the features of the application of this type of analysis and its limitations.

  • Research Article
  • 10.3103/s0146411625700890
Detecting the Spread of False News Content Using Machine Learning
  • Dec 1, 2025
  • Automatic Control and Computer Sciences
  • D S Lavrova + 2 more

The problem of detecting unreliable news content is studied and a solution based on machine learning methods is proposed. Modern approaches used to assess the reliability of textual and multimedia content are analyzed, with promising approaches identified and adapted to the Russian-language media space. A combined method for detecting fake news is proposed, based on the joint analysis of textual and multimedia information, as well as the characteristics of content dissemination. Testing the proposed method confirmed its effectiveness and applicability for the automated detection of unreliable news content in real-world information systems.

  • Research Article
  • 10.3103/s014641162570083x
Method for Detecting Latent Vulnerabilities at the Final Stage of Software Development
  • Dec 1, 2025
  • Automatic Control and Computer Sciences
  • A S Cherevan’ + 1 more

A method for detecting and eliminating latent vulnerabilities in mobile applications at the final stage of development is presented. The nature of such vulnerabilities is analyzed and existing methods for their identification and neutralization are considered. The developed method is based on the analysis of the application’s state at different points in time and comparison with the reference state. Includes recording the initial state, discrete analysis of its changes, detection and identification of vulnerabilities, and their elimination. The main area of the application of the method is to ensure the security of mobile applications in the late stages of development and during final testing. The findings of the study highlight the importance of early detection of latent vulnerabilities to ensure a high level of information security of the final software product.