Name
Abstract | ||
|---|---|---|
Motivated by tensions between data privacy for individual citizens, and societal priorities such as counterterrorism and the containment of infectious disease, we introduce a computational model that distinguishes between parties for whom privacy is explicitly protected, and those for whom it is not (the targeted subpopulation). The goal is the development of algorithms that can effectively identify and take action upon members of the targeted subpopulation in a way that minimally compromises the privacy of the protected, while simultaneously limiting the expense of distinguishing members of the two groups via costly mechanisms such as surveillance, background checks, or medical testing. Within this framework, we provide provably privacy-preserving algorithms for targeted search in social networks. These algorithms are natural variants of common graph search methods, and ensure privacy for the protected by the careful injection of noise in the prioritization of potential targets. We validate the utility of our algorithms with extensive computational experiments on two large-scale social network datasets. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Graph,Social network,Computer security,Prioritization,Information privacy,Mathematics,Limiting |
DocType | Volume | Citations |
Journal | abs/1506.00242 | 0 |
PageRank | References | Authors |
0.34 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael J. Kearns | 1 | 5904 | 1805.52 |
| Aaron Roth | 2 | 1937 | 110.48 |
| Zhiwei Steven Wu | 3 | 157 | 30.92 |
| Grigory Yaroslavtsev | 4 | 209 | 17.36 |