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
相关论文
共 50 条
  • [31] Privacy-Preserving Approach PBCN in Social Network With Differential Privacy
    Huang, Haiping
    Zhang, Dongjun
    Xiao, Fu
    Wang, Kai
    Gu, Jiateng
    Wang, Ruchuan
    IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2020, 17 (02): : 931 - 945
  • [32] Uncertain Graph method based on Triadic Closure Improving Privacy Preserving in Social Network
    Yan, Jun
    Zhang, Lin
    Shi, Wuchao
    Hu, Jing
    Wu, Zhenqiang
    2017 INTERNATIONAL CONFERENCE ON NETWORKING AND NETWORK APPLICATIONS (NANA), 2017, : 190 - 195
  • [33] Personalized sampling graph collection with local differential privacy for link prediction
    Linyu Jiang
    Yukun Yan
    Zhihong Tian
    Zuobin Xiong
    Qilong Han
    World Wide Web, 2023, 26 : 2669 - 2689
  • [34] Personalized sampling graph collection with local differential privacy for link prediction
    Jiang, Linyu
    Yan, Yukun
    Tian, Zhihong
    Xiong, Zuobin
    Han, Qilong
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2023, 26 (05): : 2669 - 2689
  • [35] Statistics Collecting Algorithms of Distributed Graph via Local Differential Privacy
    Fu, Peiwang
    Ding, Hongfa
    Liu, Hai
    Jiang, Heling
    Tang, Mingli
    Yu, Yingying
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2024, 61 (07): : 1643 - 1669
  • [36] GC-NLDP: A graph clustering algorithm with local differential privacy
    Fu, Nan
    Ni, Weiwei
    Zhang, Sen
    Hou, Lihe
    Zhang, Dongyue
    COMPUTERS & SECURITY, 2023, 124
  • [37] Local perturbation of critical subgraph based social network structural privacy protection
    Chen, Dongdong
    Wang, Yong
    Qu, Lianwei
    Yang, Jing
    KNOWLEDGE-BASED SYSTEMS, 2024, 301
  • [38] Graph publishing method based on differential privacy protection
    王俊丽
    Yang Li
    Wu Yuxi
    Guan Min
    High Technology Letters, 2018, 24 (02) : 134 - 141
  • [39] Graph-based Clustering under Differential Privacy
    Pinot, Rafael
    Morvan, Anne
    Yger, Florian
    Gouy-Pailler, Cedric
    Atif, Jamal
    UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, 2018, : 329 - 338
  • [40] Protecting the privacy of social network data using graph correction
    Toroghi, Amir Dehaki
    Hamidzadeh, Javad
    KNOWLEDGE AND INFORMATION SYSTEMS, 2024, 66 (09) : 5151 - 5183