Implementing authorization delegations using graph

  • Chun Ruan
  • , Vijay Varadharajan

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

6 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationDatabase and Expert Systems Applications - 17th International Conference, DEXA 2006, Proceedings
PublisherSpringer Verlag
Pages904-913
Number of pages10
ISBN (Print)3540378715, 9783540378716
DOIs
Publication statusPublished - 2006
Event17th International Conference on Database and Expert Systems Applications, DEXA 2006 - Krakow, Poland
Duration: 4 Sept 20068 Sept 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4080 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th International Conference on Database and Expert Systems Applications, DEXA 2006
Country/TerritoryPoland
CityKrakow
Period4/09/068/09/06

Keywords

  • Access control
  • Authorization delegation
  • Weighted graph

Fingerprint

Dive into the research topics of 'Implementing authorization delegations using graph'. Together they form a unique fingerprint.

Cite this