Privacy-preserving Graph Neural Network Recommendation System Based on Negative Database

被引:0
|
作者
Zhao, Dong-Dong [1 ,2 ]
Xu, Hu [1 ]
Peng, Si-Yun [1 ]
Zhou, Jun-Wei [1 ]
机构
[1] School of Computer Science and Artificial Intelligence, Wuhan University of Technology, Wuhan
[2] Chongqing Research Institute, Wuhan University of Technology, Chongqing
来源
Ruan Jian Xue Bao/Journal of Software | 2024年 / 35卷 / 08期
关键词
graph data; graph neural network; negative database; privacy preservation; recommendation system;
D O I
10.13328/j.cnki.jos.007124
中图分类号
学科分类号
摘要
Graph data is a kind of data composed of nodes and edges, which models the entities as the nodes, nodes may be connected by edges, and edge indicates a relationship between entities. By analyzing and mining these data, a lot of valuable information can be revealed. Meanwhile, it also brings risks of privacy information disclosure for every entity in the graph. To address this issue, a graph data publishing method is proposed based on the negative database (NDB). This method transforms the structural characteristics of the graph data into the encoding format of a negative database. Based on this, a generation method for perturbed graphs (NDB-Graph) is designed. Since NDB is a privacy-preserving technique that does not explicitly store the original data and is difficult to reverse, the published graph data ensures the security of the original graph data. Besides, due to the high efficiency of graph neural network in relation feature processing in graph data, it is widely used in various task processing modeling on graph data, such as recommendation system. a graph neural network recommendation system is also proposed based on NDB technology to protect the privacy of graph data for each user. Compared with publishing method PBCN, the proposed method outperforms it in most cases in experiments on the Karate and Facebook datasets. For example, on Facebook datasets, the smallest L1-error of degree distribution is only 6, which is about 2.6% lower than the PBCN method under the same privacy level, the worst case is about 1 400, which is about 46.5% lower than the PBCN method under the same privacy level. The experiment of collaborative filtering based on LightGCN also demonstrates that the proposed privacy protection method has high precision. © 2024 Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码:3698 / 3720
页数:22
相关论文
共 46 条
  • [1] Zhao G, Wang QG, Yao F, Et al., A survey of large-scale graph neural network systems, Ruan Jian Xue Bao/Journal of Software, 33, 1, pp. 150-170, (2022)
  • [2] Abawajy JH, Ninggal MIH, Herawan T., Privacy preserving social network data publication, IEEE Communications Surveys and Tutorials, 18, 3, pp. 1974-1997, (2016)
  • [3] Li XY, Zhang CH, Jung T, Et al., Graph-based privacy preserving data publication, Proc. of the 35th Annual IEEE Int’l Conf. on Computer Communications (INFOCOM 2016), pp. 1-9, (2016)
  • [4] Dwork C., The differential privacy frontier, Proc. of the Theory of Cryptography Conf, pp. 496-502, (2009)
  • [5] Hay M, Li C, Miklau G, Et al., Accurate estimation of the degree distribution of private networks, Proc. of the 9th IEEE Int’l Conf. on Data Mining, pp. 169-178, (2009)
  • [6] Esponda F., Everything that is not important: Negative databases, IEEE Computational Intelligence Magazine, 3, 2, pp. 60-63, (2008)
  • [7] Esponda F, Forrest S, Helman P., Enhancing privacy through negative representations of data, pp. 72-84, (2004)
  • [8] Dasgupta D, Saha S., Password security through negative filtering, Proc. of the 2010 Int’l Conf. on Emerging Security Technologies, pp. 83-89, (2010)
  • [9] Zhao DD, Luo WJ, Liu R, Et al., Negative iris recognition, IEEE Trans. on Dependable and Secure Computing, 15, 1, pp. 112-125, (2015)
  • [10] Zhao DD, Luo WJ., Real-Valued negative databases, Proc. of the Artificial Life Conf, pp. 884-890, (2013)