A survey on querying encrypted XML documents for databases as a service

Ünay, Ozan; Gündem, Taflan İmre

doi:10.1145/1374780.1374783

Cited by 14 publications

(5 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, since each path is encoded independently, the server cannot process TPQ, which contains multiple correlated paths. Interested readers can refer to [21] for a more complete survey about outsourcing of XML documents.…”

Section: Related Workmentioning

confidence: 99%

Efficient tree pattern queries on encrypted XML documents

Cao

Rao

Kuzu³

et al. 2013

Proceedings of the Joint EDBT/ICDT 2013 Workshops

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient tree pattern queries on encrypted XML documents

Cao

Rao

Kuzu³

et al. 2013

Proceedings of the Joint EDBT/ICDT 2013 Workshops

View full text Add to dashboard Cite

show abstract

“…The first column is the key name. The second column is element name, and the third is the occurrences, which is expressed as the Dewey number of elements in the second column [6]. All three columns are encrypted using the keys in the first column.…”

Section: Index Informationmentioning

confidence: 99%

“…The field occurrences of the row associated with element type "Issuer", which is requested in the query, is decrypted by the processor [5,6]. The position of element type "Issuer" is at the node with number 1.1.2.2, and encrypted data element is included in the node with Dewey number 1.1.2 [5,6]. The node with Dewey number 1.1.2 is returned and decrypted.…”

Section: Index Informationmentioning

confidence: 99%

Encrypted XML Data Query Processing with Range Query

Liu

Chen

Guo

2011

AMM

View full text Add to dashboard Cite

show abstract

“…There are other security issues in outsourcing database models that are orthogonal to our problem, for example, secure releasing of outsourced XML databases [22], enforcing access control policies on published XML documents [3], [15], and querying encrypted outsourced XML databases (we refer the readers to [21] for a survey of this topic).…”

Section: Related Workmentioning

confidence: 99%

Integrity Verification of Outsourced XML Databases

Liu

Wang

2009

2009 International Conference on Computational Science and Engineering

View full text Add to dashboard Cite

Abstract-Recent years have witnessed an increasing trend of enterprises outsource their IT services to third parties. A major concern in database outsourcing paradigm is integrity verification. Two important issues of integrity verification are correctness and completeness. In this paper, we consider these two issues for outsourced XML databases. We propose a novel auditing mechanism that provides the guarantees for both of them. Our experimental results demonstrate the effectiveness and efficiency of our approaches. I. INTRODUCTIONAdvances in networking technologies and the continued growth of the Internet have triggered a new trend towards outsourcing data management and information technology to external service providers. However, the third-party service provider that in the database-as-service (DAS) model may not be trusted [10]. One of important security concerns in the database outsourcing paradigm is integrity; when a client receives a query result from the third-party service provider, he/she wants to be assured that the result is both correct and complete. Here correctness means that the answers are from the original database without being tampered with, while completeness means that the result includes all records in the original database that satisfy the query.The problem of providing security guarantee to outsourced databases has received considerable interests in recent years [11], [16], [18], [20], [23]. However, most of them only consider relational databases. As large amounts of data are stored in native XML database repositories now, there rises the need to consider integrity auditing of outsourced XML databases. In this paper, we focus on the mechanisms that provide both correctness and completeness auditing for XML databases that are hosted by untrusted third-party servers.We consider the system model that consists of three components, the data owner who possesses the original database, the third-party service provider, or the server, who hosts and manages the database from the data owner, and the verifier who validates the integrity of the server. Figure 1 shows the architecture of the system. We assume that the verifier can be the data owner him/herself. Thus the verifier may have limited resources such as disk space and computational power. One of our goals is to reduce the space overhead and computational complexity that is incurred by integrity auditing.We adapt the signature-based approach

show abstract

A survey on querying encrypted XML documents for databases as a service

Cited by 14 publications

References 17 publications

Efficient tree pattern queries on encrypted XML documents

Efficient tree pattern queries on encrypted XML documents

Encrypted XML Data Query Processing with Range Query

Integrity Verification of Outsourced XML Databases

Contact Info

Product

Resources

About