Role Based Access Control (RBAC) is a very popular access control model, for long time investigated and widely deployed in the se- curity architecture of different enterprises. To implement RBAC, roles have to be firstly identified within the considered organization. Usually the process of (automatically) defining the roles in a bottom up way, starting from the permissions assigned to each user, is called role min- ing. In literature, role mining have been formally analyzed and several techniques have been proposed in order to return a set of valid roles. Recently, the problem of defining different kind of constraints on the number and the size of the roles included in the resulting role set has been addressed. In this paper we provide a formal definition of the role mining problem under the cardinality constraint, i.e. restricting the max- imum number of permissions that can be included in a role. We discuss formally the computational complexity of the problem and propose a novel heuristic, returning a role set satisfying the cardinality constraint. Furthermore we present experimental results obtained after the applica- tion of the proposed heuristic on both real and synthetic datasets, and compare its performance with respect to previous proposals in literature.

Constrained Role Mining

BLUNDO, Carlo;CIMATO, Stelvio
2013-01-01

Abstract

Role Based Access Control (RBAC) is a very popular access control model, for long time investigated and widely deployed in the se- curity architecture of different enterprises. To implement RBAC, roles have to be firstly identified within the considered organization. Usually the process of (automatically) defining the roles in a bottom up way, starting from the permissions assigned to each user, is called role min- ing. In literature, role mining have been formally analyzed and several techniques have been proposed in order to return a set of valid roles. Recently, the problem of defining different kind of constraints on the number and the size of the roles included in the resulting role set has been addressed. In this paper we provide a formal definition of the role mining problem under the cardinality constraint, i.e. restricting the max- imum number of permissions that can be included in a role. We discuss formally the computational complexity of the problem and propose a novel heuristic, returning a role set satisfying the cardinality constraint. Furthermore we present experimental results obtained after the applica- tion of the proposed heuristic on both real and synthetic datasets, and compare its performance with respect to previous proposals in literature.
978-3-642-38003-7
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11386/3878738
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 23
  • ???jsp.display-item.citation.isi??? ND
social impact