Authenticating Multi-dimensional Query Results in Data Publishing

Wang, Cheng; Pang, HweeHwa; Tan, Kian-Lee

doi:10.1007/11805588_5

Cited by 50 publications

(48 citation statements)

References 20 publications

(30 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cheng et al [5] apply signature chaining to devise authenticated versions of the KD-Tree and the R-Tree (called the VKD-Tree and the VR-Tree, respectively). Signature aggregation [19] can be used to reduce the communication and verification cost.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Continuous authentication on relational streams

2009

View full text Add to dashboard Cite

According to the database outsourcing model, a data owner delegates database functionality to a thirdparty service provider, which answers queries received from clients. Authenticated query processing enables the clients to verify the correctness of query results. Despite the abundance of methods for authenticated processing in conventional databases, there is limited work on outsourced data streams. Stream environments pose new challenges such as the need for fast structure updating, support for continuous query processing and authentication, and provision for temporal completeness. Specifically, in addition to the correctness of individual results, the client must be able to verify that there are no missing results in between data updates. This paper presents a comprehensive set of methods covering relational streams. We first describe REF, a technique that achieves correctness and temporal completeness but incurs false transmissions, i.e., the provider has to inform the clients whenever there is a data update, even if their results are not affected. Then, we propose CADS, which minimizes the processing and transmission overhead through an elaborate indexing scheme and a virtual caching mechanism. In addition, we present an analytical study to determine the optimal indexing granularity, and extend CADS for the case that the data distribution changes over time. Finally, we evaluate the effectiveness of our techniques through extensive experiments.

show abstract

Section: Related Workmentioning

confidence: 99%

“…We implemented all methods using the Crypto++ library, 5 and deployed them on a Core 2 Duo 2.2 GHz CPU with 2 GBytes of RAM. Each record r consumes 100 bytes and contains a search key r.k which has values normalized to [0,1].…”

Section: Experimental Evaluationmentioning

confidence: 99%

Continuous authentication on relational streams

2009

View full text Add to dashboard Cite

show abstract

“…First, Cheng et al [3] introduce two authenticated structures, namely the Verifiable KD-Tree (VKD-Tree) and the Verifiable R-Tree (VR-Tree). Both structures are modified versions of the standard KD-Tree and R-Tree, respectively.…”

Section: Related Workmentioning

confidence: 99%

“…However, these structures incur large space and query processing overhead for the SP, high initial construction cost for the DO, and considerable verification burden for the clients. Furthermore, they lack algorithms for insertions and deletions (updates are not discussed in [3]), which render them inapplicable to dynamic environments.…”

Section: Related Workmentioning

confidence: 99%

Continuous Spatial Authentication

Papadopoulos

Yang

Bakiras

et al. 2009

Advances in Spatial and Temporal Databases

View full text Add to dashboard Cite

Abstract. Recent advances in wireless communications and positioning devices have generated a tremendous amount of interest in the continuous monitoring of spatial queries. However, such applications can incur a heavy burden on the data owner (DO), due to very frequent location updates. Database outsourcing is a viable solution, whereby the DO delegates its database functionality to a service provider (SP) that has the infrastructure and resources to handle the high workload. In this framework, authenticated query processing enables the clients to verify the correctness of the query results that are returned by the SP. In addition to correctness, the dynamic nature of the monitored data requires the provision for temporal completeness, i.e., the clients must be able to verify that there are no missing results in between data updates. This paper constitutes the first work that deals with the authentication of continuous spatial queries, focusing on ranges. We first introduce a baseline solution (BSL) that achieves correctness and temporal completeness, but incurs false transmissions; that is, the SP has to notify clients whenever there is a data update, even if it does not affect their results. Then, we propose CSA, a mechanism that minimizes the processing and transmission overhead through an elaborate indexing scheme and a virtual caching mechanism. Finally, we derive analytical models to optimize the performance of our methods, and evaluate their effectiveness through extensive experiments.

show abstract

“…[21,22]). The general approach is to build authentication information into index tree structures like the B + -tree [13] and the R-tree [5]. In text retrieval, each term in the dictionary is considered a dimension.…”

Section: Introductionmentioning

confidence: 99%

Authenticating the query results of text search engines

Pang

Mouratidis

2008

Proc. VLDB Endow.

Self Cite

View full text Add to dashboard Cite

The number of successful attacks on the Internet shows that it is very difficult to guarantee the security of online search engines. A breached server that is not detected in time may return incorrect results to the users. To prevent that, we introduce a methodology for generating an integrity proof for each search result. Our solution is targeted at search engines that perform similarity-based document retrieval, and utilize an inverted list implementation (as most search engines do). We formulate the properties that define a correct result, map the task of processing a text search query to adaptations of existing threshold-based algorithms, and devise an authentication scheme for checking the validity of a result. Finally, we confirm the efficiency and practicality of our solution through an empirical evaluation with real documents and benchmark queries.

show abstract

Authenticating Multi-dimensional Query Results in Data Publishing

Cited by 50 publications

References 20 publications

Continuous authentication on relational streams

Continuous authentication on relational streams

Continuous Spatial Authentication

Authenticating the query results of text search engines

Contact Info

Product

Resources

About