A secure comparison technique for tree structured data

Rahaman, Mohammad Ashiqur; Roudier, Yves; Schaad, Andreas
ICIW 2009, 4th International Conference on Internet and Web Applications and Services, May 24-28, 2009, Venice, Italy

 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.


DOI
Type:
Conference
City:
Venice
Date:
2009-05-24
Department:
Digital Security
Eurecom Ref:
2699
Copyright:
© 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also:

PERMALINK : https://www.eurecom.fr/publication/2699