Skip to main content

Towards a Privacy-Preserving Solution for OSNs

  • Conference paper
Network and System Security (NSS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 7873))

Included in the following conference series:

  • 3693 Accesses

Abstract

In this short paper, we describe a solution to protect users’ privacy in online social networks (OSNs). The solution achieves the following functionalities: (1) it enables users to store their private data securely; (2) it enables users, from the same or different OSNs, to compute their similarity through a secure protocol; (3) it enables similar users to establish a session key for secure communication. Different from existing solutions in the literature, which often rely on a global public key infrastructure or/and traditional key distribution techniques, the proposed solution leverages on the trust between friends and the entropy of users’ private attributes.

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Beye, M., Jeckmans, A., Erkin, Z., Hartel, P., Lagendijk, R., Tang, Q.: Literature overview - privacy in online social networks. Technical report, Centre for Telematics and Information Technology, University of Twente (2010)

    Google Scholar 

  2. Boyd, C., Mathuria, A.: Protocols for Authentication and Key Establishment. Springer (2004)

    Google Scholar 

  3. Dodis, Y., Reyzin, L., Smith, A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 523–540. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

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

    Google Scholar 

  5. Jeckmans, A., Tang, Q., Hartel, P.: Privacy-preserving profile matching using the social graph. In: The Third International Conference on Computational Aspects of Social Networks, pp. 42–47 (2011)

    Google Scholar 

  6. Narayanan, A., Shmatikov, V.: De-anonymizing social networks. In: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy, pp. 173–187 (2009)

    Google Scholar 

  7. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  8. Palen, L., Dourish, P.: Unpacking ”privacy” for a networked world. In: CHI 2003: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 129–136 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tang, Q. (2013). Towards a Privacy-Preserving Solution for OSNs. In: Lopez, J., Huang, X., Sandhu, R. (eds) Network and System Security. NSS 2013. Lecture Notes in Computer Science, vol 7873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38631-2_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38631-2_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38630-5

  • Online ISBN: 978-3-642-38631-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics