Skip to main content
SpringerLink
Log in

Extending [K 1 , K 2 ] Anonymization of Shortest Paths for Social Networks

  • Conference paper
  • First Online:
Multidisciplinary Social Networks Research (MISNC 2015)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 540))

Included in the following conference series:

  • 1685 Accesses

Abstract

Privacy is a great concern when information are published and shared. Privacy-preserving social network data publishing has been studied extensively in recent years. Early works had concentrated on protecting sensitive nodes and links information to prevent privacy breaches. Recent studies start to focus on preserving sensitive edge weight information such as shortest paths. Two types of privacy on sensitive shortest paths have been proposed. One type of privacy tried to add random noise edge weights to the graph but still maintain the same shortest path. The other privacy, k-shortest path privacy, minimally perturbed edge weights, so that there exists at least k shortest paths. However, there might be insufficient paths that can be modified to the same path length. In this work, we extend previously proposed [k 1 , k 2 ]-shortest path privacy, k 1 ≦k≦k 2 , to not only anonymizing different number of shortest paths for different source and destination vertex pair, but also modifying different types of edges, such as partially visited edges. Numerical experiments showing the characteristics of the proposed algorithm is given. The proposed algorithm is more efficient in running time than the previous work with similar perturbed ratios of edges.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Backstrom, L., Huttenlocher, D.P., Kleinberg, J.M., Lan, X.: Group formation in large social networks: membership, growth, and evolution. In: Proceedings of KDD, pp. 44–54 (2006)

    Google Scholar 

  2. Backstrom, L., Dwork, C., Kleinberg, J.M.: Wherefore art thou r3579x?: anonymized social networks, hidden patterns. and structural steganography. In: Proceedings of World Wide Web, pp. 181–190 (2007)

    Google Scholar 

  3. Bhagat, S., Cormode, G., Krishnamurthy, B., Srivastava, D.: Class-based graph anonymization for social network data. In: Proceedings of Very Large Data Bases, pp. 766–777 (2009)

    Google Scholar 

  4. Banisar, D.: Freedom of information around the world 2006 – A global survey of access to government information Laws. www.privacyinternational.org/foi/survey

  5. Cheng, J., Fu, A., Liu, J.: K-isomorphism: privacy preserving network publication against structural attacks. In: Proceedings of ACM SIGMOD Conference, pp. 459–470 (2010)

    Google Scholar 

  6. Das, S., Egecioglu, O., Abbad, A.E.: Anonymizing weighted social network graphs. In: Proceedings of International Conference on Data Engineering, pp. 904–907 (2010)

    Google Scholar 

  7. Gao, J., Xu, Y., Jin, R.M., Zhou, J.S., Wang, T.J., Yang, D.Q.: Neighborhood-privacy protected shortest distance computing in cloud. In: Proceedings of ACM SIGMOD Conference, pp. 409–420 (2011)

    Google Scholar 

  8. Hay, M., Miklau, G., Jensen, D., Towsley, D.F., Weis, P.: Resisting structural re-identification in anonymized social networks. Proceedings of the VLDB Endowment 1(1), 102–114 (2008)

    Article  Google Scholar 

  9. Inkpen, A.: The Japanese corporate network transferred to North America: implications of North American firms. The International Executive 36(4), 411–433 (1994)

    Article  Google Scholar 

  10. Leskovec, J., Huttenlocher, D., Kleingerg, J.: Signed networks in social media. In: Proceedings of CHI Conference on Human Factors in Computing Systems, pp. 1361–1370 (2010)

    Google Scholar 

  11. Li, Y., Shenm, H.: On Identity Disclosure in Weighted Graphs. In: Proceedings of the 11th International Conference on Parallel and Distributed Computing, Applications and Technologies, pp.166–174 (2010)

    Google Scholar 

  12. Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: Proceedings of ACM SIGMOD Conference, pp. 93–106 (2008)

    Google Scholar 

  13. Liu, L., Liu, J., Zhang, J.: Privacy preservation of affinities in social networks. In: Proceedings of International Conference on Information Systems (2010)

    Google Scholar 

  14. Liu, L., Wang, J., Liu, J., Zhang, J.: Privacy preservation in social networks with sensitive edge weights. In: Proceedings of the SIAM International Conference on Data Mining, pp. 954–965 (2009)

    Google Scholar 

  15. Liu, X., Yang, X.: A Generalization Based Approach for Anonymizing Weighted Social Network Graphs. In: Wang, H., Li, S., Oyama, S., Hu, X., Qian, T. (eds.) WAIM 2011. LNCS, vol. 6897, pp. 118–130. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  16. Newman, M.E.J.: The structure of scientific collaboration networks. In: Proceedings of Natl. Acad. Sci. 98, pp. 404409 (2001)

    Google Scholar 

  17. Nobari, S., Karras, P., Pang, H., Bressan, S.: L-opacity: linkage-aware graph anonymization. In: Proceedings of 17th International Conference on Extending Database Technology, pp. 583–594 (2014)

    Google Scholar 

  18. Wang, S.-L., Tsai, Z.-Z., Hong, T.-P., Ting, I.-H.: Anonymizing Shortest Paths on Social Network Graphs. In: Nguyen, N.T., Kim, C.-G., Janiak, A. (eds.) ACIIDS 2011, Part I. LNCS, vol. 6591, pp. 129–136. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  19. Tsai, Y.C., Wang, S.L., Kao, H.Y., Hong, T.P.: Edge types vs privacy in K-anonymization of shortest paths. In Applied Soft Computing 31, 348–359 (2015)

    Article  Google Scholar 

  20. Tsai, Y.C., Wang, S.L., Kao, H.Y., Hong, T.P.: [k1, k2]-anonymization of Shortest Paths, In: Proceedings of 4th International Workshop on Intelligent Data Analysis and Management (2014)

    Google Scholar 

  21. Yuan, M., Chen, L., Yu, P.S.: Personalized privacy protection in social networks. In: Proceedings of the 36rd International Conference on Very Large Data Bases, pp.141–150 (2010)

    Google Scholar 

  22. Yuan, M., Chen, L.: Node Protection in Weighted Social Networks. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011, Part I. LNCS, vol. 6587, pp. 123–137. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  23. Yen, J.Y.: A shortest path algorithm, Ph.D. dissertation, University of California, Berkeley (1970)

    Google Scholar 

  24. Zhou, B., Pei, J.: Preserving privacy in social networks against neighborhood attacks. In: Proceedings of the 24th International Conference on Data Engineering, pp. 506–515 (2008)

    Google Scholar 

  25. Zou, L., Chen, L., Ozsu, M.T.: K-automorphism: A general framework for privacy preserving network publication. In: Proceedings of the 35rd International Conference on Very Large Data Bases, pp. 946–957 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Library and Information Center, National University of Kaohsiung, Kaohsiung, 81148, Taiwan

    Yu-Chuan Tsai

  2. Department of Information Management, National University of Kaohsiung, Kaohsiung, 81148, Taiwan

    Shyue-Liang Wang

  3. Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, 81148, Taiwan

    Tzung-Pei Hong

  4. Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, 70101, Taiwan

    Hung-Yu Kao

Authors
  1. Yu-Chuan Tsai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shyue-Liang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tzung-Pei Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hung-Yu Kao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shyue-Liang Wang .

Editor information

Editors and Affiliations

  1. National University of Kaohsiung, Kaohsiung City, Taiwan

    Leon Wang

  2. Matsuyama University, Matsuyama, Japan

    Shiro Uesugi

  3. National University of Kaohsiung, Kaohsiung City, Taiwan

    I-Hsien Ting

  4. Osaka University, Osaka, Japan

    Koji Okuhara

  5. National University of Kaohsiung, Kaohsiung City, Taiwan

    Kai Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tsai, YC., Wang, SL., Hong, TP., Kao, HY. (2015). Extending [K 1 , K 2 ] Anonymization of Shortest Paths for Social Networks. In: Wang, L., Uesugi, S., Ting, IH., Okuhara, K., Wang, K. (eds) Multidisciplinary Social Networks Research. MISNC 2015. Communications in Computer and Information Science, vol 540. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48319-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48319-0_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48318-3

  • Online ISBN: 978-3-662-48319-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation