Secure XML querying based on authorization graphs

XML is rapidly emerging as a standard for data representation and exchange over the World Wide Web and an increasing amount of sensitive business data is processed in XML format. Therefore, it is critical to have control mechanisms to restrict a user to access only the parts of XML documents that she is authorized to access. In this paper, we propose the first DTD-based access control model that employs graph matching to analyze if an input query is fully acceptable, fully rejectable, or partially acceptable. In this way, there will be no further security overhead for the processing of fully acceptable and rejectable queries. For partially acceptable queries, we propose a graph-matching based authorization model for an optimized rewriting procedure in which a recursive query (query with descendant axis ‘//’) will be rewritten A. Chebotko (B) Department of Computer Science, University of Texas-Pan American, 1201 W. University Drive, Edinburg, TX 78539-2999, USA e-mail: [email protected] S. Chang · S. Lu · F. Fotouhi Department of Computer Science, Wayne State University, 5143 Cass Avenue, Detroit, MI 48202, USA S. Chang e-mail: [email protected] S. Lu e-mail: [email protected] F. Fotouhi e-mail: [email protected] into an equivalent recursive one if possible and into a non-recursive one only if necessary, resulting queries that can fully take advantage of structural join based query optimization techniques. Moreover, we propose an index structure for XML element types to speed up the query rewriting procedure, a facility that is potentially useful for applications with large DTDs. Our performance study results showed that our algorithms armed with rewriting indexes are promising.