Information-theoretic bounds for differentially private mechanisms

Proceedings - IEEE Computer Security Foundations Symposium

Volumn , Issue , 2011, Pages 191-204

  Barthe, Gilles ^a   Kopf, Boris ^a  

^a IMDEA SOFTWARE INSTITUTE   (Spain)

Author keywords

Differential Privacy; Information Theory; Quantitative Information Flow

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING; DATA PRIVACY; RATIONAL FUNCTIONS;

AMOUNT OF INFORMATION; CODING THEORY; CONFIDENTIAL DATA; DIFFERENTIAL PRIVACIES; INFORMATION THEORETIC BOUNDS; PRIVACY PRESERVING; PRIVATE CHANNELS; PROPERTY; QUANTITATIVE INFORMATION FLOWS; UPPER BOUND;

INFORMATION THEORY;

EID: 80052677847     PISSN: 19401434     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSF.2011.20     Document Type: Conference Paper

References (36)

1. M. S. Alvim, M. Andrés, K. Chatzikokolakis, P. Degano, and C. Palamidessi. Differential privacy: on the trade-off between utility and information leakage. CoRR, abs/1103.5188v1, 2011.
2. M. S. Alvim, K. Chatzikokolakis, P. Degano, and C. Palamidessi. Differential privacy versus quantitative information flow. CoRR, abs/1012.4250v1, 2010.
3. M. Backes, B. Köpf, and A. Rybalchenko. Automatic Discovery and Quantification of Information Leaks. In Proc. IEEE Symp. on Security and Privacy (S&P '09), pages 141-153. IEEE, 2009.
4. C. Braun, K. Chatzikokolakis, and C. Palamidessi. Quantitative notions of leakage for one-try attacks. Electr. Notes Theor. Comput. Sci., 249:75-91, 2009.
5. C. Cachin. Entropy Measures and Unconditional Security in Cryptography. PhD thesis, ETH Zürich, 1997.
6. K. Chatzikokolakis, C. Palamidessi, and P. Panangaden. Anonymity protocols as noisy channels. Inf. Comput., 206(2-4):378-401, 2008.
7. 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)
8. M. R. Clarkson and F. B. Schneider. Quantification of integrity. Cornell Computing and Information Science Technical Reports, 2011. http://hdl.handle. net/1813/22012.
9. G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein. Covering Codes. Elsevier Science, 1997.
10. G. E. Collins. Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In H. Barkhage, editor, Automata Theory and Formal Languages, volume 33 of Lecture Notes in Computer Science, pages 134-183. Springer, 1975.
11. C. Dwork. Differential Privacy. In Proc. 33rd Intl. Colloquium on Automata, Languages and Programming (ICALP '06), volume 4052 of LNCS, pages 1-12. Springer, 2006.
12. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating Noise to Sensitivity in Private Data Analysis. In Proc. 3rd Theory of Cryptography Conference (TCC '06), volume 3876 of LNCS, pages 265-284. Springer, 2006.
13. B. C. M. Fung, K. Wang, R. Chen, and P. S. Yu. Privacy-preserving data publishing: A survey of recent developments. ACM Comput. Surv., 42(4), 2010.
14. S. R. Ganta, S. P. Kasiviswanathan, and A. Smith. Composition attacks and auxiliary information in data privacy. In Proc. 14th ACM Conference on Knowledge Discovery and Data Mining (KDD '08), pages 265-273. ACM, 2008.
15. J. W. Gray. Toward a Mathematical Foundation for Information Flow Security. Journal of Computer Security, 1(3-4):255-294, 1992.
16. S. Hamadou, V. Sassone, and C. Palamidessi. Reconciling belief and vulnerability in information flow. In Proc. 31st IEEE Symposium on Security and Privacy (S&P '10), pages 79-92. IEEE Computer Society, 2010.
17. J. Harrison. Handbook of Practical Logic and Automated Reasoning. Cambridge University Press, 2009.
18. J. Heusser and P. Malacaria. Quantifying information leaks in software. In 26th Annual Computer Security Applications Conference, (ACSAC '10), pages 261-269. ACM, 2010.
19. L. Hörmander. The Analysis of Linear Partial Differential Operators II: Differential Operators with Constant Coefficients. Springer, 1983.
20. B. Köpf and D. Basin. An Information-Theoretic Model for Adaptive Side-Channel Attacks. In Proc. ACM Conf. on Computer and Communications Security (CCS '07), pages 286-296. ACM, 2007.
21. B. Köpf and M. Dürmuth. A Provably Secure and Efficient Countermeasure against Timing Attacks. In Proc. IEEE Computer Security Foundations Symposium (CSF '09), pages 324-335. IEEE, 2009.
22. B. Köpf and A. Rybalchenko. Approximation and Randomization for Quantitative Information-Flow Analysis. In Proc. 23rd IEEE Computer Security Foundations Symposium (CSF '10), pages 3-14. IEEE, 2010.
23. B. Köpf and G. Smith. Vulnerability Bounds and Leakage Resilience of Blinded Cryptography under Timing Attacks. In Proc 23rd. IEEE Computer Security Foundations Symposium (CSF '10), pages 44-56. IEEE, 2010.
24. C. Li, M. Hay, V. Rastogi, G. Miklau, and A. McGregor. Optimizing linear counting queries under differential privacy. In Proc. 29th ACM Symposium on Principles of Database Systems (PODS '10), pages 123-134. ACM, 2010.
25. G. Lowe. Quantifying Information Flow. In Proc. IEEE Computer Security Foundations Workshop (CSFW '02), pages 18-31. IEEE, 2002.
26. S. McCamant and M. D. Ernst. Quantitative information flow as network flow capacity. In Proc. ACM Conf. on Programming Language Design and Implementation (PLDI '08), pages 193-205. ACM, 2008.
27. F. McSherry. Privacy integrated queries: an extensible platform for privacy-preserving data analysis. In Proc. International Conference on Management of Data (SIGMOD '09), pages 19-30. ACM, 2009.
28. J. K. Millen. Covert Channel Capacity. In Proc. IEEE Symp. on Security and Privacy (S&P '87), pages 60-66. IEEE, 1987.
29. J. Newsome, S. McCamant, and D. Song. Measuring channel capacity to distinguish undue influence. In Proc. ACM Workshop on Programming Languages and Analysis for Security (PLAS '09), pages 73-85. ACM, 2009.
30. K. Nissim, S. Raskhodnikova, and A. Smith. Smooth sensitivity and sampling in private data analysis. In Proc. 39th Annual ACM Symposium on Theory of Computing (STOC '07), pages 75-84. ACM, 2007.
31. A. Rényi. On measures of entropy and information. In Proceedings of the 4th Berkeley Symposium on Mathematics, Statistics and Probability 1960, pages 547-561, 1961.
32. A. Roth and T. Roughgarden. Interactive privacy via the median mechanism. In Proc. 42nd ACM Symposium on Theory of Computing (STOC '10), pages 765-774. ACM, 2010.
33. I. Roy, S. T. V. Setty, A. Kilzer, V. Shmatikov, and E. Witchel. Airavat: Security and Privacy for MapReduce. In Proc. 7th USENIX Symposium on Networked Systems Design and Implementation (NSDI '10), pages 297-312. USENIX Association, 2010.
34. G. Smith. On the foundations of quantitative information flow. In Proc. Intl. Conf. of Foundations of Software Science and Computation Structures (FoSSaCS '09), LNCS 5504, pages 288-302. Springer, 2009.
35. A. Tarski. A Decision Method for Elementary Algebra and Geometry. Univ. of California Press, 2nd edition, 1951.
36. X. Xiao, G. Wang, and J. Gehrke. Differential privacy via wavelet transforms. In Proc. 26th International Conference on Data Engineering (ICDE '10), pages 225-236. IEEE, 2010.