Flexible support for multiple access control policies
Top Cited Papers
- 1 June 2001
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 26 (2), 214-260
- https://doi.org/10.1145/383891.383894
Abstract
Although several access control policies can be devised for controlling access to information, all existing authorization models, and the corresponding enforcement mechanisms, are based on a specific policy (usually the closed policy). As a consequence, although different policy choices are possible in theory, in practice only a specific policy can actually be applied within a given system. In this paper, we present a unified framework that can enforce multiple access control policies within a single system. The framework is based on a language through which users can specify security policies to be enforced on specific accesses. The language allows the specification of both positive and negative authorizations and incorporates notions of authorization derivation, conflict resolution, and decision strategies. Different strategies may be applied to different users, groups, objects, or roles, based on the needs of the security policy. The overall result is a flexible and powerful, yet simple, framework that can easily capture many of the traditional access control policies as well as protection requirements that exist in real-world applications, but are seldom supported by existing systems. The major advantage of our approach is that it can be used to specify different access control policies that can all coexist in the same system and be enforced by the same security server.Keywords
This publication has 17 references indexed in Scilit:
- A flexible authorization mechanism for relational data management systemsACM Transactions on Information Systems, 1999
- A temporal access control mechanism for database systemsIEEE Transactions on Knowledge and Data Engineering, 1996
- Computing the well-founded semantics fasterLecture Notes in Computer Science, 1995
- The relationship between stable, supported, default and autoepistemic semantics for general logic programsTheoretical Computer Science, 1992
- Stable and extension class theory for logic programs and default logicsJournal of Automated Reasoning, 1992
- Complexity Results for Nonmonotonic LogicsJournal of Logic and Computation, 1992
- A model of authorization for next-generation database systemsACM Transactions on Database Systems, 1991
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- A logic for default reasoningArtificial Intelligence, 1980
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955