A weighted graph approach to authorization delegation and conflict resolution

Chun Ruan*, Vijay Varadharajan

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

Abstract

Solving conflicts in authorization delegation has not been considerably explored by researchers. In [5] we proposed a graph based framework supporting authorization delegation and conflict resolution. We proposed a predecessor-take-precedence based conflict resolution method, which gives higher priorities to the predecessors along the delegation paths to achieve the well-controlled delegations. In this paper, we further extend the model to allow grantors to express degrees of certainties about their delegations and grants of authorizations. This expression of certainty gives subjects more flexibility on the control of their delegations of access rights. A new conflict resolution policy based on weighted lengths of authorization paths is proposed. This policy deals with the conflicts in a more flexible way in that not only the relationship of predecessor-successor but also the weights of authorizations are taken into consideration. Cyclic authorizations are allowed to further enhance the expressive flexibility, and the undesired situations caused by them can be avoided through the proposed conflict resolution method. The intuitive graph interpretation provides a formal basis for the underlying semantics of our model.

Original languageEnglish
Pages (from-to)402-413
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3108
Publication statusPublished - 2004

Fingerprint

Dive into the research topics of 'A weighted graph approach to authorization delegation and conflict resolution'. Together they form a unique fingerprint.

Cite this