Sensitive Label Privacy Protection on Social Network Data

  • Yi Song
  • Panagiotis Karras
  • Qian Xiao
  • Stéphane Bressan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7338)


This paper is motivated by the recognition of the need for a finer grain and more personalized privacy in data publication of social networks. We propose a privacy protection scheme that not only prevents the disclosure of identity of users but also the disclosure of selected features in users’ profiles. An individual user can select which features of her profile she wishes to conceal. The social networks are modeled as graphs in which users are nodes and features are labels. Labels are denoted either as sensitive or as non-sensitive. We treat node labels both as background knowledge an adversary may possess, and as sensitive information that has to be protected. We present privacy protection algorithms that allow for graph data to be published in a form such that an adversary who possesses information about a node’s neighborhood cannot safely infer its identity and its sensitive labels. To this aim, the algorithms transform the original graph into a graph in which nodes are sufficiently indistinguishable. The algorithms are designed to do so while losing as little information and while preserving as much utility as possible. We evaluate empirically the extent to which the algorithms preserve the original graph’s structure and properties. We show that our solution is effective, efficient and scalable while offering stronger privacy guarantees than those in previous research.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adamic, L.A., Glance, N.: The political blogosphere and the 2004 U.S. election: divided they blog. In: LinkKDD (2005)Google Scholar
  2. 2.
    Backstrom, L., Dwork, C., Kleinberg, J.M.: Wherefore art thou R3579X?: anonymized social networks, hidden patterns, and structural steganography. Commun. ACM 54(12) (2011)Google Scholar
  3. 3.
    Bhagat, S., Cormode, G., Krishnamurthy, B., Srivastava, D.: Class-based graph anonymization for social network data. PVLDB 2(1) (2009)Google Scholar
  4. 4.
    Campan, A., Truta, T.M.: Data and Structural k-Anonymity in Social Networks. In: Bonchi, F., Ferrari, E., Jiang, W., Malin, B. (eds.) PinKDD 2008. LNCS, vol. 5456, pp. 33–54. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  5. 5.
    Cheng, J., Fu, A.W.-C., Liu, J.: K-isomorphism: privacy-preserving network publication against structural attacks. In: SIGMOD (2010)Google Scholar
  6. 6.
    Cormode, G., Srivastava, D., Yu, T., Zhang, Q.: Anonymizing bipartite graph data using safe groupings. PVLDB 19(1) (2010)Google Scholar
  7. 7.
    Das, S., Egecioglu, Ö., Abbadi, A.E.: Anonymizing weighted social network graphs. In: ICDE (2010)Google Scholar
  8. 8.
    Francesco Bonchi, A.G., Tassa, T.: Identity obfuscation in graphs through the information theoretic lens. In: ICDE (2011)Google Scholar
  9. 9.
    Hay, M., Miklau, G., Jensen, D., Towsley, D., Weis, P.: Resisting structural re-identification in anonymized social networks. PVLDB 1(1) (2008)Google Scholar
  10. 10.
    Li, Y., Shen, H.: Anonymizing graphs against weight-based attacks. In: ICDM Workshops (2010)Google Scholar
  11. 11.
    Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: SIGMOD (2008)Google Scholar
  12. 12.
    Liu, L., Wang, J., Liu, J., Zhang, J.: Privacy preserving in social networks against sensitive edge disclosure. In: SIAM International Conference on Data Mining (2009)Google Scholar
  13. 13.
    Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: ℓ-diversity: privacy beyond k-anonymity. In: ICDE (2006)Google Scholar
  14. 14.
  15. 15.
    Song, Y., Karras, P., Xiao, Q., Bressan, S.: Sensitive label privacy protection on social network data. Technical report TRD3/12 (2012)Google Scholar
  16. 16.
    Song, Y., Nobari, S., Lu, X., Karras, P., Bressan, S.: On the privacy and utility of anonymized social networks. In: iiWAS, pp. 246–253 (2011)Google Scholar
  17. 17.
    Sweeney, L.: K-anonymity: a model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 10(5) (2002)Google Scholar
  18. 18.
    Tai, C.-H., Yu, P.S., Yang, D.-N., Chen, M.-S.: Privacy-preserving social network publication against friendship attacks. In: SIGKDD (2011)Google Scholar
  19. 19.
    Tore, O., Filip, A., John, S.: Node centrality in weighted networks: generalizing degree and shortest paths. Social Networks 32(3) (2010)Google Scholar
  20. 20.
    Wu, W., Xiao, Y., Wang, W., He, Z., Wang, Z.: K-symmetry model for identity anonymization in social networks. In: EDBT (2010)Google Scholar
  21. 21.
    Ying, X., Wu, X.: Randomizing social networks: a spectrum perserving approach. In: SDM (2008)Google Scholar
  22. 22.
    Ying, X., Wu, X.: On Link Privacy in Randomizing Social Networks. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS, vol. 5476, pp. 28–39. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  23. 23.
    Yuan, M., Chen, L., Yu, P.S.: Personalized privacy protection in social networks. PVLDB 4(2) (2010)Google Scholar
  24. 24.
    Zhang, L., Zhang, W.: Edge anonymity in social network graphs. In: CSE (2009)Google Scholar
  25. 25.
    Zhou, B., Pei, J.: Preserving privacy in social networks against neighborhood attacks. In: ICDE (2008)Google Scholar
  26. 26.
    Zhou, B., Pei, J.: The k-anonymity and ℓ-diversity approaches for privacy preservation in social networks against neighborhood attacks. Knowledge and Information Systems 28(1) (2010)Google Scholar
  27. 27.
    Zou, L., Chen, L., Özsu, M.T.: K-automorphism: a general framework for privacy-preserving network publication. PVLDB 2(1) (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Yi Song
    • 1
  • Panagiotis Karras
    • 2
  • Qian Xiao
    • 1
  • Stéphane Bressan
    • 1
  1. 1.School of ComputingNational University of SingaporeSingapore
  2. 2.Rutgers Business SchoolRutgers UniversityUSA

Personalised recommendations