Distance makes the types grow stronger: A calculus for differential privacy

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2010, Pages 157-168

  Reed, Jason ^a   Pierce, Benjamin C ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

differential privacy; type systems

Indexed keywords

COMPOSITIONALITY; DIFFERENTIAL PRIVACIES; FUNCTIONAL LANGUAGES; QUERY PROGRAMS; SENSITIVE INFORMATIONS; STATISTICAL GUARANTEE; TYPE SYSTEMS;

DIFFERENTIATION (CALCULUS);

FUNCTIONAL PROGRAMMING;

EID: 78249264133     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1863543.1863568     Document Type: Conference Paper

References (32)

1. A. Ahmed. Step-indexed syntactic logical relations for recursive and quantified types. In of Lecture Notes in Computer Science, volume 3924, pages 69-83, 2006.
2. M. Ajtai, J. Komlós, and E. Szemerédi. Sorting in c log n parallel steps. Combinatorica, 3(1):1-19, March 1983. ISSN 0209-9683.
3. A. W. Appel and D. McAllester. An indexed model of recursive types for foundational proof-carrying code. ACM Trans. Program. Lang. Syst., 23(5):657-683, 2001. ISSN 0164-0925.
4. A. Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, University of Edinburgh, 1996.
5. K. E. Batcher. Sorting networks and their applications. In AFIPS '68 (Spring): Proceedings of the April 30-May 2, 1968, spring joint computer conference, pages 307-314, New York, NY, USA, 1968. ACM.
6. A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the sulq framework. In PODS '05: Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 128-138, New York, NY, USA, 2005. ACM.
7. A. Blum, K. Ligett, and A. Roth. A learning theory approach to noninteractive database privacy. In STOC '08: Proceedings of the 40th annual ACM symposium on Theory of computing, pages 609-618, New York, NY, USA, 2008. ACM.
8. P. Buneman, S. Khanna, and T. Wang-Chiew. Why and where: A characterization of data provenance. In J. Bussche and V. Vianu, editors, Database Theory ICDT 2001, volume 1973 of Lecture Notes in Computer Science, chapter 20, pages 316-330. Springer Berlin Heidelberg, Berlin, Heidelberg, October 2001.
9. T.-H. H. Chan, E. Shi, and D. Song. Private and continual release of statistics. Cryptology ePrint Archive, Report 2010/076, 2010. http://eprint.iacr.org/.
10. S. Chaudhuri, S. Gulwani, and R. Lublinerman. Continuity analysis of programs. SIGPLAN Not., 45(1):57-70, 2010. ISSN 0362-1340.
11. N. Dalvi, C. Ré, and D. Suciu. Probabilistic databases: diamonds in the dirt. Commun. ACM, 52(7):86-94, 2009.
12. C. Dwork. The differential privacy frontier (extended abstract). In Theory of Cryptography, Lecture Notes in Computer Science, chapter 29, pages 496-502. 2009.
13. C. Dwork. Differential privacy: A survey of results. 5th International Conference on Theory and Applications of Models of Computation, pages 1-19, 2008.
14. C. Dwork. Differential privacy. In Proceedings of ICALP (Part, volume 2, pages 1-12, 2006.
15. C. Dwork, F. Mcsherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In Theory of Cryptography Conference, 2006.
16. J. Girard. Linear logic. Theoretical Computer Science, 50(1):1-102, 1987.
17. T. J. Green, G. Karvounarakis, and V. Tannen. Provenance semirings. In PODS '07: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 31-40, New York, NY, USA, 2007. ACM.
18. A. Gupta, K. Ligett, F. McSherry, A. Roth, and K. Talwar. Differentially private combinatorial optimization. Nov 2009.
19. J. Ketonen. A decidable fragment of predicate calculus. Theoretical Computer Science, 32(3):297-307, 1984. ISSN 03043975.
20. J. Lambek. The mathematics of sentence structure. American Mathematical Monthly, 65(3):154-170, 1958.
21. G. Lowe. Quantifying information flow. In In Proc. IEEE Computer Security Foundations Workshop, pages 18-31, 2002.
22. A. Machanavajjhala, D. Kifer, J. Abowd, J. Gehrke, and L. Vilhuber. Privacy: Theory meets practice on the map. In ICDE '08: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, pages 277-286, Washington, DC, USA, 2008. IEEE Computer Society.
23. S. McCamant and M. D. Ernst. Quantitative information flow as network flow capacity. In PLDI '08: Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation, pages 193-205, New York, NY, USA, 2008. ACM.
24. F. McSherry and K. Talwar. Mechanism design via differential privacy. In FOCS '07: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pages 94-103, Washington, DC, USA, 2007. IEEE Computer Society.
25. F. D. McSherry. Privacy integrated queries: an extensible platform for privacy-preserving data analysis. In SIGMOD '09: Proceedings of the 35th SIGMOD international conference on Management of data, pages 19-30, New York, NY, USA, 2009. ACM.
26. A. Narayanan and V. Shmatikov. Robust de-anonymization of large sparse datasets. In SP '08: Proceedings of the 2008 IEEE Symposium on Security and Privacy, pages 111-125, Washington, DC, USA, 2008. IEEE Computer Society. ISBN 978-0-7695-3168-7. doi: http://dx.doi.org/10.1109/SP.2008.33.
27. K. Nissim, S. Raskhodnikova, and A. Smith. Smooth sensitivity and sampling in private data analysis. In STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 75-84, New York, NY, USA, 2007. ACM.
28. P. O'Hearn and D. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215-244, 1999.
29. S. Park, F. Pfenning, and S. Thrun. A monadic probabilistic language. In In Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation, pages 38-49. ACM Press, 2003.
30. N. Ramsey and A. Pfeffer. Stochastic lambda calculus and monads of probability distributions. In In 29th ACM POPL, pages 154-165. ACM Press, 2002.
31. A. Roth and T. Roughgarden. The median mechanism: Interactive and efficient privacy with multiple queries, 2010. To appear in STOC 2010.
32. D. Wright and C. Baker-Finch. Usage Analysis with Natural Reduction Types. In Proceedings of the Third International Workshop on Static Analysis, pages 254-266. Springer-Verlag London, UK, 1993.