CC BY
84
УДК 004.056.5
Mathematical Modeling of User Perception in Information Security Systems
Mikhail A. Styugin*
Siberian State Aerospace University Krasnoyarsky Rabochy, 31, Krasnoyarsk, 660014 Institute of Space and Information Technology
Russia
Siberian Federal University Kirenskogo, 26, Krasnoyarsk, 660041
Russia
Alexey A. KytmanoV
Institute of Space and Information Technology Siberian Federal University Kirenskogo, 26, Krasnoyarsk, 660041
Russia
Received 24.07.2015, received in revised form 10.08.2015, accepted 20.09.2015 The problem of the functional structures research is considered in this example of information systems. A feature of such research is that it is not always possible to ensure that the research results will match reality. This is a topic of current interest in the field of design and analysis of information security systems and software analysis for undeclared capabilities of systems in general. By undeclared capabilities, we refer to a functionality available in software that is invisible to users and can be used / exploited by an intruder. This paper presents a model of a researcher and of a functional object investigated by him. Based on this model, informational limitations of the researcher are shown. The mathematical model of the subjective structure of an investigated system is constructed. It is shown in which cases this structure is stable. This article answers the question of if the researcher can claim that his subjective functional structure corresponds to the actual structure of the investigated system. We provide examples of such approach on certain mathematical models of information security.
Keywords: mathematical models of information security, model of the researcher, information structure of the conflict, information flows, misinformation, black box model, graph theory. DOI: 10.17516/1997-1397-2015-8-4-454-466
Introduction
Information management in the sense of the knowledge of structure of a system and its vulnerabilities is an important issue in the field of information security. Effectiveness of information security actions depends on the information that a security administrator has. More precisely, it depends on how his information coincides with the reality. On the other hand, effectiveness of information security depends on a potential intruder's knowledge about the system: how close
* [email protected] [email protected] © Siberian Federal University. All rights reserved
his knowledge is to the real picture. There is a huge amount of information management tools which can be used in this case: logging systems, testing systems, security simulation systems, fake objects such as Honeypots, etc. However, at the present moment there are no modeling tools for such kind of systems.
For the modeling of such systems, it is necessary to split all the information on the system into an objective one and a subjective one. The level of similarity between a subjective image and the real structure of the system depends on the objects in the system to which the subject has an access and from which he can get a response. Under certain circumstances this level of similarity can dramatically affect the security of a system.
In the present article we propose one of the possible solutions to this problem.
1. Review of the relevant literature
Let us outline the main existing directions in the field of researching how of the attacker's information is influenced and managed. The most well-known direction is obfuscation. The most commonly used concept of obfuscation refers to software source code. The concepts that are used less commonly refer to software architecture and hardware devices. We may refer the reader to the works [1-3] where the mentioned concepts are studied.
The main idea of such concepts is obfuscation of a source code or a system structure in such way that the decoding task becomes a non-trivial problem. The key difference between the obfuscation theory and the theory used in the present work is that in the obfuscation theory the attacker knows about unknown parts of the system and therefore he is able to formulate the problem of investigating the real system structure. In our situation, the attacker does not have any information about the real system structure so that he is unable to formulate the problem of obtaining such a structure.
As a basis for the present work we used the existing mathematical models of access control. The most common examples of such models would be the Harrison, Ruzzo, Ullman (HRU) Model [4], the Bell-LaPadula Model [5], the Model of Secure Information Flow [6], the Role-based Access Control Models [7]. The HRU Model can be considered as the most universal (but at the same time the least usable) since the current access status in any system can always be represented as a matrix. For improving usability, a few modifications of the HRU model were introduced, namely the Typed Access Matrix Model [8], the Dynamic-Typed Access Matrix Model [9], etc. However, these models do not take into account the structure of the information system participants' awareness.
An exception here is the Quantitative Information Flow approach that became popular recently (see [10-12]). In these works, the concept of information flow is considered in terms of the Shannon entropy. Article [12] is the most interesting for us since the notion of information flow is expressed by considering the beliefs of individual users receiving this information flow. In other words, the information flows are considered in terms of the participants' awareness of the system. The related concepts of misinformation and covert channels are considered as well. Despite the fact that in this work we study similar processes, our approach is completely different as we only use qualitative characteristics of information flows.
As a basis for our research, we take the HRU Model with added awareness of all participants. The approach described in the present work can be applied without loss of generalty to various access control models including information flow modes.
2. Functional system model
Most information systems can be modeled using the black box model with input parameters which one can affect and output parameters which one can observe. We will treat a system structure as transformation laws that convert input parameters into output result. A black box structure can be represented as a set of elementary black boxes with inputs, outputs and connections between some of them. The output of each box functionally depends on its inputs. We call such a system of interacting black boxes a functional system.
One can make assumptions about the functional structure of the system. However, it is possible to control only a finite number of inputs and outputs. Parameter types (discrete, continuous, etc.) will also affect the result of the system research.
Consider the scheme given on Fig. 1.
In this case, researcher made an assumption about the black box structure. Namely he assumes the box consists of three objects, each of which represents a functional box, consisting of inputs and outputs. Object oy can be normalized by splitting it into the two independent objects with input x and outputs k and w.
The functions of system objects are
k(x), w(x), e(k, y), f (w, e). The resulting function of the system is
f{w(x),e(k(x)) ,y^.
Here x and y are input parameters of the system. Parameter y is considered but not observed by the researcher.
Since the system has input parameters which are unobservable, the researcher cannot obtain an informative feedback from the investigated system. However, it could be still possible to learn something new about the system [13]. There could be some information on the topology of the system and on the properties of the information flows.
It is necessary to split the subjective and the objective view of the system for determining the conditions under which the informative feedback exists. To do this, one has to divide the view of the objects into subjective (which might not be real) and objective, and the information flows between those objects.
Thus, we get the subjective and the objective sche-me of the information flows (Fig. 2).
In the scheme shown on Fig. 2, the object o2 has an extra input y in the objective system while the subjective scheme does not have it. Will the researcher get an informative feedback from the system? It depends on the properties of the functions and on the topology of information
flows network. Based on the properties of the researcher model described in [13], we can get an informative feedback from the system when we are able to introduce an equivalence relation on the set of values of the function, observed by the researcher based on unknown input parameters.
Fig. 2. Subjective and objective schemes of information flows
For the scheme mentioned above, these values will be
Fo2 : K x Y ^ Ei x E2,
so that the function may be written down as a direct product
F0k2 : k ^ Ei, FY : y ^ E2,
F — FK x FY
One can introduce an equivalence relation on the range (set of values) of F02 by the formula
F02 : Ei x E2 ^ Ei x E2,
Vei G Ei,e2 G E2, e3 G E2 ^ (e\, — (ei, 63).
Furthermore, if the object o3 performs similar mappings then it is possible to define an equivalence relation on the set of values of the function observed by the researcher. That is, the researcher gets the function with values which can be split into two sets. One of these sets can be indistinguishable i.e. not within the scope of the functional visibility of the subject (Fig. 3).
Fig. 3. Orthogonal information flows
We call such information flows orthogonal since they have different domains of parameters and functions. It is always possible to separate orthogonal information flows by introducing duplicating objects. As a result we get a system with non-orthogonal flows (Fig. 4).
In the resulting system, the researcher can get an accurate informative feedback on the top part of the information flows scheme. At the same time he cannot observe functional response of the bottom part. This is due to the proposition proven in [14]. It states that the subject can always compare the simpler model to the actual system and verify its validity by limiting the set of the functional visibility.
From now on we consider that all the flows in the system are non-orthogonal. Consider the situation described on Fig. 2. In this case, information flows can be iterative and noniterative. By a noniterative system, we mean the system in which the information flows exist continuously changing the values of the inputs of the black boxes. Any uncontrolled input in a noniterative system leads to the situation where we can never get informative feedback.
For an iterative system, we assume that the values of one or more inputs of an object stay the same for multiple experiments. Thus we can get an informative feedback from the other information flows.
Most technical and information systems are iterative. It is possible to investigate their structure even without having knowledge of the values of all the inputs. There are two key issues that are important from the practical point of view in the research of such structures:
• Which subjective schemes are stable for the resear-cher?
• What information can one obtain from the objective scheme based on the knowledge of the subjective scheme? How do these schemes correspond to each other?
To answer these questions, it is necessary to formalize the system in such a way that it becomes clear how the subject can adjust its assumptions on the real system structure based on the informative feedback of the system. Since the results of this study cannot be predicted, it is important for us to describe the maximal information of the real system structure that can be obtained from the incoming and outgoing information in the model.
3. The mathematical formulation of the problem
3.1. Definition of objective and subjective graph
A scheme with a given topology will be identified with a directed graph. A vertex of the graph corresponds to an object in the scheme. A directed edge corresponds to the direction of
<... researcher ...>
Fig. 4. A separation of orthogonal flows
information flow in the scheme. Note that we can consider edges with the same two vertices and opposite directions. We associate a graph with one vertex distinguished from all others with the scheme that has the subject (the researcher). This is the so-called selected vertex. Thus, we consider directed graphs of the following form
r = {V,E},
where
V = {Vo,Vi,... ,Vk} is a set of vertices containing the selected vertex V0, and
E = {Ei,...,Em}, Ei = Ei1i2 = (Vi1 ,Vi2), i-i e {0,1,...,*}, ¿2 e {0,i,...,k}\{i-i}
is a set of ordered pairs of vertices from V, called directed edges or just simply edges.
To the objective (real) scheme we assign the graph, which we call by objective graph or etalon graph. Graph that corresponds to the subjective scheme is called subjective graph.
3.2. Transformations of graphs
While investigating real structure of a scheme the researcher can remove certain information flows between objects that do not exist in reality (objective scheme) or add existing but previously unknown information flows. After a finite number of actions the researcher will come to the situation where he will be unable to remove or add anything new to a scheme (the scheme is stable). We call such a process of modification of a scheme when investigating its real structure a scheme reduction. The stable scheme that one obtains after the described process has been completed is called reduced subjective scheme or just reduced scheme.
In terms of mathematical language, we refer to the rules of addition and removal of information flows as graph transformations. Note that such transformations are irreversible.
By stable graph we refer to the graph that corresponds to a stable scheme. We refer to the reduced graph denoted by T as a stable graph obtained from graph r using graph transformations.
3.3. The formulation of the problem in a general form
Consider the objective graph = {Vo,Eo} and the subjective graph rs = {Vs,Es} such that
V0o = Vs = Vo, Vo n Vs = 0 and Eo n Es = 0. The question is how similar objective graph and reduced (subjective) graph rs can be?
4. Graph transformation rules
Note that in the case of a disconnected graph it makes sense to only consider the connected component containing the selected vertex V0. Indeed if the researcher has no connection to some part of a scheme, then in no way can he get information about objects from that part. Therefore, without loss of generality, we only consider connected graphs.
Definition 1. By a selected subgraph of graph r we call subgraph of r whose set of vertices Vj contains the selected vertex Vq and whose set of edges contains all the edges of r whose heads and tails belong simultaneously to Vj.
Rule 1. Any selected subgraph not containing cycles is stable.
This typically corresponds to the situation where the researcher either cannot act on the object, or he has no feedback from the object. In this case, he cannot receive any new information about the objects, and therefore, he cannot add or remove information flows.
Definition 2. By an oriented cycle rj of graph r = {V,E} where I = (i1,...,is), ik € {1,..., m} for k = 1,..., s we call the graph rj = {Vj, Ej} with
Vj = {Vi! ,...,Vis }c V
and
Ej = {Ei 1 i 2 , . . . , Eis-lis ,Eisil } C E.
An oriented cycle containing selected vertex Vq is called a selected cycle.
Definition 3. By a difference r1 \ r2 of graphs r1 = {V\ Ex} and v2 = {V2,E2} we call the connected component of the graph r = {V1, E1 \ E2} which contains the selected vertex Vq1 .
Definition 4. By a feedback ring T of graph r we call the set of all the vertices and all the edges of r contained in arbitrary oriented cycle of r passing through the selected vertex Vq.
Rule 2. Suppose there is a vertex Vk that belongs to an oriented cycle containing the selected vertex Vq. Suppose the mentioned cycle belongs to ro and rs. If there is an edge Eik = (Vi, Vk) with the tail Vk such that Eik € Eo and Eik € Es then the graph rs is unstable (Fig. 5).
v< r v, r»
v> v,
Fig. 5. Rule 2
This rule yields the restoration of hidden edges (i.e., existing in an objective graph, but not in a subjective graph) of a subjective graph rs that will be performed according to the step of the algorithm given in the next section.
Rule 3. If Vs \ r0 = 0 then Vs is unstable (Fig. 6).
rs i/, r0
Fig. 6. Rule 3
This rule yields the removal of non-existent edges of a subjective graph rs that will be performed according to the step of the algorithm given in the next section.
Corollary 1. A graph that contains no vertices strongly connected to the selected vertex Vq is stable.
5. Graph reduction algorithm
Graph reduction algorithm consists of the two steps.
1. Addition of the edges missing in the subjective graph, but existing in the objective graph.
2. Removal of the edges existing in the subjective graph, but missing in the objective graph.
Remark 1. Note the following important points. First of all, each step, in general, may consist of a different number of operations of addition (removal) of edges performed sequentially. Secondly, the order of steps in the algorithm in general can affect the outcome (reduced graph). Therefore, we will implement the steps of the algorithm in a specific order. First, one fully performs the step of addition of all the possible edges and after that, the step of removal of edges. This will ensure one obtains the same result when the algorithm is finished.
We now describe in detail the steps of the algorithm.
Let r I be an oriented cycle containing the vertex V0, rI C ro, rI C rs. By EI we denote the set of all the edges of the graph r which do not belong to the cycle rI and whose tails are in arbitrary vertices of rI. By VI we denote the set of vertices which are heads of the edges of EI.
Step 1 (addition). If the graph is unstable according to the Rule 2 then by adding some edges it can be reduced to the graph
r = {Vs ,Es},
where
Es = Es u y (E \ E^j, Vs = Es u y (Vf \ Vf) ■ (1)
I I
Here the union is taken over all multi-indices I for which there exist oriented cycles rI containing Vo and such that ri C ro, ri C rs.
Remark 2. If in (1) one uses Eo instead of Eo \ EST and Vf instead of Vf \ V/, the result remains the same. However, the proposed form is convenient because the given sets are exactly the sets of new edges and vertices (which are not contained in the previous version of the modified subjective graph).
Step 2 (removal). If the graph is unstable according to the Rule 3, then by removing some edges it can be reduced to the graph
r =rs \ (ts \ f^.
1. The main result
The main result of this paper answers the question, "under what conditions can a subjective graph be reduced to the objective one?"
Theorem 5.1. If the feedback ring of subjective graph contains all its vertices, and the set of vertices of subjective and objective graphs coincide, then the reduced subjective graph coincides with the objective graph. This can be written down as
If Vo = Vs C f^ then p = ro.
6. Example of an interpretation of the model
Suppose there is a subject S (in the system) which can initiate the process pi with parameter x.
The process pi, in turn, starts the process p2 with the parameter y that is generated based on x.
Process p1 (x: par) y = func (x); Create Process p2 (y);
end.
The process p2 generates parameter z based on y. After that, the file fi is open for writing and the process writes z down to it.
Process p2 (y: par) z = func (y); Open f1 for write; Write z to f1;
end.
The subject s can view the contents of the file fi, i.e. he is able to run the command:
Open f1 for read; k = f1;
As a result, we get the following information flows scheme (Fig. 7).
1
Fig. 7. Information flows scheme This scheme can be represented as a graph (objective and/or subjective), see Fig. 8.
Fig. 8. Graph representation of information flows
Here we assume that the subjective graph coincides with the objective one, i.e. assumptions of the subject S on the information flows structure in the system are true.
Now let us consider two graphs which are unstable according to the Rules 2 and 3 (Fig. 9 and 10, respectively).
Fig. 9. Unstable graph according to the Rule 2
Fig. 10. Unstable graph according to the Rule 3
In the first case, the process p1 in fact does not initiate the process p2. This leads to the situation when the subject cannot discover any feedback when affecting the file f1. If there is no other feedback ring in the graph, he will lose all the objects and information flows in this chain.
In the second case, there is an extra process that has an access for writing to the file f1. This fact will be discovered by the subject sooner or later so that the new edge will appear in the subjective graph.
7. Analysis of real systems
Application of the model described above can be considered for information security systems. Take for example the classical Harrison-Ruzzo-Ullman access matrix model [4] which is considered in information security models.
The model defines:
O — the set of objects in the system;
S — the set of subjects in the system (S C O);
R — the set of access rights types of subjects to objects;
T — access matrix with rows corresponding to the subjects and columns corresponding to the objects (T[s,o] C R).
As a result of applying a primitive operator a, a transition from the state q = (S, O, T) to the state q' = (S',O',T') is performed. We denote this transition by q ^a q'.
In our case, it is necessary to introduce the subjective states of the system for all the subjects of the system
Vsi e s 3qSi = (SSi ,OSi ,TSi).
Each subject in the graph defined by the state qsi = (SSi ,OSi ,TSi) has an area of misinformation (fake objects and accesses) and an invisible area (objects and accesses that he does not
see in the objective access matrix). Denote them as
Misinformation area: qmis = (Ssz \ S, Osz \ O, Tsz \ T);
Invisible area: q™ = (S \ Ss^,O \ Os. ,T \ TH).
Harrison-Ruzzo-Ullman model (HRU) is used for analysis of safe-states of systems depending on the possibility of a transition to the state q' for which the forbidden permissions appear in the respective cells of the matrix.
If we introduce subjective states of the system, the HRU system cannot perform transitions if they do not exist in the subjective matrices of any of the subjects. Thus we can express initial state of the system with N subjects as follows:
qo = (Ssi u... u SsN n S,Osi u... u OsS n O, Tsi u... u TsS n T).
Obviously, when intersecting the sets, the system can switch from an unsecure state to a secure one and vice versa. Consequently, if the system in which only the objective states of the HRU automaton are being analyzed is unsecure, then it does not mean that we also get an insecure system starting from subjective states of the HRU automaton. This gives us an opportunity to obtain a secure system by adjusting subjective access matrices.
In order to reduce analysis of the system to analysis of the information flows, one has to define graph vertices as objects of the set O. One also needs to introduce a function that transfers elements of the access matrix to the edges of the graph. For R = {read, write, execute} it can be done as follows:
r = (V, E), V = O, E = {(v-,v2) | write € T [01,02] or
execute € T[01, o2] or read € T[o^,o2]}.
We have to implement this construction both for objective and subjective graphs. As a result, we will get the objective and the subjective access graphs. This will allow us to answer the following questions according to the above described theory:
• How can misinformation of the subjects lead them to the stable subjective states?
• What information can be obtained by the subjects based on their access to the objects and entities of the system (i.e., what graphs can they obtain through the research)?
• In which case can the information security administrator claim that the subjective image of the system constructed by him corresponds to the objective structure (according to the Theorem 5.1)?
In order to bring the information flows graph back to the access matrix T' of the HRU system, one has to perform the following transformations:
r € T'[oj,, 0j] ^ r € T[oi, 0j] and (vi, vj) € E,
where r € {read, write, execute}. The result is the modified access matrix of the system, in which the state can be secure. Thus, by controlling the user perception of the system structure, one can bring the system from an insecure state to a secure one.
8. Conclusion and applications
The model of a researcher considered in the present work allows us to make the system secure by means of user perception about the system and about misinformation to the users. Besides the Harrison-Ruzzo-Ullman model, one can consider and make similar additions to other information security models such as the Take-Grant model or mandate and role access control model [5]. The model can also be used for conflictive systems modeling. For example, it can be used for the construction of the initial payment matrices in theoretical-game-models.
Mathematical models developed in this work can also be used in the field of software testing since they allow one to compare the structure of the tested system to the tests with a stable positive feedback. Based on the developed functional systems research methodology, we can come to software design patterns, which would avoid uninformative feedback on the testing stage.
This work was supported by the Federal Grant-in-Aid Program under Governmental (Contract No. 14.574.21.0126 , unique identifier RFMEFI57414X0126, first author); the state order of the Ministry of Education and Science of the Russian Federation for Siberian Federal University (task 1.1462.2014/K, second author) and the Russian Foundation for Basic Research (grant 15-31-20008-mol_a_ved, second author).
References
[1] S.Goldwasser, G.Rothblum, On best-possible obfuscation, Journal of Cryptology, 27(2014), no. 3, 480-505.
[2] Y.Tang, P.Lin, Z.Luo, Obfuscating encrypted web traffic with combined objects, 10th International Conference on Information Security Practice and Experience, ISPEC 2014, Fuzhou, China, 8434(2014), LNCS, 90-104.
[3] B.Barak, O.Goldreich, R.Impagliazzo, S.Rudich, A.S.Ucla, S.Vadhan, K.Yang, On the (Im)possibility of obfuscating programs, Journal of the ACM, 59(2012), no. 2, Article 6.
[4] M.Harrison, W.Ruzzo, J.Ullman, Protection in operating system, Communication of ACM, 19(1976), no. 8, 461-471.
[5] D.E.Bell, L.J.LaPadula, Secure Computer Systems: Unified Exposition and Multics Interpretation, Bedford, Mass., MITRE Corp., 1976.
[6] D.E.Denning, Lattice model of secure information flow, Communications of the ACM, 19(1976), no. 5, 236-243.
[7] R.S.Sandhu, E.J.Coyne, H.L.Feinstein, C.E.Youman, Computer role-based access control models, Computer, 29(1996), no. 2, 38-47.
[8] R.S.Sandhu, The typed access matrix model, Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy, Oakland, CA, USA, 17596(1992), 122-136.
[9] M.Soshi, M.Maekawa, E.Okamoto, The Dynamic-Typed Access Matrix Model and Decidability of the Safety Problem, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E87-A(2004), no. 1, 190-203.
[10] G.Lowe, Quantifying Information Flow, CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations, 2002.
[11] G.Smith, On the Foundations of Quantitative Information Flow, FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures, 2009, 288-302.
[12] M.R.Clarkson, A.C.Myers, F.B.Schneider, Quantifying information flow with beliefs, Journal of Computer Security, 17(2009), no. 5, 655-701.
[13] M.Styugin, Protection Against System Research, Cybernetics and Systems: An International Journal, 45(2014), no. 4, 362-372.
[14] M.Styugin, Protection against system research. Methods and models of secured system construction and information management in a conflict, Lambert Academic Publishing, 2011.
Математическое моделирование информированности субъектов в системах информационной безопасности
Михаил А. Стюгин Алексей А. Кытманов
В статье рассмотрена проблема исследования функциональных структур на примере информационных систем. Особенность такого исследования заключается в том, что не всегда возможно добиться того, что результат исследования будет соответствовать реальности. Это крайне актуальная проблема в области разработки и анализа систем информационной безопасности и анализа программного обеспечения на предмет недекларируемых возможностей. В статье дана модель исследователя и исследуемого им функционального объекта. На основании данной модели показаны информационные ограничения исследователя. Построена математическая модель субъективной структуры исследуемой системы, и показано, в каких случаях она является устойчивой. Дан также ответ на вопрос, в каком случае субъект может утверждать, что его субъективная функциональная структура объекта соответствует действительной. Приведены примеры реализации данного подхода на математических моделях информационной безопасности.
Ключевые слова: математические модели информационной безопасности, модель исследователя,, информационная структура конфликта, информационные потоки, дезинформация, модель черного ящика, теория графов.
