SNGPLDP: Social network graph generation based on personalised local differential privacy

被引:0
|
作者
Shen, Zixuan [1 ]
Fei, Jianwei [2 ]
Xia, Zhihua [1 ]
机构
[1] Jinan Univ, Coll Cyber Secur, Guangzhou 510632, Peoples R China
[2] Nanjing Univ Informat Sci & Technol, Sch Comp Sci, Nanjing 210044, Peoples R China
关键词
PLDP; personalised local differential privacy; SNG; social network graph; randomised response; expectation-maximisation; graph generation; NOISE;
D O I
10.1504/IJAACS.2024.137062
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The social network graph (SNG) can display valuable information. Its generation needs vast amounts of users' data. However, conflicts arise between generating the SNG and protecting the sensitive data therein. To balance it, some SNG generation schemes are proposed by using local differential privacy (LDP) techniques while they do not consider the personalised privacy requirements of users. This paper proposes an SNG generation scheme by designing a personalised LDP method, named SNGPLDP. Specifically, we develop a personalised randomised perturbation mechanism that satisfies is an element of total- PLDP to perturb users' private data. A seed graph creation mechanism and an optimised graph generation mechanism (OGGM) are then designed to generate and optimise the SNG with the perturbed data. Experiments performed on four real datasets show the effectiveness of SNGPLDP in providing PLDP protection with general graph properties. Moreover, the proposed scheme achieves higher network structure cohesion and supports stronger privacy protection than the advanced methods.
引用
收藏
页码:159 / 180
页数:23
相关论文
共 15 条
  • [1] Preserving Differential Privacy in Degree-Correlation based Graph Generation
    Wang, Yue
    Wu, Xintao
    TRANSACTIONS ON DATA PRIVACY, 2013, 6 (02) : 127 - 145
  • [2] Preserving Privacy in Social Network Graph with K-anonymize Degree Sequence Generation
    Bhattacharya, Munmun
    Mani, Papri
    2015 9TH INTERNATIONAL CONFERENCE ON SOFTWARE, KNOWLEDGE, INFORMATION MANAGEMENT AND APPLICATIONS (SKIMA), 2015,
  • [3] Desensitized Financial Data Generation Based on Generative Adversarial Network and Differential Privacy
    Zhang, Fan
    Wang, Luyao
    Zhang, Xinhong
    BIG DATA MINING AND ANALYTICS, 2025, 8 (01): : 103 - 117
  • [4] Applications of Differential Privacy in Social Network Analysis: A Survey
    Jiang, Honglu
    Pei, Jian
    Yu, Dongxiao
    Yu, Jiguo
    Gong, Bei
    Cheng, Xiuzhen
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (01) : 108 - 127
  • [5] Graph-based modelling of query sets for differential privacy
    Inan, Ali
    Gursoy, Mehmet Emre
    Esmerdag, Emir
    Saygin, Yucel
    28TH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT (SSDBM) 2016), 2016,
  • [6] WDP-GAN: Weighted Graph Generation With GAN Under Differential Privacy
    Hou, Lihe
    Ni, Weiwei
    Zhang, Sen
    Fu, Nan
    Zhang, Dongyue
    IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2023, 20 (04): : 5155 - 5165
  • [7] Differential Privacy Images Protection Based on Generative Adversarial Network
    Yang, Ren
    Ma, Xuebin
    Bai, Xiangyu
    Su, Xiangdong
    2020 IEEE 19TH INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS (TRUSTCOM 2020), 2020, : 1688 - 1695
  • [8] Adaptive graph generation based on generalized pagerank graph neural network for traffic flow forecasting
    Guo, Xiaoyu
    Kong, Xiangyuan
    Xing, Weiwei
    Wei, Xiang
    Zhang, Jian
    Lu, Wei
    APPLIED INTELLIGENCE, 2023, 53 (24) : 30971 - 30986
  • [9] Adaptive graph generation based on generalized pagerank graph neural network for traffic flow forecasting
    Xiaoyu Guo
    Xiangyuan Kong
    Weiwei Xing
    Xiang Wei
    Jian Zhang
    Wei Lu
    Applied Intelligence, 2023, 53 : 30971 - 30986
  • [10] Location protection method for mobile crowd sensing based on local differential privacy preference
    Wang, Jian
    Wang, Yanli
    Zhao, Guosheng
    Zhao, Zhongnan
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2019, 12 (05) : 1097 - 1109