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 language | English |
|---|---|
| Title of host publication | Database and Expert Systems Applications: 17th International Conference, DEXA 2006, Kraków, Poland, September 4-8, 2006: Proceedings |
| Publisher | Springer |
| Number of pages | 10 |
| ISBN (Print) | 9783540378716 |
| Publication status | Published - 2006 |
| Event | International Workshop on Database and Expert Systems Applications - Duration: 1 Jan 2006 → … |
Conference
| Conference | International Workshop on Database and Expert Systems Applications |
|---|---|
| Period | 1/01/06 → … |
Keywords
- authorization delegation
- access control
- weighted graph