<?xml version="1.0" encoding="utf-8"?>
<journal>
  <titleid>9004</titleid>
  <issn>2071-8217</issn>
  <journalInfo lang="ENG">
    <title>Problems of information security. Computer systems</title>
  </journalInfo>
  <issue>
    <number>Спецвыпуск</number>
    <altNumber> </altNumber>
    <dateUni>2023</dateUni>
    <pages>1-194</pages>
    <articles>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>13-24</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0006-6856-2108</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Pahomov</surname>
              <initials>Maksim</initials>
              <email>pahomov_ma@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0003-1345-1874</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Pavlenko</surname>
              <initials>Evgeny</initials>
              <email>pavlenko_eyu@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0009-0008-8784-8720</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Sobolev</surname>
              <initials>Nikolay</initials>
              <email>sobolev.nv@edu.spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Analysis of methods for ensuring information security of wireless AD-HOC networks</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The features of wireless self-organizing networks and their routing mechanisms are analyzed. The classification of attacks on this type of networks is presented. Groups of methods used to ensure the security of self-organizing networks are highlighted. The analysis of representatives of each group of methods is performed, their advantages and disadvantages are singled out. The purpose and direction of further research is formulated.</abstract>
        </abstracts>
        <codes>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>information security</keyword>
            <keyword>wireless ad-hoc networks</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.1/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>25-33</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0002-2141-6780</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great Saint-Petersburg Polytechnic University</orgName>
              <surname>Shtyrkina</surname>
              <initials>Anna</initials>
              <email>anna_sh@ibks.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0002-7485-4848</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Aleksandrova </surname>
              <initials>Elena</initials>
              <email>aleksandrova_eb@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Cyber physical attacks detection based on graph Fourier transform</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper is devoted to the topic of detecting cyber-physical systems (CPS) attacks that affect the parameters of the functioning of devices. The potential consequences of cyber attacks on the CPS, as well as the corresponding changes in the modeling graph, are considered. A method for detecting cyberattacks based on the graph Fourier transform and the gradient boosting algorithm is proposed. The method makes it possible to detect a non-standard change in the operation parameters of devices and evaluate its criticality from the point of view of the centrality of a group of modeling vertices.</abstract>
        </abstracts>
        <codes>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>cyber-physical systems</keyword>
            <keyword>graph theory</keyword>
            <keyword>graph signal processing</keyword>
            <keyword>boosting</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.2/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>34-44</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0002-6370-123X</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Danilov</surname>
              <initials>Vladislav</initials>
              <email>danilov.wrk@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes/>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Gribkov</surname>
              <initials>Nikita</initials>
              <email>gribkov.na@edu.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0000-0001-8206-2915</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Ivanov</surname>
              <initials>Denis </initials>
              <email>ivanov@ibks.spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Analysis of methods for detecting artificially synthesized content</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper presents an analysis of existing methods for detecting artificially synthesized content and proposes a proprietary architecture for DeepFake’s hybrid detection system based on searching original content. The study tests and compares the effectiveness of detection methods in two different cases. In the first case, records for training and testing samples are used from the same dataset; in the second case, testing is performed using a black-box method using records from different datasets. As a result, it is concluded that there are shortcomings in the existing methods and a hybrid DeepFake detection system architecture is proposed.</abstract>
        </abstracts>
        <codes>
          <udk>004.56</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>DeepFake detection</keyword>
            <keyword>generative adversarial networks</keyword>
            <keyword>artificially synthesized content</keyword>
            <keyword>deep learning</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.3/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>45-53</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Zagalsky</surname>
              <initials>Dmitry</initials>
              <email>dzagalskii@yandex.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Kashkarov</surname>
              <initials>Oleg</initials>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Moskvin</surname>
              <initials>Dmitry</initials>
              <email>moskvin_da@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Solovey</surname>
              <initials>Roman</initials>
            </individInfo>
          </author>
          <author num="005">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>LOGINOV</surname>
              <initials>Zakhar</initials>
              <email>loginoff.zahar@yandex.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Development of a metaverse model for user access control to metaverse resources</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In this article, various approaches to the definition of the concept of the metaverse are investigated, and a proper, most universal one is proposed. The threats are analyzed and the requirements for the information security of the metaverse are highlighted. Its main components and features of their use are investigated. The applicability of various access control models to ensure effective security management of the metaverse has been evaluated.</abstract>
        </abstracts>
        <codes>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>metaverse</keyword>
            <keyword>metaverse security</keyword>
            <keyword>metaverse model</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.4/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>54-64</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0005-3102-5950</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Izotova</surname>
              <initials>Oksana</initials>
              <email>izotova@ibks.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0003-2849-4682</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Lavrova </surname>
              <initials>Daria</initials>
              <email>lavrova_ds@spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Early detection of network attacks based on weight agnostic neural networks</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper describes an approach to early detection of network attacks using weight agnostic neural networks. The choice of the type of neural networks is due to the specificity of their architecture that provides high processing speed and performance, which is significant in solving the problem of early attack detection. Experimental studies have demonstrated the effectiveness of the proposed approach based on a combination of multiple regression for feature selection of the training sample and weight agnostic neural networks. The accuracy of attack detection is comparable to the best results in the field with a significant time gain.</abstract>
        </abstracts>
        <codes>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>network attacks</keyword>
            <keyword>weight agnostic neural networks</keyword>
            <keyword>multiple regression</keyword>
            <keyword>machine learning</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.5/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>65-76</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Berko</surname>
              <initials>Alexander</initials>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0001-9659-1244</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Poltavtseva</surname>
              <initials>Maria </initials>
              <email>potavtseva@ibks.spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">A framework for security policies modeling for big data systems</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper is about the task of automating the analysis of access control in big data management systems by modeling security policies. The paper analyzes modern methods of access control in this class of systems, defines the requirements and selects the most promising one to describe the security policy within the framework of the developed solution. The task of modeling security policies in big data management systems is set. The architecture, main components and generalized algorithm of the software framework for its solution are presented. The results of experimental validation are also presented, the advantages and disadvantages of the framework are evaluated and the ways of its further development are proposed.</abstract>
        </abstracts>
        <codes>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>big data security</keyword>
            <keyword>big data management systems</keyword>
            <keyword>access control</keyword>
            <keyword>attribute access control</keyword>
            <keyword>security policy</keyword>
            <keyword>security policy modeling</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.6/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>77-85</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0008-7164-1872</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Skokov</surname>
              <initials>Nikita</initials>
              <email>vampire@ns-skokov.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0002-2264-7513</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Krundyshev</surname>
              <initials>Vasiliy </initials>
              <email>krundyshev_vm@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Ensuring the security of web resources based on intelligent analysis of network traffic</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper presents the developed method for detecting anomalies in network traffic, which is based on the technology of hierarchical temporary memory. To evaluate the effectiveness of the proposed solution, a new data set was generated containing information about legitimate and malicious network sessions. As a result of experimental studies, it was found that the use of a hierarchy of features and support for the memory mechanism make it possible to reveal hidden patterns in the analyzed chains of network requests to web resources with high accuracy.</abstract>
        </abstracts>
        <codes>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>network traffic analysis</keyword>
            <keyword>web resource security</keyword>
            <keyword>hierarchical temporary memory</keyword>
            <keyword>anomaly detection</keyword>
            <keyword>network attacks</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.7/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>86-94</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0003-0623-9891</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Gololobov</surname>
              <initials>Nikita</initials>
              <email>gololobov_nv@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0003-1345-1874</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Pavlenko</surname>
              <initials>Evgeny</initials>
              <email>pavlenko_eyu@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Classification of methods to counteract a data poisoning attack during neural network training</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Considered methods of counteraction attack data poisoning type learning neural network and compiled a model of the attacker, according to which a classification of the considered methods. The classification obtained as a result of the study can be used in further research, the ultimate goal of which is to increase the level of unification and automation of data processing and protection methods.</abstract>
        </abstracts>
        <codes>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>information security</keyword>
            <keyword>machine learning</keyword>
            <keyword>data processing</keyword>
            <keyword>data poisoning</keyword>
            <keyword>learning quality</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.8/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>95-107</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Soshnev</surname>
              <initials>Maxim</initials>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0002-9732-0099</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Kalinin</surname>
              <initials>Maxim</initials>
              <email>max@ibks.spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Protection against the threat of the machine learning models extraction</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The threat of extraction of the machine learning models is considered. Most of the modern approaches to the prevention of machine learning models extraction are based on the use of the protective noising mechanism. The main disadvantage of this protective method is the decrease in the accuracy of the outputs generated by the protected model. The paper states the requirements for methods for protecting machine learning models against extraction and presents a new method, which supplements noise with a distillation stage. It has been experimentally shown that the developed method ensures the resistance of machine learning models to extraction while maintaining the quality of their results by transforming the protected models to other, the simplified, but equivalent, models.</abstract>
        </abstracts>
        <codes>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>machine learning security</keyword>
            <keyword>model distillation</keyword>
            <keyword>noising</keyword>
            <keyword>soft label</keyword>
            <keyword>degree of security</keyword>
            <keyword>accuracy of results</keyword>
            <keyword>model extraction threat</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.9/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>108-119</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Rudnitskaya</surname>
              <initials>Ekaterina</initials>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0001-9659-1244</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Poltavtseva</surname>
              <initials>Maria </initials>
              <email>potavtseva@ibks.spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Privacy of machine learning models</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper is devoted to the problem of ensuring the confidentiality of models in machine learning systems. The aim of the work is to ensure the confidentiality of proprietary models of machine learning systems. In the course of the work we analyzed attacks aimed at violating the confidentiality of models of machine learning systems, as well as ways to protect against this type of attacks, as a result of which the problem of protection against such attacks is set as a search for anomalies in the input data. We propose a way to detect anomalies in the input data based on statistical data, taking into account the resumption of the attack under a different account of the attacker. The obtained results can be used as a basis for designing components of machine learning defense systems.</abstract>
        </abstracts>
        <codes>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>information security</keyword>
            <keyword>artificial intelligence</keyword>
            <keyword>artificial intelligence security</keyword>
            <keyword>attacks on machine learning systems</keyword>
            <keyword>privacy</keyword>
            <keyword>model privacy</keyword>
            <keyword>behavioral analysis</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.10/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>120-129</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0003-0623-9891</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Gololobov</surname>
              <initials>Nikita</initials>
              <email>gololobov_nv@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <scopusid>13103571000</scopusid>
              <orcid>0000-0002-0232-7248</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Zegzhda</surname>
              <initials>Dmitry</initials>
              <email>zegzhda_dp@spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">A set-theoretic model of data poisoning attack techniques in artificial intelligence systems</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article contains formalized techniques of data poisoning attacks are presented in the form of a set-theoretic model, considering the levels at which poisoning can be carried out. The division of attacks according to levels allows further consideration of each type of poisoning attack to prevent or minimize the consequences of data contamination specific to each level. The model obtained because of the study can be used in further research, the goal of which is to increase the level of unification and automation of data processing and protection methods.</abstract>
        </abstracts>
        <codes>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>cybersecurity</keyword>
            <keyword>data poisoning</keyword>
            <keyword>data cleaning</keyword>
            <keyword>heterogeneous data</keyword>
            <keyword>set-theoretic attack model</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.11/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>130-138</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0001-9862-1507</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Dakhnovich</surname>
              <initials>Andrey</initials>
              <email>add@ibks.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Solovey</surname>
              <initials>Roman</initials>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>LOGINOV</surname>
              <initials>Zakhar</initials>
              <email>loginoff.zahar@yandex.ru</email>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Zagalsky</surname>
              <initials>Dmitry</initials>
              <email>dzagalskii@yandex.ru</email>
            </individInfo>
          </author>
          <author num="005">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Moskvin</surname>
              <initials>Dmitry</initials>
              <email>moskvin_da@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="006">
            <authorCodes>
              <scopusid>13103571000</scopusid>
              <orcid>0000-0002-0232-7248</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Zegzhda</surname>
              <initials>Dmitry</initials>
              <email>zegzhda_dp@spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Caviats of detecting unfairness biases in results of recommender systems</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In the context of the deep penetration of information technologies and services into people’s lives, the issues of control over recommendation systems (hereinafter – RS), which are actively used by social networks and Internet applications for personalized selection and ranking of content for users, are becoming increasingly relevant. The concept of RS operation is based on the preliminary collection of various types and degrees of sensitivity data about the user and their subsequent algorithmic processing in order to provide personalized recommendations. Personalized recommendations selected according to certain methods can create different worldviews for the same users, provoke active actions, etc. Thus, there is a need for a tool to assess the susceptibility of RS to the influences that lead to the bias of recommendation algorithms, on behalf of an external observer.</abstract>
        </abstracts>
        <codes>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>recommender systems</keyword>
            <keyword>unfairness biases</keyword>
            <keyword>social networks</keyword>
            <keyword>social network communications</keyword>
            <keyword>cybersecurity</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.12/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>139-144</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0004-1271-709X</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Ognev</surname>
              <initials>Roman </initials>
              <email>ognev_ra@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <scopusid>13103571000</scopusid>
              <orcid>0000-0002-0232-7248</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Zegzhda</surname>
              <initials>Dmitry</initials>
              <email>zegzhda_dp@spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">An empirical study of the robustness of a linear filter built on the Neyman – Pearson criterion to a change in the mean values</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The assertion about the stability of a linear filter built on the basis of the Neyman – Pearson criterion was verified by performing falsifying experiments. The relationship between the eigenvalues of the interference covariance matrix and their minimum values and network stability was not found.</abstract>
        </abstracts>
        <codes>
          <udk>004.56</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>linear filter</keyword>
            <keyword>single-layer neural network</keyword>
            <keyword>robustness</keyword>
            <keyword>Neyman – Pearson criterion</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.13/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>145-158</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0008-4442-5365</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Kubrin</surname>
              <initials>Georgiy</initials>
              <email>kubrin@ibks.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <scopusid>13103571000</scopusid>
              <orcid>0000-0002-0232-7248</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Zegzhda</surname>
              <initials>Dmitry</initials>
              <email>zegzhda_dp@spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Vulnerability detection with an ensemble of analysis algorithms for code graph representation</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper presents an analysis of existing methods for software vulnerabilities detection. A problem of faulty paths in interprocedural code graph representation is presented. This problem hinders application of graph deep learning models to code analysis tasks. A method based on an ensemble of algorithms for code graph analysis is presented to overcome the problem of faulty paths. The method performs gradual reduction of analyzed code fragments size for effective application of algorithms with high time complexity. A prototype of vulnerability detection system for .NET software based on the proposed method is presented. The prototype is evaluated using NIST SARD database and software with considerable codebase size.</abstract>
        </abstracts>
        <codes>
          <udk>004.56</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>software vulnerabilities detection</keyword>
            <keyword>logical vulnerabilities</keyword>
            <keyword>static code analysis</keyword>
            <keyword>graph theory</keyword>
            <keyword>deep learning</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.14/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>159-172</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0001-9665-0128</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Suprun </surname>
              <initials>Alexander</initials>
              <email>afs54@inbox.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0009-0008-8784-8720</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Sobolev</surname>
              <initials>Nikolay</initials>
              <email>sobolev.nv@edu.spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">A method for detecting attacks on web applications using a web application firewall based on an artificial neural network</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">A method for detecting network attacks on web applications using a neural network based on LSTM is presented. The process of extracting the necessary information from traffic before submitting it to an artificial neural network (ANN) is presented. This process of preprocessing HTTP traffic allows you to select key fragments, which are subsequently vectorized for proper processing in the ANN. The ANN architecture is defined, including the necessary layers, for the multiclassification of HTTP traffic and the detection of network attacks on web applications.</abstract>
        </abstracts>
        <codes>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>firewall</keyword>
            <keyword>web-applications</keyword>
            <keyword>network attacks</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.15/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>173-182</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Kuzmina</surname>
              <initials>Kseniia</initials>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0002-7121-6031</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Yarmak</surname>
              <initials>Anastasiia</initials>
              <email>yarmak_av@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0000-0002-7485-4848</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Aleksandrova </surname>
              <initials>Elena</initials>
              <email>aleksandrova_eb@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Proxy signature based on GOST 34.10–2018</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper proposes a digital signature scheme that expands the functionality of the GOST 34.10–2018 and allows delegating signing capability to a trusted person (proxy signer). A classification of proxy signatures has been developed; the selected delegation scheme was modified to prevent misuse by a proxy signer. The correctness of the scheme was shown, the analysis of compliance with security requirements was carried out. The results of software implementation testing are presented.</abstract>
        </abstracts>
        <codes>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>digital signature</keyword>
            <keyword>proxy signature</keyword>
            <keyword>GOST 34.10–2018</keyword>
            <keyword>elliptic curves</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.16/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>183-193</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0000-3181-4769</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Kostin</surname>
              <initials>Sergey</initials>
              <email>s8kostin@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0002-7485-4848</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Aleksandrova </surname>
              <initials>Elena</initials>
              <email>aleksandrova_eb@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Research of the isogeny graph structure of supersingular curves for post-quantum cryptography protocols</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Isogeny graphs of supersingular elliptic curves are one of perspective mathematical structures for post-quantum cryptography algorithms. However, recently published attack on the SIDH protocol [1] demonstrates that isogeny graphs require a more detailed study when they are used in real protocols. In this paper, we analyze the structure of isogeny graphs of degree l &gt; 2 and consider a set of nodes of a special kind to which the attack [7] on path recovery in the graph is applicable.</abstract>
        </abstracts>
        <codes>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>post-quantum cryptography</keyword>
            <keyword>isogeny graphs</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2023.12.17/</furl>
          <file>2023_spetsvipusk_ru_.pdf</file>
        </files>
      </article>
    </articles>
  </issue>
</journal>
