Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Backstrom, C. Dwork, J. Kleinberg (2011)
Wherefore art thou R3579X?Communications of the ACM, 54
It is simple to see that every pair of vertices v and v such that ψ C (v) = ψ C (v ) = C satisfy |C ∩ N G (v) ∩ N G (v )| ≤ |C| − 2. Hence, ∆ n intra = max C∈C {|C| − 2}
Gilbert Wondracek, Thorsten Holz, E. Kirda, Christopher Krügel (2010)
A Practical Attack to De-anonymize Social Network Users2010 IEEE Symposium on Security and Privacy
B. Karrer, M. Newman (2010)
Stochastic blockmodels and community structure in networksPhysical review. E, Statistical, nonlinear, and soft matter physics, 83 1 Pt 2
Jaewon Yang, J. Leskovec (2013)
Overlapping community detection at scale: a nonnegative matrix factorization approachProceedings of the sixth ACM international conference on Web search and data mining
S. Ji, Weiqing Li, Prateek Mittal, Xin Hu, R. Beyah (2015)
SecGraph: A Uniform and Open-source Evaluation System for Graph Data Anonymization and De-anonymization
Joseph Pfeiffer, T. Fond, Sebastián Moreno, Jennifer Neville (2012)
Fast Generation of Large Scale Social Networks While Incorporating Transitive Closures2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing
Kun Liu, Evimaria Terzi (2008)
Towards identity anonymization on graphs
Darakhshan Mir, R. Wright (2009)
A Differentially Private Graph Estimator2009 IEEE International Conference on Data Mining Workshops
M. Newman (2016)
Community detection in networks: Modularity optimization and maximum likelihood are equivalentPhysical review. E, 94 5-1
F. Rousseau, Jordi Casas-Roma, M. Vazirgiannis (2018)
Community-preserving anonymization of graphsKnowledge and Information Systems, 54
Daniel Kifer, Bing-Rong Lin (2010)
Towards an axiomatization of statistical privacy and utility
S. Mauw, Y. Ramírez-Cruz, Rolando Trujillo-Rasua (2018)
Robust active attacks on social graphsData Mining and Knowledge Discovery, 33
Julián Salas, V. Torra (2015)
Graphic sequences, distances and k-degree anonymityDiscret. Appl. Math., 188
Joseph Pfeiffer, Sebastián Moreno, T. Fond, Jennifer Neville, Brian Gallagher (2014)
Attributed graph models: modeling network structure with correlated attributesProceedings of the 23rd international conference on World wide web
Jordi Casas-Roma, J. Herrera-Joancomartí, V. Torra (2013)
An algorithm for k-degree anonymity on large networks2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)
(2011)
A Distribution of degree and local clustering coefficient
on the protection of natural persons with regard to the processing of personal data and on the free movement of such data, and repealing directive 95/46/ec (general data protection regulation)
V. Blondel, Jean-Loup Guillaume, R. Lambiotte, E. Lefebvre (2008)
Fast unfolding of communities in large networksJournal of Statistical Mechanics: Theory and Experiment, 2008
T. Kolda, Ali Pinar, T. Plantenga, Seshadhri Comandur (2013)
A Scalable Generative Graph Model with Community StructureArXiv, abs/1302.6636
C. Dwork (2006)
Differential Privacy
Vishesh Karwa, A. Slavkovic (2012)
Differentially Private Graphical Degree Sequences and Synthetic Graphs
Jordi Casas-Roma, J. Herrera-Joancomartí, V. Torra (2017)
k-Degree anonymity and edge selection: improving data utility in large networksKnowledge and Information Systems, 50
L. Ostroumova, Alexey Tikhonov (2018)
Community Detection through Likelihood Optimization: In Search of a Sound ModelThe World Wide Web Conference
James Cheng, A. Fu, Jia Liu (2010)
K-isomorphism: privacy preserving network publication against structural attacksProceedings of the 2010 ACM SIGMOD International Conference on Management of data
Frank McSherry (2009)
Privacy integrated queriesCommunications of the ACM, 53
Michael Hay, Chao Li, G. Miklau, David Jensen (2009)
Accurate Estimation of the Degree Distribution of Private Networks2009 Ninth IEEE International Conference on Data Mining
Changchang Liu, Supriyo Chakraborty, Prateek Mittal (2016)
Dependence Makes You Vulnberable: Differential Privacy Under Dependent Tuples
N. Marquetoux, M. Stevenson, P. Wilson, A. Ridler, C. Heuer (2016)
Using social network analysis to inform disease control interventions.Preventive veterinary medicine, 126
Lei Zou, Lei Chen, M. Özsu (2009)
K-Automorphism: A General Framework For Privacy Preserving Network PublicationProc. VLDB Endow., 2
Qian Xiao, Rui Chen, K. Tan (2014)
Differentially private network data release via structural inferenceProceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining
Jaewon Yang, J. Leskovec (2012)
Defining and evaluating network communities based on ground-truthKnowledge and Information Systems, 42
Jaewon Yang, Julian McAuley, J. Leskovec (2013)
Community Detection in Networks with Node Attributes2013 IEEE 13th International Conference on Data Mining
R. Albert, A. Barabási (2001)
Statistical mechanics of complex networksArXiv, cond-mat/0106096
Jeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet (2012)
Differentially private data analysis of social networks via restricted sensitivity
Xinzhe Fu, Zhongzhao Hu, Zhiying Xu, Luoyi Fu, Xinbing Wang (2017)
De-anonymization of Social Networks with Communities: When Quantifications Meet AlgorithmsArXiv, abs/1703.09028
C. Largeron, Pierre-Nicolas Mougel, Oualid Benyahia, Osmar Zaiane (2017)
DANCer: dynamic attributed networks with community structure generationKnowledge and Information Systems, 53
H. Nguyen, Abdessamad Imine, M. Rusinowitch (2016)
Detecting Communities under Differential PrivacyProceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society
Jérôme Kunegis (2013)
KONECT: the Koblenz network collectionProceedings of the 22nd International Conference on World Wide Web
Wentao Wu, Yanghua Xiao, Wei Wang, Zhenying He, Zhihui Wang (2010)
k-symmetry model for identity anonymization in social networks
Kundan Kandhway, J. Kuri (2016)
Using Node Centrality and Optimal Control to Maximize Information Diffusion in Social NetworksIEEE Transactions on Systems, Man, and Cybernetics: Systems, 47
In this case, we have that n intra (G ) − n intra (G)
J. Leskovec, C. Faloutsos (2007)
Scalable modeling of real graphs using Kronecker multiplication
C. Largeron, Pierre-Nicolas Mougel, Reihaneh Rabbany, Osmar Zaiane (2015)
Generating Attributed Networks with CommunitiesPLoS ONE, 10
Shirin Nilizadeh, Apu Kapadia, Yong-Yeol Ahn (2014)
Community-Enhanced De-anonymization of Online Social NetworksProceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security
WangYue, WUXin-Tao (2013)
Preserving Differential Privacy in Degree-Correlation based Graph GenerationTransactions on Data Privacy
Michael Hay, G. Miklau, David Jensen, D. Towsley, Chao Li (2008)
Resisting structural re-identification in anonymized social networksThe VLDB Journal, 19
P. Holland, Kathryn Laskey, S. Leinhardt (1983)
Stochastic blockmodels: First stepsSocial Networks, 5
A. Clauset, Cristopher Moore, M. Newman (2008)
Hierarchical structure and the prediction of missing links in networksNature, 453
F. Chung, Linyuan Lu (2002)
The average distances in random graphs with given expected degreesProceedings of the National Academy of Sciences of the United States of America, 99
Arvind Narayanan, Vitaly Shmatikov (2009)
anonymizing Social Networks
S. Mauw, Yunior Ram'irez-Cruz, Rolando Trujillo-Rasua (2017)
Rethinking $(k,\ell)$-anonymity in social graphs: $(k,\ell)$-adjacency anonymity and $(k,\ell)$-(adjacency) anonymous transformations
Yue Wang, Xintao Wu, Jun Zhu, Yang Xiang (2012)
On learning cluster coefficient of private networksSocial Network Analysis and Mining, 3
Vishesh Karwa, Sofya Raskhodnikova, Adam Smith, G. Yaroslavtsev (2014)
Private Analysis of Graph StructureProc. VLDB Endow., 4
S. Mauw, Y. Ramírez-Cruz, Rolando Trujillo-Rasua (2018)
Anonymising social graphs in the presence of active attackersTrans. Data Priv., 11
Bin Zhou, J. Pei (2011)
The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacksKnowledge and Information Systems, 28
Zach Jorgensen, Ting Yu, Graham Cormode (2016)
Publishing Attributed Social Graphs with Formal Privacy GuaranteesProceedings of the 2016 International Conference on Management of Data
D. Zinoviev (2012)
Information Diffusion in Social Networks
Figure 3 shows the comparison of degree distributions (a-c) and distributions of local clustering coefficients (d-f) in terms of the complementary cumulative distribution functions (CCDF)
S. Mauw, Y. Ramírez-Cruz, Rolando Trujillo-Rasua (2019)
Conditional adjacency anonymity in social graphs under active attacksKnowledge and Information Systems
Prateek Mittal, Charalampos Papamanthou, D. Song (2012)
Preserving Link Privacy in Social Network Based SystemsArXiv, abs/1208.6189
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith (2007)
Smooth sensitivity and sampling in private data analysis
Tinghuai Ma, Yuliang Zhang, Jie Cao, Jian Shen, Meili Tang, Yuan Tian, A. Al-Dhelaan, Mznah Al-Rodhaan (2015)
KDVEM : a k-degree anonymity with vertex and edge modification algorithmComputing, 97
Mark Newman, Mark Newman, Michelle Girvan, Michelle Girvan (2003)
Finding and evaluating community structure in networks.Physical review. E, Statistical, nonlinear, and soft matter physics, 69 2 Pt 2
Lauren Charles-Smith, T. Reynolds, M. Cameron, Mike Conway, E. Lau, Jennifer Olsen, J. Pavlin, M. Shigematsu, L. Streichert, Katie Suda, Courtney Corley (2015)
Using Social Media for Actionable Disease Surveillance and Outbreak Management: A Systematic Literature ReviewPLoS ONE, 10
Tinghuai Ma, Yuliang Zhang, Jie Cao, Jian Shen, Meili Tang, Yuan Tian, A. Al-Dhelaan, Mznah Al-Rodhaan (2015)
$$\varvec{\textit{KDVEM}}$$KDVEM: a $$k$$k-degree anonymity with vertex and edge modification algorithmComputing, 97
Yazhe Wang, Long Xie, Baihua Zheng, Ken Lee (2014)
High utility K-anonymization for social network publishingKnowledge and Information Systems, 41
A. Sala, Xiaohan Zhao, Christo Wilson, Haitao Zheng, Ben Zhao (2011)
Sharing graphs using differentially private graph models
J. Leskovec, A. Krevl (2014)
{SNAP Datasets}: {Stanford} Large Network Dataset Collection
Jun Zhang, Graham Cormode, Cecilia Procopiuc, D. Srivastava, Xiaokui Xiao (2015)
Private Release of Graph Statistics using Ladder FunctionsProceedings of the 2015 ACM SIGMOD International Conference on Management of Data
P. Massa, P. Avesani (2007)
Trust-aware recommender systems
S. Chester, B. Kapron, G. Ramesh, Gautam Srivastava, Alex Thomo, Venkatesh Srinivasan (2012)
Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodesSocial Network Analysis and Mining, 3
Yang Zhang, Mathias Humbert, Bartlomiej Surma, Praveen Manoharan, Jilles Vreeken, M. Backes (2017)
Towards Plausible Graph AnonymizationProceedings 2020 Network and Distributed System Security Symposium
Jordi Casas-Roma, J. Herrera-Joancomartí, V. Torra (2014)
Anonymizing graphs: measuring quality for clusteringKnowledge and Information Systems, 44
Xuesong Lu, Yi Song, S. Bressan (2012)
Fast Identity Anonymization on Graphs
Frank McSherry (2009)
Privacy integrated queries: an extensible platform for privacy-preserving data analysisProceedings of the 2009 ACM SIGMOD International Conference on Management of data
Frank McSherry, Kunal Talwar (2007)
Mechanism Design via Differential Privacy48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
AbstractWe present a novel method for publishing differentially private synthetic attributed graphs. Our method allows, for the first time, to publish synthetic graphs simultaneously preserving structural properties, user attributes and the community structure of the original graph. Our proposal relies on CAGM, a new community-preserving generative model for attributed graphs. We equip CAGM with efficient methods for attributed graph sampling and parameter estimation. For the latter, we introduce differentially private computation methods, which allow us to release communitypreserving synthetic attributed social graphs with a strong formal privacy guarantee. Through comprehensive experiments, we show that our new model outperforms its most relevant counterparts in synthesising differentially private attributed social graphs that preserve the community structure of the original graph, as well as degree sequences and clustering coefficients.
Proceedings on Privacy Enhancing Technologies – de Gruyter
Published: Oct 1, 2020
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.