M. Abadi and C. Fournet, Mobile values, new names, and secure communication, 28th Annual Symposium on Principles of Programming Languages (POPL). ACM, pp.104-115, 2001.
URL : https://hal.archives-ouvertes.fr/hal-01423924

S. Abramsky and R. Jagadeesan, Abstract, The Journal of Symbolic Logic, vol.417, issue.02, pp.543-574, 1994.
DOI : 10.1007/BF01622878

S. Abramsky, R. Jagadeesan, and P. Malacaria, Full Abstraction for PCF, Information and Computation, vol.163, issue.2, pp.409-470, 2000.
DOI : 10.1006/inco.2000.2930

R. Beauxis and C. Palamidessi, Probabilistic and nondeterministic aspects of anonymity, Theoretical Computer Science, vol.410, issue.41, pp.4006-4025, 2009.
DOI : 10.1016/j.tcs.2009.06.008
URL : https://hal.archives-ouvertes.fr/inria-00424855

R. Chadha, S. Delaune, and S. Kremer, Epistemic Logic for the Applied Pi Calculus, Proceedings of FMOODS, pp.182-197, 2009.
DOI : 10.1016/j.entcs.2006.08.026

K. Chatzikokolakis, G. Norman, P. , and D. , Bisimulation for Demonic Schedulers, Proc. of the Twelfth International Conference on Foundations of Software Science and Computation Structures, pp.318-332, 2009.
DOI : 10.1007/3-540-61770-1_38

K. Chatzikokolakis and C. Palamidessi, Making random choices invisible to the scheduler, Information and Computation, vol.208, issue.6, pp.694-715, 2010.
DOI : 10.1016/j.ic.2009.06.006
URL : https://hal.archives-ouvertes.fr/inria-00424860

K. Chatzikokolakis, C. Palamidessi, and P. Panangaden, Anonymity protocols as noisy channels, Inf. and Comp, vol.206, pp.2-4, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00349225

V. Danos and R. Harmer, The Anatomy of Innocence, Lecture Notes in Computer Science, vol.2142, pp.188-202, 2001.
DOI : 10.1007/3-540-44802-0_14

F. Dechesne, M. Mousavi, and S. Orzan, Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap, Proceedings of the 14th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR'07), pp.226-241, 2007.
DOI : 10.1007/978-3-540-75560-9_18

R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi, Reasoning About Knowledge, 1995.

J. Y. Halpern and Y. Moses, Knowledge and common knowledge in a distributed environment, Proc. of Principles of Distributed Computing, pp.50-61, 1984.

M. Hennessy and R. Milner, On observing nondeterminism and concurrency, Lecture Notes in Computer Science, vol.85, pp.299-309, 1980.
DOI : 10.1007/3-540-10003-2_79

M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, Journal of the ACM, vol.32, issue.1, pp.137-162, 1985.
DOI : 10.1145/2455.2460

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

J. M. Hyland and C. L. Ong, On Full Abstraction for PCF: I, II, and III, Information and Computation, vol.163, issue.2, pp.285-408, 2000.
DOI : 10.1006/inco.2000.2917

S. Kramer, C. Palamidessi, R. Segala, A. Turrini, and C. Braun, A quantitative doxastic logic for probabilistic processes and applications to information-hiding, Journal of Applied Non-Classical Logics, vol.4790, issue.4, pp.489-516, 2009.
DOI : 10.2168/LMCS-1(3:1)2005
URL : https://hal.archives-ouvertes.fr/inria-00445212

P. Krasucki, G. Ndjatou, and R. Parikh, Probabilistic knowledge and probabilistic common knowledge, ISMIS 90, pp.1-8, 1990.

S. Kripke, Semantical analysis of modal logic, Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 9, pp.67-96, 1963.

S. Mohalik and I. Walukiewicz, Distributed Games, FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, pp.338-351, 2003.
DOI : 10.1007/978-3-540-24597-1_29

S. Schneider and A. Sidiropoulos, CSP and anonymity, Proc. of ESORICS, pp.198-218, 1996.
DOI : 10.1007/3-540-61770-1_38

C. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, vol.27, issue.3, pp.379-423623, 1948.
DOI : 10.1002/j.1538-7305.1948.tb01338.x

J. J. Van-benthem, Modal correspondence theory Modal Logic and Classical Logic, 1976.