M. Andrés, C. Palmidessi, G. Peter-van-rossum, and . Smith, Computing the amount of leakage in information-hiding systems, 2009.

M. Bhargava and C. Palamidessi, Probabilistic Anonymity, Proceedings of CONCUR, pp.171-185, 2005.
DOI : 10.1007/11539452_16

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

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

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

K. Chatzikokolakis and C. Palamidessi, Probable innocence revisited, Theoretical Computer Science, vol.367, issue.1-2, pp.123-138, 2006.
DOI : 10.1016/j.tcs.2006.08.033

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

K. Chatzikokolakis, C. Palamidessi, and P. Panangaden, Anonymity protocols as noisy channels, pdf. [6] Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden . Anonymity protocols as noisy channels, pp.378-4012, 2008.
DOI : 10.1016/j.ic.2007.07.003

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

D. Clark, S. Hunt, and P. Malacaria, Quantitative Analysis of the Leakage of Confidential Data, Electronic Notes in Theoretical Computer Science, vol.59, issue.3, 2001.
DOI : 10.1016/S1571-0661(04)00290-7

D. Clark, S. Hunt, and P. Malacaria, Quantitative information flow, relations and polymorphic types Journal of Logic and Computation, Special Issue on Lambda-calculus, type theory and natural language, pp.181-199, 2005.

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

URL : http://logcom.oxfordjournals.org/cgi/content/short/15/2/181

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

I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong, Freenet: A Distributed Anonymous Information Storage and Retrieval System, Designing Privacy Enhancing Technologies, International Workshop on Design Issues in Anonymity and Unobservability, pp.44-66, 2000.
DOI : 10.1007/3-540-44702-4_4

R. Michael, A. C. Clarkson, F. B. Myers, and . Schneider, Belief in information flow, Journal of Computer Security, 2008.

M. Thomas, J. A. Cover, and . Thomas, Elements of Information Theory, 1991.

M. Thomas, J. A. Cover, and . Thomas, Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) Wiley- Interscience, Proceedings of the 2008 Workshop on Programming Languages and Analysis for Security, 2006.

M. Franz, B. Meyer, and A. Pashalidis, Attacking Unlinkability: The Importance of Context, Privacy Enhancing Technologies, 7th International Symposium , PET 2007, pp.1-16, 2007.
DOI : 10.1007/978-3-540-75551-7_1

Y. Joseph, K. R. Halpern, and . Neill, Anonymity and information hiding in multiagent systems, Journal of Computer Security, vol.13, issue.3, pp.483-512, 2005.

S. Hamadou, C. Palamidessi, V. Sassone, and E. Elsalamouny, Probable Innocence in the Presence of Independent Knowledge, To appear in the Proc. of the sixth International Workshop on Formal Aspects in Security and Trust (FAST2009), 2009.
DOI : 10.1007/978-3-642-12459-4_11

D. Hughes and V. Shmatikov, Information hiding, anonymity and privacy: a modular approach, Journal of Computer Security, vol.12, issue.1, pp.3-36, 2004.
DOI : 10.3233/JCS-2004-12102

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
DOI : 10.1145/1315245.1315282

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

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
DOI : 10.1145/1375696.1375713

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

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

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

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

Y. Peter, S. Ryan, and . Schneider, Modelling and Analysis of Security Protocols, 2001.

S. Schneider and A. Sidiropoulos, CSP and anonymity, Proc. of the European Symposium on Research in Computer Security (ESORICS), pp.198-218, 1996.
DOI : 10.1007/3-540-61770-1_38

G. Smith, Adversaries and Information Leaks (Tutorial), Proceedings of the Third Symposium on Trustworthy Global Computing, pp.383-400, 2007.
DOI : 10.1007/978-3-540-78663-4_25

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

G. Smith, On the Foundations of Quantitative Information Flow, Proceedings of the Twelfth International Conference on Foundations of Software Science and Computation Structures, pp.288-302, 2009.
DOI : 10.1137/060651380

G. Smith, On the Foundations of Quantitative Information Flow, Lecture Notes in Computer Science, vol.38, issue.1, pp.288-302, 2009.
DOI : 10.1137/060651380

F. Paul, S. G. Syverson, and . Stubblebine, Group principals and the formalization of anonymity, World Congress on Formal Methods, pp.814-833, 1999.

P. F. Syverson, D. M. Goldschlag, and M. G. Reed, Anonymous connections and onion routing, Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097), pp.44-54, 1997.
DOI : 10.1109/SECPRI.1997.601314

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

Y. Zhu and R. Bettati, Anonymity vs. information leakage in anonymity systems, Proc. of ICDCS, pp.514-524, 2005.