Role Engineering via Prioritized Subset Enumeration

被引:37
作者
Vaidya, Jaideep [1 ]
Atluri, Vijayalakshmi [1 ]
Warner, Janice [2 ]
Guo, Qi [1 ]
机构
[1] Rutgers State Univ, Newark, NJ 07102 USA
[2] Georgian Court Univ, Lakewood, NJ 08701 USA
基金
美国国家科学基金会;
关键词
Role-based access control; role engineering; data mining;
D O I
10.1109/TDSC.2008.61
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Today, role-based access control (RBAC) has become a well-accepted paradigm for implementing access control because of its convenience and ease of administration. However, in order to realize the full benefits of the RBAC paradigm, one must first define the roles accurately. This task of defining roles and associating permissions with them, also known as role engineering, is typically accomplished either in a top-down or in a bottom-up manner. Under the top-down approach, a careful analysis of the business processes is done to first define job functions and then to specify appropriate roles from them. While this approach can help in defining roles more accurately, it is tedious and time consuming since it requires that the semantics of the business processes be well understood. Moreover, it ignores existing permissions within an organization and does not utilize them. On the other hand, under the bottom-up approach, existing permissions are used to derive roles from them. As a result, it may help automate the process of role definition. In this paper, we present an unsupervised approach, called RoleMiner, for mining roles from existing user-permission assignments. Since a role, when semantics are unavailable, is nothing but a set of permissions, the task of role mining is essentially that of clustering users having the same (or similar) permissions. However, unlike the traditional applications of data mining that ideally require identification of nonoverlapping clusters, roles will have overlapping permissions and thus permission sets that define roles should be allowed to overlap. It is this distinction from traditional clustering that makes the problem of role mining nontrivial. Our experiments with real and simulated data sets indicate that our role mining process is quite accurate and efficient. Since our role mining approach is based on subset enumeration, it is fairly robust to reasonable levels of noise.
引用
收藏
页码:300 / 314
页数:15
相关论文
共 18 条
  • [1] [Anonymous], IEEE COMPUT
  • [2] Migrating to role-based access control
    Brooks, K
    [J]. FOURTH ACM WORKSHOP ON ROLE-BASED ACCESS CONTROL, PROCEEDINGS, 1999, : 71 - 81
  • [3] Coyne E., 1996, Proceedings of the first ACM Workshop on Role-based access control, P4, DOI 10.1145/270152.270159
  • [4] Engineering of role/permission assignments
    Epstein, P
    Sandhu, R
    [J]. 17TH ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE, PROCEEDINGS, 2001, : 127 - 136
  • [5] FERNANDEZ EB, 1997, P 2 ACM WORKSH ROL B, P121
  • [6] Ferraiolo D. F., 2001, ACM Transactions on Information and Systems Security, V4, P224, DOI 10.1145/501978.501980
  • [7] GALLAGHER MP, 2002, ECONOMIC IMPACT ROLE
  • [8] *GRAPHV, 2008, GRAPH VIS SOFTW
  • [9] KERN A, 2002, P 7 ACM S ACC CONTR, P43, DOI DOI 10.1145/507711.507718
  • [10] Kuhlmann Martin., 2003, Proceedings of the Eighth ACM Symposium on Access Control Models and Technologies, SACMAT '03, P179