TY  - CONF
ID  - www200918
UR  - http://www2009.eprints.org/18/
A1  - Korolova, Aleksandra
A1  - Kenthapadi, Krishnaram
A1  - Mishra, Nina
A1  - Ntoulas, Alexandros
Y1  - 2009/04//
N2  - The question of how to publish an anonymized search log was brought to the forefront by a well-intentioned, but privacy-unaware AOL search log release. Since then a series of ad-hoc techniques have been proposed in the literature, though none are known to be provably private. In this paper, we take a major step towards a solution: we show how queries, clicks and their associated perturbed counts can be published in a manner that rigorously preserves privacy. Our algorithm is decidedly simple to state, but non-trivial to analyze. On the opposite side of privacy is the question of whether the data we can safely publish is of any use. Our ?ndings offer a glimmer of hope: we demonstrate that a non-negligible fraction of queries and clicks can indeed be safely published via a collection of experiments on a real search log. In addition, we select an application, keyword generation, and show that the keyword suggestions generated from the perturbed data resemble those generated from the original data. 
TI  - Releasing Search Queries and Clicks Privately
SP  - 171
M2  - Madrid, Spain
AV  - public
EP  - 171
T2  - 18th International World Wide Web Conference
ER  -