Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika
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


Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.:
Year:
Volume:
Issue:
Page:
Find




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

Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2021, Number 5, Pages 57–60 (Mi vmumm4428)  
Short notes

Automata model for verifying attibuted-based access control policy in systems with a finite number of objects

A. L. Kuznetsovaa, S. A. Afoninb

a Bauman Moscow State Technical University
b Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (633 kB)
References:
PDF
HTML
Abstract: In this paper, we use a finite-automata model of attribute-based access control policies. The correctness of a policy is defined as a variation of the reachability problem for an infinite transition system induced by the policy. The problem of correctness validation for a given policy is shown decidable for information systems with a bounded number of objects.
Key words: information security, ABAC, policy validation, finite automaton, decidability.
Funding agency Grant number
Russian Foundation for Basic Research 18-07-01055
Received: 21.10.2020
English version:
Moscow University Mathematics Bulletin, 2021, Volume 76, Issue 5, Pages 230–233
DOI: https://doi.org/10.3103/S002713222105003X
Bibliographic databases:
Document Type: Article
UDC: 519.71
Language: Russian
Citation: A. L. Kuznetsova, S. A. Afonin, “Automata model for verifying attibuted-based access control policy in systems with a finite number of objects”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2021, no. 5, 57–60; Moscow University Mathematics Bulletin, 76:5 (2021), 230–233
Citation in format AMSBIB
\Bibitem{KuzAfo21}
\by A.~L.~Kuznetsova, S.~A.~Afonin
\paper Automata model for verifying attibuted-based access control policy in systems with a finite number of objects
\jour Vestnik Moskov. Univ. Ser.~1. Mat. Mekh.
\yr 2021
\issue 5
\pages 57--60
\mathnet{http://mi.mathnet.ru/vmumm4428}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4383511}
\zmath{https://zbmath.org/?q=an:1487.68069}
\transl
\jour Moscow University Mathematics Bulletin
\yr 2021
\vol 76
\issue 5
\pages 230--233
\crossref{https://doi.org/10.3103/S002713222105003X}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000750338400005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85124294065}
Linking options:
  • https://www.mathnet.ru/eng/vmumm4428
  • https://www.mathnet.ru/eng/vmumm/y2021/i5/p57
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:73
    Full-text PDF :13
    References:18
    First page:4
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024