Privacy in Search Logs

Details Privacy in Search Logs Privacy in Search Logs

2009-04-04

arxiv.org/abs/0904.0682v4

Computer Science

Databases

Scientific paper

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 an 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. [17] 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.

Affiliated with

Also associated with

No associations

Rating

Privacy in Search Logs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Privacy in Search Logs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Privacy in Search Logs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-123025