A Programming Framework for Differential Privacy with Accuracy Concentration Bounds

被引:18
作者
Lobo-Vesga, Elisabet [1 ]
Russo, Alejandro [1 ]
Gaboardi, Marco [2 ]
机构
[1] Chalmers Univ Technol, Gothenburg, Sweden
[2] Boston Univ, Boston, MA 02215 USA
来源
2020 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2020) | 2020年
基金
美国国家科学基金会;
关键词
accuracy; concentration bounds; differential privacy; functional programming; databases; haskell; SENSITIVITY;
D O I
10.1109/SP40000.2020.00086
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Differential privacy offers a formal framework for reasoning about privacy and accuracy of computations on private data. It also offers a rich set of building blocks for constructing private data analyses. When carefully calibrated, these analyses simultaneously guarantee the privacy of the individuals contributing their data, and the accuracy of the data analyses results, inferring useful properties about the population. The compositional nature of differential privacy has motivated the design and implementation of several programming languages aimed at helping a data analyst in programming differentially private analyses. However, most of the programming languages for differential privacy proposed so far provide support for reasoning about privacy but not for reasoning about the accuracy of data analyses. To overcome this limitation, in this work we present DPella, a programming framework providing data analysts with support for reasoning about privacy, accuracy and their trade-offs. The distinguishing feature of DPella is a novel component which statically tracks the accuracy of different data analyses. In order to make tighter accuracy estimations, this component leverages taint analysis for automatically inferring statistical independence of the different noise quantities added for guaranteeing privacy. We evaluate our approach by implementing several classical queries from the literature and showing how data analysts can figure out the best manner to calibrate privacy to meet the accuracy requirements.
引用
收藏
页码:411 / 428
页数:18
相关论文
共 60 条
[1]   Synthesizing Coupling Proofs of Differential Privacy [J].
Albarghouthi, Aws ;
Hsu, Justin .
PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2018, 2 (POPL)
[2]  
[Anonymous], 2009, CONC MEAS ANAL RAND
[3]  
[Anonymous], 2016, ARXIV PREPRINT ARXIV
[4]  
[Anonymous], 2010, P USENIX S NETW SYST
[5]  
[Anonymous], 2016, Psi: a private data sharing interface
[6]  
[Anonymous], 2018, PROC 35 INT C MACH L
[7]  
Barthe G., 2016, P ACM IEEE S LOG COM
[8]   Differentially Private Bayesian Programming [J].
Barthe, Gilles ;
Farina, Gian Pietro ;
Gaboardi, Marco ;
Arias, Emilio Jesus Gallego ;
Gordon, Andy ;
Hsu, Justin ;
Strub, Pierre-Yves .
CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2016, :68-79
[9]   Advanced Probabilistic Couplings for Differential Privacy [J].
Barthe, Gilles ;
Fong, Noemie ;
Gaboardi, Marco ;
Gregoire, Benjamin ;
Hsu, Justin ;
Strub, Pierre-Yves .
CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2016, :55-67
[10]  
Barthe G, 2015, ACM SIGPLAN NOTICES, V50, P55, DOI [10.1145/10.1145/2676726.2677000, 10.1145/2775051.2677000]