Flexible access control policy specification with constraint logic programming
- 1 November 2003
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information and System Security
- Vol. 6 (4), 501-546
- https://doi.org/10.1145/950191.950194
Abstract
We show how a range of role-based access control (RBAC) models may be usefully represented as constraint logic programs, executable logical specifications. The RBAC models that we define extend the "standard" RBAC models that are described by Sandhu et al., and enable security administrators to define a range of access policies that may include features, like denials of access and temporal authorizations, that are often useful in practice, but which are not widely supported in existing access control models. Representing access policies as constraint logic programs makes it possible to support certain policy options, constraint checks, and administrator queries that cannot be represented by using related methods (like logic programs). Representing an access control policy as a constraint logic program also enables access requests and constraint checks to be efficiently evaluated.Keywords
This publication has 16 references indexed in Scilit:
- Flexible Security Policies in SQLPublished by Springer Nature ,2002
- Inferring Termination Conditions for Logic Programs Using Backwards AnalysisLecture Notes in Computer Science, 2001
- Flexible support for multiple access control policiesACM Transactions on Database Systems, 2001
- Data Protection by Logic ProgrammingLecture Notes in Computer Science, 2000
- Role-based authorization constraints specificationACM Transactions on Information and System Security, 2000
- An access control model supporting periodicity constraints and temporal reasoningACM Transactions on Database Systems, 1998
- An authorization model for workflowsLecture Notes in Computer Science, 1996
- The CLP( ℛ ) language and systemACM Transactions on Programming Languages and Systems, 1992
- COMPLEX: an object-oriented logic programming systemIEEE Transactions on Knowledge and Data Engineering, 1992
- A completeness theorem for SLDNF resolutionThe Journal of Logic Programming, 1989