Approximation method of multiple consistency constraint under differential privacy

Jianping CAI; Ximeng LIU; Jinbo XIONG; Zuobin YING; Yingjie WU

doi:10.11959/j.issn.1000-436x.2021122

您当前的位置：

首页 >

文章列表页 >

Approximation method of multiple consistency constraint under differential privacy

Papers | 更新时间：2024-06-05

- Approximation method of multiple consistency constraint under differential privacy
- Journal on Communications Vol. 42, Issue 6, Pages: 107-117(2021)
- 作者机构：
  
  1. 福州大学数学与计算机科学学院，福建福州 350108
  2. 福建师范大学数学与信息学院，福建福州 350117
  3. 新加坡南洋理工大学电气与电子工程学院，新加坡 639798
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(62072109);The National Natural Science Foundation of China(U1804263);The National Natural Science Foundation of China(61702105);The National Natural Science Foundation of China(62002062)
- DOI：10.11959/j.issn.1000-436x.2021122
  CLC： TP309
- Online First：2021-06，
  
  Published：25 June 2021
- 稿件说明：
移动端阅览
Jianping CAI, Ximeng LIU, Jinbo XIONG, et al. Approximation method of multiple consistency constraint under differential privacy[J]. Journal on Communications, 2021, 42(6): 107-117.
DOI：

Jianping CAI, Ximeng LIU, Jinbo XIONG, et al. Approximation method of multiple consistency constraint under differential privacy[J]. Journal on Communications, 2021, 42(6): 107-117. DOI： 10.11959/j.issn.1000-436x.2021122.

摘要

为了解决差分隐私下多重一致性约束的最优发布问题，通过分析最优一致性发布原理提出了多重一致性约束问题的逼近方法。所提方法的主要思想是将一致性约束问题划分为多个一致性约束子问题，通过反复独立地求解各一致性约束子问题实现原问题的最优一致性发布。其优势在于一致性约束问题划分之后，子问题往往更容易求解或者实现子问题最优一致性发布的技术已相当成熟，从而能够解决更加复杂的差分隐私最优发布问题。分析论证了逼近方法的收敛性，保证任意一致性约束子问题的划分均能实现原问题的最优一致性发布。并且，以销量直方图发布为例，基于多重一致性约束问题的逼近方法设计了差分隐私餐馆销量直方图一致性并行发布算法。实验表明，该算法相比通用解法可提升效率高达400倍，并且具备处理百万级大规模数据的能力。

Abstract

Under differential privacy

to solve the optimal publishing problem with multiple consistency constraints

an approximation method of multiple consistency constraints was proposed by the theoretical analysis of the principle of optimal consistency release.The main idea was to divide the consistency constraint problem into several consistency constraint sub-problems and then achieve the original problem's optimal consistency release by solving each consistency constraint sub-problem repeatedly and independently.The advantage was that after the consistency constraint problem divided

the sub-problems were often easier to solve

or the technology to achieve optimal and consistent release of sub-problems is quite mature.Therefore more complex differential privacy optimal release problem could be solved.After analysis

the approximation method's convergence was fully demonstrated

ensuring that any partition of consistency constrained sub-problems can always achieve the optimal consistency release of the original problem.Furthermore

taking the sales histogram publishing as an example

based on the approximation method of multiple consistency constraints

a parallel algorithm was designed with optimal consistency release under differential privacy.The experimental results show that the algorithm's efficiency is 400 times higher than that of the general solution

and the algorithm can process millions of large-scale data.

关键词

Keywords

references

DWORK C , . Differential privacy [C ] // The 33rd International Conference on Automata,Languages and Programming - Volume Part II . Berlin:Springer , 2006 : 1 - 12 .

HAY M , RASTOGI V , MIKLAU G , et al . Boosting the accuracy of differentially private histograms through consistency [J ] . Proceedings of the VLDB Endowment , 2010 , 3 ( 1/2 ): 1021 - 1032 .

吴英杰 , 陈鸿 , 王一蕾 , 等 . 面向任意区间树结构的差分隐私直方图发布算法 [J ] . 模式识别与人工智能 , 2015 , 28 ( 12 ): 1084 - 1092 .

WU Y J , CHEN H , WANG Y L , et al . A differentially private histogram publication algorithm for arbitrary range tree structure [J ] . Pattern Recognition and Artificial Intelligence , 2015 , 28 ( 12 ): 1084 - 1092 .

孙岚 , 康健 , 吴英杰 , 等 . 异方差加噪下差分隐私流数据发布一致性优化算法 [J ] . 清华大学学报(自然科学版) , 2019 , 59 ( 3 ): 203 - 210 .

