Skip to main content

A Layered Secret Sharing Scheme for Automated Profile Sharing in OSN Groups

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

Abstract

We propose a novel Layered secret sharing scheme and its application to Online Social Networks (OSNs). In current, commercially offered OSNs, access to users’ profile information is managed by the service provider e.g. Facebook or Google+, based on the user defined privacy settings. A limited set of rules such as those governing the creation of groups of friends as defined by the user (e.g. circles, friend groups or lists) allow the users to define different levels of privacy, however they are arguably complex and rely on a trusted third party (the service provider) to ensure compliance. The proposed scheme enables automated profile sharing in OSN groups with fine grained privacy control, via a multi-secret sharing scheme comprising layered shares, created from user’s profile attributes (multiple secrets), that are distributed to group members; with no reliance on a trusted third party. The scheme can be implemented via e.g. a browser plugin, enabling automation of all operations for OSN users. We study the security of the scheme against attacks aiming to acquire knowledge about user’s profile. We also provide a theoretical analysis of the resulting level of protection for specific (privacy sensitive) attributes of the profile.

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

Notes

  1. 1.

    http://www.nicta.com.au/pub?id=7318

  2. 2.

    http://point-at-infinity.org/ssss/

  3. 3.

    http://freecode.com/projects/vdmfec

  4. 4.

    http://www.openssl.org/

References

  1. Anderson, J., Diaz, C., Bonneau, J., Stajano, F.: Privacy-enabling social networking over untrusted networks. In: WOSN ’09, pp. 1–6. ACM (2009)

    Google Scholar 

  2. Baden, R., Bender, A., Spring, N., Bhattacharjee, B., Starin, D.: Persona: an online social network with user-defined privacy. SIGCOMM 39(4), 135–146 (2009)

    Article  Google Scholar 

  3. Beimel, A.: Secret-sharing schemes: a survey. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 11–46. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Blundo, C., Santis, A.D., Vaccaro, U.: Efficient sharing of many secrets. In: Enjalbert, P., Wagner, K.W., Finkel, A. (eds.) STACS 1993. LNCS, vol. 665. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  5. Buchegger, S., Schiöberg, D., Vu, L.-H., Datta, A.: Peerson: P2p social networking: early experiences and insights. In: SNS ’09, pp. 46–52. ACM (2009)

    Google Scholar 

  6. Cazabet, R., Leguistin, M., Amblard, F.: Automated community detection on social networks: useful? efficient? asking the users. In: ACM WI&C (2012)

    Google Scholar 

  7. Chan, C.-W., Chang, C.-C.: A scheme for threshold multi-secret sharing. Appl. Math. Comput. 166(1), 1–14 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Guha, S., Tang, K., Francis, P.: Noyb: privacy in online social networks. In: WOSN ’08, pp. 49–54. ACM (2008)

    Google Scholar 

  9. Jahid, S., Mittal, P., Borisov, N.: Easier: encryption-based access control in social networks with efficient revocation. In: ASIACCS ’11, pp. 411–415. ACM, New York (2011)

    Google Scholar 

  10. Liu, Y., Gummadi, K.P., Krishnamurthy, B., Mislove, A.: Analyzing Facebook privacy settings: user expectations vs. reality. In: 2011 ACM SIGCOMM Conference on Internet Measurement Conference, ACM IMC 2011 (2011)

    Google Scholar 

  11. Narayanan, A., Shmatikov, V.: Myths and fallacies of "personally identifiable information". Commun. ACM 53(6), 24–26 (2010)

    Article  Google Scholar 

  12. Pang, L.-J., Wang, Y.-M.: A new (t, n) multi-secret sharing scheme based on shamir’s secret sharing. Appl. Math. Comput. 167, 840–848 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 36(2), 335–348 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  14. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  15. Ugander, J., Karrer, B., Backstrom, L., Marlow, C.: The anatomy of the Facebook social graph. CoRR, abs/1111.4503 (2011)

    Google Scholar 

  16. Viswanath, B., Mislove, A., Cha, M., Gummadi, K.P.: On the evolution of user interaction in Facebook. In: WOSN (2009)

    Google Scholar 

  17. Wang, F., Gu, L., Zheng, S., Yang, Y., Hu, Z.: A novel verifiable dynamic multi-policy secret sharing scheme. In: ICACT’10, pp. 1474–1479. IEEE Press (2010)

    Google Scholar 

  18. Waseda, A., Soshi, M.: Consideration for multi-threshold multi-secret sharing schemes. In: ISITA 2012, pp. 265–269, Oct 2012

    Google Scholar 

  19. Yamamoto, H.: Secret sharing system using (k, l, n) threshold scheme. Electron. Commun. Jpn. (Part I: Commun.) 69(9), 46–54 (1986)

    Article  Google Scholar 

  20. Yang, C.-C., Chang, T.-Y., Hwang, M.-S.: A (t, n) multi-secret sharing scheme. Appl. Math. Comput. 151(2), 483–490 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  21. Yildiz, H., Kruegel, C.: Detecting social cliques for automated privacy control in online social networks. In: IEEE International Conference on Pervasive Computing and Communications Workshops, pp. 353–359 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guillaume Smith .

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

Smith, G., Boreli, R., Kaafar, M.A. (2014). A Layered Secret Sharing Scheme for Automated Profile Sharing in OSN Groups. 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_38

Download citation

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

  • 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