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. Information and Computation, 2007.
DOI : 10.1007/978-3-540-75336-0_18

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

K. Chatzikokolakis, C. Palamidessi, and P. Panangaden, Probability of Error in Information-Hiding Protocols, 20th IEEE Computer Security Foundations Symposium (CSF'07), pp.341-354, 2007.
DOI : 10.1109/CSF.2007.27

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

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

URL : http://doi.org/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

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

R. Michael, A. C. Clarkson, F. B. Myers, and . Schneider, Belief in information flow

M. Thomas, J. A. Cover, and . 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), Lecture Notes in Computer Science, 2006.
DOI : 10.1007/978-3-540-75227-1_5

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

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.
DOI : 10.3233/jcs-1992-13-405

URL : http://doi.org/10.3233/jcs-1992-13-405

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.

M. E. 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=

M. Ueli and . Maurer, Authentication theory and hypothesis testing, IEEE Transactions on Information Theory, vol.46, issue.4, pp.1350-1356, 2000.

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

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

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

A. Di-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. Di-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

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.

A. Rényi, On the amount of missing information and the Neyman- Pearson lemma, Festschriftf for J. Neyman, pp.281-288, 1966.

H. L. Royden, Real Analysis, 1988.

N. Santhi and A. Vardy, On an improvement over Rényi's equivocation bound, th Annual Allerton Conference on Communication, Control, and Computing, 2006.

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

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

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. 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=