Skip to main content
SpringerLink
Log in

Community-Preserving Social Graph Release with Node Differential Privacy

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The goal of privacy-preserving social graph release is to protect individual privacy while preserving data utility. Community structure, which is an important global pattern of nodes, is a crucial data utility as it is fundamental to many graph analysis tasks. Yet, most existing methods with differential privacy (DP) commonly fall into edge-DP to sacrifice security in exchange for utility. Moreover, they reconstruct graphs from the local feature-extraction of nodes, resulting in poor community preservation. Motivated by this, we develop PrivCom, a strict node-DP graph release algorithm to maximize the utility on the community structure while maintaining a higher level of privacy. In this algorithm, to reduce the huge sensitivity, we devise a Katz index based private graph feature extraction method, which can capture global graph structure features while greatly reducing the global sensitivity via a sensitivity regulation strategy. Yet, under the condition that the sensitivity is fixed, the feature captured by the Katz index, which is presented in matrix form, requires privacy budget splits. As a result, plenty of noise is injected, mitigating global structural utility. To bridge this gap, we design a private eigenvector estimation method, which yields noisy eigenvectors from extracted low-dimensional vectors. Then, a dynamic privacy budget allocation method with provable utility guarantees is developed to preserve the inherent relationship between eigenvalues and eigenvectors, so that the utility of the generated noise Katz matrix is well maintained. Finally, we reconstruct the synthetic graph via calculating its Laplacian with the noisy Katz matrix. Experimental results confirm our theoretical findings and the efficacy of PrivCom.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Fortunato S. Community detection in graphs. Physics Reports, 2010, 486(3/4/5): 75–174. https://doi.org/10.1016/j.physrep.2009.11.002.

    Article  MathSciNet  Google Scholar 

  2. Tu C C, Zeng X K, Wang H, Zhang Z Y, Liu Z Y, Sun M S, Zhang B, Lin L Y. A unified framework for community detection and network representation learning. IEEE Trans. Knowledge and Data Engineering, 2019, 31(6): 1051–1065. https://doi.org/10.1109/TKDE.2018.2852958.

    Article  Google Scholar 

  3. Zhu J, Wang B, Wu B, Zhang W Y. Emotional community detection in social network. IEICE Trans. Information and Systems, 2017, E100.D(10): 2515–2525. https://doi.org/10.1587/transinf.2016EDP7473.

  4. Li C Y, Zhang Y S. A personalized recommendation algorithm based on large-scale real micro-blog data. Neural Computing and Applications, 2020, 32(15): 11245–11252. https://doi.org/10.1007/s00521-020-05042-y.

    Article  Google Scholar 

  5. Wang D, Li J X, Xu K Q, Wu Y Z. Sentiment community detection: Exploring sentiments and relationships in social networks. Electronic Commerce Research, 2017, 17(1): 103–132. https://doi.org/10.1007/s10660-016-9233-8.

    Article  Google Scholar 

  6. Hay M, Liu K, Miklau G, Pei J, Terzi E. Privacy-aware data management in information networks. In Proc. the 2011 ACM SIGMOD International Conference on Management of Data, Jun. 2011, pp.1201–1204. https://doi.org/10.1145/1989323.1989453.

  7. Dwork C, McSherry F, Nissim K, Smith A. Calibrating noise to sensitivity in private data analysis. In Proc. the 3rd Theory of Cryptography Conference, Mar. 2006, pp.265–284. https://doi.org/10.1007/11681878_14.

  8. Hay M, Li C, Miklau G, Jensen D. Accurate estimation of the degree distribution of private networks. In Proc. the 9th IEEE International Conference on Data Mining, Dec. 2009, pp.169–178. https://doi.org/10.1109/ICDM.2009.11.

  9. Sala A, Zhao X H, Wilson C, Zheng H T, Zhao B Y. Sharing graphs using differentially private graph models. In Proc. the 11th ACM SIGCOMM Conference on Internet Measurement Conference, Nov. 2011, pp.81–98. https://doi.org/10.1145/2068816.2068825.

  10. Wang Y, Wu X T. Preserving differential privacy in degree-correlation based graph generation. Trans. Data Privacy, 2013, 6(2): 127–145.

    MathSciNet  Google Scholar 

  11. Xiao Q, Chen R, Tan K L. Differentially private network data release via structural inference. In Proc. the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 2014, pp.911–920. https://doi.org/10.1145/2623330.2623642.

  12. Wang Y, Wu X T, Wu L T. Differential privacy preserving spectral graph analysis. In Proc. the 17th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Apr. 2013, pp.329–340. https://doi.org/10.1007/978-3-642-37456-2_28.

  13. Chen R, Fung B C M, Yu P S, Desai B C. Correlated network data publication via differential privacy. The VLDB Journal, 2014, 23(4): 653–676. https://doi.org/10.1007/s00778-013-0344-8.

    Article  Google Scholar 

  14. Eliáš M, Kapralov M, Kulkarni J, Lee Y T. Differentially private release of synthetic graphs. In Proc. the 31st Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 2020, pp.560–578. https://doi.org/10.1137/1.9781611975994.34.

  15. Gupta A, Roth A, Ullman J. Iterative constructions and private data release. In Proc. the 9th Theory of Cryptography Conference, Mar. 2012, pp.339–356. https://doi.org/10.1007/978-3-642-28914-9_19.

  16. Gao T C, Li F. PHDP: Preserving persistent homology in differentially private graph publications. In Proc. the 2019 IEEE Conference on Computer Communications, Apr. 29–May 2, 2019, pp.2242–2250. https://doi.org/10.1109/INFOCOM.2019.8737584.

  17. Kifer D, Machanavajjhala A. No free lunch in data privacy. In Proc. the 2011 ACM SIGMOD International Conference on Management of Data, Jun. 2011, pp.193–204. https://doi.org/10.1145/1989323.1989345.

  18. Li N H, Qardaji W, Su D, Wu Y, Yang W N. Membership privacy: A unifying framework for privacy definitions. In Proc. the 2013 ACM SIGSAC Conference on Computer & Communications Security, Nov. 2013, pp.889–900. https://doi.org/10.1145/2508859.2516686.

  19. Day W Y, Li N H, Lyu M. Publishing graph degree distribution with node differential privacy. In Proc. the 2016 International Conference on Management of Data, Jun. 2016, pp.123–138. https://doi.org/10.1145/2882903.2926745.

  20. Zhang S, Ni W W, Fu N. Community preserved social graph publishing with node differential privacy. In Proc. the 2020 IEEE International Conference on Data Mining, Nov. 2020, pp.1400–1405. https://doi.org/10.1109/ICDM50108.2020.00184.

  21. Katz L. A new status index derived from sociometric analysis. Psychometrika, 1953, 18(1): 39–43. https://doi.org/10.1007/BF02289026.

    Article  Google Scholar 

  22. Jain P, Jin C, Kakade S M, Netrapalli P, Sidford A. Streaming PCA: Matching matrix bernstein and near-optimal finite sample guarantees for Oja’s algorithm. In Proc. the 29th Annual Conference on Learning Theory, Jun. 2016, pp.1147–1164.

  23. Backstrom L, Dwork C, Kleinberg J. Wherefore art thou R3579X?: Anonymized social networks, hidden patterns, and structural steganography. In Proc. the 16th International Conference on World Wide Web, May 2007, pp.181–190. https://doi.org/10.1145/1242572.1242598.

  24. Hay M, Miklau G, Jensen D, Towsley D, Li C. Resisting structural re-identification in anonymized social networks. The VLDB Journal, 2010, 19(6): 797–823. https://doi.org/10.1007/s00778-010-0210-x.

    Article  Google Scholar 

  25. Narayanan A, Shmatikov V. De-anonymizing social networks. In Proc. the 30th IEEE Symposium on Security and Privacy, May 2009, pp.173–187. https://doi.org/10.1109/SP.2009.22.

  26. Liu K, Terzi E. Towards identity anonymization on graphs. In Proc. the 2008 ACM SIGMOD International Conference on Management of Data, Jun. 2008, pp.93–106. https://doi.org/10.1145/1376616.1376629.

  27. Zhou B, Pei J. Preserving privacy in social networks against neighborhood attacks. In Proc. the 24th IEEE International Conference on Data Engineering, Apr. 2008, pp.506–515. https://doi.org/10.1109/ICDE.2008.4497459.

  28. Zou L, Chen L, Özsu M T. K-automorphism: A general framework for privacy preserving network publication. Proceedings of the VLDB Endowment, 2009, 2(1): 946–957. https://doi.org/10.14778/1687627.1687734.

    Article  Google Scholar 

  29. Karwa V, Slavković A B. Differentially private graphical degree sequences and synthetic graphs. In Proc. the 2012 International Conference on Privacy in Statistical Databases, Sept. 2012, pp.273–285. https://doi.org/10.1007/978-3-642-33627-0_21.

  30. Zhang J, Cormode G, Procopiuc C M, Srivastava D, Xiao X K. Private release of graph statistics using ladder functions. In Proc. the 2015 ACM SIGMOD International Conference on Management of Data, May 2015, pp.731–745. https://doi.org/10.1145/2723372.2737785.

  31. Karwa V, Raskhodnikova S, Smith A, Yaroslavtsev G. Private analysis of graph structure. ACM Trans. Database Systems, 2014, 39(3): Article No. 22. https://doi.org/10.1145/2611523.

  32. Wang Y, Wu X T, Zhu J, Xiang Y. On learning cluster coefficient of private networks. Social Network Analysis and Mining, 2013, 3(4): 925–938. https://doi.org/10.1007/s13278-013-0127-7.

    Article  Google Scholar 

  33. Mir D J, Wright R N. A differentially private graph estimator. In Proc. the 2009 IEEE International Conference on Data Mining Workshops, Dec. 2009, pp.122–129. https://doi.org/10.1109/ICDMW.2009.96.

  34. Dwork C, Roth A. The algorithmic foundations of differential privacy. Foundations and Trends® in Theoretical Computer Science, 2014, 9(3/4): 211–407. https://doi.org/10.1561/0400000042.

  35. Zhang M H, Chen Y X. Link prediction based on graph neural networks. In Proc. the 32nd International Conference on Neural Information Processing Systems, Dec. 2018, pp.5171–5181.

  36. Lü L Y, Zhou T. Link prediction in complex networks: A survey. Physica A: Statistical Mechanics and Its Applications, 2011, 390(6): 1150–1170. https://doi.org/10.1016/j.physa.2010.11.027.

    Article  Google Scholar 

  37. Allen-Zhu Z Y, Li Y Z. First efficient convergence for streaming k-PCA: A global, gap-free, and near-optimal rate. In Proc. the 58th IEEE Annual Symposium on Foundations of Computer Science, Oct. 2017, pp.487–492. https://doi.org/10.1109/FOCS.2017.51.

  38. Ahmed F, Liu A X, Jin R. Publishing social network graph eigenspectrum with privacy guarantees. IEEE Trans. Network Science and Engineering, 2020, 7(2): 892–906. https://doi.org/10.1109/TNSE.2019.2901716.

    Article  MathSciNet  Google Scholar 

  39. Bandeira A S, Van Handel R. Sharp nonasymptotic bounds on the norm of random matrices with independent entries. The Annals of Probability, 2016, 44(4): 2479–2506. https://doi.org/10.1214/15-AOP1025.

    Article  MathSciNet  Google Scholar 

  40. Hoskins J G, Musco C, Musco C, Tsourakakis C E. Infer-ring networks from random walk-based node similarities. In Proc. the 32nd International Conference on Neural Information Processing Systems, Dec. 2018, pp.3708–3719.

  41. Courrieu P. Fast computation of Moore-Penrose inverse matrices. arXiv: 0804.4809, 2008. http://arxiv.org/abs/0804.4809, Nov. 2023.

  42. Ackland R. Mapping the U.S. political blogosphere: Are conservative bloggers more prominent? In Proc. the 2005 BlogTalk Downunder Conference, May 2005.

  43. McAuley J, Leskovec J. Learning to discover social circles in ego networks. In Proc. the 26th International Conference on Neural Information Processing Systems, Dec. 2012, pp.539–547.

  44. Rossi R A, Ahmed N K. The network data repository with interactive graph analytics and visualization. In Proc. the 29th AAAI Conference on Artificial Intelligence, Jan. 2015, pp.4292–4293.

  45. Abadi M, Chu A, Goodfellow I, Mcmahan H B, Mironov I, Talwar K, Zhang L. Deep learning with differential privacy. In Proc. the 2016 ACM SIGSAC Conference on Computer and Communications Security, Oct. 2016, pp.308–318. https://doi.org/10.1145/2976749.2978318.

  46. Nissim K, Raskhodnikova S, Smith A. Smooth sensitivity and sampling in private data analysis. In Proc. the 39th Annual ACM Symposium on Theory of Computing, Jun. 2007, pp.75–84. https://doi.org/10.1145/1250790.1250803.

  47. Rossetti G, Pappalardo L, Pedreschi D, Giannotti F. Tiles: An online algorithm for community discovery in dynamic social networks. Machine Learning, 2017, 106(8): 1213–1241. https://doi.org/10.1007/s10994-016-5582-8.

    Article  MathSciNet  Google Scholar 

  48. Blondel V D, Guillaume J L, Lambiotte R, Lefebvre E. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008, 2008(10): P10008. https://doi.org/10.1088/1742-5468/2008/10/P10008.

    Article  Google Scholar 

  49. Palla G, Derényi I, Farkas I, Vicsek T. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 2005, 435(7043): 814–818. https://doi.org/10.1038/nature03607.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Southeast University, Nanjing, 211189, China

    Sen Zhang, Wei-Wei Ni & Nan Fu

  2. Key Laboratory of Computer Network and Information Integration (Southeast University), Ministry of Education, Nanjing, 211189, China

    Sen Zhang, Wei-Wei Ni & Nan Fu

Authors
  1. Sen Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei-Wei Ni
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nan Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei-Wei Ni.

Supplementary Information

ESM 1

(PDF 414 kb)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, S., Ni, WW. & Fu, N. Community-Preserving Social Graph Release with Node Differential Privacy. J. Comput. Sci. Technol. 38, 1369–1386 (2023). https://doi.org/10.1007/s11390-021-1270-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-021-1270-7

Keywords

Search

Navigation