Chen, Liang and Crampton, Jason (2009) Set covering problems in role-based access control. In: Computer Security - ESORICS 2009. Lecture Notes in Computer Science, 5789. Springer, Heidelberg, Germany, pp. 689-704. ISBN 9783642044434

Full text not available from this repository.

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.

Item Type:	Book Section
Identifier:	10.1007/978-3-642-04444-1_42
Subjects:	Computing
Depositing User:	Liang Chen
Date Deposited:	22 Mar 2016 18:05
Last Modified:	28 Aug 2021 07:19
URI:	https://repository.uwl.ac.uk/id/eprint/1834

Actions (login required)

View Item