Project Details | |
Project Code | DWI101 |
Title | Publishing Search Logs - A Comparative Study of Privacy Guarentees |
Project Type | ASP.NET Website |
Front End | Microsoft Visual Studio 2010 (.Net 2010) |
Back End | Microsoft SQL Server 2008 |
Project Cost |
About the Project
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.
Execution Video
Download Links
Abstract
BasePaper
I strongly feel tat d project supported n created by DP.Jegan Kumar s very good n worth faar better than from sleeky project centre. I thank him for d worthwhile stuff he provided me wen I was in need!!
ReplyDeleteI got a project from Mr D.P. Jegan Kumar ...
ReplyDeletethe project which he gave was a complete one and more over i would like to appreciate the efforts he took in explaining and guiding .. a worthy one.. i would suggest anyone who is need of the project to get it from Jegan ..
Thank you Jegan..