loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing -Vol 1 (SUTC'06)
The Computational Complexity of Enforceability Validation for Generic Access Control Rules
Taichung, Taiwan
June 05-June 07
ISBN: 0-7695-2553-9
ASCII Text
x 
 
Vincent C. Hu, D. Richard Kuhn, David F. Ferraiolo, "The Computational Complexity of Enforceability Validation for Generic Access Control Rules," Sensor Networks, Ubiquitous, and Trustworthy Computing, International Conference on, vol. 1, pp. 260-267, IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing -Vol 1 (SUTC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/SUTC.2006.131,
author = {Vincent C. Hu and D. Richard Kuhn and David F. Ferraiolo},
title = {The Computational Complexity of Enforceability Validation for Generic Access Control Rules},
journal ={Sensor Networks, Ubiquitous, and Trustworthy Computing, International Conference on},
volume = {1},
year = {2006},
isbn = {0-7695-2553-9},
pages = {260-267},
doi = {http://doi.ieeecomputersociety.org/10.1109/SUTC.2006.131},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Sensor Networks, Ubiquitous, and Trustworthy Computing, International Conference on
TI - The Computational Complexity of Enforceability Validation for Generic Access Control Rules
SN - 0-7695-2553-9
SP260
EP267
A1 - Vincent C. Hu,
A1 - D. Richard Kuhn,
A1 - David F. Ferraiolo,
PY - 2006
KW - null
VL - 1
JA - Sensor Networks, Ubiquitous, and Trustworthy Computing, International Conference on
ER -
 
Vincent C. Hu, National Institute of Standards and Technology, Gaithersburg, Maryland
D. Richard Kuhn, National Institute of Standards and Technology, Gaithersburg, Maryland
David F. Ferraiolo, National Institute of Standards and Technology, Gaithersburg, Maryland
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.
Citation:
Vincent C. Hu, D. Richard Kuhn, David F. Ferraiolo, "The Computational Complexity of Enforceability Validation for Generic Access Control Rules," sutc, vol. 1, pp.260-267, IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing -Vol 1 (SUTC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.