Set Covering Problems in Role-Based Access Control

Liang Chen; Jason Crampton

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

Set Covering Problems in Role-Based Access Control

Liang Chen, Jason Crampton

Computing Science

Royal Holloway University of London

Research output: Contribution to conference › Unpublished paper

24 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 language	English
Pages	689-704
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-04444-1_42
Publication status	Published - 2009
Event	Proceedings of the 14th European Symposium on Research in Computer Security - Saint Malo, France Duration: 21 Sept 2009 → 25 Sept 2009

Conference

Conference	Proceedings of the 14th European Symposium on Research in Computer Security
Country/Territory	France
City	Saint Malo
Period	21/09/09 → 25/09/09

Access to Document

10.1007/978-3-642-04444-1_42Licence: Unspecified

Cite this

@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 - Unpublished paper

SP - 689

EP - 704

T2 - Proceedings of the 14th European Symposium on Research in Computer Security

Y2 - 21 September 2009 through 25 September 2009

ER -

Set Covering Problems in Role-Based Access Control

Abstract

Conference

Access to Document

Fingerprint

Cite this