No abstract

No abstract

No abstract

This paper proposes a D-algebra to compose decisions from multiple access control policies. Compared to other algebrabased approaches aimed at policy composition, D-algebra is the only one that satisfies both functional completeness (any possible decision matrix can be expressed by a D-algebra formula) and computational effectiveness (a formula can be computed efficiently given any decision matrix). The Dalgebra has several relevant applications in the context of access control policies, namely the analysis of policy languages decision mechanisms, and the development of tools for policy authoring and enforcement.

In this paper, we present a novel obligation model for the Core Privacy-aware Role Based Access Control (P-RBAC), and discuss some design issues in detail. Pre-obligations, post-obligations, conditional obligations, and repeating obligations are supported by the obligation model. Interaction between permissions and obligations is discussed, and efficient algorithms are provided to detect undesired effects. Core P-RBAC is extended to support both access control policies and privacy policies simultaneously. We believe that a full-fledged obligation solution based on RBAC may have a great potential because it could be easily deployed in systems already adopting RBAC and would thus allow one to seamlessly introduce policies with obligation requirements, either for access control purposes or for privacy purposes.