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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Ruan, C., & Varadharajan, V. (2006). Implementing authorization delegations using graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4080 LNCS, pp. 904–913). Springer Verlag. https://doi.org/10.1007/11827405_88
Mendeley helps you to discover research relevant for your work.