期刊文献+

基于分布式多关联属性的高维数据差分隐私保护方法

Differential privacy protection method of multi-associated attribute based on distributed high dimensional data
下载PDF
导出
摘要 针对高维数据发布的过程中存在由多关联属性引发的隐私信息泄露风险问题,在分布式环境下提出一种满足差分隐私保护的多关联属性高维数据发布方法(HDMPDP)。根据数据维度,提出一种基于分布式划分的粗糙集高效降维方法,完成对高维复杂数据特征属性的划分,降低数据维度的同时提高处理效率;设计属性分类准则,利用属性信息熵改进关联分析方法;对得到的属性分别进行加噪,优化噪声添加的方式,减轻关联属性带来的隐私问题。在Spark分布式框架下实现隐私保护数据发布,通过高维数据实验验证了该方法的有效性和隐私保护的安全性。 To solve the problem of privacy information leakage caused by multi associated attributes in the publishing process of high-dimensional data sets,a multi associated attribute high-dimensional data privacy protection method(HDMPDP)was proposed in distributed environment.According to the data dimension,an efficient dimensionality reduction method of rough set based on distributed partition was proposed,to complete the division of high-dimensional complex data feature attributes,reduce the data dimension and improve the processing efficiency.The attribute classification criterion was designed,and the attribute information entropy was used.The associated analysis method was improved.The noise was added to the obtained attributes respectively,the way of adding noise was optimized,and the privacy problem caused by associated attributes was alleviated.The privacy-preserving data release was realized under the Spark distributed framework,and the effectiveness of the method and the security of privacy-preserving were verified through high-dimensional data experiments.
作者 褚治广 李俊燕 陈昊 张兴 CHU Zhi-guang;LI Jun-yan;CHEN Hao;ZHANG Xing(Faculty of Information Technology,Beijing University of Technology,Beijing 100124,China;Key Laboratory of Security for Network and Data in Industrial Internet of Liaoning Province,Liaoning University of Technology,Jinzhou 121001,China)
出处 《计算机工程与设计》 北大核心 2024年第4期967-973,共7页 Computer Engineering and Design
基金 国家自然科学基金项目(61802161) 辽宁省教育厅科学研究基金项目(JZL202015404、LJKZ0625)。
关键词 高维数据 多关联属性 差分隐私 分布式 关联分析 粗糙集 隐私保护 high dimensional data multi-associated attribute differential privacy distributed association analysis rough set privacy protection
  • 相关文献

参考文献10

二级参考文献115

  • 1孙慧中,杨健宇,程祥,苏森.一种基于随机投影的本地差分隐私高维数值型数据收集算法[J].大数据,2020,6(1):3-11. 被引量:3
  • 2张自力,秦其明,董开发,张泽勋,贾兵.基于ArcSDE的空间数据库设计与实现[J].微计算机信息,2007,23(33):133-135. 被引量:18
  • 3Savasere A, Omieeinski ER, Navathe SB. An efficient algorithm for mining association rules in large databases. In: Proc. of the 21th Int'l Conf. on Very Large Data Bases (VLDB). San Francisco: Morgan Kaufmann Publishers, 1995. 432-444.
  • 4Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Proc. of the 20th Int'l Conf. on Very Large Data Bases (VLDB). San Mateo: Morgan Kaufmann Publishers, 1994. 487-499.
  • 5Adar E, Weld DS, Bershad BN, Gribble SD. Why we search: Visualizing and predicting user behavior. In: Proc. of the 16th Int'l Conf. on World Wide Web. Banff: ACM Press, 2007. 161-170. [doi: 10.1145/1242572.1242595].
  • 6Sweeney L. K-Anonymity: A model for protecting privacy. Int'l Journal of Uncertainty Fuzziness and Knowledge Based Systems, 2002,10(5):557-570. [doi: 10.1142/S0218488502001648].
  • 7Machanavajjhala A, Gehrke J, Kifer D, Venkitasubramaniam M. L-Diversity: Privacy beyond k-anonymity. ACM Trans. on Knowledge Discovery from Data (TKDD), 2007,1 (1):3. Idol: 10.1145/1217299.1217302].
  • 8Fung BCM, Wang K, Chen R, Yu PS. Privacy preserving data publishing: A survey of recent developments. ACM Computing Surveys, 2010,42(4): 1-53. [doi: 10.1145/1749603.1749605].
  • 9Hong Y, Vaidya J, Lu HB, Wu MR. Differentially private search log sanitization with optimal output utility. In: Proc. of the 15th Int'l Conf. on Extending Database Technology. Berlin: ACM Press, 2012.50-61. [doi: 10.1145/2247596.2247604].
  • 10He Y, Naughton .IF. Anonymization of set-valued data via top-down, local generalization. Proc. of the VLDB Endowment, 2009, 2(1):934-945. Idol: 10.14778/1687627.1687733].

共引文献47

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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