Differential privacy preservation for graph auto-encoders: A novel anonymous graph publishing model

被引:8
作者
Li, Xiaolin [1 ,2 ]
Xu, Li [1 ,2 ]
Zhang, Hongyan [1 ,2 ]
Xu, Qikui [3 ]
机构
[1] Fujian Normal Univ, Coll Comp & Cyber Secur, Fuzhou, Fujian, Peoples R China
[2] Fujian Normal Univ, Fujian Prov Key Lab Network Secur & Cryptol, Fuzhou, Fujian, Peoples R China
[3] Fudan Univ, Sch Life Sci, Shanghai, Peoples R China
基金
中国国家自然科学基金;
关键词
Graph neural network; Differential privacy; Multi-task learning; Anonymous graph publishing;
D O I
10.1016/j.neucom.2022.11.083
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In recent years, the number of users in social networks has grown substantially, and more data-intensive applications have been developed. This creates a demand for the ability to mine large-scale graph data more efficiently, so that the information mined can be maximized (e.g., mining social relationships between people). However, the direct publication of the original graphs leads to potential leakage of users' privacy. Therefore, graph anonymization techniques are often utilized to process the original graphs. A key challenge of it lies in the balance between anonymity and usability. In this paper, we intro-duced the idea of graph auto-encoder, a fundamental element in graph neural networks, and proposed the Differential Privacy Deep Graph Auto-Encoder (DP-DGAE). Our main idea is to convert the anonymous graph publishing problem into a privacy-preserving problem for generative models, and optimize the models in terms of both privacy and usability using a multi-task learning approach. Theoretical analysis and experimental evaluations show that the DP-DGAE achieves anonymity while ensuring usability.(c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页码:113 / 125
页数:13
相关论文
共 37 条
[1]   Deep Learning with Differential Privacy [J].
Abadi, Martin ;
Chu, Andy ;
Goodfellow, Ian ;
McMahan, H. Brendan ;
Mironov, Ilya ;
Talwar, Kunal ;
Zhang, Li .
CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2016, :308-318
[2]  
[Anonymous], 2015, Nature, DOI [DOI 10.1038/NATURE14539, 10.1038/, 10.1038/nature14539]
[3]  
Arfken G., 1985, Mathematical Methods for Physicists, V3rd
[4]  
Ateniese Giuseppe, 2015, International Journal of Security and Networks, V10, P137, DOI 10.1504/ijsn.2015.071829
[5]  
Balog M, 2018, PR MACH LEARN RES, V80
[6]   Collective Data-Sanitization for Preventing Sensitive Information Inference Attacks in Social Networks [J].
Cai, Zhipeng ;
He, Zaobo ;
Guan, Xin ;
Li, Yingshu .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2018, 15 (04) :577-590
[7]   How Do the Open Source Communities Address Usability and UX Issues? An Exploratory Study [J].
Cheng, Jinghui ;
Guo, Jin L. C. .
CHI 2018: EXTENDED ABSTRACTS OF THE 2018 CHI CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS, 2018,
[8]  
Cunningham T., 2021, VLDB
[9]   Publishing Graph Degree Distribution with Node Differential Privacy [J].
Day, Wei-Yen ;
Li, Ninghui ;
Lyu, Min .
SIGMOD'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2016, :123-138
[10]  
De A, 2021, AAAI CONF ARTIF INTE, V35, P63