On Feasibility of Attribute-Aware Relationship-Based Access Control Policy Mining - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

On Feasibility of Attribute-Aware Relationship-Based Access Control Policy Mining

Shuvra Chakraborty
  • Fonction : Auteur
  • PersonId : 1135169
Ravi Sandhu
  • Fonction : Auteur
  • PersonId : 978076

Résumé

This paper studies whether exact conversion to an AReBAC (Attribute-aware Relationship-Based Access Control) system is possible from an Enumerated Authorization System (EAS), given supporting attribute and relationship data. The Attribute-aware ReBAC Ruleset Existence Problem (ARREP) is defined formally and solved algorithmically, along with complexity analysis. Approaches to resolve infeasibility using exact solutions are discussed.
Fichier principal
Vignette du fichier
513274_1_En_23_Chapter.pdf (776.95 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03677044 , version 1 (24-05-2022)

Licence

Paternité

Identifiants

Citer

Shuvra Chakraborty, Ravi Sandhu. On Feasibility of Attribute-Aware Relationship-Based Access Control Policy Mining. 35th IFIP Annual Conference on Data and Applications Security and Privacy (DBSec), Jul 2021, Calgary, AB, Canada. pp.393-405, ⟨10.1007/978-3-030-81242-3_23⟩. ⟨hal-03677044⟩
10 Consultations
4 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More