JISE


  [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14]


Journal of Information Science and Engineering, Vol. 40 No. 1, pp. 125-150


An Uncertain Graph Method based on Shuffle Model to Preserve Link Privacy of Mobile Social Networks


JUN YAN1,2, WEN-LI WANG3, ZHEN-QIANG WU1,+, LAI-FENG LU3 AND YI-HUI ZHOU1
1School of Computer Science
3School of Mathematics and Statistics
Shaanxi Normal University
Xi'an, 710119 P.R. China

2School of Mathematics and Computer Applications
Shangluo College
Shangluo, 72600 P.R. China
E-mail: {yanrongjunde; zqiangwu
+; lulaifeng; zhouyihui}@snnu.edu.cn; 1272369927@qq.com


With the rapid development of mobile wireless technology, mobile social networks play a key role in people’s online life. However, a large amount of data containing indi-vidual relationship information in mobile social networks will result in the leakage of in-dividual privacy. Therefore, how to prevent privacy disclosure of these network data while sharing them to improve services for users is urgent. In order to improve the effec-tiveness of differential privacy, an uncertain graph method based on the shuffle model is proposed. Especially, the shuffle model is introduced to modify the relationships of nodes, which not only provides differential privacy preserving for the link privacy of nodes, but also improves the data utility of differential privacy. Moreover, node differen-tial privacy is utilized to inject uncertainty on edges, which can reduce perturbations caused by differential privacy. In addition, the exponential mechanism is used to restrict the edge modification in the original graph. The theoretical analysis shows that the un-certain method satisfies differential privacy. The results of experiments show that the uncertain method can effectively preserve link privacy of nodes and maintain data utility.


Keywords: mobile social networks, link privacy, differential privacy, shuffle model, uncertain graph

  Retrieve PDF document (JISE_202401_09.pdf)