Publishing Search Logs


Search engine companies collect the "database of intentions", the histories of their users' search queries. These search logs are a gold mine for researchers. Search engine companies, however, are wary of publishing search logs in order not to disclose sensitive information.

In this paper we analyze algorithms for publishing frequent keywords, queries and clicks of a search log. We first show how methods that achieve variants of k-anonymity are vulnerable to active attacks. We then demonstrate that the stronger guarantee ensured by epsilon-differential privacy unfortunately does not provide any utility for this problem. We then propose a novel algorithm ZEALOUS and show how to set its parameters to achieve (epsilon, delta)-probabilistic privacy.

We also contrast our analysis of ZEALOUS with an analysis by Korolova et al. that achieves (epsilon', delta')-indistinguishability. Our paper concludes with a large experimental study using real applications where we compare ZEALOUS and previous work that achieves k-anonymity in search log publishing.

Our results show that ZEALOUS yields comparable utility to k-anonymity while at the same time achieving much stronger privacy guarantees


<< back

Labels : Java Projects for Beginners, Free Java Projects for Students, J2EE Projects, Java Project Titles with Abstract, Java Project Titles 2009|2010|2011|2012, Java Project Titles List, List Java Projects, Java Projects Ideas, Java Projects Download, Java Sample Projects, Java Projects for Engineering Students, Java Projects for Students, Java Project Ideas, Mini Projects Java, Core Java Project Topics, Java Projects with Source Code, Java Projects, Java Project Topics for Computer Science, Java Project Topics for Students, Java Project Topics List, Java Project Topics MCA Final Year

Copyright © V2computers 2007 through 2018