The risks due to a global and unaware diffusion of our personal data cannot be overlooked when more than two billion people are estimated to be registered in at least one of the most popular online social networks. As a consequence, privacy has become a primary concern among social network analysts and Web/data scientists. Some studies propose to “measure” users' profile privacy according to their privacy settings but do not consider the topological properties of the social network adequately. In this paper, we address this limitation and define a centrality-based privacy score to measure the objective user privacy risk according to the network properties. We analyze the effectiveness of our measures on a large network of real Facebook users.
[1]
G. Golub,et al.
Eigenvalue computation in the 20th century
,
2000
.
[2]
Yong Wang,et al.
Social network privacy measurement and simulation
,
2014,
2014 International Conference on Computing, Networking and Communications (ICNC).
[3]
Evimaria Terzi,et al.
A Framework for Computing the Privacy Scores of Users in Online Social Networks
,
2009,
2009 Ninth IEEE International Conference on Data Mining.
[4]
Sergey Brin,et al.
The Anatomy of a Large-Scale Hypertextual Web Search Engine
,
1998,
Comput. Networks.
[5]
Jennifer Widom,et al.
Scaling personalized web search
,
2003,
WWW '03.