ACM Home Page
Please provide us with feedback. Feedback
A class of probabilistic models for role engineering
Full text PdfPdf (644 KB)
Source
Conference on Computer and Communications Security archive
Proceedings of the 15th ACM conference on Computer and communications security table of contents
Alexandria, Virginia, USA
SESSION: Access control table of contents
Pages 299-310  
Year of Publication: 2008
ISBN:978-1-59593-810-7
Authors
Mario Frank  ETH Zurich, Zurich, Switzerland
David Basin  ETH Zurich, Zurich, Switzerland
Joachim M. Buhmann  ETH Zurich, Zurich, Switzerland
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): 14,   Downloads (12 Months): 216,   Citation Count: 3
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/1455770.1455809
What is a DOI?

ABSTRACT

Role Engineering is a security-critical task for systems using role-based access control (RBAC). Different role-mining approaches have been proposed that attempt to automatically infer appropriate roles from existing user-permission assignments. However, these approaches are mainly combinatorial and lack an underlying probabilistic model of the domain. We present the first probabilistic model for RBAC. Our model defines a general framework for expressing user permission assignments and can be specialized to different domains by limiting its degrees of freedom with appropriate constraints. For one practically important instance of this framework, we show how roles can be inferred from data using a state-of-the-art machine-learning algorithm. Experiments on both randomly generated and real-world data provide evidence that our approach not only creates meaningful roles but also identifies erroneous user-permission assignments in given data.


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
 
2
C. E. Antoniak. Mixtures of Dirichlet processes with applications to Bayesian nonparametric problems. The Annals of Statistics, 2(6):1152?-1174, November 1974.
 
3
4
 
5
 
6
T. S. Ferguson. A Bayesian analysis of some nonparametric problems. Annals of Statistics, 1(2):209?-230, 1973.
7
8
 
9
C. Kemp, J. B. Tenenbaum, T. L. Griffths, T. Yamada, and N. Ueda. Learning systems of concepts with an infinite relational model. In Proceedings of the 21st National Conference on Artificial Intelligence, 2006.
10
 
11
H. Lu, J. Vaidya, and V. Atluri. Optimal Boolean matrix decomposition: Application to role engineering. In Proceedings of the 24th International Conference on Data Engineering (ICDE), pages ?, 2008.
 
12
P. Miettinen, T. Mielik¨ainen, A. Gionis, G. Das, and H. Mannila. The Discrete Basis Problem. In Lecture Notes in Artificial Intelligence, pages 335?-346, Berlin, Germany, 2006. Springer.
 
13
R. M. Neal. Markov chain sampling methods for Dirichlet process mixture models. Journal of Computational and Graphical Statistics, 9(2):249-?265, 2000.
14
15
16
17
18


Collaborative Colleagues:
Mario Frank: colleagues
David Basin: colleagues
Joachim M. Buhmann: colleagues