loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)
Graph Matching Based Authorization Model for Efficient Secure XML Querying
Niagara Falls, Ontario, Canada
May 21-May 23
ISBN: 0-7695-2847-3
Seunghan Chang, Wayne State University, USA
Artem Chebotko, Wayne State University, USA
Shiyong Lu, Wayne State University, USA
Farshad Fotouhi, Wayne State University, USA
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.
Citation:
Seunghan Chang, Artem Chebotko, Shiyong Lu, Farshad Fotouhi, "Graph Matching Based Authorization Model for Efficient Secure XML Querying," ainaw, vol. 2, pp.473-478, 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.