期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2012
卷号：2
期号：8
出版社：S.S. Mishra
摘要：Search engine companies collect the "database of intentions", the histories of their users' sea rch 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, q ueries 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 .-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 (., ¦Ä) -probabilistic privacy. Our paper concludes with a large experimental study using real applications where we compare ZEALOUS and previous wo rk 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
