A. Fujioka, T. Okamoto, and K. Ohta, A practical secret voting scheme for large scale elections, ASIACRYPT '92, pp.244-251, 1993.
DOI : 10.1007/3-540-57220-1_66

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

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. Gray and J. W. , Toward a mathematical foundation for information flow security, Proc. of SSP '91, pp.21-35, 1991.

D. Clark, S. Hunt, and P. Malacaria, Quantitative Analysis of the Leakage of Confidential Data, Proc. of QAPL 2001, 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 2004, pp.149-166, 2005.
DOI : 10.1016/j.entcs.2004.01.018

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

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, Quasi-anonymous channels, In: IASTED CNIS, pp.126-131, 2003.

A. Serjantov and G. Danezis, Towards an Information Theoretic Metric for Anonymity, Proc. of PET, 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

C. Díaz, S. Seys, J. Claessens, and B. Preneel, Towards Measuring Anonymity, Proc. of PET, pp.54-68, 2002.
DOI : 10.1007/3-540-36467-6_5

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

K. Chatzikokolakis, C. Palamidessi, and P. Panangaden, Probability of error in informationhiding protocols, Proc. of CSF, pp.341-354, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00200957

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

R. Segala and N. Lynch, Probabilistic simulations for probabilistic processes, Nordic Journal of Computing, vol.2, pp.250-273, 1995.

R. Milner, Communication and Concurrency. International Series in Computer Science, 1989.

O. M. Herescu and C. Palamidessi, Probabilistic Asynchronous ??-Calculus, Proceedings of FOSSACS, pp.146-160, 2000.
DOI : 10.1007/3-540-46432-8_10
URL : http://arxiv.org/pdf/cs/0109002v1.pdf

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

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

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

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

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

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

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

K. Chatzikokolakis and C. Palamidessi, Making random choices invisible to the scheduler, Proc. of CONCUR'07, pp.42-58, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00424860