pith. sign in

arxiv: 1504.08043 · v2 · pith:T3OVVFQSnew · submitted 2015-04-29 · 💻 cs.CR · cs.SI

Don't let Google know I'm lonely!

classification 💻 cs.CR cs.SI
keywords learningonlineprivacyprofilingsensitivesystemsacceptadversaries
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.