Recipient Privacy in Online Social Networks

Filipe Beato, Kimmo Halunen, Bart Mennink

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

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.
Original languageEnglish
Title of host publicationAdvances in Information and Computer Security
Subtitle of host publication11th International Workshop on Security, IWSEC 2016, Tokyo, Japan, September 12-14, 2016, Proceedings
PublisherSpringer
Pages254-264
ISBN (Print)978-3-319-44523-6, 978-3-319-44524-3
DOIs
Publication statusPublished - 9 Sep 2016
MoE publication typeA4 Article in a conference publication
Event11th International Workshop on Security - Tokyo, Japan
Duration: 12 Sep 201614 Sep 2016
Conference number: 11

Publication series

NameLecture Notes in Computer Science LNCS
PublisherSpringer
Volume9836
ISSN (Print)0302-9743

Conference

Conference11th International Workshop on Security
Abbreviated titleIWSEC 2016
CountryJapan
CityTokyo
Period12/09/1614/09/16

Fingerprint

Cryptography

Keywords

  • recipient privacy
  • entropy
  • online social networks

Cite this

Beato, F., Halunen, K., & Mennink, B. (2016). Recipient Privacy in Online Social Networks. In Advances in Information and Computer Security: 11th International Workshop on Security, IWSEC 2016, Tokyo, Japan, September 12-14, 2016, Proceedings (pp. 254-264). Springer. Lecture Notes in Computer Science, Vol.. 9836 https://doi.org/10.1007/978-3-319-44524-3_15
Beato, Filipe ; Halunen, Kimmo ; Mennink, Bart. / Recipient Privacy in Online Social Networks. Advances in Information and Computer Security: 11th International Workshop on Security, IWSEC 2016, Tokyo, Japan, September 12-14, 2016, Proceedings. Springer, 2016. pp. 254-264 (Lecture Notes in Computer Science, Vol. 9836).
@inproceedings{eb1cb23e078a40629bd51a271256939d,
title = "Recipient Privacy in Online Social Networks",
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",
author = "Filipe Beato and Kimmo Halunen and Bart Mennink",
year = "2016",
month = "9",
day = "9",
doi = "10.1007/978-3-319-44524-3_15",
language = "English",
isbn = "978-3-319-44523-6",
series = "Lecture Notes in Computer Science LNCS",
publisher = "Springer",
pages = "254--264",
booktitle = "Advances in Information and Computer Security",
address = "Germany",

}

Beato, F, Halunen, K & Mennink, B 2016, Recipient Privacy in Online Social Networks. in Advances in Information and Computer Security: 11th International Workshop on Security, IWSEC 2016, Tokyo, Japan, September 12-14, 2016, Proceedings. Springer, Lecture Notes in Computer Science, vol. 9836, pp. 254-264, 11th International Workshop on Security, Tokyo, Japan, 12/09/16. https://doi.org/10.1007/978-3-319-44524-3_15

Recipient Privacy in Online Social Networks. / Beato, Filipe; Halunen, Kimmo; Mennink, Bart.

Advances in Information and Computer Security: 11th International Workshop on Security, IWSEC 2016, Tokyo, Japan, September 12-14, 2016, Proceedings. Springer, 2016. p. 254-264 (Lecture Notes in Computer Science, Vol. 9836).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

TY - GEN

T1 - Recipient Privacy in Online Social Networks

AU - Beato, Filipe

AU - Halunen, Kimmo

AU - Mennink, Bart

PY - 2016/9/9

Y1 - 2016/9/9

N2 - 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.

AB - 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.

KW - recipient privacy

KW - entropy

KW - online social networks

U2 - 10.1007/978-3-319-44524-3_15

DO - 10.1007/978-3-319-44524-3_15

M3 - Conference article in proceedings

SN - 978-3-319-44523-6

SN - 978-3-319-44524-3

T3 - Lecture Notes in Computer Science LNCS

SP - 254

EP - 264

BT - Advances in Information and Computer Security

PB - Springer

ER -

Beato F, Halunen K, Mennink B. Recipient Privacy in Online Social Networks. In Advances in Information and Computer Security: 11th International Workshop on Security, IWSEC 2016, Tokyo, Japan, September 12-14, 2016, Proceedings. Springer. 2016. p. 254-264. (Lecture Notes in Computer Science, Vol. 9836). https://doi.org/10.1007/978-3-319-44524-3_15