M. Abadi and A. D. Gordon, A calculus for cryptographic protocols, Proceedings of the 4th ACM conference on Computer and communications security , CCS '97, pp.1-70, 1999.
DOI : 10.1145/266420.266432

A. Aldini and R. Gorrieri, Security Analysis of a Probabilistic Non-repudiation Protocol, Process Algebra and Probabilist Methods, p.17, 2002.
DOI : 10.1007/3-540-45605-8_3

[. Andova, Probabilistic process algebra, 2002.

[. Billingsley, Probability and Measure, 1995.

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

E. Bandini and R. Segala, Axiomatizations for Probabilistic Bisimulation, Proceedings of the 28th International Colloquium on Automata, Languages and Programming, pp.370-381, 2001.
DOI : 10.1007/3-540-48224-5_31

A. Cayley, A theorem on trees, Quart. J. Math, vol.23, pp.376-378, 1889.
DOI : 10.1017/CBO9780511703799.010

T. Chothia and K. Chatzikokolakis, A Survey of Anonymous Peer-to-Peer File-Sharing, Proceedings of the IFIP International Symposium on Network-Centric Ubiquitous Systems (NCUS 2005), pp.744-755, 2005.
DOI : 10.1007/11596042_77

L. Canetti, D. Cheung, M. Kaynar, N. Liskov, O. Lynch et al., Task-Structured Probabilistic I/O Automata, 2006 8th International Workshop on Discrete Event Systems, 2006.
DOI : 10.1109/WODES.2006.1678432
URL : https://hal.archives-ouvertes.fr/inria-00080681

L. Canetti, D. Cheung, M. Kirli-kaynar, N. A. Liskov, O. Lynch et al., Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols, Proceedings of the 20th International Symposium in Distributed Computing (DISC '06), pp.238-253, 2006.
DOI : 10.1007/11864219_17

D. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM, vol.4, issue.2, 1981.

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

[. Chothia, How anonymity can fail because of the scheduler . Demonstration of the scheduler problem of the Dining Cryptographers in Java, 2007.

[. Chatzikokolakis and K. Martin, A Framework for Analyzing Probabilistic Protocols and Its Application to the Partial Secrets Exchange, Proceedings of the Symp. on Trustworthy Global Computing, pp.146-162, 2005.
DOI : 10.1007/11580850_9
URL : https://hal.archives-ouvertes.fr/inria-00201111

[. Chatzikokolakis and C. Palamidessi, Probable Innocence Revisited, Third International Workshop on Formal Aspects in Security and Trust (FAST 2005), Revised Selected PapersCP06b] Konstantinos Chatzikokolakis and Catuscia Palamidessi. Probable innocence revisited. Theoretical Computer Science, pp.142-157123, 2006.
DOI : 10.1007/11679219_11
URL : https://hal.archives-ouvertes.fr/inria-00201109

[. Chatzikokolakis and C. Palamidessi, Making Random Choices Invisible to the Scheduler, Luís Caires and Vasco Thudichum VasconcelosCPP06] Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden. Anonymity protocols as noisy channels Postproceedings of the Symp. on Trustworthy Global Computing, Lecture Notes in Computer Science, pp.42-58, 2006.
DOI : 10.1007/978-3-540-74407-8_4
URL : https://hal.archives-ouvertes.fr/inria-00424860

[. Chatzikokolakis, C. Palamidessi, and P. Panangaden, Anonymity protocols as noisy channels. Information and Computation, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00349225

[. Chatzikokolakis, C. Palamidessi, and P. Panangaden, Probability of Error in Information-Hiding Protocols, 20th IEEE Computer Security Foundations Symposium (CSF'07), 2007.
DOI : 10.1109/CSF.2007.27
URL : https://hal.archives-ouvertes.fr/inria-00200957

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

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

T. A. Luca-de-alfaro, R. Henzinger, and . Jhala, Compositional methods for probabilistic systems On privacy and anonymity in electronic and non electronic voting: the ballot-as-signature attack, Proceedings of the 12th International Conference on Concurrency Theory, 2001.

S. Deering, Host extensions for IP multicasting, RFC, vol.1112, 1989.

[. Delaune, S. Kremer, and M. D. Ryan, Verifying properties of electronic voting protocols, Proceedings of the IAVoSS Workshop On Trustworthy Elections (WOTE'06), pp.45-52, 2006.

Y. Deng, C. Palamidessi, and J. Pang, Compositional Reasoning for Probabilistic Finite-State Behaviors, Aart Middeldorp 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

[. Deng, C. Palamidessi, and J. Pang, Weak probabilistic anonymity Electronic Notes in Theoretical Computer Science, Proceedings of the 3rd International Workshop on Security Issues in Concurrency (SecCo), 2006.

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

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

[. Even, O. Goldreich, and A. Lempel, A randomized protocol for signing contracts, Communications of the ACM, vol.28, issue.6, pp.637-647, 1985.
DOI : 10.1145/3812.3818

]. R. Gra90 and . Gray, Entropy and Information Theory, 1990.

]. J. Gra91 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.

[. Gunes, U. Sorges, and I. Bouazzi, Ara ? the antcolony based routing algorithm for manets, Proceedings of the International Workshop on Ad Hoc Networking, 2002.

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

B. [. Hansson and . Jonsson, A framework for reasoning about time and reliability, [1989] Proceedings. Real-Time Systems Symposium, pp.102-111, 1989.
DOI : 10.1109/REAL.1989.63561

B. [. Hansson and . Jonsson, A calculus for communicating systems with time and probabitilies, Proceedings of the Real-Time Systems Symposium -1990, pp.278-287, 1990.

Y. Joseph, K. R. Halpern, and . Neill, Anonymity and information hiding in multiagent systems, Proc. of the 16th IEEE Computer Security Foundations Workshop, pp.75-88, 2003.

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.

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

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

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

[. Jonsson, K. G. Larsen, and W. Yi, Probabilistic extensions of process algebras, Handbook of Process Algebra, pp.685-710, 2001.

M. Z. Kwiatkowska, G. Norman, and D. Parker, PRISM 2.0: a tool for probabilistic model checking, First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings., pp.322-323, 2004.
DOI : 10.1109/QEST.2004.1348048

G. Lowe, Quantifying information flow, Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15, pp.18-31, 2002.
DOI : 10.1109/CSFW.2002.1021804

G. Kim, A. Larsen, and . Skou, Bisimulation through probabilistic testing. Information and Computation, pp.1-28, 1991.

K. Martin, Topology in information theory in topology, Theoretical Computer Science, vol.405, issue.1-2, 2007.
DOI : 10.1016/j.tcs.2008.06.027

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

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

K. Martin, I. S. Moskowitz, and G. Allwein, Algebraic Information Theory For Binary Channels, Electronic Notes in Theoretical Computer Science, vol.158, pp.289-306, 2006.
DOI : 10.1016/j.entcs.2006.04.015
URL : http://doi.org/10.1016/j.entcs.2006.04.015

. S. Ira, R. E. Moskowitz, D. P. Newman, A. R. Crepeau, and . Miller, Covert channels and anonymizing networks, WPES, pp.79-88, 2003.

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

[. Mislove, J. Ouaknine, and J. Worrell, Axioms for Probability and Nondeterminism, Proc. of the 10th Int. Wksh. on Expressiveness in Concurrency (EXPRESS '03), pp.7-28, 2004.
DOI : 10.1016/j.entcs.2004.04.019

R. De, N. , and M. C. Hennessy, Testing equivalences for processes, Theoretical Computer Science, vol.34, issue.12, pp.83-133, 1984.

M. Naor, B. Pinkas, and R. Sumner, Privacy preserving auctions and mechanism design, Proceedings of the 1st ACM conference on Electronic commerce , EC '99, pp.129-139, 1999.
DOI : 10.1145/336992.337028

G. Norman and V. Shmatikov, Analysis of Probabilistic Contract Signing, Proc. BCS-FACS Formal Aspects of Security (FASec'02), volume 2629 of LNCS, pp.81-96, 2003.
DOI : 10.1007/978-3-540-40981-6_9

G. Norman and V. Shmatikov, Analysis of probabilistic contract signing Formal Aspects of Computing (to appear) [Par81] D. Park. Concurrency and automata on infinite sequences, Proceedings of the Fifth GI-Conference on Theoretical Computer Science, pp.167-183, 1981.

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

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

A. Pfitzmann and M. Köhntopp, Anonymity, unobservability , and pseudonymity: A proposal for terminology, draft v0, 2004.

O. Michael and . Rabin, How to exchange secrets by oblivious transfer, 1981.

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

R. L. Rivest, The threeballot voting system, 2006.

]. H. Roy88 and . Royden, Real Analysis, 1988.

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.

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

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

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

]. C. Sha93 and . Shannon, Some geometrical results in channel capacity, Collected Papers of C.E. Shannon, pp.259-265, 1993.

[. Shmatikov, Probabilistic analysis of anonymity, Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15, pp.119-128, 2002.
DOI : 10.1109/CSFW.2002.1021811

]. V. Shm04 and . Shmatikov, Probabilistic model checking of an anonymity system, Journal of Computer Security, vol.12, issue.34, pp.355-377, 2004.

R. Segala and N. Lynch, Probabilistic simulations for probabilistic processes, An extended abstract appeared in Proceedings of CON- CUR '94, pp.250-273, 1995.

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

A. Sabelfeld and D. Sands, Probabilistic noninterference for multi-threaded programs, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13, pp.200-214, 2000.
DOI : 10.1109/CSFW.2000.856937

E. [. Sokolova and . De-vink, Probabilistic Automata: System Types, Parallel Composition and Comparison, Validation of Stochastic Systems: A Guide to Current Research, pp.1-43, 2004.
DOI : 10.1007/978-3-540-24611-4_1

[. Santhi and A. Vardy, On an improvement over Rényi's equivocation bound, Presented at the 44-th Annual Allerton Conference on Communication, Control, and Computing, 2006.

M. Y. Vardi, Automatic verification of probabilistic concurrent finite state programs, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.327-338, 1985.
DOI : 10.1109/SFCS.1985.12

M. [. Wright, B. Adler, C. Levine, and . Shields, An analysis of the degradation of anonymous protocols, ISOC Network and Distributed System Security Symposium (NDSS), 2002.

W. Yi and K. G. Larsen, Testing Probabilistic and Nondeterministic Processes, Proceedings of the 12th IFIP International Symposium on Protocol Specification, Testing and Verification, 1992.
DOI : 10.1016/B978-0-444-89874-6.50010-6

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