期刊文献+

DP2G_(sister):差分隐私社交网络图发布模型

DP2G_(sister): differential privacy publishing model for social network graph
下载PDF
导出
摘要 基于社交网络的用户建模、信息推荐等研究近年来得到快速发展,但社交网络中包含大量的个人敏感信息,直接发布此类数据会严重危害个人隐私,因此,在数据发布前进行有效的隐私保护处理具有重要的研究价值和现实意义。基于马尔科夫链蒙特卡洛(Markov Chain Monte Carlo,MCMC)算法,提出了保护数据免受关系推断攻击的隐私保护数据发布方法 DP2G_(sister)和multiR_DP2G_(sister)。DP2G_(sister)首先利用满足差分隐私约束的MCMC算法对原始社交网络图进行采样,进而计算采样结果的连接概率,最终生成重构的具有隐私保证的社交网络发布图。扩展该方法得到的multiR_DP2G_(sister)适用于增量数据发布中的隐私保护。在两个真实的社交网络数据集上进行的实验结果表明,提出的方法能够兼顾数据可用性与隐私性,且在增量数据发布的隐私保护中也能显示出良好的效果。 The research on social networks based user profiling and information recommendation obtained rapid development in recent years. However, social networks contain a large amount of sensitive personnel information, directly releasing such kind of sensitive information which affects the individual privacy seriously. Therefore, studying on privacy preserving before releasing the social network data has significant impact from viewpoints of both research and practical application. In this paper, based on MCMC (Markov Chain Monte Carlo) algorithm, we propose privacy preserving data publication methods, named DP2Gsister, and muhiR DP2Gsisterwhich protect privacy data from relationship inference at- tack. DP2Gsister, algorithm firstly applies MCMC algorithm which satisfies differential privacy constraint to sample the original social network graph, and then calculates the connection probability of the sampling results. Finally, the algorithm generates the reconstructed social network graph with privacy guarantee before data release.
作者 殷轶平 徐睿峰 Yin Yiping1,2, Xu Ruiteng1(1. School of Computer Science and Technology, Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen 518055, China; 2. College of National Security, University of Harbin Engineering University, Harbin 150001, Chin)
出处 《信息技术与网络安全》 2018年第6期11-17,27,共8页 Information Technology and Network Security
基金 国家重点研发计划(2017YFB0802204)
关键词 差分隐私 隐私发布模型 社交网络 增量发布 differential privacy data publishing model with privacy preserving social network incremental publication
  • 相关文献

参考文献2

二级参考文献13

  • 1Wang C J L, Wang E T, Chen A L P. Anonymization for Multiple Released Social Network Graphs [M] //Advances in Knowledge Discovery and Data Mining. Berlin: Springer, 2013:99-110.
  • 2Liu K, Terzi E. Towards identity anonymization on graphs [C] //Proc o{ the 2008 ACM SIGMOD Int Con{ on Management o{ Data. New York ACM, 2008 93-106.
  • 3Zhou B, Pei J. Preserving privacy in social networks against neighborhood attacks [C]//Proc of the 24th Int Conf on Data Engineering. Piscataway, NJ: IEEE, 2008 506-515.
  • 4Zou L, Chen L, C)zsu M T. K automorphism; A general framework for privacy preserving network publication [J]. The VLDB Journal, 2009, 2(1): 946-957.
  • 5Cheng J, Fu A W, Liu J. K-isomorphism: Privacy preserving network publication against structural attacks [C] //Proc of the 2010 ACM SIGMOD Int Conf on Management of Data. New York.. ACM, 2010:459-470.
  • 6Yuan M, Chen L. Node protection in weighted social networks [C] //Proc of Int Conf on Database Systems for Advanced Applications. Berlin: Springer, 2011 123-137.
  • 7Li Y, Shen H. Anonymizing graphs against weight-based attacks [C] //Proc of the Int Conf on Data Mining Workshops (ICDMW). Piscataway, NJ: IEEE, 2010:491-498.
  • 8Liu X, Yang X. A generalization based approach for anonymizing weighted social network graphs [C] //Proc of Int Conf on Web-Age Information Management. Berlin: Springer, 2011:118-130.
  • 9Yuan M, Chen L, Yu P S. Personalized privacy protection in social networks [J]. The VLDB Journal, 2010, 4(2) : 141- 150.
  • 10Bhagat S, Cormode G, Krishnamurthy B, et al. Class-based graph anonymization for social network data [J]. The VLDB Journal, 2009, 2(1)= 766-777.

共引文献78

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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