Meeting Cardinality Constraints in Role Mining

被引:38
作者
Harika, Pullamsetty [1 ]
Nagajyothi, Marreddy [1 ]
John, John C. [1 ]
Sural, Shamik [1 ]
Vaidya, Jaideep [2 ]
Atluri, Vijayalakshmi [2 ]
机构
[1] Indian Inst Technol, Sch Informat Technol, Kharagpur 721302, W Bengal, India
[2] Rutgers State Univ, Dept MSIS, Piscataway, NJ 08855 USA
基金
美国国家科学基金会;
关键词
RBAC; role mining; cardinality constraint; concurrent framework; post-processing framework;
D O I
10.1109/TDSC.2014.2309117
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Role mining is a critical step for organizations that migrate from traditional access control mechanisms to role based access control (RBAC). Additional constraints may be imposed while generating roles from a given user-permission assignment relation. In this paper we consider two such constraints which are the dual of each other. A role-usage cardinality constraint limits the maximum number of roles any user can have. Its dual, the permission-distribution cardinality constraint, limits the maximum number of roles to which a permission can belong. These two constraints impose mutually contradictory requirements on user to role and role to permission assignments. An attempt to satisfy one of the constraints may result in a violation of the other. We show that the constrained role mining problem is NP-Complete and present heuristic solutions. Two distinct frameworks are presented in this paper. In the first approach, roles are initially mined without taking the constraints into account. The user-role and role-permission assignments are then checked for constraint violation in a post-processing step, and appropriately re-assigned, if necessary. In the second approach, constraints are enforced during the process of role mining. The methods are first applied on problems that consider the two constraints individually, and then with both considered together. Both methods are evaluated over a number of real-world data sets.
引用
收藏
页码:71 / 84
页数:14
相关论文
共 29 条
[1]  
Blundo C., 2012, ARXIV E PRINTS
[2]  
Colantonio A, 2009, SACMAT'09: PROCEEDINGS OF THE 14TH ACM SYMPOSIUM ON ACCESS CONTROL MODELS AND TECHNOLOGIES, P85, DOI 10.1145/1542207.1542223
[3]  
Colantonio A, 2008, APPLIED COMPUTING 2008, VOLS 1-3, P2129
[4]  
COYNE EJ, 1996, P 1 ACM WORKSH ROL B, P15, DOI DOI 10.1145/270152.270159
[5]  
Ene A, 2008, SACMAT'08: PROCEEDINGS OF THE 13TH ACM SYMPOSIUM ON ACCESS CONTROL MODELS AND TECHNOLOGIES, P1
[6]  
Ferraiolo D. F., 2001, ACM Transactions on Information and Systems Security, V4, P224, DOI 10.1145/501978.501980
[7]  
Fleischner H, 2007, LECT NOTES COMPUT SC, V4855, P340
[8]   Role Mining with Probabilistic Models [J].
Frank, Mario ;
Buhman, Joachim M. ;
Basin, David .
ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2013, 15 (04)
[9]  
Frank M, 2012, J MACH LEARN RES, V13, P459
[10]  
Frank M, 2009, CCS'09: PROCEEDINGS OF THE 16TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P101