Set covering problems in role-based access control

Authors:
Liang Chen;Jason Crampton
Affiliations:
Information Security Group and Department of Mathematics, Royal Holloway, University of London;Information Security Group and Department of Mathematics, Royal Holloway, University of London
Venue:
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Year:
2009

Citing 10
Cited 3

Role-Based Access Control Models

Computer
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Constraint generation for separation of duty

Proceedings of the eleventh ACM symposium on Access control models and technologies
Supporting authorization query and inter-domain role mapping in presence of hybrid role hierarchy

Proceedings of the eleventh ACM symposium on Access control models and technologies
On mutually exclusive roles and separation-of-duty

ACM Transactions on Information and System Security (TISSEC)
Inter-domain role mapping and least privilege

Proceedings of the 12th ACM symposium on Access control models and technologies
UAQ: a framework for user authorization query processing in RBAC extended with hybrid hierarchy and constraints

Proceedings of the 13th ACM symposium on Access control models and technologies
An efficient framework for user authorization queries in RBAC systems

Proceedings of the 14th ACM symposium on Access control models and technologies
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Role updating for assignments

Proceedings of the 15th ACM symposium on Access control models and technologies
RAR: A role-and-risk based flexible framework for secure collaboration

Future Generation Computer Systems
Mitigating the intractability of the user authorization query problem in role-based access control (RBAC)

NSS'12 Proceedings of the 6th international conference on Network and System Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interest in role-based access control has generated considerable research activity in recent years. A number of interesting problems related to the well known set cover problem have come to light as a result of this activity. However, the computational complexity of some of these problems is still not known. In this paper, we explore some variations on the set cover problem and use these variations to establish the computational complexity of these problems. Most significantly, we introduce the minimal cover problem - a generalization of the set cover problem - which we use to determine the complexity of the inter-domain role mapping problem.