Search of the conflicts in security policies: a model of random graphs

A. A. Grusho^ab, N. A. Grusho^a, E. E. Timonina<sup>a

a</sup> Russian State University for the Humanities, Institute for Information Sciences and Security Technologies
^b M. V. Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics

Abstract: Risk analysis requires at least a rough estimate of the probability of problematic situations in the implementation of security policy. Such estimates can be obtained in the analysis of conflicts in security policies using models of random graphs. In this paper, two examples of conflicts in security policy are considered and a model of random graphs for their research is constructed. The results of analysis were used to evaluate the influence of certain parameters of random graphs on the probability of the existence of conflicts and complexity of search algorithms in real conflict security policies.

Keywords: security policy; threats to information security; mathematical models of security policy.