期刊文献+

A Privacy Preservation Method for Attributed Social Network Based on Negative Representation of Information

下载PDF
导出
摘要 Due to the presence of a large amount of personal sensitive information in social networks,privacy preservation issues in social networks have attracted the attention of many scholars.Inspired by the self-nonself discrimination paradigmin the biological immune system,the negative representation of information indicates features such as simplicity and efficiency,which is very suitable for preserving social network privacy.Therefore,we suggest a method to preserve the topology privacy and node attribute privacy of attribute social networks,called AttNetNRI.Specifically,a negative survey-based method is developed to disturb the relationship between nodes in the social network so that the topology structure can be kept private.Moreover,a negative database-based method is proposed to hide node attributes,so that the privacy of node attributes can be preserved while supporting the similarity estimation between different node attributes,which is crucial to the analysis of social networks.To evaluate the performance of the AttNetNRI,empirical studies have been conducted on various attribute social networks and compared with several state-of-the-art methods tailored to preserve the privacy of social networks.The experimental results show the superiority of the developed method in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topology disturbing and attribute hiding parts.The experimental results show the superiority of the developed methods in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topological interference and attribute-hiding components.
出处 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第7期1045-1075,共31页 工程与科学中的计算机建模(英文)
基金 supported by the National Natural Science Foundation of China(Nos.62006001,62372001) the Natural Science Foundation of Chongqing City(Grant No.CSTC2021JCYJ-MSXMX0002).
  • 相关文献

参考文献2

二级参考文献21

  • 1Esponda E Everything that is not important: negative databases [re- search frontier]. IEEE Computational Intelligence Magazine, 2008, 3(2): 60-63.
  • 2Esponda F, Forrest S, Helman P. Enhancing privacy through negative representations of data. Technical Report, DTIC Document. 2004.
  • 3Esponda F, Forrest S, Helman R Negative representations of informa- tion. International Journal of Information Security, 2009, 8(5): 331- 345.
  • 4Esponda F, Ackley E S, Helman P, Jia H, Forrest S. Protecting data privacy through hard-to-reverse negative databases. International Journal of Information Security, 2007, 6(6): 403-415.
  • 5Liu R, Luo W, Wang X. A hybrid of the prefix algorithm and the q-hidden algorithm for generating single negative databases. In: Pro- ceedings of 2011 IEEE Symposium on Computational Intelligence in Cyber Security (CICS). 2011, 31-38.
  • 6Jia H, Moore C, Strain D. Generating hard satisfiable formulas by hid- ing solutions deceptively. Journal of Artificial Intelligence Research, 2007, 28(1): 107-118.
  • 7Jia H, Moore C, Strain D. Generating hard satisfiable formulas by hid- ing solutions deceptively. In: Proceedings of the National Conference on Artificial Intelligence. 2005, 384.
  • 8Esponda F. Negative surveys, arXiv preprint math.ST/0608176. 2006.
  • 9Bao Y, Luo W, Zhang X. Estimating positive surveys from negative surveys. Statistics & Probability Letters, 2013, 83(2): 551-558.
  • 10Xie H, Kulik L, Tanin E. Privacy-aware collection of aggregate spatial data. Data & Knowledge Engineering, 2011, 70(6): 576--595.

共引文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部