Paper Info
Title
The Computational Complexity of Enforceability Validation for Generic Access Control Rules
Abstract
In computer security, many researches have tackled on the possibility of a unified model of access control, which could enforce any access control policies within a single unified system. One issue that must be considered is the efficiency of such systems, i.e., what is the computational complexity for the enforceability validation of access control rules of a system that is capable of implementing any access control policy? We investigate this question by arguing that two fundamental requirements exist for any such system: satisfiability of access rules and ensuring absence of deadlock among rules. We then show that both of these problems are NP-Complete by using some basic computational theorems applied to the components of the generic access control process.
Year
DOI
Venue
2006
10.1109/SUTC.2006.131
Sensor Networks, Ubiquitous, and Trustworthy Computing, 2006. IEEE International Conference
Keywords
Field
DocType
single unified system,generic access control rules,generic access control process,access control,access rule,access control rule,computational complexity,computer security,enforceability validation,unified model,access control policy,basic computational,databases,np complete problem,authorization,satisfiability,authentication,nist,data security
Data security,Authentication,Computer science,Satisfiability,Deadlock,Role-based access control,Computer network,Access control,Unified Model,Distributed computing,Computational complexity theory
Conference
Volume
ISBN
Citations 
1
0-7695-2553-9-01
5
PageRank 
References 
Authors
0.46
11
3
Name
Order
Citations
PageRank
Vincent C. Hu114312.86
D. Richard Kuhn22723203.24
David F. Ferraiolo32401173.08