The complexity of discretionary access control

Authors:
Stephen Dranger;Robert H. Sloan;Jon A. Solworth
Affiliations:
Dept. of Computer Science, University of Illinois at Chicago;Dept. of Computer Science, University of Illinois at Chicago;Dept. of Computer Science, University of Illinois at Chicago
Venue:
IWSEC'06 Proceedings of the 1st international conference on Security
Year:
2006

Citing 8
Cited 0

Succinct representations of graphs

Information and Control
Configuring role-based access control to enforce mandatory and discretionary access control policies

ACM Transactions on Information and System Security (TISSEC)
Protection in operating systems

Communications of the ACM
A graph-based formalism for RBAC

ACM Transactions on Information and System Security (TISSEC)
Decidability of Safety in Graph-Based Models for Access Control

ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
The Complexity of Graph Problems fore Succinctly Represented Graphs

WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
The Typed Access Matrix Model

SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
Security analysis in role-based access control

Proceedings of the ninth ACM symposium on Access control models and technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

A recent paper presented an access control scheme for discretionary access controls with a decidable safety problem. This paper deals with the complexity analysis of that access control, and finds it to be, in its worst cases, PSPACE-complete, but polynomial time for practical cases. The PSPACE-hardness reduction uses the theory of succinct problems in a more general manner than circuit representation.