M. S. Alvim, M. E. Andrés, K. Chatzikokolakis, P. Degano, and C. Palamidessi, Differential Privacy: On the Trade-Off between Utility and Information Leakage, FAST 2011, p.7140, 2011.
DOI : 10.1007/978-3-642-29420-4_3

URL : https://hal.archives-ouvertes.fr/inria-00580122

M. S. Alvim, M. E. Andrés, K. Chatzikokolakis, and C. Palamidessi, Quantitative Information Flow and Applications to Differential Privacy, FOSAD VI, pp.211-230, 2011.
DOI : 10.1007/978-3-642-00596-1_21

URL : https://hal.archives-ouvertes.fr/hal-00655522

M. S. Alvim, M. E. Andrés, K. Chatzikokolakis, and C. Palamidessi, On the Relation between Differential Privacy and Quantitative Information Flow, ICALP, vol.54, issue.1, pp.60-76, 2011.
DOI : 10.1007/978-3-642-00596-1_21

URL : https://hal.archives-ouvertes.fr/inria-00627937

G. Barthe and B. Köpf, Information-Theoretic Bounds for Differentially Private Mechanisms, 2011 IEEE 24th Computer Security Foundations Symposium, pp.191-204, 2011.
DOI : 10.1109/CSF.2011.20

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.6688

M. Boreale, F. Pampaloni, and M. Paolini, Asymptotic information leakage under one-try attacks Full version to appear on MSCS available at http, FoSSaCS LNCS, vol.6604, pp.396-410, 2011.
DOI : 10.1007/978-3-642-19805-2_27

M. Boreale, F. Pampaloni, and M. Paolini, Quantitative Information Flow, with a View, ESORICS 2011, pp.588-604, 2011.
DOI : 10.1007/978-3-642-23822-2_32

URL : http://eprints.imtlucca.it/1244/1/Pampaloni_Paolini_LNCS_2011b.pdf

M. Boreale and M. Paolini, Worst-and average-case privacy breaches in randomization mechanisms . Full version of the present paper
DOI : 10.1007/978-3-642-33475-7_6

URL : https://hal.archives-ouvertes.fr/hal-01556211

C. Braun, K. Chatzikokolakis, and C. Palamidessi, Quantitative Notions of Leakage for One-try Attacks, Proc. of MFPS 2009, pp.75-91, 2009.
DOI : 10.1016/j.entcs.2009.07.085

URL : https://hal.archives-ouvertes.fr/inria-00424852

K. Chatzikokolakis, C. Palamidessi, and P. Panangaden, Anonymity protocols as noisy channels, Information and Computation, vol.206, issue.2-4, pp.378-401, 2008.
DOI : 10.1016/j.ic.2007.07.003

URL : https://hal.archives-ouvertes.fr/inria-00201110

K. Chatzikokolakis, C. Palamidessi, and P. Panangaden, On the Bayes risk in information-hiding protocols, Journal of Computer Security, vol.16, issue.5, pp.531-571, 2008.
DOI : 10.3233/JCS-2008-0333

URL : https://hal.archives-ouvertes.fr/inria-00349224

D. Chaum, The dining cryptographers problem: Unconditional sender and recipient untraceability, Journal of Cryptology, vol.1, issue.1, pp.65-75, 1988.
DOI : 10.1007/BF00206326

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.4293

C. Dwork, Differential Privacy, LNCS, vol.4052, pp.1-12, 2006.
DOI : 10.1007/11787006_1

C. Dwork, F. Mcsherry, K. Nissim, and A. Smith, Calibrating Noise to Sensitivity in Private Data Analysis, Proc. of the 3rd IACR Theory of Cryptography Conference, 2006.
DOI : 10.1007/11681878_14

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.9267

A. Evfimievski, J. Gehrke, and R. Srikant, Limiting privacy breaches in privacy preserving data mining, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, 2003.
DOI : 10.1145/773153.773174

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.7574

A. Friedman and A. Shuster, Data mining with differential privacy, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '10, 2010.
DOI : 10.1145/1835804.1835868

S. R. Ganta, S. P. Kasiviswanathan, and A. Smith, Composition attacks and auxiliary information in data privacy, Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD 08, 2008.
DOI : 10.1145/1401890.1401926

URL : http://arxiv.org/abs/0803.0032

A. Ghosh, T. Roughgarden, and M. Sundararajan, Universally utility-maximizing privacy mechanisms, STOC 2009, pp.351-360, 2009.
DOI : 10.1145/1536414.1536464

URL : http://arxiv.org/abs/0811.2841

B. Köpf and G. Smith, Vulnerability Bounds and Leakage Resilience of Blinded Cryptography under Timing Attacks, 2010 23rd IEEE Computer Security Foundations Symposium, pp.44-56, 2010.
DOI : 10.1109/CSF.2010.11

C. C. Leang and D. H. Johnson, On the asymptotics of M-hypothesis Bayesian detection, IEEE Transactions on Information Theory, vol.43, issue.1, pp.280-282, 1997.
DOI : 10.1109/18.567705

F. Mcsherry, Privacy Integrated Queries, Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data (SIGMOD), 2009.

F. Mcsherry and K. Talwar, Mechanism Design via Differential Privacy, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 2007.
DOI : 10.1109/FOCS.2007.66

A. Narayanan and V. Shmatikov, Robust De-anonymization of Large Sparse Datasets, 2008 IEEE Symposium on Security and Privacy (sp 2008), 2008.
DOI : 10.1109/SP.2008.33

M. K. Reiter and A. D. Rubin, Crowds: anonymity for Web transactions, ACM Transactions on Information and System Security, vol.1, issue.1, pp.66-92, 1998.
DOI : 10.1145/290163.290168

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.864

A. Rényi, On Measures of Entropy and Information, Proc. of the 4th Berkeley Symposium on Mathematics, pp.547-561, 1961.

G. Smith, On the Foundations of Quantitative Information Flow, FoSSaCS LNCS, vol.38, issue.1, pp.288-302, 2009.
DOI : 10.1137/060651380