Taming role mining complexity in RBAC

Alessandro Colantonio, Roberto Di Pietro, Alberto Ocello, Nino Vincenzo Verde

Research output: Contribution to journalArticlepeer-review

37 Scopus citations


In this paper we address the problem of reducing the role mining complexity in RBAC systems. To this aim, we propose a three steps methodology: first, we associate a weight to roles; second, we identify user-permission assignments that cannot belong to roles with a weight exceeding a given threshold; and third, we restrict the role-finding problem to user-permission assignments identified in the second step. We formally show - the proofs of our results are rooted in graph theory - that this methodology allows role engineers for the elicitation of stable candidate roles, by contextually simplifying the role selection task. Efficient algorithms to implement our strategy are also described. Further, we discuss practical applications of our approach. Finally, we tested our methodology on real dataset. Results achieved confirm both the viability of our proposal and the analytical findings. © 2009 Elsevier Ltd. All rights reserved.
Original languageEnglish (US)
Pages (from-to)548-564
Number of pages17
JournalComputers and Security
Issue number5
StatePublished - Jul 1 2010
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-09-20

ASJC Scopus subject areas

  • Law
  • General Computer Science


Dive into the research topics of 'Taming role mining complexity in RBAC'. Together they form a unique fingerprint.

Cite this