南京邮电大学学报（自然科学版）2017，Vol.37Issue(4)：103-112,10.DOI:10.14132/j.cnki.1673-5439.2017.04.017
基于动态区间树的差分隐私数据发布算法
Differential privacy data publishing algorithm based on dynamic interval tree
摘要
Abstract
The application of differential privacy in data released is topical issues of privacy protection in recent years.In the resent studies of the data publishing,there are mainly two lines of thinking.The first one is to add noise after the conversion and the other is to add noise firstly and then convertion.A new way in the field of data publishing is proposed based on the first idea for convering the primary data firstly,then add noises and converse to an interval tree to finish data publishing.In the process of histogram transformation,a new method is presented to construct the interval tree based on arbitrary structure (CRTree algorithm) to improve the query precision.The method transforms the histogram into similar complete k-interval tree and verify the efficiency by comparion analysis of errors of the algorithm.Experimental results show that the algorithm is feasible and effective.关键词
差分隐私/直方图/区间树/数据发布Key words
differential privacy/histogram/interval tree/data publishing分类
信息技术与安全科学引用本文复制引用
李丽,张琳,王汝传..基于动态区间树的差分隐私数据发布算法[J].南京邮电大学学报（自然科学版）,2017,37(4):103-112,10.基金项目
国家自然科学基金(61402241,61572260,61373017,61572261,61472192)、江苏省科技支撑计划(BE2015702)、江苏省自然科学基金优秀青年基金(BK20160089)和南京邮电大学校级科研基金(NY217050)资助项目 （61402241,61572260,61373017,61572261,61472192）
