Set Covering Problems in Role-Based Access Control

Liang, Chen; Crampton, Jason

doi:10.1007/978-3-642-04444-1_42

Cited by 25 publications

(26 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…El SCP fue incluido en la lista de 21 problemas NP-completos de Karp (Karp, 2010). Existen muchos usos prácticos para este problema como son: Localización de unidades de conexión en redes vehiculares (Sarubbi et al, 2017), ubicación de instalaciones (Crawford et al, 2017), ruteo de vehículos (Cacchiani, Hemmelmayr, & Tricoire, 2014;Prata, 2016;Yakici, 2017), asignación de tráfico en sistemas de comunicación satelitales (Ribeiro, Minoux, & Penna, 1989;Ceria, Nobili, & Sassano, 1998), asignación de tripulantes en líneas aéreas (Housos & Elmroth, 1997), asignación y ruteo de trenes (Samà et al, 2015), control de acceso basado en roles (Chen & Crampton, 2009) entre otros.…”

Section: Materiales Y Métodosunclassified

Study of population variation using Harmony Search for the resolution of Set Covering Problem

Salas¹,

Mora²,

Barriga³

et al. 2017

Rev. ciente. UCSA

View full text Add to dashboard Cite

RESUMENEl presente trabajo se titula: Estudio de variación poblacional usando Harmony Search (HS) para la resolución del Set Covering Problem (SCP). El principal aporte de este trabajo consiste en demostrar los efectos del tamaño de la población de soluciones, en la obtención de resultados a un problema de optimización. Los efectos del presente estudio son relevantes, debido a que la mayoría de las metaheurísticas actuales usan población de soluciones de tamaño fijo. Nuestro equipo logró comprobar que una población de soluciones variable permite obtener mejores resultados en el 93.3% de los casos. Al comparar la técnica con un algoritmo del estado del arte (Black Hole) presenta mejores resultados en el 61.1% de las veces. Este documento se estructura de la siguiente forma: En la sección introducción se realiza una revisión y justificación de este estudio; en la sección materiales y métodos se define el marco de trabajo de esta investigación; en la sección resultados se presentan los valores obtenidos de los diferentes experimentos y finalmente en la sección discusión y conclusión se muestran los comentarios más importantes respecto a los resultados obtenidos. Palabras clave: metaheurística; harmony search; población fija; población variable; set covering problem. ABSTRACTThe present work is entitled: Study of population variation using Harmony Search (HS) for the resolution of Set Covering Problem (SCP). Its main contribution is to demonstrate the effects of the solutions population size, in obtaining results to an optimization problem. The effects of the present study are relevant, since most of the current metaheuristics use solutions population of fixed size. Our team was able to verify that a variable solutions population allows to obtain better results in 93.3%of cases. When comparing the technique with an algorithm of the state of the art (Black Hole), presents better results in 61.1% of the time. This document is structured as follows: In the introduction section, a review and justification of this study is carried out; in the materials and methods section, the framework of this research is defined; In the results section the values obtained from the different experiments are presented and finally in the discussion and conclusion section the most important comments regarding the obtained results are shown.

show abstract

Section: Materiales Y Métodosunclassified

Study of population variation using Harmony Search for the resolution of Set Covering Problem

Salas¹,

Mora²,

Barriga³

et al. 2017

Rev. ciente. UCSA

View full text Add to dashboard Cite

show abstract

“…In order to show the safe cover of GUAQ problem is NPhard, we reduce a special case of it to the NP-hard container optimization problem [12] to the special case. In the container optimization problem, the inputs are a finite set X, a family !…”

Section: Definition 2 (The Safe Cover Of Guaq Problem)mentioning

confidence: 99%

“…Another similar problem is proposed by Du et al with the name of inter-domain role mapping (IDRM) problem [10], which relates to determining whether a user's request for activating a set of roles can be granted or not. Chen [12] constructed a series of role-based models and used these models to investigate least privilege and the IDRM problem in the presence of multiple role hierarchies and temporal constraints.…”

Section: Related Workmentioning

confidence: 99%

“…To better understand how different optimization objectives may affect the complexity of GUAQ, we study the computational complexities of GUAQ into three subcases: any cover, safe cover, and available cover. Chen et al [12] assert that allowing both options of minimization and maximization is no more difficult than allowing minimization only. However, Mousavi et al [8] show that this assertion is not true.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Specification and Enforcement of the General User Authorization Query Problem in Role Based Access Control System

Ma¹,

Liu²,

Zhao³

et al. 2014

TOAUTOCJ

View full text Add to dashboard Cite

Abstract:The User Authorization Query (UAQ) problem in Role Based Access Control (RBAC) is assigning roles to users in an appropriate manner. That is, take as input a set of permissions that a user requests to have in a session, and determine whether there exists an optimum set of roles to active. However the existing definition of UAQ is inadequate, it only considers the number of permissions whereas the number of roles is also equally important, has been largely ignored. In addition, little attention has been paid to the complexity analysis of the UAQ problem with the consideration of the both permission and role numbers in the literature. In this paper, we give a general definition of UAQ with the name of GUAQ by introducing the consideration for the number of both permissions and roles, and then study the computational complexity of the GUAQ problem into three subcases. Furthermore, we propose an approach for finding a safe resolution for GUAQ, which employ the preprocessing and reduction to SAT solver that greatly reduce the running time.

show abstract

“…Role mining algorithms have been presented based on set covering [3], graph theory [6,26], subset enumeration [25], database tiling [23]. The theoretical aspects of the RMP have been considered in [24,23,3], where the complexity of the problem has been analyzed and its equivalence to other known optimization problem showed. Another interrelated problem, i.e.…”

Section: Related Workmentioning

confidence: 99%

Constrained Role Mining

Blundo

Cimato

2013

Security and Trust Management

View full text Add to dashboard Cite

Role Based Access Control (RBAC) is a very popular access control model, for long time investigated and widely deployed in the security 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 mining. In literature, the role mining problem has been formally analyzed and several techniques have been proposed in order to obtain 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 maximum number of permissions that can be included in a role. We discuss formally the computational complexity of the problem and propose a novel heuristic. Furthermore we present experimental results obtained after the application of the proposed heuristic on both real and synthetic datasets, and compare the resulting performance to previous proposals.

show abstract

Set Covering Problems in Role-Based Access Control

Cited by 25 publications

References 11 publications

Study of population variation using Harmony Search for the resolution of Set Covering Problem

Study of population variation using Harmony Search for the resolution of Set Covering Problem

Specification and Enforcement of the General User Authorization Query Problem in Role Based Access Control System

Constrained Role Mining

Contact Info

Product

Resources

About