Analyzing Graphs with Node Differential Privacy
We develop algorithms for the private analysis of network data that provide accurate analysis of realistic networks while satisfying stronger privacy guarantees than those of previous work. We present several techniques for designing node differentially private algorithms, that is, algorithms whose output distribution does not change significantly when a node and all its adjacent edges are added to a graph. We also develop methodology for analyzing the accuracy of such algorithms on realistic networks.
The main idea behind our techniques is to “project” (in one of several senses) the input graph onto the set of graphs with maximum degree below a certain threshold. We design projection operators, tailored to specific statistics that have low sensitivity and preserve information about the original statistic. These operators can be viewed as giving a fractional (low-degree) graph that is a solution to an optimization problem described as a maximum flow instance, linear program, or convex program. In addition, we derive a generic, efficient reduction that allows us to apply any differentially private algorithm for bounded-degree graphs to an arbitrary graph. This reduction is based on analyzing the smooth sensitivity of the “naive” truncation that simply discards nodes of high degree.
- 1.Blocki, J., Blum, A., Datta, A., Sheffet, O.: Differentially Private Data Analysis of Social Networks via Restricted Sensitivity. In: ITCS (to appear, 2013)Google Scholar
- 2.Blum, A., Dwork, C., McSherry, F., Nissim, K.: Practical Privacy: The SuLQ Framework. In: PODS, pp. 128–138. ACM (2005)Google Scholar
- 4.Dinur, I., Nissim, K.: Revealing Information While Preserving Privacy. In: PODS, pp. 202–210. ACM (2003)Google Scholar
- 7.Dwork, C., Lei, J.: Differential Privacy and Robust Statistics. In: STOC, pp. 371–380 (2009)Google Scholar
- 10.Hay, M., Li, C., Miklau, G., Jensen, D.: Accurate Estimation of the Degree Distribution of Private Networks. In: ICDM, pp. 169–178 (2009)Google Scholar
- 11.Jernigan, C., Mistree, B.F.T.: Gaydar: Facebook Friendships Expose Sexual Orientation. First Monday 14(10) (2009)Google Scholar
- 12.Karwa, V., Raskhodnikova, S., Smith, A., Yaroslavtsev, G.: Private analysis of graph structure. PVLDB 4(11), 1146–1157 (2011)Google Scholar
- 13.Kifer, D., Machanavajjhala, A.: No Free Lunch in Data Privacy. In: SIGMOD, pp. 193–204 (2011)Google Scholar
- 15.Nissim, K., Raskhodnikova, S., Smith, A.: Smooth sensitivity and sampling in private data analysis. In: Symp. Theory of Computing (STOC), pp. 75–84. ACM (2007), full paper: http://www.cse.psu.edu/~asmith/pubs/NRS07
- 16.Rastogi, V., Hay, M., Miklau, G., Suciu, D.: Relationship Privacy: Output Perturbation for Queries with Joins. In: PODS, pp. 107–116 (2009)Google Scholar