Skip to main content

Advertisement

Springer Nature Link
Log in

Protect You More Than Blank: Anti-Learning Sensitive User Information in the Social Networks

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

Abstract

Social networks are getting more and more attention in recent years. People join social networks to share their information with others. However, due to the different cultures and backgrounds, people have different requirements on what kind of information should be published. Currently, when social network websites publish data, they just leave the information that a user feels sensitive blank. This is not enough due to the existence of the label-structure relationship. A group of analyzing algorithms can be used to learn the blank information with high accuracy. In this paper, we propose a personalized model to protect private information in social networks. Specifically, we break the label-structure association by slightly changing the edges in some users’ neighborhoods. More importantly, in order to increase the usability of the published graph, we also preserve the influence value of each user during the privacy protection. We verify the effectiveness of our methods through extensive experiments. The results show that the proposed methods can protect sensitive labels against learning algorithms and at the same time, preserve certain graph utilities.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Liu L, Wang J, Liu J, Zhang J. Privacy preserving in social networks against sensitive edge disclosure. Technical Report, CMIDA-HiPSCCS 006-08, Department of Computer Science, University of Kentucky, Lexington, USA, 2008.

  2. Das S, Egecioglu Ö, El Abbadi A. Anonymizing weighted social network graphs. In Proc. the 26th ICDE, March 2010, pp.904–907.

  3. Zheleva E, Getoor L. To join or not to join: The illusion of privacy in social networks with mixed public and private user profiles. In Proc. the 18th International Conference on World Wide Web, April 2009, pp.531–540.

  4. Mo M, King I. Exploit of online social networks with community-based graph semi-supervised learning. In Proc. the 17th International Conference on Neural Information Processing: Theory and Algorithms - Volume Part I, November 2010, pp.669–678.

  5. Lu Q, Getoor L. Link-based classification. In Proc. the 20th International Conference on Machine Learning (ICML), August 2003, pp.496–503.

  6. Neville J, Jensen D. Relational dependency networks. Journal of Machine Learning Research, 2007, 8(Mar): 653–692.

  7. Tang L, Liu H. Relational learning via latent social dimensions. In Proc. the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, June 28–July 1, 2009, pp.817–826.

  8. Bhagat S, Cormode G, Krishnamurthy B, Srivastava D. Class-based graph anonymization for social network data. Proc. VLDB Endow., 2009, 2(1): 766–777.

    Article  Google Scholar 

  9. Cheng J, Fu A W, Liu J. K-isomorphism: Privacy preserving network publication against structural attacks. In Proc. the 2010 International Conference on Management of Data, June 2010, pp.459–470.

  10. Hay M, Miklau G, Jensen D, Towsley D, Weis P. Resisting structural re-identification in anonymized social networks. Proc. VLDB Endow., 2008, 1(1): 102–114.

    Article  Google Scholar 

  11. Liu K, Terzi E. Towards identity anonymization on graphs. In Proc. the 2008 International Conference on Management of Data, June 2008, pp.93–106.

  12. Zhou B, Pei J. Preserving privacy in social networks against neighborhood attacks. In Proc. the 24th ICDE, April 2008, pp.506–515.

  13. Liu X, Wang B, Yang X. Efficiently anonymizing social networks with reachability preservation. In Proc. the 22nd ACM International Conference on Information & Knowledge Management, October 27-November 1, 2013, pp.1613–1618.

  14. Campbell C S, Maglio P P, Cozzi A, Dom B. Expertise identification using email communications. In Proc. the 12th International Conference on Information and Knowledge Management, November 2003, pp.528–531.

  15. Zhang J, Tang J, Li J. Expert finding in a social network. In Proc. the 12th Int. Conf. Database Systems for Advanced Applications, April 2007, pp.1066–1069.

  16. Ying X, Wu X. Randomizing social networks: A spectrum preserving approach. In Proc. SDM, April 2008, pp.739–750.

  17. Zhang J, Tang J, Liu L, Li J. A mixture model for expert finding. In Proc. the 12th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, May 2008, pp.466–478.

  18. Zheleva E, Getoor L. Preserving the privacy of sensitive relationships in graph data. In Proc. the 1st PinKDD, August 2007, pp.153–171.

  19. Campan A, Truta T M. Data and structural k-anonymity in social networks. In Proc. the 2nd PinKDD, August 2008, pp.33–54.

  20. Zou L, Chen L, Özsu M T. k-automorphism: A general framework for privacy preserving network publication. Proc. VLDB Endow., 2009, 2(1): 946–957.

  21. Cormode G, Srivastava D, Yu T, Zhang Q. Anonymizing bipartite graph data using safe groupings. Proc. VLDB Endow., 2008, 1(1): 833–844.

    Article  Google Scholar 

  22. Wu W, Xiao Y, Wang W, He Z, Wang Z. k-symmetry model for identity anonymization in social networks. In Proc. the 13th International Conference on Extending Database Technology, March 2010, pp.111–122.

  23. He X, Vaidya J, Shafiq B, Adam N, Atluri V. Preserving privacy in social networks: A structure-aware approach. In Proc. the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, Sept. 2009, pp.647–654.

  24. Yuan M, Chen L, Yu P S. Personalized privacy protection in social networks. Proc. VLDB Endow., 2010, 4(2): 141–150.

    Article  Google Scholar 

  25. Lindamood J, Heatherly R, Kantarcioglu M, Thuraisingham B. Inferring private information using social network data. In Proc. the 18th International Conference on World Wide Web, April 2009, pp.1145–1146.

  26. Machanavajjhala A, Korolova A, Sarma A D. Personalized social recommendations: Accurate or private? Proc. VLDB Endow., 2011, 4(7): 440–450.

    Article  Google Scholar 

  27. Dwork C. Differential privacy. In Proc. the 33rd ICALP Part II, July 2006, pp.1–12.

  28. Xu J, Zhang Z, Xiao X, Yang Y, Yu G. Differentially private histogram publication. In Proc. the 28th IEEE International Conference on Data Engineering, April 2012, pp.32–43.

  29. Qardaji W, Yang W, Li N. Differentially private grids for geospatial data. In Proc. the 29th IEEE International Conference on Data Engineering (ICDE), April 2013, pp.757–768.

  30. To H, Ghinita G, Shahabi C. A framework for protecting worker location privacy in spatial crowdsourcing. Proc. VLDB Endow., 2014, 7(10): 919–930.

    Google Scholar 

  31. Li N, Qardaji W, Su D, Cao J. PrivBasis: Frequent itemset mining with differential privacy. Proc. VLDB Endow., 2012, 5(11): 1340–1351.

    Article  Google Scholar 

  32. Zeng C, Naughton J F, Cai J Y. On differentially private frequent itemset mining. Proc. VLDB Endow., 2012, 6(1): 25–36.

    Article  Google Scholar 

  33. Akcora C, Carminati B, Ferrari E. Privacy in social networks: How risky is your social graph? In Proc. the 28th IEEE International Conference on Data Engineering, April 2012, pp.9–19.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong, China

    Mingxuan Yuan & Lei Chen

  2. Huawei Noah’s Ark Laboratory, Shatin, Hong Kong, China

    Mingxuan Yuan

  3. Department of Computer Science, University of Illinois at Chicago, Chicago, IL, 60637, U.S.A.

    Philip S. Yu

  4. Key Laboratory of High Confidence Software Technologies, Ministry of Education, Beijing, 100871, China

    Hong Mei

  5. Institute of Software, School of Electronics Engineering and Computer Science, Peking University, Beijing, 100871, China

    Hong Mei

  6. Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, 200240, China

    Hong Mei

Authors
  1. Mingxuan Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lei Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Philip S. Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hong Mei
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mingxuan Yuan.

Additional information

This work is supported in part by the Research Grants Council (RGC) of Hong Kong, China, under Grant No. NHKUST612/09, the National Basic Research 973 Program of China under Grant No. 2012CB316200, and the National Natural Science Foundation of China under Grant No. 60931160444.

Electronic supplementary material

Below is the link to the electronic supplementary material.

ESM 1

(PDF 95 kb)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yuan, M., Chen, L., Yu, P.S. et al. Protect You More Than Blank: Anti-Learning Sensitive User Information in the Social Networks. J. Comput. Sci. Technol. 29, 762–776 (2014). https://doi.org/10.1007/s11390-014-1466-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-014-1466-1

Keywords

Search

Navigation