Set Covering Problems in Role-Based Access Control

Liang Chen, Jason Crampton

Research output: Contribution to conferencePaper

16 Citations (Scopus)

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.
Original languageEnglish
Pages689-704
Number of pages16
DOIs
Publication statusPublished - 2009
EventProceedings of the 14th European Symposium on Research in Computer Security - Saint Malo, France
Duration: 21 Sep 200925 Sep 2009

Conference

ConferenceProceedings of the 14th European Symposium on Research in Computer Security
CountryFrance
CitySaint Malo
Period21/09/0925/09/09

Fingerprint

Set Covering Problem
Role-based Access Control
Set Cover
Computational Complexity
Cover

Cite this

Chen, L., & Crampton, J. (2009). Set Covering Problems in Role-Based Access Control. 689-704. Paper presented at Proceedings of the 14th European Symposium on Research in Computer Security, Saint Malo, France. https://doi.org/10.1007/978-3-642-04444-1_42

Set Covering Problems in Role-Based Access Control. / Chen, Liang; Crampton, Jason.

2009. 689-704 Paper presented at Proceedings of the 14th European Symposium on Research in Computer Security, Saint Malo, France.

Research output: Contribution to conferencePaper

Chen, L & Crampton, J 2009, 'Set Covering Problems in Role-Based Access Control' Paper presented at Proceedings of the 14th European Symposium on Research in Computer Security, Saint Malo, France, 21/09/09 - 25/09/09, pp. 689-704. https://doi.org/10.1007/978-3-642-04444-1_42
Chen L, Crampton J. Set Covering Problems in Role-Based Access Control. 2009. Paper presented at Proceedings of the 14th European Symposium on Research in Computer Security, Saint Malo, France. https://doi.org/10.1007/978-3-642-04444-1_42
Chen, Liang ; Crampton, Jason. / Set Covering Problems in Role-Based Access Control. Paper presented at Proceedings of the 14th European Symposium on Research in Computer Security, Saint Malo, France.16 p.
@conference{1bfa446863284e339fdf430832186654,
title = "Set Covering Problems in Role-Based Access Control",
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.",
author = "Liang Chen and Jason Crampton",
year = "2009",
doi = "10.1007/978-3-642-04444-1_42",
language = "English",
pages = "689--704",
note = "Proceedings of the 14th European Symposium on Research in Computer Security ; Conference date: 21-09-2009 Through 25-09-2009",

}

TY - CONF

T1 - Set Covering Problems in Role-Based Access Control

AU - Chen, Liang

AU - Crampton, Jason

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-04444-1_42

DO - 10.1007/978-3-642-04444-1_42

M3 - Paper

SP - 689

EP - 704

ER -