The Community for Technology Leaders
RSS Icon
Subscribe
Niagara Falls, Ontario, Canada
May 21, 2007 to May 23, 2007
ISBN: 0-7695-2847-3
pp: 473-478
Seunghan Chang , Wayne State University, USA
Artem Chebotko , Wayne State University, USA
Shiyong Lu , Wayne State University, USA
Farshad Fotouhi , Wayne State University, USA
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.
INDEX TERMS
null
CITATION
Seunghan Chang, Artem Chebotko, Shiyong Lu, Farshad Fotouhi, "Graph Matching Based Authorization Model for Efficient Secure XML Querying", AINAW, 2007, Advanced Information Networking and Applications Workshops, International Conference on, Advanced Information Networking and Applications Workshops, International Conference on 2007, pp. 473-478, doi:10.1109/AINAW.2007.195
38 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool