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

StateMiner: an efficient similarity-based approach for optimal mining of role hierarchy

Published:11 June 2010Publication History

ABSTRACT

Recently, there is a growing trend of organizations migrating to RBAC because of the economic benefits that RBAC provides, and the ease of administration. In order to deploy an RBAC system, one requires to first identify a complete set of roles. This process, known as role engineering, has been identified as one of the costliest tasks in migrating to RBAC. Several approaches have been proposed that mostly use data mining techniques to discover roles. However, most of them do not consider the existing roles and try to define everything from scratch, which is not acceptable for organizations that already have an RBAC system in place. In this paper, we formally define the problem of mining role hierarchy with minimal perturbation and present StateMiner, a heuristic solution to find an RBAC state as similar as possible to both the existing state and the optimal state. We present experiments to demonstrate the effectiveness of our approach.

References

  1. E. J. Coyne, "Role-engineering", In Proc. ACM Workshop on Role-Based Access Control, pages 15--16, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. P. Gallagher, A.C. O'Connor, and B. Kropp, "The economic impact of role-based access control", Planning report 02-1, National Institute of Standards and Technology, 2002.Google ScholarGoogle Scholar
  3. K. Brooks, "Migrating to role-based access control", In Proc. ACM Workshop on Role-Based Access Control, pages 71--81, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. Shin, G.-J. Ahn, S. Cho, and S. Jin, "On modeling system-centric information for role engineering", In Proc. ACM Symposium on Access Control Models and Technologies (SACMAT), pages 169--178, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. P. Epstein and R. Sandhu, "Engineering of role/permission assignment", In Proc. 17th Annual Computer Security Application Conference, pages 127--137, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. Kern, M. Kuhlmann, A. Schaad, and J. Moffett, "Observations on the role life-cycle in the context of enterprise security management", In Proc. 7th ACM Symposium on Access Control Models and Technologies (SACMAT), pages 43--51, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Kuhlmann, D. Shohat, and G. Schimpf, "Role mining-revealing business roles for security administration using data mining technology", In Proc. ACM Symposium on Access Control Models and Technologies (SACMAT), pages 179--186, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Schlegelmilch and U. Steffens, "Role mining with ORCA", In Proc. ACM Symposium on Access Control Models and Technologies (SACMAT), pages 168--176, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. Vaidya, V. Atluri, and Q. Guo, "The role mining problem: Finding a minimal descriptive set of roles", In Proc. ACM Symposium on Access Control Models and Technologies (SACMAT), pages 175--184, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. Vaidya, V. Atluri, and J. Warner, "Roleminer: Mining roles using subset enumeration", In Proc. ACM Conference on Computer and Communications Security (CCS), pages 144--153, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. D. Zhang, K. Ramamohanarao, and T. Ebringer, "Role engineering using graph optimisation", In Proc. ACM Symposium on Access Control Models and Technologies (SACMAT), pages 139--144, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. Colantonio, R. Di Pietro, and A. Ocello, "A Cost-Driven Approach to Role Engineering", In Proc. 2008 ACM symposium on Applied computing (SAC'08), pages 2129--2136, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. H. Lu, J. Vaidya, and V. Atluri, "Optimal Boolean Matrix Decomposition: Application to Role Engineering", In Proc. IEEE 24th International Conference on Data Engineering (ICDE2008), pages 297--306, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Q. Guo, J. Vaidya, and V. Atluri, "The Role Hierachry Mining Problem: Discovery of Optimal Role Hierarchies", In Proc. 2008 Annual Computer Security Applications Conference, pages 237--246, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. A. Ene, W. Horne, N. Milosavljevic, "Fast Exact and Heuristic Methods for Role Minimization Problems", In Proc. ACM Symposium on Access Control Models and Technologies (SACMAT), pages 1--10, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. Vaidya, V. Atluri, and Q. Guo, "Migrating to Optimal RBAC with Minimal Perturbation", In Proc. ACM Symposium on Access Control Models and Technologies (SACMAT), pages 11--20, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. I. Molloy, H. Chen, T. Li, Q. Wang, N. Li, E. Bertino, S. Calo, and J. Lobo, "Mining Roles with Semantic Meanings", In Proc. ACM Symposium on Access Control Models and Technologies (SACMAT), pages 21--30, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. I. Molloy, N. Li, T. Li, Z. Mao, Q. Wang, and J. Lobo, "Evaluating Role Mining Algorithms", In Proc. ACM Symposium on Access Control Models and Technologies (SACMAT), pages 95--104, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. M. Frank, D. Basin, J. M. Buhmann, "A Class of Probabilistic Models for Role Engineering", In Proc. 15th ACM conference on Computer and Communications Security (CCS), pages 299--310, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. M. Frank, A. P. Streich, D. Basin, and J. M. Buhmann, "A Probabilistic Approach to Hybrid Role Mining", In Proc. 16th ACM conference on Computer and Communications Security (CCS), pages 101--111, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. H. Takabi and J. B. D. Joshi, "An Efficient Similarity-Based Approach for Optimal Mining of Role Hierarchy", 16th ACM Conference on Computer and Communications Security (CCS)(Poster), 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. B. Ganter and R. Wille, "Formal Concept Analysis: Mathematical Foundations", Springer, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. K. Deb, "Multi Objective Optimization Using Evolutionary Algorithms", John Wiley and Sons, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. C. Lindig, "Fast concept analysis", In G. Stumme, editor, Working with Conceptual Structures - Contributions to ICCS 2000, 2000.Google ScholarGoogle Scholar
  25. http://www.st.cs.uni-saarland.de/~lindigGoogle ScholarGoogle Scholar

Index Terms

  1. StateMiner: an efficient similarity-based approach for optimal mining of role hierarchy

        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 '10: Proceedings of the 15th ACM symposium on Access control models and technologies
          June 2010
          212 pages
          ISBN:9781450300490
          DOI:10.1145/1809842

          Copyright © 2010 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: 11 June 2010

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate177of597submissions,30%

          Upcoming Conference

          SACMAT 2024

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader