Executing SQL over encrypted data in the database-service-provider model
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Balancing confidentiality and efficiency in untrusted relational DBMSs
Proceedings of the 10th ACM conference on Computer and communications security
Information systems outsourcing: a survey and analysis of the literature
ACM SIGMIS Database
Tree-pattern queries on a lightweight XML processor
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Journal of Cognitive Neuroscience
Searchable symmetric encryption: improved definitions and efficient constructions
Proceedings of the 13th ACM conference on Computer and communications security
From tree patterns to generalized tree patterns: on efficient evaluation of XQuery
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A privacy-preserving index for range queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A survey on querying encrypted XML documents for databases as a service
ACM SIGMOD Record
Structural signatures for tree data structures
Proceedings of the VLDB Endowment
Secure kNN computation on encrypted databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
SABRE: a Sensitive Attribute Bucketization and REdistribution framework for t-closeness
The VLDB Journal — The International Journal on Very Large Data Bases
Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
A comprehensive framework for secure query processing on relational data in the cloud
SDM'11 Proceedings of the 8th VLDB international conference on Secure data management
Labeling Dynamic XML Documents: An Order-Centric Approach
IEEE Transactions on Knowledge and Data Engineering
An efficient approach to support querying secure outsourced XML information
CAiSE'06 Proceedings of the 18th international conference on Advanced Information Systems Engineering
Efficient privacy preserving content based publish subscribe systems
Proceedings of the 17th ACM symposium on Access Control Models and Technologies
| Hi-index | 0.00 |
Outsourcing XML documents is a challenging task, because it encrypts the documents, while still requiring efficient query processing. Past approaches on this topic either leak structural information or fail to support searching that has constraints on XML node content. In addition, they adopt a filtering-and-refining framework, which requires the users to prune false positives from the query results. To address these problems, we present a solution for efficient evaluation of tree pattern queries (TPQs) on encrypted XML documents. We create a domain hierarchy, such that each XML document can be embedded in it. By assigning each node in the hierarchy a position, we create for each document a vector, which encodes both the structural and textual information about the document. Similarly, a vector is created also for a TPQ. Then, the matching between a TPQ and a document is reduced to calculating the distance between their vectors. For the sake of privacy, such vectors are encrypted before being outsourced. To improve the matching efficiency, we use a k-d tree to partition the vectors into non-overlapping subsets, such that non-matchable documents are pruned as early as possible. The extensive evaluation shows that our solution is efficient and scalable to large dataset.