Abstract
Online social networking platforms have the possibility to collect an incredibly rich set of information about their users: the people they talk to, the people they follow and trust, the people they can influence, as well as their hobbies, interests, and topics in which they are authoritative. Analyzing these data creates fascinating opportunities for expanding our understanding about social structures and phenomena such as social influence, trust and their dynamics. At the same time, mining this type of rich information allows building novel online services, and it represents a great resource for advertisers and for building viral marketing campaigns. Sharing social-network graphs, however, raises important privacy concerns. To alleviate this problem, several anonymization methods have been proposed that aim at reducing the risk of a privacy breach on the published data while still allowing to analyze them and draw relevant conclusions. The bulk of those proposals only considers publishing the network structure, that is a simple (often undirected) graph. In this paper we study the problem of preserving users’ individual privacy when publishing information-rich social networks. In particular, we consider the obfuscation of users’ identities in a topic-dependent social influence network, i.e., a directed graph where each edge is enriched by a topic model that represents the strength of the social influence along the edge per topic. This information-rich graph is obviously much harder to anonymize than standard graphs. We propose here to obfuscate the identity of nodes in the network by randomly perturbing the network structure and the topic model. We then formalize our privacy notion, k-obfuscation, and show how to evaluate the level of obfuscation under a strong adversarial assumption. Experiments on two social networks confirm that randomization can successfully protect the privacy of the users while maintaining high-quality data for applications, such as influence maximization for viral marketing.
Similar content being viewed by others
Notes
For instance, in Twitter in-degree and out-degree are public information.
The datasets we use for experiments, as well as our random obfuscation software and the software for quantifying the level of obfuscation achieved, are available at http://bit.ly/1pt9NJp.
It is worth noting that, although called “set”, a seed set as output by a TIM query is an ordered list of nodes.
References
Aggarwal CC (2005) On k-anonymity and the curse of dimensionality. In: VLDB, pp 901–909
Aslay C, Barbieri N, Bonchi F, Baeza-Yates R (2014) Online topic-aware influence maximization queries. In: EDBT, pp 295–306
Aslay Ç, Lu W, Bonchi F, Goyal A, Lakshmanan LVS (2015) Viral marketing meets social advertising: ad allocation with minimum regret. PVLDB 8(7):822–833
Backstrom L, Dwork C, Kleinberg JM (2007) Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In: WWW, pp 181–190
Barbieri N, Bonchi F (2014) Influence maximization with viral product design. In: SDM. Philadelphia, PA, USA
Barbieri N, Bonchi F, Manco G (2012) Topic-aware social influence propagation models. In: ICDM, pp 81–90
Bi B, Tian Y, Sismanis Y, Balmin A, Cho J (2014) Scalable topic-specific influence analysis on microblogs. In: WSDM, pp 513–522
Boldi P, Bonchi F, Gionis A, Tassa T (2012) Injecting uncertainty in graphs for identity obfuscation. In: VLDB, vol 5, pp 27–31
Bonchi F, Gionis A, Tassa T (2011) Identity obfuscation in graphs through the information theoretic lens. In: ICDE, pp 924–935
Chen S, Zhou S (2013) Recursive mechanism: towards node differential privacy and unrestricted joins. In: SIGMOD, pp 653–664
Chen S, Fan J, Li G, Feng J, Tan K-L, Tang J (2015) Online topic-aware influence maximization. Proc VLDB Endow 8(6):666–677
Cheng J, Fu AW-C, Liu J (2010) K-isomorphism: privacy preserving network publication against structural attacks. In: SIGMOD, pp 459–470
Chu Y, Zhao X, Liu S, Feng J, Yi J, Liu H (2014) An efficient method for topic-aware influence maximization. In: APWeb, pp 584–592
Cormode G, Srivastava D, Bhagat S, Krishnamurthy B (2009) Class-based graph anonymization for social network data. PVLDB 2:766–777
Dwork C (2006) Differential privacy. In: ICALP, pp 1–12
Dyagilev K, Yom-Tov E (2013) Linguistic factors associated with propagation of political opinions in twitter. Soc Sci Comput Rev 32(2):195–204
Gur I (2013) Broker-based ad allocation in social networks. PhD thesis, Bilkent University
Hanhijärvi S, Garriga G, Puolamaki K (2009) Randomization techniques for graphs. In: SDM, pp 780–791
Hay M, Miklau G, Jensen D, Weis P, Srivastava S (2007) Anonymizing social networks. Univ Mass Tech Rep 7:180
Hay M, Li C, Miklau G, Jensen D (2009) Accurate estimation of the degree distribution of private networks. In: ICDM, pp 169–178
Hay M, Miklau G, Jensen D (2010a) Analyzing private network data. In: Bonchi F, Ferrari E (eds) Privacy-aware knowledge discovery: novel applications and new techniques. Chapman & Hall/CRC, Boca Raton, pp 459–498
Hay M, Miklau G, Jensen D, Towsley DF, Li C (2010b) Resisting structural re-identification in anonymized social networks. VLDB J 19:797–823
Hay M, Rastogi V, Miklau G, Suciu D (2010c) Boosting the accuracy of differentially private histograms through consistency. PVLDB 3:1021–1032
Karwa V, Raskhodnikova S, Smith AD, Yaroslavtsev G (2014) Private analysis of graph structure. ACM Trans Database Syst 39:22
Kasiviswanathan SP, Nissim K, Raskhodnikova S, Smith A (2013) Analyzing graphs with node differential privacy. In: TCC, pp 457–476
Kempe D, Kleinberg JM, Tardos E (2003) Maximizing the spread of influence through a social network. In: KDD, pp 137–146
Kivel M, Arenas A, Barthelemy M, Gleeson JP, Moreno Y, Porter MA (2014) Multilayer networks. J Complex Netw 2:203–271
Lin B, Kifer D (2013) Information preservation in statistical privacy and Bayesian estimation of unattributed histograms. In: SIGMOD, pp 677–688
Liu K, Terzi E (2008) Towards identity anonymization on graphs. In: SIGMOD, pp 93–106
Liu L, Wang J, Liu J, Zhang J (2009) Privacy preservation in social networks with sensitive edge weights. In: SDM, pp 954–965
Liu L, Tang J, Han J, Jiang M, Yang S (2010) Mining topic-level influence in heterogeneous networks. In: CIKM, pp 199–208
Mathioudakis M, Bonchi F, Castillo C, Gionis A, Ukkonen A (2011) Sparsification of influence networks. In: KDD, pp 529–537
Nissim K, Raskhodnikova S, Smith A (2007) Smooth sensitivity and sampling in private data analysis. In: STOC, pp 75–84
Romero DM, Meeder B, Kleinberg JM (2011) Differences in the mechanics of information diffusion across topics: idioms, political hashtags, and complex contagion on twitter. In: WWW, pp 695–704
Tang J, Sun J, Wang C, Yang Z (2009) Social influence analysis in large-scale networks. In: KDD, pp 807–816
Tassa T, Bonchi F (2014) Privacy preserving estimation of social influence. In: EDBT, pp 559–570
Weng J, Lim E-P, Jiang J, He Q (2010) Twitterrank: finding topic-sensitive influential twitterers. In: WSDM, pp 261–270
Weng L, Ratkiewicz J, Perra N, Gonçalves B, Castillo C, Bonchi F, Schifanella R, Menczer F, Flammini A (2013) The role of information diffusion in the evolution of social networks. In: KDD, pp 356–364
Wu X, Ying X, Liu K, Chen L (2010) A survey of privacy-preservation of graphs and social networks. In: Aggarwal CC, Wang H (eds) Managing and mining graph data, 1st edn. Springer, Berlin, pp 421–453
Xiao Q, Chen R, Tan K-L (2014) Differentially private network data release via structural inference. In: KDD, pp 911–920
Ying X, Wu X (2008) Randomizing social networks: a spectrum preserving approach. In: SDM, pp 739–750
Ying X, Wu X (2009) Graph generation with prescribed feature constraints. In: SDM, pp 966–977
Zou L, Chen L, Özsu MT (2009) K-automorphism: a general framework for privacy preserving network publication. PVLDB 2:946–957
Acknowledgments
The research leading to these results has received funding from the European Unions Horizon 2020 innovation action programme under Grant Agreement No. 653449 TYPES project.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hajian, S., Tassa, T. & Bonchi, F. Individual privacy in social influence networks. Soc. Netw. Anal. Min. 6, 2 (2016). https://doi.org/10.1007/s13278-015-0312-y
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13278-015-0312-y