This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 Fourth International Conference on Internet and Web Applications and Services
A Secure Comparison Technique for Tree Structured Data
Venice/Mestre, Italy
May 24-May 28
ISBN: 978-0-7695-3613-2
Comparing different versions of large tree structured data is a CPU and memory intensive task. State of the art techniques require the complete XML trees and their internal representations to be loaded into memory before any comparison may start. Furthermore, comparing sanitized XML trees is not addressed by these techniques. We propose a comparison technique for sanitized XML documents which ultimately results into a minimum cost edit script transforming the initial tree into the target tree. This method uses encrypted integer labels to encode the original XML structure and content, making the encrypted XML readable only by a legitimate party. Encoded tree nodes can be compared by a third party with a limited intermediate representation.
Index Terms:
XML, Minimum cost edit script, Encryption
Citation:
Mohammad Ashiqur Rahaman, Yves Roudier, Andreas Schaad, "A Secure Comparison Technique for Tree Structured Data," iciw, pp.304-309, 2009 Fourth International Conference on Internet and Web Applications and Services, 2009
Usage of this product signifies your acceptance of the Terms of Use.