English

Don't let Google know I'm lonely!

Cryptography and Security 2016-08-22 v2 Social and Information Networks

Abstract

From buying books to finding the perfect partner, we share our most intimate wants and needs with our favourite online systems. But how far should we accept promises of privacy in the face of personal profiling? In particular we ask how can we improve detection of sensitive topic profiling by online systems? We propose a definition of privacy disclosure we call {\epsilon}-indistinguishability from which we construct scalable, practical tools to assess an adversaries learning potential. We demonstrate our results using openly available resources, detecting a learning rate in excess of 98% for a range of sensitive topics during our experiments.

Keywords

Cite

@article{arxiv.1504.08043,
  title  = {Don't let Google know I'm lonely!},
  author = {Pól Mac Aonghusa and Douglas J. Leith},
  journal= {arXiv preprint arXiv:1504.08043},
  year   = {2016}
}

Comments

26 pages, 7 figures in ACM Transactions on Privacy and Security (TOPS), Volume 19 Issue 1, August 2016

R2 v1 2026-06-22T09:25:25.723Z