Summary: Enhancing Deniability against Query-Logs
Avi Arampatzis, Pavlos Efraimidis, and George Drosatos
Department of Electrical and Computer Engineering,
Democritus University of Thrace, Xanthi 67100, Greece
Abstract. We propose a method for search privacy on the Internet, focusing on
enhancing plausible deniability against search engine query-logs. The method ap-
proximates the target search results, without submitting the intended query and
avoiding other exposing queries, by employing sets of queries representing more
general concepts. We model the problem theoretically, and investigate the practi-
cal feasibility and effectiveness of the proposed solution with a set of real queries
with privacy issues on a large web collection. The findings may have implications
for other IR research areas, such as query expansion and fusion in meta-search.
The Internet has gradually become the primary source of information for many people.
More often than not, users submit queries to search engines in order to locate content.
Considering the Internet as a huge library, web-search corresponds to a search within
this library. While conventional library records are private under law, at least in the U.S.,
Internet users might be exposed by their searches.
Every time a user submits a query to a web search engine, some private information