Skip to main content

Neighbourhood-Pair Attack in Social Network Data Publishing

  • Conference paper
  • First Online:
Mobile and Ubiquitous Systems: Computing, Networking, and Services (MobiQuitous 2013)

Abstract

Vertex re-identification is one of the significant and challenging problems in social network. In this paper, we show a new type of vertex re-identification attack called neighbourhood-pair attack. This attack utilizes the neighbourhood topologies of two connected vertices. We show both theoretically and empirically that this attack is possible on anonymized social network and has higher re-identification rate than the existing structural attacks.

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

Access this chapter

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 EPUB and 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

References

  1. Arnaboldi,V., et al.: Analysis of ego network structure in online social networks. In: Privacy, Security, Risk and Trust (PASSAT), 2012 International Conference on and 2012 International Confernece on Social Computing (SocialCom), pp. 31–40 (2012)

    Google Scholar 

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

    Google Scholar 

  3. Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: Presented at the Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, Vancouver, Canada (2008)

    Google Scholar 

  4. Zhou, B., Pei, J.: The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacks. Knowledge and Information Syst. 1–31 (2010)

    Google Scholar 

  5. Zou, L., et al.: K-automorphism: A general framework for privacy preserving network publication. In: Proceedings of the VLDB Endowment, vol. 2, pp. 946–957 (2009)

    Google Scholar 

  6. Cheng, J., et al.: 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 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mohd Izuan Hafez Ninggal .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Ninggal, M.I.H., Abawajy, J.H. (2014). Neighbourhood-Pair Attack in Social Network Data Publishing. In: Stojmenovic, I., Cheng, Z., Guo, S. (eds) Mobile and Ubiquitous Systems: Computing, Networking, and Services. MobiQuitous 2013. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 131. Springer, Cham. https://doi.org/10.1007/978-3-319-11569-6_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11569-6_61

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11568-9

  • Online ISBN: 978-3-319-11569-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics