The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Releasing search queries and clicks privately
Abstract
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 findings 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Robust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_29 · Cited by 1,835
Self-citationAccurately interpreting clickthrough data as implicit feedback
Joachims, T., Granka, L., Pan, B., Hembrooke, H., & Gay, G. (2005) · Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1076034.1076063 · Cited by 1,408
Social Phobia Subtypes in the National Comorbidity Survey
Kessler, R. C., Stein, M. B., & Berglund, P. (1998) · American Journal of Psychiatry · doi:10.1176/ajp.155.5.613 · Cited by 398
Cited by
Airavat: security and privacy for MapReduce
Roy, I., Setty, S., Kilzer, A., Shmatikov, V., & Witchel, E. (2010) · doi:10.5555/1855711.1855731 · Cited by 393
I Have a DREAM! (DiffeRentially privatE smArt Metering)
Ács, G., & Castelluccia, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-24178-9_9 · Cited by 388
Differential Privacy via Wavelet Transforms
Xiao, X., Wang, G., & Gehrke, J. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.247 · Cited by 369
Private and Continual Release of Statistics
Chan, T.-H. H., Shi, E., & Song, D. (2011) · ACM Transactions on Information and System Security · doi:10.1145/2043621.2043626 · Cited by 352
Functional mechanism: regression analysis under differential privacy
Zhang, J., Zhang, Z., Xiao, X., Yang, Y., & Winslett, M. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2350229.2350253 · Cited by 345
Metadata
- Authors
- Korolova, A., Kenthapadi, K., Mishra, N., & Ntoulas, A.
- Venue
- Proceedings of the 18th international conference on World wide web
- Publisher
- ACM
- Published
- 2009-04-20
- Pages
- 171-180
- OpenAlex
- W2170540710
- Cited by
- 248
- References
- 5
- FWCI
- 19.04
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Releasing search queries and clicks privately. https://app.cochat.ai/papers/10.1145/1526709.1526733
- The paper
- Korolova, A., Kenthapadi, K., Mishra, N., & Ntoulas, A. (2009). Releasing search queries and clicks privately. Proceedings of the 18th international conference on World wide web. https://doi.org/10.1145/1526709.1526733
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.