skip to main content
10.1145/2295136.2295145acmconferencesArticle/Chapter ViewAbstractPublication PagessacmatConference Proceedingsconference-collections
research-article

Generative models for access control policies: applications to role mining over logs with attribution

Published:20 June 2012Publication History

ABSTRACT

We consider a fundamentally new approach to role and policy mining: finding RBAC models which reflect the observed usage of entitlements and the attributes of users. Such policies are interpretable, i.e., there is a natural explanation of why a role is assigned to a user and are conservative from a security standpoint since they are based on actual usage. Further, such "generative" models provide many other benefits including reconciliation with policies based on entitlements, detection of provisioning errors, as well as the detection of anomalous behavior. Our contributions include defining the fundamental problem as extensions of the well-known role mining problem, as well as providing several new algorithms based on generative machine learning models. Our algorithms find models which are causally associated with actual usage of entitlements and any arbitrary combination of user attributes when such information is available. This is the most natural process to provision roles, thus addressing a key usability issue with existing role mining algorithms.

We have evaluated our approach on a large number of real life data sets, and our algorithms produce good role decompositions as measured by metrics such as coverage, stability, and generality We compare our algorithms with traditional role mining algorithms by equating usage with entitlement. Results show that our algorithms improve on existing approaches including exact mining, approximate mining, and probabilistic algorithms; the results are more temporally stable than exact mining approaches, and are faster than probabilistic algorithms while removing artificial constraints such as the number of roles assigned to each user. Most importantly, we believe that these roles more accurately capture what users actually do, the essence of a role, which is not captured by traditional methods.

References

  1. ANSI. Role-based access control. Technical Report ANSI INCITS 359--2004, 2004.Google ScholarGoogle Scholar
  2. D. Blei, A. Ng, and M. Jordan. Latent dirichlet allocation. J. Mach. Learning Research, 3, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. E. J. Coyne. Role engineering. In ACM Workshop on Role Based Access Control, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. Ene, W. Horne, N. Milosavljevic, P. Rao, R. Schreiber, and R. E. Tarjan. Fast exact and heuristic methods for role minimization problems. In SACMAT, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. Frank, D. A. Basin, and J. M. Buhmann. A class of probabilistic models for role engineering. In CCS, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Frank, J. M. Buhmann, and D. Basin. On the definition of role mining. In SACMAT, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Frank, A. Streich, D. Basin, and J. Buhmann. A probabilistic approach to hybrid role mining. In CCS, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. C. Kemp, J. B. Tenenbaum, T. L. Griffiths, T. Yamada, and N. Ueda. Learning systems of concepts with an infinite relational model. In AAAI, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Kuhlmann, D. Shohat, and G. Schimpf. Role mining - revealing business roles for security administration using data mining technology. In SACMAT, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. H. Lu, J. Vaidya, and V. Atluri. Optimal boolean matrix decomposition: Application to role engineering. In ICDE, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. I. Molloy, H. Chen, T. Li, Q. Wang, N. Li, E. Bertino, S. Calo, and J. Lobo. Mining roles with multiple objectives. TISSEC, 13(4):36, Dec 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. I. Molloy, H. Chen, T. Li, Q. Wang, N. Li, E. Bertino, S. B. Calo, and J. Lobo. Mining roles with semantic meanings. In SACMAT, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. I. Molloy, N. Li, J. Lobo, Y. A. Qi, and L. Dickens. Mining roles with noisy data. In SACMAT, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. K. Rose. Deterministic annealing for clustering, compression, classification, regression, and related optimization problems. Proc. of the IEEE, (86), 1998.Google ScholarGoogle ScholarCross RefCross Ref
  15. M. Rosen-Zvi, C. Chemudugunta, T. Griffiths, P. Smyth, and M. Steyvers. Learning author-topic models from text corpora. TOIS, 28(1), 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. M. Rosen-Zvi, T. Griffiths, M. Steyvers, and P. Smyth. The author-topic model for autors and documents. In UAI, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. A. P. Singh and G. J. Gordon. Relational learning via collective matrix factorization. In KDD, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. A. P. Streich, M. Frank, D. Basin, and J. M. Buhmann. Multi-assignment clustering for boolean data. In ICML, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. J. Vaidya, V. Atluri, and Q. Guo. The role mining problem: finding a minimal descriptive set of roles. In SACMAT, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. J. Vaidya, V. Atluri, and J. Warner. Roleminer: mining roles using subset enumeration. In CCS, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. D. Zhang, K. Ramamohanarao, and T. Ebringer. Role engineering using graph optimisation. In SACMAT, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    SACMAT '12: Proceedings of the 17th ACM symposium on Access Control Models and Technologies
    June 2012
    242 pages
    ISBN:9781450312950
    DOI:10.1145/2295136

    Copyright © 2012 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 20 June 2012

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article

    Acceptance Rates

    SACMAT '12 Paper Acceptance Rate19of73submissions,26%Overall Acceptance Rate177of597submissions,30%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader