Mutual Friend Attack Prevention in Social Network Data Publishing

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10662)

Abstract

Due to increasing demand of publishing social network data, privacy has raised more concern for data publisher. There are different risks and attacks still exist that can breach user privacy. Online social network such as Facebook, Google Plus and LinkedIn provide a feature that allows finding out number of mutual friends (NMF) between two users. Adversary can use such information to identify individual user and his/her connections. As published dataset itself reveals mutual friends information for each connection, it becomes very easy for an adversary to re-identify the individual user.

Existing anonymization techniques for mutual friends attack are based on edge anonymization. It performs edge anonymization operation without considering the NMF-requirement of other edges that results into more edge insertion operations. Due to that, the data utility of anonymized dataset is very low. In this paper, we propose the anonymization approach that works on the mutual friend sequence. It ensures that, there exist at least k elements in mutual friend sequence that holds same value. The vertex selection process to increase the number of mutual friend (NMF) for one edge reduces the mutual friend anonymization requirement for other edges too. The experimental results demonstrate that the proposed anonymization approach preserve the privacy and the utility of the published dataset against mutual friend attack.

Keywords

Social network data publishing Mutual friend attack k-NMF Data utility 

References

  1. 1.
    Facebookstatistics: http://nvestor.fb.com/ Accessed on May 2017
  2. 2.
    Zhou, B., Pei, J., Luk, W.S.: A brief survey on anonymization techniques for privacy preserving publishing of social network data. ACM Sigkdd Explor. Newsl. 10(2), 12–22 (2008)CrossRefGoogle Scholar
  3. 3.
    Wu, X., Ying, X., Liu, K., Chen, L.: A survey of privacy-preservation of graphs and social networks. In: Aggarwal, C., Wang, H. (eds.) Managing and Mining Graph Data, pp. 421–453. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-1-4419-6045-0_14 CrossRefGoogle Scholar
  4. 4.
    Liu, K., Das, K., Grandison, T., Kargupta, H.: Privacy-preserving data analysis on graphs and social networks, In: Next Generation Data Mining, pp. 415–431. CRC Press (2008)Google Scholar
  5. 5.
    Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 93–106. ACM (2008)Google Scholar
  6. 6.
    Backstrom, L., Dwork, C., Kleinberg, J.: Wherefore art thou r3579x? Anonymized social networks, hidden patterns, and structural steganography. In: Proceedings of the 16th International Conference on World Wide Web, pp. 181–190. ACM (2007)Google Scholar
  7. 7.
    Hay, M., Miklau, G., Jensen, D., Towsley, D., Weis, P.: Resisting structural re-identification in anonymized social networks. Proc. VLDB Endowment 1(1), 102–114 (2008)CrossRefGoogle Scholar
  8. 8.
    Sweeney, L.: K-anonymity: a model for protecting privacy. Int. J. Uncertainty Fuzziness Knowl.-Based Syst. 10(05), 557–570 (2002)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Xindong, W., Zhu, X., Gong-Qing, W., Ding, W.: Privacy preserving social network publication against mutual friend attacks. IEEE Trans. Data Priv. 7(2), 71–77 (2014)MathSciNetGoogle Scholar
  10. 10.
    Zheleva, E., Getoor, L.: Preserving the privacy of sensitive relationships in graph data. In: Bonchi, F., Ferrari, E., Malin, B., Saygin, Y. (eds.) PInKDD 2007. LNCS, vol. 4890, pp. 153–171. Springer, Heidelberg (2008).  https://doi.org/10.1007/978-3-540-78478-4_9 CrossRefGoogle Scholar
  11. 11.
    Zhou, B., Pei, J.: Preserving privacy in social networks against neighborhood attacks. In: 2008 IEEE 24th International Conference on Data Engineering, pp. 506–515. IEEE (2008)Google Scholar
  12. 12.
    He, X., Vaidya, J., Shafiq, B., Adam, N., Atluri, V.: Preserving privacy in social networks: a structure-aware approach. In: Web Intelligence and Intelligent Agent Technologies, WI-IAT 2009. IEEE/WIC/ACM International Joint Conferences on, vol. 1, pp. 647–654. IET (2009)Google Scholar
  13. 13.
    Ying, X., Wu, X.: Randomizing social networks: a spectrum preserving approach. In: Proceedings of the 2008 SIAM International Conference on Data Mining, pp. 739–750. SIAM (2008)Google Scholar
  14. 14.
    Zou, L., Chen, L., Tamer Özsu, M.: K-automorphism: a general framework for privacy preserving network publication. Proc. VLDB Endowment 2(1), 946–957 (2009)CrossRefGoogle Scholar
  15. 15.
    Zhang, L., Zhang, W.: Edge anonymity in social network graphs. In: International Conference on Computational Science and Engineering CSE 2009, vol. 4, pp. 1–8. IEEE (2009)Google Scholar
  16. 16.
    Tai, C.-H., Yu, P.S., Yang, D.-N., Chen, M.-S.: Privacy-preserving social network publication against friendship attacks. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1262–1270. ACM (2011)Google Scholar
  17. 17.
    Networkx: http://networkx.lanl.gov/ Accessed on Mar 2017
  18. 18.
    Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)Google Scholar
  19. 19.
    Cheng, J., Fu, A.W., Liu, J.: K-isomorphism: privacy preserving network publication against structural attacks. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp. 459–470. ACM (2010)Google Scholar
  20. 20.
    Tai, C.-H., Yu, P.S., Yang, D.-N., Chen, M.-S.: Structural diversity for privacy in publishing social networks. In: Proceedings of the 2011 SIAM International Conference on Data Mining, pp. 35–46. SIAM (2011)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Sardar Vallabhbhai National Institute of TechnologySuratIndia

Personalised recommendations