Ecole d'ingénieur et centre de recherche en télécommunications

Analysis of privacy in online social networks from the graph theory perspective

Cutillo, Leucio Antonio; Molva, Refik; Önen, Melek

GLOBECOM 2011, Selected Areas in Communications Symposium, Social Networks Track, 5-9 December, Houston, Texas, USA

The extremely widespread adoption of Online Social Networks (OSNs) raises many questions on privacy and access control. Regardless of the particular centralized or de-centralized nature of the OSN, the achievable security and privacy degree strongly depends on the graph-theoretical properties of the social graph representing the real friendship relations between the users. In this paper, we analyze the relationship between the social network graph topology and the achievable privacy. We observe three metrics, namely degree distribution, clustering coefficient and mixing time, and show that they give fundamental insights on the privacy degree of the OSN. We propose how to exploit these insight for the design of future privacy-friendly OSN.        

Document Doi Hal Bibtex

Département:Réseaux et Sécurité
Eurecom ref:3454
Copyright: © 2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Bibtex: @inproceedings{EURECOM+3454, doi = {}, year = {2011}, title = {{A}nalysis of privacy in online social networks from the graph theory perspective}, author = {{C}utillo, {L}eucio {A}ntonio and {M}olva, {R}efik and {\"{O}}nen, {M}elek}, booktitle = {{GLOBECOM} 2011, {S}elected {A}reas in {C}ommunications {S}ymposium, {S}ocial {N}etworks {T}rack, 5-9 {D}ecember, {H}ouston, {T}exas, {USA}}, address = {{H}ouston, {\'{E}}{TATS}-{UNIS}}, month = {12}, url = {} }
Voir aussi: