ACM Home Page
Please provide us with feedback. Feedback
Efficient policy analysis for administrative role based access control
Full text PdfPdf (402 KB)
Source
Conference on Computer and Communications Security archive
Proceedings of the 14th ACM conference on Computer and communications security table of contents
Alexandria, Virginia, USA
SESSION: Policies table of contents
Pages: 445 - 455  
Year of Publication: 2007
ISBN:978-1-59593-703-2
Authors
Scott D. Stoller  Stony Brook University, Stony Brook, NY
Ping Yang  Binghamton University, Binghamton, NY
C R. Ramakrishnan  Stony Brook University, Stony Brook, NY
Mikhail I. Gofman  Binghamton University, Binghamton, NY
Sponsors
ACM: Association for Computing Machinery
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 24,   Downloads (12 Months): 168,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1315245.1315300
What is a DOI?

ABSTRACT

Administrative RBAC (ARBAC) policies specify how Role-Based Access Control (RBAC) policies may be changed by each administrator. It is often difficult to fully understand the effect of an ARBAC policy by simple inspection, because sequences of changes by different administrators may interact in unexpected ways. ARBAC policy analysis algorithms can help by answering questions, such a suser-role reachability, which asks whether a given user can be assigned to given roles by given administrators. This problem is intractable in general. This paper identifies classes of policies of practical interest, develops analysis algorithms for them, and analyzes their parameterized complexity, showing that the algorithms may have high complexity with respect to some parameter k characterizing the hardness of the input (such that k is often small in practice) but have polynomial complexity in terms of the overall input size when the value of k is fixed.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
American National Standards Institute (ANSI), International Committee for Information Technology Standards (INCITS). Role-based access control. ANSI INCITS Standard 359-2004, Feb. 2004.
 
2
 
3
M. Y. Becker. Cassandra: Flexible Trust Management and its Application to Electronic Health Records. PhD thesis, University of Cambridge, Oct. 2005.
 
4
5
 
6
 
7
8
 
9
 
10
 
11
J. Y. Halpern and V. Weissman. Using first-order logic to reason about policies. In Proc. 16th IEEE Computer Security Foundations Workshop (CSFW), pages 187--201. IEEE Computer Society Press, 2003.
12
13
14
 
15
 
16
17
18
19
20
21
22
23
 
24
25
 
26
 
27
28
29
 
30
A. P. Sistla and M. Zhou. Analysis of dynamic policies. In Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA), Aug. 2006. Full version to appear in Information & Computation.
 
31
www.cs.stonybrook.edu/~stoller/ccs2007/.


Collaborative Colleagues:
Scott D. Stoller: colleagues
Ping Yang: colleagues
C R. Ramakrishnan: colleagues
Mikhail I. Gofman: colleagues