Skip to main content

Recipient Privacy in Online Social Networks (Short Paper)

  • 915 Accesses

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

Abstract

Alongside the intensive growth of Online Social Networks (OSNs), privacy has become an important concept and requirement when sharing content online, leading users to enforce privacy often using encryption when sharing content with multiple recipients. Although cryptographic systems achieve common privacy goals such as confidentiality, key privacy, and recipient privacy, they have not been designed aiming at dynamic types of networks. In fact, the interactive nature of OSNs provides adversaries new attack vectors against privacy, and in particular against recipient privacy. We present the notion of frientropy, and argue that privacy of recipients is maintained in OSNs provided that the social graph has a high frientropy, besides the conventional recipient privacy notion. We compute the frientropy for various theoretical settings, and discuss its implications on some practical settings.

Keywords

  • Recipient privacy
  • Entropy
  • Online Social Networks

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-319-44524-3_15
  • Chapter length: 11 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   59.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-44524-3
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   79.99
Price excludes VAT (USA)

Notes

  1. 1.

    http://www.statista.com/statistics/232499/americans-who-use-social-networking-sites-several-times-per-day (read 2016-06-13).

References

  1. Alwen, J., Dodis, Y., Wichs, D.: Leakage-resilient public-key cryptography in the bounded-retrieval model. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 36–54. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  2. Barth, A., Boneh, D., Waters, B.: Privacy in encrypted content distribution using private broadcast encryption. In: Di Crescenzo, G. (ed.) FC 2006. LNCS, vol. 4107, pp. 52–64. Springer, Heidelberg (2006)

    CrossRef  Google Scholar 

  3. Beato, F.: Private information sharing in online communities. Ph.D. Thesis, Katholieke Universiteit Leuven, Leuven (2015)

    Google Scholar 

  4. Beato, F., Ion, I., Capkun, S., Preneel, B., Langheinrich, M.: For some eyes only: protecting online information sharing. In: CODASPY 2013, pp. 1–12. ACM (2013)

    Google Scholar 

  5. Beato, F., Kohlweiss, M., Wouters, K.: Scramble! your social network data. In: Fischer-Hübner, S., Hopper, N. (eds.) PETS 2011. LNCS, vol. 6794, pp. 211–225. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  6. Bellare, M., Boldyreva, A., Desai, A., Pointcheval, D.: Key-privacy in public-key encryption. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, p. 566. Springer, Heidelberg (2001)

    CrossRef  Google Scholar 

  7. Chung, F.R.K., Graham, R.L., Frankl, P., Shearer, J.B.: Some intersection theorems for ordered sets and graphs. J. Comb. Theor., Ser. A 43(1), 23–37 (1986)

    MathSciNet  CrossRef  MATH  Google Scholar 

  8. Deza, M., Frankl, P.: Erdös-Ko-Rado theorem - 22 years later. SIAM J. Algebraic Discrete Methods 4(4), 419–431 (1983)

    MathSciNet  CrossRef  MATH  Google Scholar 

  9. Díaz, C., Seys, S., Claessens, J., Preneel, B.: Towards measuring anonymity. In: Dingledine, R., Syverson, P. (eds.) PET 2002. LNCS, vol. 2482, pp. 54–68. Springer, Heidelberg (2003)

    CrossRef  Google Scholar 

  10. Erdös, P., Ko, C., Rado, R.: Intersection theorems for systems of finitesets. Q. J. Math. 12(1), 313–320 (1961)

    CrossRef  MATH  Google Scholar 

  11. Fazio, N., Perera, I.M.: Outsider-anonymous broadcast encryption with sublinear ciphertexts. In: Dingledine, R., Syverson, P. (eds.) PKC 2012. LNCS, vol. 7293, pp. 225–242. Springer, Heidelberg (2012)

    CrossRef  Google Scholar 

  12. Günther, F., Manulis, M., Strufe, T.: Cryptographic treatment of private user profiles. In: Danezis, G., Dietrich, S., Sako, K. (eds.) FC 2011 Workshops 2011. LNCS, vol. 7126, pp. 40–54. Springer, Heidelberg (2012)

    CrossRef  Google Scholar 

  13. Libert, B., Paterson, K.G., Quaglia, E.A.: Anonymous broadcast encryption: adaptive security and efficient constructions in the standard model. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 206–224. Springer, Heidelberg (2012)

    CrossRef  Google Scholar 

  14. Pfitzmann, A., Köhntopp, M.: Anonymity, unobservability, and pseudonymity – a proposal for terminology. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 1–9. Springer, Heidelberg (2001)

    CrossRef  Google Scholar 

  15. Serjantov, A., Danezis, G.: Towards an information theoretic metric for anonymity. In: Dingledine, R., Syverson, P. (eds.) PET 2002. LNCS, vol. 2482, pp. 41–53. Springer, Heidelberg (2003)

    CrossRef  Google Scholar 

  16. Sweeney, L.: k-anonymity: a model for protecting privacy. Int. J. Uncertainty Fuzziness Knowl. Based Syst. 10(5), 557–570 (2002)

    MathSciNet  CrossRef  MATH  Google Scholar 

  17. Tóth, G., Hornák, Z., Vajda, F.: Measuring anonymity revisited. NordSec 2004, 85–90 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kimmo Halunen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Beato, F., Halunen, K., Mennink, B. (2016). Recipient Privacy in Online Social Networks (Short Paper). In: Ogawa, K., Yoshioka, K. (eds) Advances in Information and Computer Security. IWSEC 2016. Lecture Notes in Computer Science(), vol 9836. Springer, Cham. https://doi.org/10.1007/978-3-319-44524-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44524-3_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44523-6

  • Online ISBN: 978-3-319-44524-3

  • eBook Packages: Computer ScienceComputer Science (R0)