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

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, Postproceedings of the Symp. on Trustworthy Global Computing, 2006.
DOI : 10.1016/j.ic.2007.07.003
URL : https://hal.archives-ouvertes.fr/inria-00349225

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, Proc. of QAPL, 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, Proc. of QAPL, pp.149-166, 2004.
DOI : 10.1016/j.entcs.2004.01.018

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

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

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

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

J. W. Gray and I. , 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.

J. Y. Halpern and K. R. , 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

M. Hellman and J. Raviv, Probability of error, equivocation, and the Chernoff bound, IEEE Transactions on Information Theory, vol.16, issue.4, pp.368-372, 1970.
DOI : 10.1109/TIT.1970.1054466

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

U. M. Maurer, Authentication theory and hypothesis testing, IEEE Transactions on Information Theory, vol.46, issue.4, pp.1350-1356, 2000.
DOI : 10.1109/18.850674
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.4053

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

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

A. D. Pierro, C. Hankin, and H. Wiklicky, Approximate non-interference, Journal of Computer Security, vol.12, issue.1, pp.37-82, 2004.
DOI : 10.3233/JCS-2004-12103

A. D. Pierro, C. Hankin, and H. Wiklicky, Measuring the confinement of probabilistic systems, Theoretical Computer Science, vol.340, issue.1, pp.3-56, 2005.
DOI : 10.1016/j.tcs.2005.03.002

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 and J. Neyman, On the amount of missing information and the Neyman-Pearson lemma [23] N. Santhi and A. Vardy. On an improvement over Rényi's equivocation bound, Festschriftf Presented at the 44-th Annual Allerton Conference on Communication, Control, and Computing, pp.281-288, 1966.

A. Serjantov and G. Danezis, Towards an Information Theoretic Metric for Anonymity, Proceedings of the workshop on Privacy Enhancing Technologies (PET) 2002, pp.41-53, 2002.
DOI : 10.1007/3-540-36467-6_4

V. Shmatikov, Probabilistic analysis of an anonymity system, Journal of Computer Security, vol.12, issue.3-4, pp.355-377, 2004.
DOI : 10.3233/JCS-2004-123-403

P. Syverson, D. Goldschlag, and M. 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