We propose in this paper a policies similarity approach which is performed in three steps. The first step is concerned with the formalization of a XACML policy as a term in a boolean algebra while taking into account the policy and rule combining algorithms. This formalization is based on Security Policy Language (SePL) which was proposed in a previous work. In the second step, the SePL term is transformed into a term in a boolean ring. In the third step, the two policy terms, which are derived from the previous step, are the input to a rewriting system to conclude which kind of relation exists between these security policies such as equivalence, restriction, inclusion, and divergence. We provide a case study of our approach based on real XACML policies and also an empirical evaluation of its performance.
Lately, @cite_4 devised a new set-based language called SBA-XACML to capture the complex structures in XACML and endowed it with a semantics to detect access flaws, conflicts and redundancies between policies. Their work covers the well-known rules combining algorithms (e.g. Permit overrides and First Applicable). However, the semantic space lacks a distance to assess the similarity between rules.
@cite_4
1512556106
Effective theorem provers are essential for automatic verification and generation of programs. The conventional resolution strategies, albeit complete, are inefficient. On the other hand, special purpose methods, such as term rewriting systems for solving word problems, are relatively efficient but applicable to only limited classes of problems.