Analyzing XACML policies using answer set programming

摘要: With the tremendous growth of Web applications and services, eXtensible Access Control Markup Language (XACML) has been broadly adopted to specify access control policies. However, when policies are large or defined by multiple authorities, it proved difficult analyze errors vulnerabilities in a manual fashion. Recent advances answer set programming (ASP) paradigm have provided powerful problem-solving formalism that is capable dealing with policy verification. In this paper, we employ ASP various properties XACML To end, first propose structured mechanism translate into an program. Then, leverage features off-the-shelf solvers verify wide range policy, including redundancy, conflicts, refinement, completeness, reachability, usefulness. We present empirical evaluation effectiveness efficiency analysis tool implemented on top Clingo solver. The results show our approach computationally more efficient compared existing approaches.