D. Clark, S. Hunt, and P. Malacaria, Quantitative Information Flow, Relations and Polymorphic Types, Journal of Logic and Computation, vol.15, issue.2, pp.181-199, 2005.
DOI : 10.1093/logcom/exi009

M. Clarkson, A. Myers, and F. Schneider, Belief in Information Flow, 18th IEEE Computer Security Foundations Workshop (CSFW'05), pp.31-45, 2005.
DOI : 10.1109/CSFW.2005.10

B. Köpf and D. Basin, An information-theoretic model for adaptive side-channel attacks, Proceedings of the 14th ACM conference on Computer and communications security , CCS '07, pp.286-296, 2007.
DOI : 10.1145/1315245.1315282

P. Malacaria, Assessing security threats of looping constructs, Proc. 34th Symposium on Principles of Programming Languages (POPL '07), pp.225-235, 2007.

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

G. Smith, On the Foundations of Quantitative Information Flow, Proc. 12th International Conference on Foundations of Software Science and Computational Structures (FoSSaCS '09), ser. Lecture Notes in Computer Science, L. de Alfaro, pp.288-302, 2009.
DOI : 10.1137/060651380

A. Mciver, L. Meinicke, and C. Morgan, Compositional Closure for Bayes Risk in Probabilistic Noninterference, Proc. ICALP'10, pp.223-235, 2010.
DOI : 10.1007/978-3-642-14162-1_19

M. R. Clarkson and F. B. Schneider, Quantification of integrity, Proc. 23nd IEEE Computer Security Foundations Symposium (CSF '10), pp.28-43, 2010.

M. S. Alvim, M. Andrés, and C. Palamidessi, Probabilistic Information Flow, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.314-321, 2010.
DOI : 10.1109/LICS.2010.53

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

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

M. S. Alvim, K. Chatzikokolakis, C. Palamidessi, and G. Smith, Measuring Information Leakage Using Generalized Gain Functions, 2012 IEEE 25th Computer Security Foundations Symposium, pp.265-279, 2012.
DOI : 10.1109/CSF.2012.26

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

D. Clark, S. Hunt, and P. Malacaria, A static analysis for quantifying information flow in a simple imperative language, Journal of Computer Security, vol.15, issue.3, pp.321-371, 2007.
DOI : 10.3233/JCS-2007-15302

M. Backes, B. Köpf, and A. Rybalchenko, Automatic Discovery and Quantification of Information Leaks, 2009 30th IEEE Symposium on Security and Privacy, pp.141-153, 2009.
DOI : 10.1109/SP.2009.18

J. Newsome, S. Mccamant, and D. Song, Measuring channel capacity to distinguish undue influence, Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security, PLAS '09, pp.73-85, 2009.
DOI : 10.1145/1554339.1554349

M. Andrés, C. Palamidessi, P. Van-rossum, and G. Smith, Computing the leakage of information-hiding systems, " in Tools and Algorithms for the Construction and Analysis of Systems (TACAS '10), ser. Lecture Notes in Computer Science, pp.373-389, 2010.

K. Chatzikokolakis, T. Chothia, and A. Guha, Statistical Measurement of Information Leakage, Tools and Algorithms for the Construction and Analysis of Systems (TACAS '10), pp.390-404, 2010.
DOI : 10.1007/978-3-642-12002-2_33

B. Köpf and A. Rybalchenko, Approximation and Randomization for Quantitative Information-Flow Analysis, 2010 23rd IEEE Computer Security Foundations Symposium, pp.3-14, 2010.
DOI : 10.1109/CSF.2010.8

H. Yasuoka and T. Terauchi, Quantitative Information Flow - Verification Hardness and Possibilities, 2010 23rd IEEE Computer Security Foundations Symposium, pp.15-27, 2010.
DOI : 10.1109/CSF.2010.9

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

Z. Meng and G. Smith, Calculating bounds on information leakage using two-bit patterns, Proceedings of the ACM SIGPLAN 6th Workshop on Programming Languages and Analysis for Security, PLAS '11, pp.1-112, 2011.
DOI : 10.1145/2166956.2166957

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

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

J. Heusser and P. Malacaria, Quantifying information leaks in software, Proceedings of the 26th Annual Computer Security Applications Conference on, ACSAC '10, pp.261-269, 2010.
DOI : 10.1145/1920261.1920300

B. Köpf, L. Mauborgne, and M. Ochoa, Automatic Quantification of Cache Side-Channels, Proc. 24th International Conference on Computer-Aided Verification (CAV '12), pp.564-580, 2012.
DOI : 10.1007/978-3-642-31424-7_40

A. Mciver, C. Morgan, G. Smith, L. Espinoza, and . Meinicke, Abstract Channels and Their Robust Information-Leakage Ordering, Proc. 3rd Conference on Principles of Security and Trust, pp.2014-83, 2014.
DOI : 10.1007/978-3-642-54792-8_5

T. Dalenius, Towards a methodology for statistical disclosure control, Statistik Tidskrift, vol.15, pp.429-444, 1977.

C. Dwork, Differential Privacy, Proc. 33rd International Colloquium on Automata, Languages, and Programming, pp.1-12, 2006.
DOI : 10.1007/11787006_1

C. E. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, vol.27, issue.3, pp.379-423, 1948.
DOI : 10.1002/j.1538-7305.1948.tb01338.x

J. L. Massey, Guessing and entropy, Proceedings of 1994 IEEE International Symposium on Information Theory, p.204, 1994.
DOI : 10.1109/ISIT.1994.394764

C. Braun, K. Chatzikokolakis, and C. Palamidessi, Quantitative Notions of Leakage for One-try Attacks, Proc. 25th Conference on Mathematical Foundations of Programming Semantics ser. ENTCS, pp.75-91, 2009.
DOI : 10.1016/j.entcs.2009.07.085

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

G. Smith, Quantifying Information Flow Using Min-Entropy, 2011 Eighth International Conference on Quantitative Evaluation of SysTems, pp.159-167, 2011.
DOI : 10.1109/QEST.2011.31

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

D. J. Mackay, Information Theory, Inference, and Learning Algorithms, 2003.

]. J. Bonneau, The Science of Guessing: Analyzing an Anonymized Corpus of 70 Million Passwords, 2012 IEEE Symposium on Security and Privacy, pp.538-552, 2012.
DOI : 10.1109/SP.2012.49

C. Dwork, A firm foundation for private data analysis, Communications of the ACM, vol.54, issue.1, 2011.
DOI : 10.1145/1866739.1866758

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

Y. Deng and W. Du, The Kantorovich Metric in Computer Science: A Brief Survey, Electronic Notes in Theoretical Computer Science, vol.253, issue.3, pp.73-82, 2009.
DOI : 10.1016/j.entcs.2009.10.006

A. Mciver, L. Meinicke, and C. Morgan, A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.2012-461, 2012.
DOI : 10.1109/LICS.2012.56

B. Espinoza and G. Smith, Min-entropy as a resource Information and Computation (Special Issue on Information Security as a Resource, pp.57-75, 2013.

C. Shannon, The lattice theory of information Information Theory, Transactions of the IRE Professional Group on, pp.105-107, 1953.

C. Cachin, Entropy measures and unconditional security in cryptography, 1997.

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-00349225

P. Malacaria and H. Chen, Lagrange multipliers and maximum information leakage in different observational models, Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security , PLAS '08, pp.135-146, 2008.
DOI : 10.1145/1375696.1375713

I. S. Moskowitz, R. E. Newman, and P. F. Syverson, Quasi-anonymous channels, Proc. of CNIS. IASTED, pp.126-131, 2003.

I. S. Moskowitz, R. E. Newman, D. P. Crepeau, and A. R. Miller, Covert channels and anonymizing networks, Proceeding of the ACM workshop on Privacy in the electronic society , WPES '03, pp.79-88, 2003.
DOI : 10.1145/1005140.1005153

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

M. S. Alvim, M. E. Andrés, and C. Palamidessi, Quantitative information flow in interactive systems, Journal of Computer Security, vol.20, issue.1, pp.3-50, 2012.
DOI : 10.3233/JCS-2011-0433

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

P. Malacaria, Algebraic foundations for information theoretical, probabilistic and guessability measures of information flow, 1101.

J. Landauer and T. Redmond, A lattice of information, [1993] Proceedings Computer Security Foundations Workshop VI, pp.65-70, 1993.
DOI : 10.1109/CSFW.1993.246638