Treffer: Implementing authorization delegations using graph

Title:
Implementing authorization delegations using graph
Source:
Database and expert systems applications (17th international conference, DEXA 2006, Kraków, Poland, September 4-8, 2006)0DEXA 2006. :904-913
Publisher Information:
Berlin; Heidelberg; New York: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 7 ref 1
Original Material:
INIST-CNRS
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
School of Computing and Information Technology University of Western Sydney, Penrith South DC, NSW 1797, Australia
Department of Computing Macquarie University, North Ryde, NSW 2109, Australia
ISSN:
0302-9743
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19151329
Database:
PASCAL Archive

Weitere Informationen

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.