论文信息 - XACML 3.0 in Answer Set Programming

XACML 3.0 in Answer Set Programming

We present a systematic technique for transforming XACML 3.0 policies in Answer Set Programming (ASP). We show that the resulting logic program has a unique answer set that directly corresponds to our formalisation of the standard semantics of XACML 3.0 from [9]. We demonstrate how our results make it possible to use off-the-shelf ASP solvers to formally verify properties of access control policies represented in XACML, such as checking the completeness of a set of access control policies and verifying policy properties.

[1] Timo Soininen,et al. Extending and implementing the stable model semantics , 2000, Artif. Intell..

[2] Frank van Harmelen,et al. Handbook of Knowledge Representation , 2008, Handbook of Knowledge Representation.

[3] Peter J. Stuckey,et al. Flexible access control policy specification with constraint logic programming , 2003, TSEC.

[4] Flemming Nielson,et al. The logic of XACML , 2011, Sci. Comput. Program..

[5] Chitta Baral,et al. Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[6] Sabrina De Capitani di Vimercati,et al. Access Control: Policies, Models, and Mechanisms , 2000, FOSAD.

[7] Michael Huth,et al. Access-Control Policies via Belnap Logic: Effective and Efficient Composition and Analysis , 2008, 2008 21st IEEE Computer Security Foundations Symposium.

[8] Elisa Bertino,et al. A unified framework for enforcing multiple access control policies , 1997, SIGMOD '97.

[9] Michael Gelfond,et al. Answer Sets , 2008, Handbook of Knowledge Representation.

[10] Gail-Joon Ahn,et al. Reasoning about XACML Policy Descriptions in Answer Set Programming ( Preliminary Report ) , 2010 .

[11] Gail-Joon Ahn,et al. Representing and Reasoning about Web Access Control Policies , 2010, 2010 IEEE 34th Annual Computer Software and Applications Conference.

[12] Tim Moses,et al. EXtensible Access Control Markup Language (XACML) version 1 , 2003 .