Probabilistic relational reasoning for differential privacy

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2012, Pages 97-109

  Barthe, Gilles ^a   Köpf, Boris ^a   Olmedo, Federico ^a   Béguelin, Santiago Zanella ^a  

^a IMDEA SOFTWARE INSTITUTE   (Spain)

Author keywords

Coq proof assistant; Differential privacy; Relational Hoare logic

Indexed keywords

CENTRAL COMPONENT; COQ PROOF ASSISTANT; DIFFERENTIAL PRIVACIES; ERROR PRONES; FIRST-PRINCIPLES; FORMAL ANALYSIS; HOARE LOGIC; LAPLACIANS; LINEAR TYPES; MACHINE-CHECKED PROOFS; OPEN PROBLEMS; PRIVATE DATA; RELATIONAL REASONING; STREAMING ALGORITHM; TOOL SUPPORT;

COMPUTER PROGRAMMING LANGUAGES;

STATIC ANALYSIS;

EID: 84857867264     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2103656.2103670     Document Type: Conference Paper

References (35)

1. P. Audebaud and C. Paulin-Mohring. Proofs of randomized algorithms in Coq. Sci. Comput. Program., 74(8):568-589, 2009.
2. G. Barthe and B. Köpf. Information-theoretic bounds for differentially private mechanisms. In 24rd IEEE Computer Security Foundations Symposium, CSF 2011, pages 191-204, Los Alamitos, 2011. IEEE Computer Society.
3. G. Barthe, B. Grégoire, and S. Zanella Béguelin. Formal certification of code-based cryptographic proofs. In 36th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages, POPL 2009, pages 90-101, New York, 2009. ACM.
4. G. Barthe, B. Grégoire, S. Heraud, and S. Zanella Béguelin. Computer-aided security proofs for the working cryptographer. In Ad-vances in Cryptology - CRYPTO 2011, volume 6841 of Lecture Notes in Computer Science, pages 71-90, Heidelberg, 2011. Springer.
5. A. Beimel, K. Nissim, and E. Omri. Distributed private data analysis: Simultaneously solving how and what. In Advances in Cryptology -CRYPTO 2008, volume 5157 of Lecture Notes in Computer Science, pages 451-468, Heidelberg, 2008. Springer.
6. M. Bellare and P. Rogaway. The security of triple encryption and a framework for code-based game-playing proofs. In Advances in Cryptology - EUROCRYPT 2006, volume 4004 of Lecture Notes in Computer Science, pages 409-426, Heidelberg, 2006. Springer. (Pubitemid 44072253)
7. N. Benton. Simple relational correctness proofs for static analyses and program transformations. In 31st ACMSIGPLAN-SIGACT symposium on Principles of Programming Languages, POPL 2004, pages 14-25, New York, 2004. ACM.
8. T.-H. H. Chan, E. Shi, and D. Song. Private and continual release of statistics. In 37th International colloquium on Automata, Languages and Programming, ICALP 2010, volume 6199 of Lecture Notes in Computer Science, pages 405-417, Heidelberg, 2010. Springer.
9. S. Chaudhuri, S. Gulwani, R. Lublinerman, and S. Navidpour. Proving programs robust. In 8th joint meeting of the European Software Engi-neering Conference and the ACM SIGSOFT International Symposium on Foundations of Software Engineering, ESEC/FSE '11. ACM, 2011.
10. D. Clark, S. Hunt, and P. Malacaria. A static analysis for quantifying information flow in a simple imperative language. Journal of Computer Security, 15(3):321-371, 2007. (Pubitemid 46868450)
11. M. R. Clarkson and F. B. Schneider. Hyperproperties. Journal of Computer Security, 18(6):1157-1210, 2010.
12. J. Desharnais, F. Laviolette, and M. Tracol. Approximate analysis of probabilistic processes: Logic, simulation and games. In 5th International Conference on Quantitative Evaluation of Systems, QEST 2008, pages 264-273. IEEE Computer Society, 2008.
13. C. Dwork. Differential privacy. In 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006, volume 4052 of Lecture Notes in Computer Science, pages 1-12, Heidelberg, 2006. Springer. (Pubitemid 44113232)
14. C. Dwork. Differential privacy: A survey of results. In Theory and Applications of Models of Computation, volume 4978 of Lecture Notes in Computer Science, pages 1-19, Heidelberg, 2008. Springer.
15. C. Dwork. A firm foundation for private data analysis. Commun. ACM, 54(1):86-95, January 2011.
16. C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor. Our data, ourselves: Privacy via distributed noise generation. In Advances in Cryptology - EUROCRYPT 2006, volume 4004 of Lecture Notes in Computer Science, pages 486-503, Heidelberg, 2006. Springer. (Pubitemid 44072257)
17. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In 3rd Theory of Cryptography Conference, TCC 2006, volume 3876 of Lecture Notes in Computer Science, pages 265-284, Heidelberg, 2006. Springer. (Pubitemid 43979853)
18. A. Gupta, K. Ligett, F. McSherry, A. Roth, and K. Talwar. Differentially private combinatorial optimization. In 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pages 1106-1125. SIAM, 2010.
19. J. Hurd, A. McIver, and C. Morgan. Probabilistic guarded commands mechanized in HOL. Theor. Comput. Sci., 346(1):96-112, 2005. (Pubitemid 41606836)
20. B. Jonsson, W. Yi, and K. G. Larsen. Probabilistic extensions of process algebras. In J. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra, pages 685-710. Elsevier, Amsterdam, 2001.
21. S. P. Kasiviswanathan and A. Smith. A note on differential privacy: Defining resistance to arbitrary side information. Cryptology ePrint Archive, Report 2008/144, 2008.
22. D. Kifer and A. Machanavajjhala. No free lunch in data privacy. In 2011 International conference on Management of Data, SIGMOD '11, pages 193-204. ACM Press, 2011.
23. F. McSherry and K. Talwar. Mechanism design via differential privacy. In 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007, pages 94-103, Washington, 2007. IEEE Computer Society.
24. F. D. McSherry. Privacy integrated queries: an extensible platform for privacy-preserving data analysis. In 35th SIGMOD international conference on Management of Data, SIGMOD 2009, pages 19-30, New York, 2009. ACM.
25. I. Mironov, O. Pandey, O. Reingold, and S. Vadhan. Computational differential privacy. In Advances in Cryptology - CRYPTO 2009, volume 5677 of Lecture Notes in Computer Science, pages 126-142, Heidelberg, 2009. Springer.
26. A. D. Pierro, C. Hankin, and H. Wiklicky. Approximate noninterference. Journal ofComputer Security, 12(1):37-82, 2004.
27. L. Pitt. A simple probabilistic approximation algorithm for vertex cover. Technical Report TR-404, Yale University, 1985.
28. N. Ramsey and A. Pfeffer. Stochastic lambda calculus and monads of probability distributions. In 29th ACM SIGPLAN-SIGACTsymposium on Principles ofProgramming Languages, POPL 2002, pages 154-165, New York, 2002. ACM. (Pubitemid 35009038)
29. J. Reed and B. C. Pierce. Distance makes the types grow stronger: a calculus for differential privacy. In 15th ACMSIGPLANinternational conference on Functional programming, ICFP 2010, pages 157-168, New York, 2010. ACM.
30. I. Roy, S. T. V. Setty, A. Kilzer, V. Shmatikov, and E. Witchel. Airavat: security and privacy for MapReduce. In 7th USENIX conference on Networked Systems Design and Implementation, NSDI 2010, pages 297-312, Berkeley, 2010. USENIX Association.
31. A. Sabelfeld and D. Sands. Probabilistic noninterference for multithreaded programs. In 13th IEEE workshop on Computer Security Foundations, CSFW 2000, pages 200-215, Los Alamitos, 2000. IEEE Computer Society.
32. R. Segala and A. Turrini. Approximated computationally bounded simulation relations for probabilistic automata. In 20th IEEE Computer Security Foundations symposium, CSF 2007, pages 140-156, 2007.
33. T. Terauchi and A. Aiken. Secure information flow as a safety problem. In 12th International Symposium on Static Analysis, SAS 2005, volume 3672 of Lecture Notes in Computer Science, pages 352-367, Heidelberg, 2005. Springer.
34. The Coq development team. The Coq Proof Assistant Reference Manual Version 8.3. Online -http://coq.inria.fr. 2010.
35. M. C. Tschantz, D. Kaynar, and A. Datta. Formal verification of differential privacy for interactive systems. Electronic Notes in Theoretical Computer Science, 276:61-79, 2011.