Skip to main content

Discovery and Protection of Sensitive Linkage Information for Online Social Networks Services

  • Conference paper
Wireless Algorithms, Systems, and Applications (WASA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5682))

Abstract

This paper investigates the problem of suppressing access to sensitive linkage information over data published by users of an online social network service. We unveil the potential threats by inferring linkage information from the user-published data, and suggest a class of data publishing schemes to enable distributed data publication by individual users but hide the sensitive information. Our hope is that this white paper shed lights on the future investigation of privacy-preserving online social network services.

This work was supported in part by the National Science Foundation under 0644247, 0845644, 0852673, 0852674, and 0907964. Any opinions, findings, conclusions, and/or recommendations expressed in this material, either expressed or implied, are those of the authors and do not necessarily reflect the views of the sponsor listed above.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Classmates Online, Inc.: (2009), http://www.classmates.com/

  2. LinkedIn.: Relationships matter - linkedin (2009), http://www.linkedin.com/

  3. Facebook.: Welcome to facebook! – facebook (2009), http://www.facebook.com/

  4. Passportstamp Limited (2009), http://www.passportstamp.com/

  5. SciSpace.net: Social networking for collaboration (2009), http://www.scispace.net/

  6. Nye, D.: Dan nye - linkedin (2009), http://www.linkedin.com/in/danielnye

  7. Hay, M., Miklau, G., Jensen, D., Towsley, D.F., Weis, P.: Resisting structural re-identification in anonymized social networks. In: VLDB (2008)

    Google Scholar 

  8. Zhou, B., Pei, J.: Preserving privacy in social networks against neighborhood attacks. In: ICDE (2008)

    Google Scholar 

  9. Korolova, A., Motwani, R., Nabar, S.U., Xu, Y.: Link privacy in social networks. In: CIKM (2008)

    Google Scholar 

  10. Nabar, S., Marthi, B., Kenthapadi, K., Mishra, N., Motwani, R.: Towards robustness in query auditing. In: VLDB (2006)

    Google Scholar 

  11. Yu, W., Zhang, N., Fu, X., Bettati, R., Zhao, W.: On localization attacks to internet threat monitors: An information-theoretic framework. In: the 38th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, N., Song, M., Fu, X., Yu, W. (2009). Discovery and Protection of Sensitive Linkage Information for Online Social Networks Services. In: Liu, B., Bestavros, A., Du, DZ., Wang, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2009. Lecture Notes in Computer Science, vol 5682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03417-6_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03417-6_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03416-9

  • Online ISBN: 978-3-642-03417-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics