Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Rewriting System for the Assessment of XACML Policies Relationship

Published 19 May 2016 in cs.CR | (1605.05887v3)

Abstract: We propose in this paper a new approach to assess the relationship between XACML policies. Our approach spans over three steps. In the first one, the XACML policies are mapped to terms of a boolean ring while taking into account XACML policy and rule combining algorithms. In the second step, the relationship problem between XACML policies is transformed into a validity problem in a boolean ring. In the third step, the validity problem is resolved using a dedicated rewriting system. The convergence of the rewriting system is proved in this paper. Moreover, the approach is implemented and its performance is evaluated. The results show that our approach enjoys better performance and memory cost than the best so far published SMT based approach.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (4)

Collections

Sign up for free to add this paper to one or more collections.