Integration of graph based authorization policies

Authors:
Chun Ruan;Vijay Varadharajan
Affiliations:
School of Computing and Information Technology, University of Western Sydney, Penrith South DC, NSW, Australia;School of Computing and Information Technology, University of Western Sydney, Penrith South DC, NSW, Australia
Venue:
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Year:
2006

Citing 5
Cited 0

A calculus for access control in distributed systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Linear Time Algorithm for Deciding Subject Security

Journal of the ACM (JACM)
Practical safety in flexible access control models

ACM Transactions on Information and System Security (TISSEC)
Authorization in Distributed Systems: A Formal Approach

SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
Administrative scope in the graph-based framework

Proceedings of the ninth ACM symposium on Access control models and technologies

Quantified Score

Hi-index	0.00

Visualization

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.