A query scrambler for search privacy on the internet

Authors:
Avi Arampatzis;Pavlos S. Efraimidis;George Drosatos
Affiliations:
Department of Electrical and Computer Engineering, Democritus University of Thrace, Xanthi, Greece 67100;Department of Electrical and Computer Engineering, Democritus University of Thrace, Xanthi, Greece 67100;Department of Electrical and Computer Engineering, Democritus University of Thrace, Xanthi, Greece 67100
Venue:
Information Retrieval
Year:
2013

Citing 21
Cited 0

Randomized algorithms

Randomized algorithms
WordNet: a lexical database for English

Communications of the ACM
Searching the Web: the public and their queries

Journal of the American Society for Information Science and Technology
k-anonymity: a model for protecting privacy

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Comparing Top k Lists

SIAM Journal on Discrete Mathematics
Verbs semantics and lexical selection

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Semantic similarity methods in wordNet and their application to information retrieval on the web

Proceedings of the 7th annual ACM international workshop on Web information and data management
Semantic-based information retrieval of biomedical data

Proceedings of the 2006 ACM symposium on Applied computing
A picture of search

InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
On anonymizing query logs via token-based hashing

Proceedings of the 16th international conference on World Wide Web
Privacy protection in personalized search

ACM SIGIR Forum
Private web search

Proceedings of the 2007 ACM workshop on Privacy in electronic society
Vanity fair: privacy in querylog bundles

Proceedings of the 17th ACM conference on Information and knowledge management
WikiRelate! computing semantic relatedness using wikipedia

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
User-private information retrieval based on a peer-to-peer community

Data & Knowledge Engineering
From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Secure anonymous database search

Proceedings of the 2009 ACM workshop on Cloud computing security
Private information retrieval

Communications of the ACM
A survey of single-database private information retrieval: techniques and applications

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Embellishing text search queries to protect user privacy

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a method for search privacy on the Internet, focusing on enhancing plausible deniability against search engine query-logs. The method approximates 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 practical 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. Finally, we discuss ideas for privacy, such as k-anonymity, and how these may be applied to search tasks.