Set Covering Problems in Role-Based Access Control

Liang Chen, Jason Crampton

Research output: Contribution to conferencePaper

18 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 Dive into the research topics of 'Set Covering Problems in Role-Based Access Control'. Together they form a unique fingerprint.

Cite this