Verified Computational Differential Privacy with Applications to Smart Metering

被引:50
作者
Barthe, Gilles [1 ]
Danezis, George [3 ]
Gregoire, Benjamin [2 ]
Kunz, Cesar [1 ]
Zanella-Beguelin, Santiago [3 ]
机构
[1] IMDEA Software Inst, Madrid, Spain
[2] INRIA, Sophia Antipolis, France
[3] Microsoft Res, Cambridge, England
来源
2013 IEEE 26TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF) | 2013年
关键词
D O I
10.1109/CSF.2013.26
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
EasyCrypt is a tool-assisted framework for reasoning about probabilistic computations in the presence of adversarial code, whose main application has been the verification of security properties of cryptographic constructions in the computational model. We report on a significantly enhanced version of EasyCrypt that accommodates a richer, user-extensible language of probabilistic expressions and, more fundamentally, supports reasoning about approximate forms of program equivalence. This enhanced framework allows us to express a broader range of security properties, that notably include approximate and computational differential privacy. We illustrate the use of the framework by verifying two protocols: a two-party protocol for computing the Hamming distance between bit-vectors, yielding two-sided privacy guarantees; and a novel, efficient, and privacy-friendly distributed protocol to aggregate smart meter readings into statistics and bills.
引用
收藏
页码:287 / 301
页数:15
相关论文
共 46 条
[31]  
Jawurek Marek, 2012, Privacy Enhancing Technologies. Proceedings 12th International Symposium, PETS 2012, P221, DOI 10.1007/978-3-642-31680-7_12
[32]  
Jawurek M, 2011, LECT NOTES COMPUT SC, V6794, P192, DOI 10.1007/978-3-642-22263-4_11
[33]  
Kursawe K, 2011, ICISR11002 RADB U NI
[34]  
Kursawe K, 2011, LECT NOTES COMPUT SC, V6794, P175, DOI 10.1007/978-3-642-22263-4_10
[35]  
McGregor A., 2011, ELECT C COMPUTATIONA, P106
[36]  
McSherry F, 2009, ACM SIGMOD/PODS 2009 CONFERENCE, P19
[37]   Translating higher-order clauses to first-order clauses [J].
Meng, Jia ;
Paulson, Lawrence C. .
JOURNAL OF AUTOMATED REASONING, 2008, 40 (01) :35-60
[38]  
Mironov I, 2009, LECT NOTES COMPUT SC, V5677, P126, DOI 10.1007/978-3-642-03356-8_8
[39]   Verification of Information Flow and Access Control Policies with Dependent Types [J].
Nanevski, Aleksandar ;
Banerjee, Anindya ;
Garg, Deepak .
2011 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2011), 2011, :165-179
[40]  
Paillier P, 1999, LECT NOTES COMPUT SC, V1592, P223