Graph Matching Based Authorization Model for Efficient Secure XML Querying

Authors:
Seunghan Chang;Artem Chebotko;Shiyong Lu;Farshad Fotouhi
Affiliations:
Wayne State University, USA;Wayne State University, USA;Wayne State University, USA;Wayne State University, USA
Venue:
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02
Year:
2007

Citing 0
Cited 3

An efficient access control model for schema-based relational storage of XML documents

Proceedings of the 49th Annual Southeast Regional Conference
Secure XML querying based on authorization graphs

Information Systems Frontiers
Storing XML rules in relational storage of XML DTD

Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 the XML format. Therefore, it is critical to have control mechanisms to restrict a user to access only the parts of XML documents that he/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, and to rewrite for partially acceptable queries only if necessary, along with the features of optimization and speed-up for query rewriting by introducing an index structure.