skip to main content
10.1145/2020408.2020599acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
poster

Privacy-preserving social network publication against friendship attacks

Published:21 August 2011Publication History

ABSTRACT

Due to the rich information in graph data, the technique for privacy protection in published social networks is still in its infancy, as compared to the protection in relational databases. In this paper we identify a new type of attack called a friendship attack. In a friendship attack, an adversary utilizes the degrees of two vertices connected by an edge to re-identify related victims in a published social network data set. To protect against such attacks, we introduce the concept of k2-degree anonymity, which limits the probability of a vertex being re-identified to 1/k. For the k2-degree anonymization problem, we propose an Integer Programming formulation to find optimal solutions in small-scale networks. We also present an efficient heuristic approach for anonymizing large-scale social networks against friendship attacks. The experimental results demonstrate that the proposed approaches can preserve much of the characteristics of social networks.

References

  1. L. Backstrom, C. Dwork, and J. M. Kleinberg. Wherefore art thou r3579x?: Anonymized social networks, hidden patterns, and structural steganography. In Proc. of WWW, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. In Proc. of SDM, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  3. J. Cheng, A. W. Fu, and J. Liu. K-isomorphism: privacy preserving network publication against structural attacks. In Proc. of SIGMOD, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. B. C. M. Fung, K. Wang, R. Chen, and P. S. Yu. Privacy-preserving data publishing: A survey on recent evelopments. ACM Computing Surveys, in press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. Hay, G. Miklau, D. Jensen, D. F. Towsley, and P. Weis. Resisting structural re-identification in anonymized social networks. In Proc. of VLDB, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. X. He, J. Vaidya, B. Shafiq, N. Adam, and V. Atluri. Preserving privacy in social networks: A structure-aware approach. In Proc. of WI-IAT, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. IBM. (ILOG CPLEX 12.2, 2010) http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/.Google ScholarGoogle Scholar
  8. K. Liu, K. Das, T. Grandison, and H. Kargupta. Privacy-preserving data analysis on graphs and social networks. In H. Kargupta, J. Han, P. Yu, R. Motwani, and V. Kumar, editors, Next Generation Data Mining. CRC Press, 2008.Google ScholarGoogle Scholar
  9. K. Liu and E. Terzi. Towards identity anonymization on graphs. In Proc. of ACM SIGMOD, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. P. Samarati and L. Sweeney. Generalizing data to provide anonymity when disclosing information. In Proc. of ACM PODS, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. L. Sweeney. k-anonymity: A model for protecting privacy. IJUFKS, 10(5), 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. P. Scott. Social network analysis: a handbook. Sage Publications, 2nd edition, 2000.Google ScholarGoogle Scholar
  13. C.-H. Tai, D.-N. Yang, P. S. Yu, and M.-S. Chen. Structural Diversity for Privacy in Publishing Social Networks. In Proc. of SDM, 2011.Google ScholarGoogle Scholar
  14. S. Wasserman, K. Faust, D. Iacobucci, and M. Granovetter. Social network analysis: methods and applications. Cambridge University Press, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  15. X. Wu, X. Ying, K. Liu, and L. Chen. A Survey of Privacy-Preservation of Graphs and Social Networks. Springer US, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  16. X. Ying and X. Wu. Randomizing social networks: a spectrum preserving approach. In Proc. of SDM, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  17. L. Zhang and W. Zhang. Edge anonymity in social network graphs. In Proc. of CSE, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. E. Zheleva and L. Getoor. Preserving the privacy of sensitive relationships in graph data. In Proc. of PinKDD, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. B. Zhou and J. Pei. Preserving privacy in social networks against neighborhood attacks. In Proc. of ICDE, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. B. Zhou, J. Pei, and W. Luk. A brief survey on anonymization techniques for privacy preserving publishing of social network data. SIGKDD Explorations, 10(2), 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. L. Zou, L. Chen, and M. T. -Ozsu. K-automorphism: a general framework for privacy preserving network publication. In Proc. of VLDB, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Privacy-preserving social network publication against friendship attacks

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      KDD '11: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
      August 2011
      1446 pages
      ISBN:9781450308137
      DOI:10.1145/2020408

      Copyright © 2011 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 21 August 2011

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • poster

      Acceptance Rates

      Overall Acceptance Rate1,133of8,635submissions,13%

      Upcoming Conference

      KDD '24

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader