Set Covering Problems in Role-Based Access Control

  • Liang Chen
  • Jason Crampton
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5789)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Liang Chen
    • 1
  • Jason Crampton
    • 1
  1. 1.Information Security Group and Department of Mathematics Royal HollowayUniversity of LondonUK

Personalised recommendations