Publication Type

Conference Proceeding Article

Publication Date

8-2008

Abstract

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.

Keywords

Authentication scheme, Document Retrieval, Empirical evaluations, Inverted list, Query results, Search results, Text search

Discipline

Databases and Information Systems | Numerical Analysis and Scientific Computing

Research Areas

Data Management and Analytics

Publication

Proceedings of the VLDB Endowment: VLDB ‘08, August 24-30, 2008, Auckland, New Zealand

Volume

1

Issue

1

First Page

126

Last Page

137

ISSN

2150-8097

Identifier

10.1145/1453856.1453875

Publisher

VLDB Endowment

City or Country

New York

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://dx.doi.org/10.14778/1453856.1453875

Share

COinS