Abstract
In a distributed environment, authorizations are usually physically stored in several computers connected by a network. Each computer may have its own local policies which could conflict with the others. Therefore how to make a global decision from the local authorization policies is a crucial and practical problem for a distributed system. In this paper, three general integration models based on the degrees of node autonomy are proposed, and different strategies of integrating the local policies into the global policies in each model are systematically discussed. The discussion is based on the weighted authorization graph model that we proposed before.
Original language | English |
---|---|
Journal | Lecture Notes in Computer Science |
DOIs | |
Publication status | Published - 2006 |
Keywords
- access control
- authorization conflict
- weighted graph