Name
Abstract | ||
|---|---|---|
In Attribute-Based Access Control (ABAC), access to resources is given based on the attributes of subjects, objects, and environment. There is an imminent need for the development of efficient algorithms that enable migration to ABAC. However, existing policy mining approaches do not consider possible adaptation to the policy of a similar organization. In this article, we address the problem of automatically determining an optimal assignment of attribute values to subjects for enabling the desired accesses to be granted while minimizing the number of ABAC rules used by each subject or other appropriate metrics. We show the problem to be NP-Complete and propose a heuristic solution.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3323233 | ACM Transactions on Internet Technology |
Keywords | Field | DocType |
ABAC policy,attribute value hierarchy,policy adaptation | Attribute-based access control,Computer science,Distributed computing | Journal |
Volume | Issue | ISSN |
19 | 3 | 1533-5399 |
Citations | PageRank | References |
1 | 0.37 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Saptarshi Das | 1 | 202 | 28.99 |
| Shamik Sural | 2 | 1008 | 96.36 |
| Jaideep Vaidya | 3 | 2778 | 171.18 |
| Vijayalakshmi Atluri | 4 | 3256 | 424.98 |