SUN L , KANG J , WU Y J , et al . Consistency optimization algorithm for differential privacy streaming data publication with non-uniform private budgets [J ] . Journal of Tsinghua University (Science and Technology) , 2019 , 59 ( 3 ): 203 - 210 .

贾俊杰 , 陈慧 , 马慧芳 , 等 . 差分隐私的查询一致性约束研究 [J ] . 计算机工程与科学 , 2020 , 42 ( 1 ): 71 - 79 .

JIA J J , CHEN H , MA H F , et al . Query consistency constraints of differential privacy [J ] . Computer Engineering ＆ Science , 2020 , 42 ( 1 ): 71 - 79 .

LEE J , WANG Y , KIFER D . Maximum likelihood postprocessing for differential privacy under consistency constraints [C ] // The 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . New York:ACM Press , 2015 : 635 - 644 .

张双越 , 蔡剑平 , 田丰 , 等 . 差分隐私下满足一致性的轨迹流量发布方法 [J ] . 计算机科学与探索 , 2018 , 12 ( 12 ): 1903 - 1913 .

ZHANG S Y , CAI J P , TIAN F , et al . Trajectory flow releasing method with consistency constraint under differential privacy [J ] . Journal of Frontiers of Computer Science and Technology , 2018 , 12 ( 12 ): 1903 - 1913 .

CORMODE G , PROCOPIUC C , SRIVASTAVA D , et al . Differentially private spatial decompositions [J ] . arXiv Preprint,arXiv:1103.5170 , 2011 .

DWORK C , KENTHAPADI K , MCSHERRY F , et al . Our data,ourselves:privacy via distributed noise generation [C ] // Advances in Cryptology - EUROCRYPT 2006 . Berlin:Springer , 2006 : 486 - 503 .

DWORK C , MCSHERRY F , NISSIM K , et al . Calibrating noise to sensitivity in private data analysis [C ] // Theory of Cryptography Conference . Berlin:Springer , 2006 : 265 - 284 .

LI C , HAY M , RASTOGI V , et al . Optimizing linear counting queries under differential privacy [C ] // The 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems of Data . New York:ACM Press , 2010 : 123 - 134 .

LEE J , CLIFTON C W . Top-k frequent itemsets via differentially private FP-trees [C ] // The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . New York:ACM Pree , 2014 : 931 - 940 .

CORMODE G , PROCOPIUC C , SRIVASTAVA D , et al . Differentially private spatial decompositions [C ] // 2012 IEEE 28th International Conference on Data Engineering . Piscataway:IEEE Press , 2012 : 20 - 31 .

DWYER P S , RAO C R , MITRA S K . Generalized inverse of matrices and its applications [J ] . Journal of the American Statistical Association , 1973 , 68 ( 341 ): 239 .

GRAYBILL F A , MEYER C D , PAINTER R J . Note on the computation of the generalized inverse of a matrix [J ] . SIAM Review , 1966 , 8 ( 4 ): 522 - 524 .

PENROSE R . A generalized inverse for matrices [J ] . Mathematical Proceedings of the Cambridge Philosophical Society , 1955 , 51 ( 3 ): 406 - 413 .

TÜRKMEN R , GÖKBAŞ H . On the spectral norm of r-circulant matrices with the Pell and Pell-Lucas numbers [J ] . Journal of Inequalities and Applications , 2016 , 2016 ( 1 ): 1 - 7 .

CHEN Y , MACHANAVAJJHALA A , HAY M , et al . PeGaSus:dataadaptive differentially private stream processing [C ] // The 2017 ACM SIGSAC Conference on Computer and Communications Security . New York:ACM Press , 2017 : 1375 - 1388 .

QARDAJI W , YANG W N , LI N H . Understanding hierarchical methods for differentially private histograms [J ] . Proceedings of the VLDB Endowment , 2013 , 6 ( 14 ): 1954 - 1965 .

Views

1850

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Personalized trajectory privacy protection method based on fuzzy sensitivity quantification in MEC

Trajectory reconstruction attacks on differential privacy based on a CNN-BiLSTM-Attention hybrid model

Federated learning with differential privacy recalibration for dynamic computing nodes

Assessment method on protection effectiveness of differential privacy algorithms based on fuzzy influence diagram

DAGUARD: distributed backdoor attack defense scheme under federated learning

Related Author

Jiang Zhongyuan

Fang Mengxin

Wang Qizhou

Ma Jianfeng

Li Xinghua

XIE Lixia

ZHAO Erkang

YANG Hongyu

Related Institution

School of Telecommunication, Xi’an Jiaotong University

School of Cyber Engineering, Xidian University

Purple Mountain Laboratories

School of Safety Science and Engineering, Civil Aviation University of China

School of Computer Science and Technology, Civil Aviation University of China

AI问答

⁰