ACM Home Page
Please provide us with feedback. Feedback
The role mining problem: finding a minimal descriptive set of roles
Full text PdfPdf (222 KB)
Source
Symposium on Access Control Models and Technologies archive
Proceedings of the 12th ACM symposium on Access control models and technologies table of contents
Sophia Antipolis, France
SESSION: Roles and policies table of contents
Pages: 175 - 184  
Year of Publication: 2007
ISBN:978-1-59593-745-2
Authors
Jaideep Vaidya  Rutgers University, Newark, NJ
Vijayalakshmi Atluri  Rutgers University, Newark, NJ
Qi Guo  Rutgers University, Newark, NJ
Sponsors
ACM: Association for Computing Machinery
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 19,   Downloads (12 Months): 145,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1266840.1266870
What is a DOI?

ABSTRACT

Devising a complete and correct set of roles has been recognized as one of the most important and challenging tasks in implementing role based access control. A key problem related to this is the notion of goodness/interestingness -- when is a role good/interesting? In this paper, we define the role mining problem (RMP) as the problem of discovering an optimal set of roles from existing user permissions. The main contribution of this paper is to formally define RMP, and analyze its theoretical bounds. In addition to the above basic RMP, we introduce two different variations of the RMP, called the δ-approx RMP and the Minimal Noise RMP that have pragmatic implications. We reduce the known "set basis problem" to RMP to show that RMP is an NP-complete problem. An important contribution of this paper is also to show the relation of the role mining problem to several problems already identified in the data mining and data analysis literature. By showing that the RMP is in essence reducible to these known problems, we can directly borrow the existing implementation solutions and guide further research in this direction.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C. Damm, K. H. Kim, and F. Roush. On covering and rank problems for boolean matrices and their applications. In Computing and Combinatorics: 5th Annual International Conference, COCOON '99,volume 1627 of Lecture Notes in Computer Science, pages 123--133. Springer-Verlag, 1999.
2
3
 
4
M. P. Gallagher, A. O'Connor, and B. Kropp. The economic impact of role-based access control. Planning report 02-1, National Institute of Standards and Technology, March 2002.
 
5
 
6
F. Geerts, B. Goethals, and T. Mielikainen. Tiling databases. In Discovery Science, Lecture Notes in Computer Science, pages 278--289. Springer-Verlag, 2004.
7
 
8
9
10
 
11
G. Markowsky. Ordering d-classes and computing schein rank is hard. Semi-group Forum, 44:373--375, 1992.
 
12
T. Mielikäinen. Intersecting data to closed sets with constraints. In B. Goethals and M. J. Zaki, editors, FIMI, volume 90 of CEUR Workshop Proceedings. CEUR-WS.org, 2003.
 
13
P. Miettinen. The discrete basis problem, master's thesis. Master's thesis, University of Helsinki, 2006.
 
14
P. Miettinen, T. Mielikainen, A. Gionis, G. Das, and H. Mannila. The discrete basis problem. In Knowledge Discovery in Databases: PKDD 2006, Lecture Notes in Artificial Intelligence, pages 335--346, 2006.
 
15
N. Mishra, D. Ron, and R. Swaminathan. On finding large conjunctive clusters. In Learning Theory and Kernel Machines: 16th Annual Conference on Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, volume 2777 of Lecture Notes in Computer Science, pages 448--462. Springer, 2003.
16
 
17
 
18
19
20
21

CITED BY  12

Collaborative Colleagues:
Jaideep Vaidya: colleagues
Vijayalakshmi Atluri: colleagues
Qi Guo: colleagues