Upravlenie Bol'shimi Sistemami
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



UBS:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


UBS, 2018, Issue 75, Pages 76–102 (Mi ubs968)  

Network-based models in Control

Counteraction to conspiracy in discrete dynamical models of computers network

D. E. Gorbatenkoa, A. A. Semenovb

a Institute of Mathematics, Economics and Informatics, Irkutsk
b Matrosov Institute for System Dynamics and Control Theory, Irkutsk

Abstract: The paper studies the problem of counteracting the collusion of subjects in computer networks. In real world situations the goal of the collusions is to obtain some access rights between two network subjects. Within the proposed model, collusion is considered as a dynamic process taking place at discrete time. An original network is associated with a discrete dynamic system (DDS), in which collusion corresponds to a sequence of transitions between states. Collusion is successful if as a result of a sequence of steps the access rights are transferred from one particular subject to another. A counteraction to such collusion is achieved by deactivating some nodes. In a real network a deactivation corresponds to reducing access level between subjects. Deactivation of several nodes induces a new DDS. A final state of such DDS is a stationary point. If in this point the access rights are not transferred between selected subjects, then deactivation successfully blocked collusion. In the paper we consider a problem of finding minimal deactivating set. It is reduced to Boolean satisfiability problem and solved using state-of-the-art SAT solvers. We use the Take-Grant model of computer security because it is one of the most simple and well-studied models.

Keywords: discrete dynamical systems, "Grant model", conspiracy graph, SAT

DOI: https://doi.org/10.25728/ubs.2018.75.4

Full text: PDF file (323 kB)
References: PDF file   HTML file

UDC: 519.7
BBK: 22.17
Received: March 6, 2018
Published: September 30, 2018

Citation: D. E. Gorbatenko, A. A. Semenov, “Counteraction to conspiracy in discrete dynamical models of computers network”, UBS, 75 (2018), 76–102

Citation in format AMSBIB
\Bibitem{GorSem18}
\by D.~E.~Gorbatenko, A.~A.~Semenov
\paper Counteraction to conspiracy in discrete dynamical models of computers network
\jour UBS
\yr 2018
\vol 75
\pages 76--102
\mathnet{http://mi.mathnet.ru/ubs968}
\crossref{https://doi.org/10.25728/ubs.2018.75.4}


Linking options:
  • http://mi.mathnet.ru/eng/ubs968
  • http://mi.mathnet.ru/eng/ubs/v75/p76

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Upravlenie Bol'shimi Sistemami
    Number of views:
    This page:107
    Full text:27
    References:17

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021