Study on utility optimization for randomized response mechanism
Papers|更新时间:2024-06-05
|
Study on utility optimization for randomized response mechanism
Journal on CommunicationsVol. 40, Issue 6, Pages: 74-81(2019)
作者机构:
1. 陕西师范大学计算机科学学院,陕西 西安 710119
2. 陕西师范大学数学与信息科学学院,陕西 西安 710119
3. 贵州大学贵州省公共大数据重点实验室,贵州 贵阳 550025
作者简介:
基金信息:
The National Natural Science Foundation of China(61673251);The Natural Science Foundation of Shaanxi Province(2018JM6050);The Natural Science Foundation of Shaanxi Province(2017JQ6038);The Open Project Fund of Guizhou Provincial Key Laboratory of Public Big Data(2017BDKFJJ026);The Open Project Fund of Guizhou Provincial Key Laboratory of Public Big Data(2018BDKFJJ004);The Fundamental Research Funds for the Central Universities(GK201903091);The Fundamental Research Funds for the Central Universities(GK201903011)
Yihui ZHOU, Laifeng LU, Zhenqiang WU. Study on utility optimization for randomized response mechanism[J]. Journal on Communications, 2019, 40(6): 74-81.
DOI:
Yihui ZHOU, Laifeng LU, Zhenqiang WU. Study on utility optimization for randomized response mechanism[J]. Journal on Communications, 2019, 40(6): 74-81. DOI: 10.11959/j.issn.1000-436x.2019088.
Study on utility optimization for randomized response mechanism
For the study of privacy-utility trade-off in local differential privacy
the utility optimization models of binary generalized random response mechanism for the case of differential privacy and approximate differential privacy were established.By graphic method
optimality proof
software solution and extreme point method
the exact expression of the optimal utility with privacy budget and the distribution of input data was obtained
and the corresponding optimal randomized response mechanism was given.The results show that both the optimal utility and optimal mechanism are related to privacy budget and input data distribution.Moreover
the discussion for multivariate randomized response mechanism shows that the method of extreme points of local differential privacy is feasible to the solution.
关键词
Keywords
references
DWORK C , ROTH A . Thealgorithmic foundations of differential privacy [J ] . Foundations and Trends in Theoretical Computer Science , 2014 , 9 ( 3-4 ): 211 - 407 .
TANG J , KOROLOVAA J , BAI X , et al . Privacy loss inapple’s implementation of differential privacy on MacOS 10.12 [J ] . Cornell University,arXiv Preprint ,arXiv:1709.02753 , 2017 .
ERLINGSSON Ú , PIHUR V , KOROLOVA A . RAPPOR:randomized aggregatable privacy-preserving ordinal response [C ] // The ACM SIGSAC Conference on Computer and Communications Security . ACM , 2014 : 1054 - 1067 .
WARNER S L . Randomized response:a survey technique for eliminating evasive answer bias [J ] . Journal of the American Statistical Association , 1965 , 60 ( 309 ): 63 - 69 .
COMAS J S , FERRER J D . Optimal data-independent noise for differential privacy [J ] . Information Sciences , 2013 , 250 : 200 - 214 .
GENG Q , KAIROUZ P , OH S , et al . The staircase mechanism in differential privacy [J ] . IEEE Journal of Selected Topics in Signal Processing , 2015 , 9 ( 7 ): 1176 - 1184 .
GENG Q , VISWANATH P . The optimal noise-adding mechanism in differential privacy [J ] . IEEE Transactions on Information Theory , 2016 , 62 ( 2 ): 925 - 951 .
GENG Q , VISWANATH P . Optimal noise adding mechanisms for approximate differential privacy [J ] . IEEE Transactions on Information Theory , 2016 , 62 ( 2 ): 952 - 969 .
HOLOHAN N , LEITH D J , MASON O . Optimal differentially private mechanisms for randomized response [J ] . IEEE Transactions on Information Forensics & Security , 2017 , 12 ( 11 ): 2726 - 2735 .
DENG C L . The Principle and Method of Operations Research [M ] . 3rd ed . Wuhan : Huazhong University of Science& Technology PressPress , 2014 .
KAIROUZ P , OH S , VISWANATHP . Extremal mechanisms for local differential privacy [J ] . Journal of Machine Learning Research , 2016 , 4 ( 1 ): 492 - 542 .
HOLOHAN N , LEITHD J , MASON O . Extreme points of the local differential privacy polytope [J ] . Linear Algebra and Its Applications , 2017 , 534 : 78 - 96 .