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
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.
@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},
publisher = {mathdoc},
number = {5},
year = {2021},
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 PB - mathdoc 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 %I mathdoc %U http://geodesic.mathdoc.fr/item/VMUMM_2021_5_a7/ %G ru %F VMUMM_2021_5_a7
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/