Geodesic
Automata model for verifying attibuted-based access control policy in systems with a finite number of objects
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2021), pp. 57-60 
A. L. Kuznetsova; S. A. Afonin. Automata model for verifying attibuted-based access control policy in systems with a finite number of objects. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2021), pp. 57-60. http://geodesic.mathdoc.fr/item/VMUMM_2021_5_a7/
@article{VMUMM_2021_5_a7,
     author = {A. L. Kuznetsova and S. A. Afonin},
     title = {Automata model for verifying attibuted-based access control policy in systems with a finite number of objects},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {57--60},
     year = {2021},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2021_5_a7/}
}
TY  - JOUR
AU  - A. L. Kuznetsova
AU  - S. A. Afonin
TI  - Automata model for verifying attibuted-based access control policy in systems with a finite number of objects
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2021
SP  - 57
EP  - 60
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2021_5_a7/
LA  - ru
ID  - VMUMM_2021_5_a7
ER  - 
%0 Journal Article
%A A. L. Kuznetsova
%A S. A. Afonin
%T Automata model for verifying attibuted-based access control policy in systems with a finite number of objects
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2021
%P 57-60
%N 5
%U http://geodesic.mathdoc.fr/item/VMUMM_2021_5_a7/
%G ru
%F VMUMM_2021_5_a7

Voir la notice de l'article provenant de la source Math-Net.Ru

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.

[1] Bogaerts J., Decat M., Lagaisse B., Joosen W., “Entity-based access control: supporting more expressive access control policies”, Proc. 31st Annual Computer Security Applications Conf., Association for Computing Machinery, Los Angeles, 2015, 291–300 | DOI

[2] Galatenko A. V., Pletneva V. A., “Vyrazimost modelei bezopasnosti take-grant i nevliyaniya v ramkakh modeli CBAC”, Programmnaya inzheneriya, 11:1 (2020), 40–46

[3] Afonin S., Bonushkina A., “Validation of safety-like properties for entity-based access control policies”, Proc. Advances in Soft and Hard Computing, Advances in Intelligent Systems and Computing, 889, Springer, 2019, 259–271 | DOI

[4] Kudryavtsev V. B., Aleshin S. V., Podkolzin A. S., Vvedenie v teoriyu avtomatov, Nauka, M., 1986

[5] Khoussainov B., Nies A., Rubin S., Stephan F., “Automatic structures: Richness and limitations”, Proc. 19th Annual Symp. on Logic in Computer Science, v. 1, IEEE, Turku, 2004, 44–53 | DOI