On Feasibility of Attribute-Aware Relationship-Based Access Control Policy Mining - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

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

Shuvra Chakraborty
  • Function : Author
  • PersonId : 1135169
Ravi Sandhu
  • Function : Author
  • PersonId : 978076

Abstract

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.
Embargoed file
Embargoed file
0 6 23
Year Month Jours
Avant la publication

Dates and versions

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

Licence

Attribution

Identifiers

Cite

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⟩
6 View
2 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More