Abstract
\(\mathcal{A}^{xml(T)}\) is a logic-based formal language of authorisation for documents written in the Extensible Markup Language. In our previous publication, we addressed the issues of the syntax, semantics, and expressive power that it has to specify access control and to query XML encoded data. In this paper, we consider an experimental implementation to test its capability to allow and restrict access to XML documents. The software implementation will allow us to define a security policy base and then reason upon it to determine authorisations. From there we can discover \(\mathcal{A}^{xml(T)}\)’s capacity to provide XML access control and any limitations it may have. Also, from this experiment we will have an initial building block for establishing an actual XML access control application.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allen, J.F.: Towards a general theory of action and time. Artif. Intell. 23(2), 123–154 (1984)
Anutariya, C., Chatvichienchai, S., Iwaihara, M., Wuwongse, V., Kambayashi, Y.: A rule-based xml access control model. In: RuleML, pp. 35–48 (2003)
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
Bertino, E., Carminati, B., Ferrari, E.: Access control for xml documents and data. Information Security Technical Report 9(3), 19–34 (2004)
Damiani, E., Vimercati, S.D.C.d., Paraboschi, S., Samarati, P.: A fine-grained access control system for xml documents. ACM Trans. Inf. Syst. Secur. 5(2), 169–202 (2002)
Ferraiolo, D.F., Cugini, J.A., Richard Kuhn, D.: Role-based access control (rbac): Features and motivations. In: 11th Annual Computer Security Applications Proceedings (1995)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K. (eds.) Proceedings of the Fifth International Conference on Logic Programming, pp. 1070–1080. The MIT Press, Cambridge (1988)
He, H., Wong, R.K.: A role-based access control model for xml repositories. In: WISE 2000: Proceedings of the First International Conference on Web Information Systems Engineering, vol. 1, p. 138. IEEE Computer Society, Washington, DC, USA (2000)
Lifschitz, V.: What is answer set programming? In: AAAI 2008: Proceedings of the 23rd national conference on Artificial intelligence, pp. 1594–1597. AAAI Press, Menlo Park (2008)
Policarpio, S.: An Answer Set Programming Based Formal Language for Complex XML Authorisations with Temporal Constraints. PhD thesis in Computer Science, University of Western Sydney (2011)
Policarpio, S., Zhang, Y.: A formal language for specifying complex XML authorisations with temporal constraints. In: Bao, F., Yung, M., Lin, D., Jing, J. (eds.) Inscrypt 2009. LNCS, vol. 6151, pp. 443–457. Springer, Heidelberg (2010)
University of Potsdam. Potassco, the potsdam answer set solving collection (2010), http://potassco.sourceforge.net/
WWW Consortium, Xml path language (xpath) version 1.0. (1999), http://www.w3.org/TR/xpath
WWW Consortium, W3c xml schema (2004), http://www.w3.org/XML/Schema.html
WWW Consortium, Extensible markup language (xml) 1.0., 5thedn. (November 2008), http://www.w3.org/TR/REC-xml/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Policarpio, S., Bai, Y. (2011). An Implementation of \(\mathcal{A}^{xml(T)}\): An Answer Set Programming Based Formal Language of Authorisation for XML Documents. In: Özcan, A., Zizka, J., Nagamalai, D. (eds) Recent Trends in Wireless and Mobile Networks. CoNeCo WiMo 2011 2011. Communications in Computer and Information Science, vol 162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21937-5_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-21937-5_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21936-8
Online ISBN: 978-3-642-21937-5
eBook Packages: Computer ScienceComputer Science (R0)