期刊文献+

基于二分关联图的大数据隐私保护方法 被引量:5

Group big data privacy protection based on binary association graph
在线阅读 下载PDF
导出
摘要 针对目前大数据缺乏群组隐私保护的问题,提出一种基于二分关联图的大数据群组隐私保护方法,在不同群组隐私层级的二分关联图中保护数据隐私。所提算法通过关联图分层(association graph layering,AGL)和层级群组差分隐私(hierarchical group differential privacy,HGDP),实现发布大数据的群组隐私保护。关联图分层将给定关联图的节点和边分组,通过划分二分关联图的节点最小化每个层级的敏感度,可以向不同权限的用户公开不同层级的子图;在层级群组差分隐私过程中,对不同层级选择灵敏度并计算方差,重复聚合噪声减少方差,通过高斯机制进行子图噪声注入,实现分层关联图的扰动,以保证每个层级的群组隐私。实验结果表明,所提方法可以用来保护群组数据的综合敏感信息,并且比其他方法具有更好的隐私保护效果和更高的数据可用性。 In order to solve the problem of lack of group privacy protection in big data,we propose a big data group privacy protection method based on bipartite association graph to protect data privacy in binary association graph at different group privacy levels.The proposed algorithm implements group privacy protection for publishing big data through association graph layering(AGL)and hierarchical group differential privacy(HGDP).The association graph layering will group the nodes and edges of the given association graph.By dividing the nodes of the binary association graph to minimize the sensitivity of each level,different levels of subgraphs can be exposed to users with different permissions.In the process of hierarchical group differential privacy,the sensitivities of different levels are selected and the variance is calculated,and the noise is aggregated repeatedly to reduce the variance.The noise annotation of the subgraph is carried out by Gaussian mechanism.In order to guarantee the group privacy of each level,the hierarchical association graph is disturbed.The experimental results show that the proposed method can be used to protect the comprehensive sensitive information of group data,and has better privacy protection effect and higher data availability than other methods.
作者 田华 何翼 TIAN Hua;HE Yi(School of Big Data Science,Tongren University,Tongren 554300,P.R.China)
出处 《重庆邮电大学学报(自然科学版)》 CSCD 北大核心 2020年第4期673-680,共8页 Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
基金 贵州省教育厅创新群体重大研究项目(黔教合KY字[2016]051)。
关键词 二分关联图 大数据 关联图分层 层级群组差分隐私 binary association graph big data association graph layering hierarchical group differential privacy
  • 相关文献

参考文献9

二级参考文献54

  • 1WANG Y, XIE L, ZHENG B, et al. Utitily- Oritented k- anony- mization on social network[ C]//Proc of the 16th Int'l Conf On- Database Systems for Advanced Application, Hong Kong, China: DASFAA, 2011:78-92.
  • 2LIU K, TERZI E.Towards Identity Anonymization on Graphs [ C ]// Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, Vancouver, Canada : ACM , 2008 : 93-106.
  • 3ZHOU B, PEI J.Preserving privacy in social networks against neigh- borhood attacks [ C ]//Proceedings of the 24th IEEE International Conference on Data Engineering ( ICDE "08 ), Cancun, Mexico: IEEE Computer Society, 2008 : 506-515.
  • 4ZHOU B, PEI J. The k- anonymity and 1- diversity approaches forprivacy preservation in social networks against neighborhood attacks[J].Knowledge and Information System,2011,28( 1 ) :47-77.
  • 5ZOU L, CHEN L, OZSU M T. k-automorphism: a general frame- work for privacy preserving graph publication [ C ]// Proc of the VLDB Endowment, Lyon ,France: ACM,2009:946-954.
  • 6A Campan, T M Truta. Data and structural k-anonymity in social graphs [ J ].Lecture Notes in Computer Science, 2008,5456 : 33- 54.
  • 7Jordi Casas-Roma, Jordi Herrera-Joancomarti, Vicena Torra. Evo- lutionary Algorithm for Graph Anonymization[ DB/OL]. (2014-03 -26).http ://arxiv.org/pdf/1310.0229v2.pdf.
  • 8D E Knuth.The Stanford GraphBase: A Platform for Combinatorial Computing[ M]. Boston:Addison-Wesley Professional, 1993.
  • 9CHENG J, FU A W, LIU J. K- isomorphism: Privacy Preserving Network Publication Against Structural Attacks [ C ] //Proceedings of the 2010 International Conference on Management of Data, In- dianapolis, USA : ACM,2010:459-470.
  • 10Panda G K, Mitra A, Prasad A, et al. Applying 1- diversity in anony - mizing collaborative social network[J].International Journal of Computer Science and Information Security, 2010, 8 (2) :324-329.

共引文献75

同被引文献83

引证文献5

二级引证文献44

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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