Authenticating the query results of text search engines

Pang, HweeHwa; Mouratidis, Kyriakos

doi:10.14778/1453856.1453875

Cited by 69 publications

(51 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Besides relational and spatial datasets, authentication of semi-structured and non-structured datasets was studied for streaming data [15,21] and text data [18].…”

Section: Background and Related Workmentioning

confidence: 99%

Authenticating location-based services without compromising location privacy

Chang

et al. 2012

Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data

View full text Add to dashboard Cite

The popularity of mobile social networking services (mSNSs) is propelling more and more businesses, especially those in retailing and marketing, into mobile and location-based forms. To address the trust issue, the service providers are expected to deliver their location-based services in an authenticatable manner, so that the correctness of the service results can be verified by the client. However, existing works on query authentication cannot preserve the privacy of the data being queried, which are sensitive user locations when it comes to location-based services and mSNSs. In this paper, we address this challenging problem by proposing a comprehensive solution that preserves unconditional location privacy when authenticating range queries. Three authentication schemes for R-tree and grid-file index, together with two optimization techniques, are developed. Cost models, security analysis, and experimental results consistently show the effectiveness, reliability and robustness of the proposed schemes under various system settings and query workloads.

show abstract

“…Besides relational and spatial datasets, authentication of semi-structured and non-structured datasets was studied for streaming data [15,21] and text data [18].…”

Section: Background and Related Workmentioning

confidence: 99%

Authenticating location-based services without compromising location privacy

Chang

et al. 2012

Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data

View full text Add to dashboard Cite

show abstract

“…The first solution on the authentication of web searches was recently proposed by Pang and Mouratidis in PVLDB 2008 [20]. This work focuses on the specific, but very important and representative case, where search engines perform similarity-based document retrieval.…”

Section: Prior Related Workmentioning

confidence: 99%

“…Inspired by the work by Pang and Mouratidis [20], we propose a new model for performing keyword-search queries over online web contents. In Section 2, we introduce the concept of an authenticated web crawler, an authentication module that achieves authentication of general queries for web searching in a way that is consistent with the current crawling-based search engines.…”

Section: Our Approachmentioning

confidence: 99%

See 1 more Smart Citation

Efficient verification of web-content searching through authenticated web crawlers

et al. 2012

View full text Add to dashboard Cite

We consider the problem of verifying the correctness and completeness of the result of a keyword search. We introduce the concept of an authenticated web crawler and present its design and prototype implementation. An authenticated web crawler is a trusted program that computes a speciallycrafted signature over the web contents it visits. This signature enables (i) the verification of common Internet queries on web pages, such as conjunctive keyword searches-this guarantees that the output of a conjunctive keyword search is correct and complete; (ii) the verification of the content returned by such Internet queries-this guarantees that web data is authentic and has not been maliciously altered since the computation of the signature by the crawler. In our solution, the search engine returns a cryptographic proof of the query result. Both the proof size and the verification time are proportional only to the sizes of the query description and the query result, but do not depend on the number or sizes of the web pages over which the search is performed. As we experimentally demonstrate, the prototype implementation of our system provides a low communication overhead between the search engine and the user, and fast verification of the returned results by the user.

show abstract

“…Tamassia and Triandopoulos [27] implement a distributed MH-Tree in order to provide data authentication over peer-to-peer networks. The authors in [23] build MH-Trees over inverted indexes [33] in order to guarantee correctness in keyword-based document retrieval.…”

Section: Related Workmentioning

confidence: 99%

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

Authenticating the query results of text search engines

Cited by 69 publications

References 29 publications

Authenticating location-based services without compromising location privacy

Authenticating location-based services without compromising location privacy

Efficient verification of web-content searching through authenticated web crawlers

Continuous authentication on relational streams

Contact Info

Product

Resources

About