Name
Abstract | ||
|---|---|---|
Role Based Access Control (RBAC) is an effective way of managing permissions assigned to a large number of users in an enterprise. In order to deploy RBAC, a complete and correct set of roles needs to be identified from the existing user permission assignments, keeping the number of roles low. This process is called role mining. After the roles are mined, users are assigned to these roles. While implementing RBAC, it is often required that a single role is not assigned a large number of permissions. Else, any user assigned to that role will be overburdened with too many operations. In this paper, we propose a heuristic bottom-up constrained role mining scheme that satisfies a cardinality condition that no role contains more than a given number of permissions. We compare its results with eight other recently proposed role mining algorithms. It is seen that the proposed scheme always satisfies the cardinality constraint and generates the least number of roles among all the algorithms studied. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-17714-9_13 | ICISS |
Keywords | Field | DocType |
role mining scheme,mining rbac role,role mining,single role,role mining algorithm,large number,proposed scheme,access control,cardinality constraint,existing user permission assignment,cardinality condition,satisfiability,role based access control,rbac,bottom up | Role engineering,Permission,Data mining,Heuristic,Computer science,Cardinality,Role-based access control,Theoretical computer science | Conference |
Volume | ISSN | ISBN |
6503 | 0302-9743 | 3-642-17713-1 |
Citations | PageRank | References |
16 | 0.65 | 22 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ravi Kumar | 1 | 21 | 4.89 |
| Shamik Sural | 2 | 1008 | 96.36 |
| Arobinda Gupta | 3 | 509 | 42.26 |