Implementing authorization delegations using graph

Authors:
Chun Ruan;Vijay Varadharajan
Affiliations:
School of Computing and Information Technology, University of Western Sydney, NSW, Australia;School of Computing and Information Technology, University of Western Sydney, NSW, Australia
Venue:
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Year:
2006

Citing 5
Cited 1

Discrete mathematics and its applications (2nd ed.)

Discrete mathematics and its applications (2nd ed.)
The role graph model and conflict of interest

ACM Transactions on Information and System Security (TISSEC) - Special issue on role-based access control
A Linear Time Algorithm for Deciding Subject Security

Journal of the ACM (JACM)
Practical safety in flexible access control models

ACM Transactions on Information and System Security (TISSEC)
Administrative scope in the graph-based framework

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

Graph-based delegation authorization in workflow

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph-based approach to access control models have been studied by researchers due to its visualization, flexible representation and precise semantics. In this paper, we present a detailed graph-based algorithm to evaluate authorization delegations and resolve conflicts based on the shorter weighted path-take-precedence method. The approach makes it possible for administrators to control their granting of authorizations in a very flexible way. The correctness proof and time complexity of the algorithm are provided. We then consider how the authorization state can be changed, since in a dynamic environment an authorization state is not static. The detailed algorithm of state transformation and its correctness proof are also given.