M. S. Alvim, M. E. Andrés, and C. Palamidessi, Information Flow in Interactive Systems, Proceedings of the 21th International Conference on Concurrency Theory, pp.102-116, 2010.
DOI : 10.1007/978-3-642-15375-4_8
URL : https://hal.archives-ouvertes.fr/inria-00479672

M. E. Andrés, C. Palamidessi, P. Van-rossum, and G. Smith, Computing the Leakage of Information-Hiding Systems, Proceedings of the 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp.373-389, 2010.
DOI : 10.1007/978-3-642-12002-2_32

M. E. Andrés, C. Palamidessi, P. Van-rossum, and A. Sokolova, Information hiding in probabilistic concurrent systems, Proceedings of the 7th IEEE International Conference on Quantitative Evaluation of SysTems, pp.17-26, 2010.

M. Bhargava and C. Palamidessi, Probabilistic Anonymity, Probabilistic anonymityProceedings of the 16th International Conference on Concurrency Theory, pp.171-185, 2005.
DOI : 10.1007/11539452_16
URL : https://hal.archives-ouvertes.fr/inria-00201101

M. Boreale, F. Pampaloni, and M. Paolini, Asymptotic Information Leakage under One-Try Attacks, Proceedings of the 14th International Conference on the Foundations of Software Science and Computational Structures (FOSSACS'11), pp.396-410, 2011.
DOI : 10.1007/978-3-642-19805-2_27

K. Chatzikokolakis and C. Palamidessi, Making random choices invisible to the scheduler, Information and Computation, vol.208, issue.6, pp.694-715, 2010.
DOI : 10.1016/j.ic.2009.06.006
URL : https://hal.archives-ouvertes.fr/inria-00424860

K. Chatzikokolakis, C. Palamidessi, and P. Panangaden, Anonymity protocols as noisy channels, Information and Computation, vol.206, pp.2-4, 2008.
DOI : 10.1007/978-3-540-75336-0_18
URL : https://hal.archives-ouvertes.fr/inria-00349225

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

K. L. Chung, A Course in Probability Theory, 2000.

D. Clark, S. Hunt, and P. Malacaria, Quantitative Analysis of the Leakage of Confidential Data, Proceedings of the Workshop on Quantitative Aspects of Programming Languages, pp.238-251, 2001.
DOI : 10.1016/S1571-0661(04)00290-7

D. Clark, S. Hunt, and P. Malacaria, Quantified Interference for a While Language, Proceedings of the Second Workshop on Quantitative Aspects of Programming Languages, pp.149-166, 2004.
DOI : 10.1016/j.entcs.2004.01.018

M. R. Clarkson, A. C. Myers, and F. B. Schneider, Belief in Information Flow, 18th IEEE Computer Security Foundations Workshop (CSFW'05), pp.655-701, 2009.
DOI : 10.1109/CSFW.2005.10

Y. Deng, C. Palamidessi, and J. Pang, Compositional Reasoning for Probabilistic Finite-State Behaviors, Processes, Terms and Cycles: Steps on the Road to Infinity, pp.309-337, 2005.
DOI : 10.1007/11601548_17
URL : https://hal.archives-ouvertes.fr/hal-00159683

Y. Deng, J. Pang, and P. Wu, Measuring Anonymity with Relative Entropy, Postproceedings of the 4th International Workshop on Formal Aspects in Security and Trust, pp.65-79, 2006.
DOI : 10.1007/978-3-540-75227-1_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.1531

J. Desharnais, R. Jagadeesan, V. Gupta, and P. Panangaden, The metric analogue of weak bisimulation for probabilistic processes, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.413-422, 2002.
DOI : 10.1109/LICS.2002.1029849

C. Díaz, S. Seys, J. Claessens, and B. Preneel, Towards Measuring Anonymity, Proceedings of the workshop on Privacy Enhancing Technologies, pp.54-68, 2002.
DOI : 10.1007/3-540-36467-6_5

A. Fujioka, T. Okamoto, and K. Ohta, A practical secret voting scheme for large scale elections, Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques. Advancaes in Cryptology (AUSCRYPT '92, pp.244-251, 1993.
DOI : 10.1007/3-540-57220-1_66

F. D. Garcia, P. Van-rossum, and A. Sokolova, Probabilistic anonymity and admissible schedulers, 2007.

J. Y. Halpern and K. R. Neill, Anonymity and information hiding in multiagent systems, Journal of Computer Security, vol.13, issue.3, pp.483-512, 2005.
DOI : 10.3233/JCS-2005-13305

S. Hamadou, C. Palamidessi, and V. Sassone, Reconciling Belief and Vulnerability in Information Flow, 2010 IEEE Symposium on Security and Privacy, pp.79-92, 2010.
DOI : 10.1109/SP.2010.13
URL : https://hal.archives-ouvertes.fr/inria-00548007

O. M. Herescu and C. Palamidessi, Probabilistic Asynchronous ??-Calculus, Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures, pp.146-160, 2000.
DOI : 10.1007/3-540-46432-8_10
URL : http://arxiv.org/pdf/cs/0109002v1.pdf

J. Heusser and P. Malacaria, Applied Quantitative Information Flow and Statistical Databases, Proceedings of the International Workshop on Formal Aspects in Security and Trust, pp.96-110, 2009.
DOI : 10.1007/978-3-642-12459-4_8

W. James and I. Gray, Toward a mathematical foundation for information flow security, Proceedings of the 1991 IEEE Computer Society Symposium on Research in Security and Privacy (SSP '91, pp.21-35, 1991.

B. Köpf and D. A. 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

G. Lowe, Quantifying information flow, Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15, pp.18-31, 2002.
DOI : 10.1109/CSFW.2002.1021804
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.1444

P. Malacaria, Assessing security threats of looping constructs, Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.225-235, 2007.

P. Malacaria and H. Chen, Lagrange multipliers and maximum information leakage in different observational models, in´Ulfarin´ in´Ulfar Erlingsson and Marco Pistoia, Proceedings of the 2008 Workshop on Programming Languages and Analysis for Security, pp.135-146, 2008.

A. Mciver, L. Meinicke, and C. Morgan, Compositional Closure for Bayes Risk in Probabilistic Noninterference, Proceedings of the 37th International Colloquium on Automata, Languages and Programming, pp.223-235, 2010.
DOI : 10.1007/978-3-642-14162-1_19

J. Mclean, Security models and information flow, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy, pp.180-189, 1990.
DOI : 10.1109/RISP.1990.63849

I. S. Moskowitz, R. E. Newman, and P. F. Syverson, Quasi-anonymous channels, Proceedings of the IASTED International Conference on Communication, Network, and Information Security, pp.126-131, 2003.

C. Palamidessi and O. M. Herescu, A Randomized Distributed Encoding of the ??-Calculus with Mixed Choice, Theoretical Computer Science, vol.335, issue.2-3, pp.373-404, 2005.
DOI : 10.1007/978-0-387-35608-2_44

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

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

R. Segala, Modeling and Verification of Randomized Distributed Real-Time Systems, 1995.

R. Segala and N. Lynch, Probabilistic simulations for probabilistic processes, Nordic Journal of Computing, vol.2, issue.2, pp.250-273, 1995.
DOI : 10.1007/bfb0015027
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.6430

A. Serjantov and G. Danezis, Towards an Information Theoretic Metric for Anonymity, Proceedings of the Workshop on Privacy Enhancing Technologies, pp.41-53, 2002.
DOI : 10.1007/3-540-36467-6_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.5992

G. Smith, On the Foundations of Quantitative Information Flow, Proceedings of the 12th International Conference on Foundations of Software Science and, 2009.
DOI : 10.1137/060651380