Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Updating logical databases
Stable and extension class theory for logic programs and default logics
Journal of Automated Reasoning
A non-ground realization of the stable and well-founded semantics
Theoretical Computer Science
Flexible support for multiple access control policies
ACM Transactions on Database Systems (TODS)
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Recent advances in access control models
Das'01 Proceedings of the fifteenth annual working conference on Database and application security
A logic-based framework for attribute based access control
Proceedings of the 2004 ACM workshop on Formal methods in security engineering
Managing RBAC states with transitive relations
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Towards the development of privacy-aware systems
Information and Software Technology
A flexible authorization framework for e-commerce
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
| Hi-index | 0.00 |
The Flexible Authorization Framework (FAF) defined by Jajodia et al. [2001] provides a policy-neutral framework for specifying access control policies that is expressive enough to specify many known access control policies. Although the original formulation of FAF indicated how rules could be added to or deleted from a FAF specification, it did not address the removal of access permissions from users. We present two options for removing permissions in FAF and provide details on the option which is representation independent.