Publishing graph degree distribution with node differential privacy

177Citations
Citations of this article
58Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Graph data publishing under node-differential privacy (node-DP) is challenging due to the huge sensitivity of queries. However, since a node in graph data oftentimes represents a person, node-DP is necessary to achieve personal data protection. In this paper, we investigate the problem of publishing the degree distribution of a graph under node-DP by exploring the projection approach to reduce the sensitivity. We propose two approaches based on aggregation and cumulative histogram to publish the degree distribution. The experiments demonstrate that our approaches greatly reduce the error of approximating the true degree distribution and have significant improvement over existing works. We also present the introspective analysis for understanding the factors of publishing the degree distribution with node-DP.

Cite

CITATION STYLE

APA

Day, W. Y., Li, N., & Lyu, M. (2016). Publishing graph degree distribution with node differential privacy. In Proceedings of the ACM SIGMOD International Conference on Management of Data (Vol. 26-June-2016, pp. 123–138). Association for Computing Machinery. https://doi.org/10.1145/2882903.2926745

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free