<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Improving the method of detecting insider attacks on the organization&apos;s information resources</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Vitalii</forename><surname>Savchenko</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">State University of Information and Communication Technologies</orgName>
								<address>
									<addrLine>Solomianska street, 7</addrLine>
									<postCode>03110</postCode>
									<settlement>Kyiv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Valeriia</forename><surname>Savchenko</surname></persName>
							<email>savchenko.valeriya@gmail.com</email>
						</author>
						<author>
							<persName><forename type="first">Roman</forename><surname>Vozniak</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">State University of Information and Communication Technologies</orgName>
								<address>
									<addrLine>Solomianska street, 7</addrLine>
									<postCode>03110</postCode>
									<settlement>Kyiv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="institution">The National Defence University of Ukraine</orgName>
								<address>
									<addrLine>Air Force avenue, 28</addrLine>
									<postCode>03049</postCode>
									<settlement>Kyiv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Oleksandr</forename><surname>Sampir</surname></persName>
							<email>sampir1984@ukr.net</email>
							<affiliation key="aff1">
								<orgName type="institution">The National Defence University of Ukraine</orgName>
								<address>
									<addrLine>Air Force avenue, 28</addrLine>
									<postCode>03049</postCode>
									<settlement>Kyiv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Improving the method of detecting insider attacks on the organization&apos;s information resources</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">AB5D8A0DCFAED86E34F16D92C37B238A</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T16:49+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>information asset, information resource, insider, abnormal user behavior, cosine similarity 1 (O. Sampir) 0000-0002-3014-131X (V. Savchenko)</term>
					<term>0000-0003-1921-2698 (V. Savchenko)</term>
					<term>0000-0002-3789-2837 (R. Vozniak)</term>
					<term>0000-0002-3564-1997 (O. Sampir)</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>The article deals with the problem of detecting insider attacks on the organization's information resources. This article is a continuation of the authors' publication, which proposed a method for detecting malicious activity based on the statistical measure IDF (Inverse Document Frequency) and calculating the cosine similarity of two vector assets. The authors show that this similarity-based approach works well in organizations where employees' access rights to the organization's information resources do not overlap. However, in the case of using shared resources or masking the activity of an insider, this approach is not very effective. The authors of the article propose an improved method, the difference of which is the presence of two matrices: the matrix of permissions and the matrix of real access. The difference of such matrices expressed as a percentage of the user's total access to information assets makes it possible to calculate a measure of the user's malicious activity. Input data for the technique is information from IDS intrusion detection systems. The simulation results based on the given examples show that the improved method is more adequate compared to the cosine similarity method, which makes it possible to use it in a wide range of applications. The method allows you to determine the abnormal activity of users in the organization, which makes it possible to detect insider attacks at an early stage. The method can be used by information security administrators for further analysis of user activity.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>In today's digital world, where access to information is becoming increasingly important for the successful operation of organizations, user interaction with information resources is becoming a key factor in efficiency and security. Organizations invest significant effort in developing and maintaining systems that provide access to data and resources for their employees and customers. However, the detection of anomalies in this interaction can have a significant impact on the security and functionality of these systems. Anomalies in interaction with an organization's information resources can include a wide range of events, from unusual user activity to potential cyber attacks or security breaches. Understanding, detecting, and responding in a timely manner to such anomalies become critical to ensuring the reliability of information systems.</p><p>In this study, we will consider the method of determining anomalies of user interaction with the organization's information resources. The study is a continuation of our previous publication <ref type="bibr" target="#b0">[1]</ref>, where we already proposed a method for detecting anomalies in the activity of information system users. It is aimed at identifying insiders, which will help increase the security and efficiency of information systems of organizations by identifying and solving anomalies in their interaction with users.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Problem statement</head><p>The general problem of identifying anomalies in the interaction of users with the organization's information resources is that this task is complex and requires an integrated approach due to several key reasons:</p><p>• Variety of Anomalies: Anomalous user behavior can take many forms, including unusual patterns of information access, unusual activity, unauthorized access attempts, or insider threats. The diversity of these anomalies makes their detection difficult. • Volume of data: Organizations have huge volumes of data generated as a result of user interaction with information systems. Analyzing these large volumes of data to detect anomalies requires powerful processing and analysis tools. • Dynamics of change: User behavior and the structure of information systems can change over time. What was normal yesterday may become an anomaly today. You need a system that can adapt to changes in the environment. • Data heterogeneity: User interaction data can be presented in different formats and sources.</p><p>Combining them and processing them to detect anomalies can be difficult due to differences in data structures and types. • Need for accuracy: Anomaly detection requires high accuracy because misinterpretation can lead to misclassification of normal behavior as abnormal or vice versa. • Ensuring privacy: When detecting anomalies, the confidentiality and privacy of user data must be preserved, which can make it difficult to implement some analysis methods.</p><p>Since these problems are complex and diverse, the detection of anomalies in the interaction of users with information resources requires the use of various methods of data analysis, machine learning, and the development of specialized systems to effectively solve this problem.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Related works overview</head><p>Anomaly detection is a direction that is becoming more and more relevant every year. There are various ways of detecting anomalies in the activity of information system users. Most of them are based on the analysis of various technical indicators, such as network activity, use of peripheral devices, system load, intensity of interaction with information systems, etc.</p><p>In the article <ref type="bibr" target="#b0">[1]</ref>, we investigated the intrusion detection method based on the calculation of the similarity of user actions. The disadvantage of the previous study is that, despite its advantages, the proposed method is poorly protected against deception by unscrupulous users, as it is based on the calculation of the similarity coefficient of the user's actions using cosine similarity. This approach allows the attacker to easily imitate loyal activity, thereby leveling off his malicious activity. Our other paper <ref type="bibr" target="#b1">[2]</ref> investigates the detection of insider attacks based on the time parameters of the protection system. In this publication, we conclude that detection of such an attack is possible only when the defense system is able to react faster than the attacker.</p><p>The article <ref type="bibr" target="#b2">[3]</ref> provides a comprehensive review of the existing literature, which examines recent advances in anomaly detection methods for detecting security threats in cyber-physical systems. The authors analyze 296 articles devoted to the detection of anomalies and identify the shortcomings of various detection methods, including: limited resources, lack of standardized communication protocols, heterogeneity of technologies and protection systems, different information security policies. The authors of the article <ref type="bibr" target="#b3">[4]</ref> propose approaches to the classification of anomaly detection methods in modern attack detection systems. It is shown that the methods of detecting anomalies in modern attack detection systems are not sufficiently elaborated in terms of the formal attack model, and, therefore, it is quite difficult for them to strictly evaluate such properties as computational complexity, correctness, and completeness.</p><p>The authors of the publication <ref type="bibr" target="#b4">[5]</ref> evaluate anomaly detection methods based on the aspect of their applicability to various systems with the minimization of the user input. The obtained results show that the most effective method of detecting anomalies, which can be transferred to different systems and minimizes the user's work, are systems based on machine learning. The publication <ref type="bibr" target="#b5">[6]</ref> defines three main methodological areas for diagnosing anomalies (machine learning, deep learning, statistical approaches) and summarizes exactly how the corresponding models are used to detect anomalies. In addition, the authors explain which specific application areas are typically addressed by anomaly detection in the context of cloud computing environments and which relevant public datasets are often used for evaluation.</p><p>In <ref type="bibr" target="#b6">[7]</ref>, the authors propose an intelligent system for detecting anomalies and identifying smart home devices using collective communication. The concept of the system's operation is based on obtaining benefits from the integration of smart homes into a social network in terms of increasing the security of both a single smart home and the entire social network of connected smart homes. Publication <ref type="bibr" target="#b7">[8]</ref> proposes an unsupervised method that was developed to detect anomalies when information is not labeled or classified. Information extraction approaches based on machine learning, developed for the implementation of the anomaly detection system, were used. implemented in the practice of organizations. Their work is based on the use of a database of attack patterns (signatures) and machine learning methods. In addition, such systems can register a set of data characterizing the interaction of employees with the organization's information assets and have proven themselves well in solving the problem of detecting anomalies.</p><p>The article <ref type="bibr" target="#b8">[9]</ref> describes a study of log mining in the field of microservices technologies with the detection of anomalies from logs, that is, events that require deeper inspection by analysts. The authors propose a new approach to finding numerical representations of computer logs without making assumptions about the format of the underlying data and without requiring programming knowledge. The article <ref type="bibr" target="#b9">[10]</ref> presents a distributed approach for real-time anomaly detection in largescale environments. The method has the ability to detect consistent and quantitative anomalies within a multi-source streaming log.</p><p>The purpose of this article is to improve the previously proposed method of detecting anomalies of user interaction with the organization's information resources, which would allow using the results of modern intrusion detection systems (IDS) and would be simple enough for practical implementation by information security administrators.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">The method of detecting insider attacks on the organization's information resources</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">General approach</head><p>As before, we will take as a basis the methodology based on the use of a bipartite graph <ref type="bibr" target="#b0">[1,</ref><ref type="bibr">11]</ref> to display the interaction of users (employees of the organization) with assets (information systems) on the basis of network data collected by the IDS system. The set of users will be denoted by 𝑈 = {𝑢 1 , … , 𝑢 𝑛 }, the information assets will be defined as the set 𝐴 = {𝑎 1 , … , 𝑎 𝑛 }, and the set of users who accessed to assets 𝑎 𝑖 over a certain period of time will be defined as the set 𝑈 𝐴 𝑖 . We denote as 𝐺 𝐴 𝑖 𝑈 𝐴 𝑖 , where the value of the weight between pairs of vertices is the value of similarity.</p><p>A bipartite graph reflecting the fact of users' access to assets is denoted by a binary matrix 𝐴 𝑈 . At the same time 𝐴 𝑈 (𝑖, 𝑗) = 1, if the user 𝑢 𝑖 accesses the 𝑎 𝑖 asset, and 𝐴 𝑈 (𝑖, 𝑗) = 0 if not. It is suggested to use the statistical measure IDF (Inverse Document Frequency) to assess the connection of users with assets. As a measure of IDF 𝐼 𝐷𝐹 , it is suggested to take a sigmoidal function in the form:</p><formula xml:id="formula_0">𝐼 𝐷𝐹 (𝑈 𝑖 ) = 1 1+𝑒 𝛾 2 − 𝛾𝐸×𝑈 𝑖 |𝐴| ,<label>(1)</label></formula><p>where 𝐸 = (1,1, … ,1) is unit vector of dimension 𝑚; |𝐴| is a power of set 𝐴; 𝑈 𝑖 is a column 𝑖-user of the matrix 𝐴 𝑆 (access vector); 𝛾 is a sensitivity coefficient of the function.</p><p>The matrix obtained after the transformation will be denoted by 𝐼 𝐷𝐹 𝑈𝐴 . The similarity between pairs of users can be obtained based on their access vectors. To measure the similarity of two vector assets, it is suggested to use cosine similarity <ref type="bibr" target="#b10">[12]</ref>: .</p><formula xml:id="formula_1">𝐶(</formula><p>(</p><formula xml:id="formula_2">)<label>2</label></formula><p>Given two feature vectors 𝑋 and 𝑌, the cosine similarity can be represented using the scalar product and the norm. When a user interacts with an organization's information assets, the cosine similarity of two users ranges from 0 to 1, since the angle between the two frequency vectors cannot be greater than 90°. Cosine similarity is effective as an evaluation measure, especially for sparse vectors, since only non-zero values are taken into account <ref type="bibr" target="#b9">[10]</ref>.</p><p>As a result of the calculations, a similarity matrix of user interaction with information assets will be obtained. It is assumed that if one of the users is an intruder, then his actions will be reflected in the similarity matrix. Around each asset, an individual group of users is formed who work with it and refer to it. To calculate the similarity between groups of users, it is necessary to calculate the average similarity between all pairs of users (total user similarity):</p><formula xml:id="formula_3">𝐶(𝐺 𝐴 𝑘 ) = ∑ ∑ 𝐶(𝑈 𝑖 ,𝑈 𝑗 ) 𝑛 𝑗=1 𝑛 𝑖=1 |𝑈 𝐴 𝑘 |× 𝑈 𝐴 𝑘 −1 2 , ∀𝑈 𝑖 ≠ 𝑈 𝑗 ∈ 𝑈 𝐴 𝑘 ∀𝑈 𝑗 ,<label>(3)</label></formula><p>where |𝑈 𝐴 𝑘 | is number of users in the group.</p><p>If 𝐶(𝐺 𝐴 𝑘 ) has a high value, it means that users have a strong engagement with asset 𝑎 𝑘 . To detect anomalous user actions, it is necessary to determine the average similarity for the subgroup 𝐶(𝐺 𝐴 𝑘 ), ∀𝑖 ∨ 𝑗 = 𝑘, in which a single user 𝑘 is compared with other users, and to determine the rating of this user relative to the average value for the organization:</p><formula xml:id="formula_4">𝑅(𝑢 𝑘 , 𝐴) = 𝐶(𝐺 𝑈 𝑘 )−𝐶(𝐺 𝐴 𝑘 ) 𝐶(𝐺 𝐴 𝑘 ) × 100%, 𝑘 = 1, … , 𝑚,<label>(4)</label></formula><p>where 𝐶(𝐺 𝑈 𝑘 ) is the subset of users that are compared to user 𝑢 𝑗 . The larger the value of 𝑅(𝑢 𝑘 , 𝐴), the more likely that user 𝑢 𝑗 's access to assets 𝑎 𝑖 is abnormal.</p><p>The proposed technique for detecting abnormal user actions based on network data analysis can be presented in the form of a sequence of steps:</p><p>1. Building sets of users and assets. 2. Construction of a bipartite interaction graph. 3. Calculation of the statistical measure of IDF. 4. Calculation of the similarity matrix of user actions. 5. Calculation of the overall similarity of user actions. 6. Detection of abnormal actions.  </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Algorithm for detecting anomalies in the interaction of users with the organization's information assets (Algorithm of similarity)</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.3.">Improvement of the method (Advanced method)</head><p>Despite the obvious advantages, such an approach, which is based on determining the similarity of the actions of individual users, has significant disadvantages, in particular:</p><p>1. The approach works well in those organizations where information resources are clearly demarcated between employees. That is, sets of information resources of individual employees do not overlap. 2. In this model, the impact of suspicious employee access to the organization's resources can be neutralized by the appropriate combination of access to authorized resources.</p><p>In order to avoid the mentioned shortcomings, it is suggested to improve the method as follows.</p><p>To control user access to the organization's resources, we introduce an access matrix</p><formula xml:id="formula_5">𝐴 𝐴 = [ 𝑎 𝑎 1,1 ⋯ 𝑎 𝑎 1,𝑛 ⋮ ⋱ ⋮ 𝑎 𝑎 𝑚,1 ⋯ 𝑎 𝑎 𝑚,𝑛</formula><p>]. The elements of this matrix denote: 𝐴 𝐴 (𝑖, 𝑗) = 1, if the user 𝑢 𝑖 is granted access to asset 𝑎 𝑗 , and 𝐴 𝐴 (𝑖, 𝑗) = 0, if not.</p><p>The actual access of users to assets will still be determined by the matrix</p><formula xml:id="formula_6">𝐴 𝑈 = [ 𝑎 𝑢 1,1 ⋯ 𝑎 𝑢 1,𝑛 ⋮ ⋱ ⋮ 𝑎 𝑢 𝑚,1 ⋯ 𝑎 𝑢 𝑚,𝑛 ].</formula><p>To determine the malicious activity of users, we will calculate the difference between the matrices 𝑀 = 𝐴 𝐴 − 𝐴 𝑈 . As a result, we will get a matrix, the elements of which will be numbers from the set 𝑀 ∈ {−1,0,1}, where: 𝑚 𝑖,𝑗 = −1 in the case of malicious user activity; 𝑚 𝑖,𝑗 = 0 the user has made legal access to the authorized assets; 𝑚 𝑖,𝑗 = 1 the user did not access the authorized assets.</p><p>Let's count the number of " 1" values in each column of the matrix 𝑀 and divide these values by the number of "1" values in each column of the matrix 𝐴 𝐴 . We will present the obtained results in percentage ratio. This is necessary in order to take into account the general activity of users: for a user with a limited scope of access, even a single malicious access will produce a result similar to a user with wide access rights to the organization's resources.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Simulation and discussion of results</head><p>As before, we will consider the effect of the technique on an abstract example <ref type="bibr" target="#b11">[13]</ref>. Assume that the organization has 10 users and 15 information assets. Then the bipartite graph of user interactions with information assets can be described by a binary matrix 𝐴 𝑆 of dimension 15×10.</p><p>Let's consider and compare the main scenarios of the application of the two methods.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.1.">Scenario 1</head><p>Two groups of users work with authorized information assets and their actions regarding access to the assets do not overlap. However, one of the users (#5) is trying to access asset #8, which he does not have permission to access. In addition, user #5, knowing the algorithm for detecting anomalies in user interaction, tries to bypass the protection system, for which he does not use one of the allowed resources, for example, asset #1. These two situations can be described by matrices of access <ref type="bibr" target="#b12">[14]</ref> 𝐴</p><formula xml:id="formula_7">𝑈 𝑎 = [ 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 0 0 𝟏 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 ] , 𝐴 𝑈 𝑏 = [ 1 1 1 1 𝟎 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 0 0 𝟏 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 ] ,<label>(5)</label></formula><p>where matrix columns denote users of the organization; the rows of the matrix indicate the organization's assets; values of "1" in blue color indicate assets to which users are allowed to access; value "0" in black color assets to which access is prohibited.</p><p>According to Scenario 1, the matrix 𝐴 𝑈 𝑎 of formula (5) describes the attempt of user #5 to access the prohibited asset #8. Matrix 𝐴 𝑈 𝑏 of formula ( <ref type="formula" target="#formula_7">5</ref>) is the attempt of user #5 to access asset #8 bypassing the security system by ignoring the asset #1 allowed to him.</p><p>In the case of 𝐴 𝑈 𝑎 , the application of the algorithm immediately gives a result in which the abnormality of the behavior of user #5 is 7.2% against the background of the rest of the users, whose Figure <ref type="figure" target="#fig_1">1</ref>). This clearly indicates anomalous behavior of this user, which may be an indication of an insider threat <ref type="bibr" target="#b13">[15]</ref>. In the situation 𝐴 𝑈 𝑏 , when user #5 tries to bypass the protection system, for which he does not use one of the permitted resources, for example, asset #1, when calculating the abnormality of the behavior of user #5, the algorithm will give an erroneous result (Figure <ref type="figure" target="#fig_2">2</ref>) . In this case, for user #5, the degree of abnormality will be only 1.9% and therefore, against the background of general indicators from 4.0% to 2.8%, it will be impossible to recognize an insider attack <ref type="bibr" target="#b14">[16]</ref>. In the same situation, when applying the improved methodology, in both cases (when user #5 access is attempted without bypassing the protection system and with the protection system bypassed), we get a result that clearly indicates the anomalous behavior of user #5 (Figure <ref type="figure" target="#fig_3">3</ref>). </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.2.">Scenario 2</head><p>In the previous scenario, the organization's information assets were clearly demarcated between users. However, this situation in most organizations is the exception rather than the rule. As a rule, when performing tasks, employees of organizations very often use common resources. In this case, the application of the method based on the similarity matrix <ref type="bibr" target="#b15">[17]</ref> gives extremely contradictory results that cannot be interpreted.</p><p>As in Scenario 1, we denote the access rights of users to the assets of the organization by the matrix 𝐴 𝐴 𝑐 . The fact of user access to assets is denoted by the access matrix 𝐴 𝑈 𝑑 . In the matrix of actual access, let's mark with red symbols "1" attempts of users to gain unauthorized access to assets, and with "0" symbols in brown authorized assets that were not used by users. In this case, the matrices 𝐴 𝐴 𝑐 and 𝐴 𝑈 𝑑 , as an example, can have the form</p><formula xml:id="formula_8">𝐴 𝐴 𝑐 = [ 0 0 0 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 0 0 0 1 1 1 1 1 1 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 1 1 1 1 0 0 0 1 1 0 0 1 1 1 0 0 1 1 1 1 0 0 1 1 0 1 1 1 1 1 0 0 1 1 1 1 1 1 1 0 0 0 0 1 ] , 𝐴 𝑈 𝑑 = [ 0 0 0 1 𝟎 𝟎 𝟎 1 1 1 0 1 1 𝟎 1 𝟎 1 1 1 0 1 1 𝟎 1 1 1 1 0 0 0 1 1 1 1 1 0 0 0 𝟏 0 0 0 0 0 0 0 0 1 1 0 0 1 1 1 1 1 1 1 0 0 1 1 𝟎 1 1 1 0 0 𝟏 0 1 1 1 𝟎 1 0 0 0 𝟏 0 1 1 0 0 0 1 1 1 1 1 1 0 0 𝟏 0 1 1 1 1 1 0 0 0 0 0 𝟏 1 1 1 1 𝟏 0 0 1 1 0 0 1 1 1 0 0 1 1 1 1 0 0 1 1 0 1 𝟎 𝟎 1 1 0 0 1 1 1 𝟎 1 1 1 𝟏 0 0 0 1 ] .<label>(6)</label></formula><p>We simulate the situation described by matrices (6) using the similarity algorithm and the improved method. The results of modeling using the similarity algorithm and the improved method are shown in Figure <ref type="figure" target="#fig_4">4</ref> and Figure <ref type="figure" target="#fig_5">5</ref>.  As we can see from Figure <ref type="figure" target="#fig_4">4</ref>, in the case when the access rights of different users overlap (when users can use shared resources), the similarity algorithm gives results that do not unambiguously indicate anomalies in user behavior. At the same time, the results in Figure <ref type="figure" target="#fig_5">5</ref> fully reproduce the pattern of malicious activity described by the matrix 𝐴 𝑈 𝑑 . At the same time, the system can also determine the level of malicious activity <ref type="bibr" target="#b16">[18,</ref><ref type="bibr" target="#b17">19]</ref>. In particular, the matrix 𝐴 𝑈 𝑑 of formula <ref type="bibr" target="#b5">(6)</ref> shows that attempts to gain unauthorized access to the organization's assets were made by users #1, #2, #4, #6, #9. At the same time, user #6 made 2 such attempts, and user #9 made three such attempts. The results of the application of the improved technique give indicators for user #6 at the level of 22.2%, and for #9 33.3%. At the same time, for other malicious actions of users #1, #2, #4, the result is within 9.09...14.3%, which clearly distinguishes more dangerous users against the background of less dangerous ones. The separation of suspicious activity into different levels is important from the point of view of identifying real insiders, because in this case it is possible to reject those users who make unintentionally erroneous actions with information assets. In this way, the system will be more protected against false alarms.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Conclusions</head><p>The improved method given in this article makes it possible to unambiguously determine that the user's interaction with some information asset of the organization is anomalous. This, in turn, may indicate a possible insider attack. The results of the application of the improved method may be transferred to the information security administrator for further analysis and action. It is assumed that in some cases such an approach will not allow to reliably determine whether a given activity is a malicious activity, since such an analysis does not take into account the context of interaction and the reason for its occurrence, in addition, other, personal characteristics of a specific user are not taken into account. In any case, the application of this technique is advisable in combination with the analysis of other indicators that allow determining the presence of the user's propensity for malicious activity, for example, taking into account the loyalty of the staff. By integrating real-time monitoring and behavior profiling, the technique can serve as an early warning system, flagging users whose actions deviate significantly from established norms. This can allow security administrators to intervene promptly, reducing response times and minimizing potential damage. Moreover, combining this method with context-aware analysis and psychological profiling could provide a more holistic approach to insider threat management, balancing technological detection with an understanding of human factors.</p><p>Future research in this area could explore the integration of machine learning techniques with the proposed method to enhance the detection of insider threats in more complex organizational environments. Specifically, incorporating predictive analytics and anomaly detection algorithms could improve the system's ability to identify patterns of malicious behavior even when insiders attempt to mask their activity.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>9 . 1 ∑</head><label>91</label><figDesc>𝐶(𝐺 𝑈 𝑘 ) = 𝑇𝑎𝑏𝑙𝑒 [ 1 𝑛−𝐼𝑓[𝑖 = 𝑗, 0, 𝐶(𝑢 𝑖 , 𝑢 𝑗 )], {𝑖,</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 1 .</head><label>1</label><figDesc>Figure 1. Calculating the abnormality of user behavior #5 using the similarity algorithm.</figDesc><graphic coords="7,101.57,62.35,396.83,247.45" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 2 .</head><label>2</label><figDesc>Figure 2. Calculating the abnormality of the behavior of user #5 using the similarity algorithm when he tries to bypass the protection system.</figDesc><graphic coords="7,101.57,428.28,396.77,248.55" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 3 .</head><label>3</label><figDesc>Figure 3. Calculating the abnormality of user behavior #5 using an improved method.</figDesc><graphic coords="8,101.57,62.35,396.80,256.50" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 4 .</head><label>4</label><figDesc>Figure 4. Calculating anomalies using the similarity algorithm.</figDesc><graphic coords="9,125.23,118.73,350.16,218.60" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Figure 5 .</head><label>5</label><figDesc>Figure 5. Calculating of anomalies according to the improved method.</figDesc><graphic coords="9,123.32,373.78,353.61,230.10" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head></head><label></label><figDesc>𝑢 𝑖 , 𝑢 𝑗 ) =</figDesc><table><row><cell>𝐼 𝐷𝐹 (𝑈 𝑖 )×𝐼 𝐷𝐹 (𝑈 𝑗 ) ‖𝐼 𝐷𝐹 (𝑈 𝑖 )‖×‖𝐼 𝐷𝐹 (𝑈 𝑗 )‖</cell><cell>=</cell><cell>√∑</cell><cell>∑ (𝐼 𝐷𝐹 (𝑈 𝑖,𝑘 )) 𝐼 𝐷𝐹 (𝑈 𝑖,𝑘 )×𝐼 𝐷𝐹 (𝑈 𝑗,𝑘 ) 𝑚 𝑘=1 2 𝑘=1 𝑚 × √∑ (𝐼 𝐷𝐹 (𝑈 𝑗,𝑘 )) 𝑚 𝑘=1</cell><cell>2</cell></row></table></figure>
		</body>
		<back>
			<div type="annex">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Declaration on Generative AI</head><p>The authors have not employed any Generative AI tools.</p></div>			</div>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">The method of detecting anomalies of user interaction with the organization&apos;s information resources</title>
		<author>
			<persName><forename type="first">V</forename><surname>Savchenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Smolev</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Gamza</surname></persName>
		</author>
		<idno type="DOI">10.31673/2409-7292.2023.030101</idno>
	</analytic>
	<monogr>
		<title level="j">Modern information security</title>
		<imprint>
			<biblScope unit="volume">4</biblScope>
			<biblScope unit="issue">56</biblScope>
			<biblScope unit="page" from="6" to="12" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Time Aspect of Insider Threat Mitigation</title>
		<author>
			<persName><forename type="first">V</forename><surname>Savchenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Savchenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Dzyuba</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Matsko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Novikova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Havryliuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Polovenko</surname></persName>
		</author>
		<idno type="DOI">10.3849/aimt.01830</idno>
	</analytic>
	<monogr>
		<title level="j">Advances in Military Technology</title>
		<imprint>
			<biblScope unit="volume">19</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="149" to="164" />
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">A Review of Anomaly Detection Strategies to Detect Threats to Cyber-Physical Systems</title>
		<author>
			<persName><forename type="first">N</forename><surname>Jeffrey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>Tan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">R</forename><surname>Villar</surname></persName>
		</author>
		<idno type="DOI">10.3390/electronics12153283</idno>
	</analytic>
	<monogr>
		<title level="j">Electronics</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="page">3283</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<monogr>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">V</forename><surname>Ruban</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">O</forename><surname>Martovytskyi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">O</forename><surname>Partyka</surname></persName>
		</author>
		<ptr target="https://openarchive.nure.ua/server/api/core/bitstreams/7c434471-942c-40a7-b70c-0cc2655a42fe/content" />
		<title level="m">Classification of anomaly detection methods</title>
				<imprint/>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">informatics: XVI All-Ukrainian scientific and practical conference of students</title>
		<ptr target="https://ela.kpi.ua/handle/123456789/25237" />
	</analytic>
	<monogr>
		<title level="j">postgraduates and young scientists</title>
		<imprint>
			<biblScope unit="volume">26</biblScope>
			<biblScope unit="issue">27</biblScope>
			<biblScope unit="page" from="51" to="52" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<idno type="DOI">10.1145/3442536.3442550</idno>
		<title level="m">3rd Artificial Intelligence and Cloud Computing Conference</title>
				<meeting><address><addrLine>AICCC; Kyoto; Japan</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2020">2020. 2020</date>
			<biblScope unit="volume">18</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">An intelligent system for detecting anomalies and identifying smart home devices using collective communication</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">O</forename><surname>Nicheporuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">A</forename><surname>Nicheporuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><forename type="middle">S</forename><surname>Savenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">D</forename><surname>Kazantsev</surname></persName>
		</author>
		<ptr target="https://eltecs.op.edu.ua/index.php/journal/article/download/3196/1118/" />
	</analytic>
	<monogr>
		<title level="j">Electrical and computer systems</title>
		<imprint>
			<biblScope unit="volume">34</biblScope>
			<biblScope unit="issue">110</biblScope>
			<biblScope unit="page" from="50" to="61" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Anomaly Detection Method in Computer Systems by Means of Machine Learning</title>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">L</forename><surname>Mezones Santana</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">E</forename><surname>Macias</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Quimiz Moreira</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-031-11438-0_32</idno>
	</analytic>
	<monogr>
		<title level="m">Innovation and Research A Driving Force for Socio-Econo-Technological Development</title>
				<editor>
			<persName><forename type="first">M</forename><forename type="middle">Zambrano</forename><surname>Vizuete</surname></persName>
		</editor>
		<imprint>
			<date type="published" when="2022">2022</date>
			<biblScope unit="volume">511</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Micro2vec: Anomaly detection in microservices systems by mining numeric representations of computer logs</title>
		<author>
			<persName><forename type="first">M</forename><surname>Cinque</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Della Corte</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Pecchia</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.jnca.2022.103515</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of Network and Computer Applications</title>
		<imprint>
			<biblScope unit="volume">208</biblScope>
			<biblScope unit="page">103515</biblScope>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<monogr>
		<ptr target="https://ieeexplore.ieee.org/document/9458872" />
		<title level="m">Based Anomaly Detection System for Cloud Engineering</title>
				<imprint>
			<publisher>ICDE</publisher>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title/>
		<ptr target="http://singhal.info/ieee2001.pdf" />
	</analytic>
	<monogr>
		<title level="j">Society Technical Committee on Data Engineering</title>
		<imprint>
			<biblScope unit="volume">24</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="35" to="43" />
			<date type="published" when="2001">2001</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<monogr>
		<author>
			<persName><forename type="first">V</forename><surname>Savchenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Akhramovych</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Dzyuba</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Laptiev</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Lukova-Chuiko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Laptieva</surname></persName>
		</author>
		<idno type="DOI">10.1109/ATIT54053.2021.9678599</idno>
		<title level="m">Theory (ATIT)</title>
				<meeting><address><addrLine>Kyiv, Ukraine</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="volume">99</biblScope>
			<biblScope unit="page">105</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Role-Based Access Control and the Access Control Matrix</title>
		<author>
			<persName><forename type="first">G</forename><surname>Saunders</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Hitchens</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Varadharajan</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-540-39927-8_14</idno>
	</analytic>
	<monogr>
		<title level="j">Operating Systems Review</title>
		<imprint>
			<biblScope unit="volume">35</biblScope>
			<biblScope unit="page" from="145" to="157" />
			<date type="published" when="2003">2003</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<monogr>
		<author>
			<persName><forename type="first">B</forename><surname>Viswanath</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Bashir</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Crovella</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Guha</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">P</forename><surname>Gummadi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Krishnamurthy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename></persName>
		</author>
		<ptr target="https://www.researchgate.net/publication/310793105_Towards_detecting_anomalous_user_behavior_in_online_social_networks" />
		<title level="m">of the 23rd USENIX Security Symposium (USENIX Security)</title>
				<imprint>
			<date type="published" when="2014">2014</date>
			<biblScope unit="volume">223</biblScope>
			<biblScope unit="page">238</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Addressing insider attacks via forensic-ready risk management</title>
		<author>
			<persName><forename type="first">L</forename><surname>Daubner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Macak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Buhnova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Pitner</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.jisa.2023.103433</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of Information Security and Applications</title>
		<imprint>
			<biblScope unit="volume">73</biblScope>
			<biblScope unit="page">103433</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Does outcome measurement of treatment for substance use disorder reflect the personal concerns of patients? A scoping review of measures recommended in Europe</title>
		<author>
			<persName><forename type="first">P</forename><surname>Alves</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Sales</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Ashworth</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.drugalcdep.2017.05.049</idno>
	</analytic>
	<monogr>
		<title level="j">Drug and Alcohol Dependence</title>
		<imprint>
			<biblScope unit="volume">179</biblScope>
			<biblScope unit="page">308</biblScope>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Insider Threat Detection and its Future Directions</title>
		<author>
			<persName><forename type="first">L</forename><surname>Ko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">M</forename><surname>Divakaran</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Liau</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Thing</surname></persName>
		</author>
		<idno type="DOI">10.1504/IJSN.2017.10005217</idno>
	</analytic>
	<monogr>
		<title level="j">International Journal of Security and Networks</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Detection of malicious activity using a neural network for continuous operation</title>
		<author>
			<persName><forename type="first">V</forename><surname>Sosnovyy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Lashchevska</surname></persName>
		</author>
		<idno type="DOI">10.28925/2663-4023.2024.23.213224</idno>
	</analytic>
	<monogr>
		<title level="j">Cybersecurity: Education, Science, Technique</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="213" to="224" />
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
