Incremental Maintenance of ABAC Policies.
Journal
CODASPY : proceedings of the ... ACM conference on data and application security and privacy. ACM Conference on Data and Application Security & Privacy
Titre abrégé: CODASPY
Pays: United States
ID NLM: 101638237
Informations de publication
Date de publication:
Apr 2021
Apr 2021
Historique:
entrez:
12
5
2021
pubmed:
13
5
2021
medline:
13
5
2021
Statut:
ppublish
Résumé
Discovery of Attribute Based Access Control policies through mining has been studied extensively in the literature. However, current solutions assume that the rules are to be mined from a static data set of access permissions and that this process only needs to be done once. However, in real life, access policies are dynamic in nature and may change based on the situation. Simply utilizing the current approaches would necessitate that the mining algorithm be re-executed for every update in the permissions or user/object attributes, which would be significantly inefficient. In this paper, we propose to incrementally maintain ABAC policies by only updating the rules that may be affected due to any change in the underlying access permissions or attributes. A comprehensive experimental evaluation demonstrates that the proposed incremental approach is significantly more efficient than the conventional ABAC mining.
Identifiants
pubmed: 33977290
doi: 10.1145/3422337.3447825
pmc: PMC8106942
mid: NIHMS1697966
doi:
Types de publication
Journal Article
Langues
eng
Pagination
185-196Subventions
Organisme : NIGMS NIH HHS
ID : R01 GM118574
Pays : United States
Organisme : NIGMS NIH HHS
ID : R35 GM134927
Pays : United States
Références
IEEE Conf Collab Internet Comput. 2017 Oct;2017:339-348
pubmed: 30506058