Near-Optimal Differentially Private Mechanism for Linear Queries

doi:10.13328/j.cnki.jos.005184

	Near-Optimal Differentially Private Mechanism for Linear Queries
	Wu, Gen-Qiang1,2 ; He, Ye-Ping 1,3; Xia, Xian-Yao 1
	2017-09-01
发表期刊	Ruan Jian Xue Bao/Journal of Software
卷号	28 期号:9 页码:2309-2322
摘要	The optimal differentially private mechanism problem is to maximize the data utility on a fixed privacy protection extent. The optimal mechanism problem is an important topic in differential privacy, which has close connection with both theoretical foundation and future applications of differential privacy model. This paper proposes a analyzing method about the topic, which is not based on the sensitivity method. First, the optimal mechanism problem is constructed to be a multi-objective optimization problem, and a new method for constructing differentially private mechanism is introduced. Then, a near-optimal mechanism is provided for the linear queries, which reaches the boundary of the differential privacy inequality. Although this paper focuses on the linear queries, most part of the analyzing method introduced is applicable to the non-linear queries. This paper finds the drawback of the sensitivity method and uncovers some deeper characteristics of differential privacy. © Copyright 2017, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
关键词	Computer software Software engineering Differential privacies Future applications Linear query Multi objective optimization problem Optimal mechanism Privacy protection Sensitivity methods Theoretical foundations
DOI	10.13328/j.cnki.jos.005184
收录类别	EI ; SCOPUS ; 北大核心 ; CSCD
ISSN	10009825
语种	中文
出版者	Chinese Academy of Sciences
EI入藏号	20174604393515
文献类型	期刊论文
条目标识符	http://ir.lzufe.edu.cn/handle/39EH0E1M/990
专题	信息工程与人工智能学院
作者单位	1.National Engineering Research Center of Fundamental Software, Institute of Software, The Chinese Academy of Sciences, Beijing; 2.100190, China; 3.School of Information Engineering, Lanzhou University of Finance and Economics, Lanzhou; 4.730020, China; 5.State Key Laboratory of Computer Science, Institute of Software, The Chinese Academy of Sciences, Beijing; 6.100190, China
推荐引用方式 GB/T 7714	Wu, Gen-Qiang,He, Ye-Ping,Xia, Xian-Yao. Near-Optimal Differentially Private Mechanism for Linear Queries[J]. Ruan Jian Xue Bao/Journal of Software,2017,28(9):2309-2322.
APA	Wu, Gen-Qiang,He, Ye-Ping,&Xia, Xian-Yao.(2017).Near-Optimal Differentially Private Mechanism for Linear Queries.Ruan Jian Xue Bao/Journal of Software,28(9),2309-2322.
MLA	Wu, Gen-Qiang,et al."Near-Optimal Differentially Private Mechanism for Linear Queries".Ruan Jian Xue Bao/Journal of Software 28.9(2017):2309-2322.