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

M. E. Andrés, C. Palamidessi, A. Sokolova, and P. Van-rossum, Information hiding in probabilistic concurrent systems, Theoretical Computer Science, vol.412, issue.28, pp.3072-3089, 2011.
DOI : 10.1016/j.tcs.2011.02.045

G. Barthe, B. Köpf, F. Olmedo, and S. Z. Béguelin, Probabilistic relational reasoning for differential privacy, Proc. of POPL. ACM, 2012.

M. Boreale, Quantifying information leakage in process calculi, Proc. of ICALP, pp.119-131, 2006.

C. Braun, K. Chatzikokolakis, and C. Palamidessi, Compositional Methods for Information-Hiding, Proc. of FOSSACS, pp.443-457, 2008.
DOI : 10.1007/978-3-540-78499-9_31

URL : https://hal.archives-ouvertes.fr/hal-01006384

R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. 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

K. Chatzikokolakis, M. E. Andrés, N. E. Bordenabe, and C. Palamidessi, Broadening the Scope of Differential Privacy Using Metrics, Privacy Enhancing Technologies, pp.82-102, 2013.
DOI : 10.1007/978-3-642-39077-7_5

URL : https://hal.archives-ouvertes.fr/hal-00767210

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

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

F. David-de-frutos-escrig, C. Rosa-velardo, and . Gregorio-rodríguez, New Bisimulation Semantics for Distributed Systems, In FORTE, vol.360, issue.1-3, pp.143-159, 2007.
DOI : 10.1016/j.tcs.2006.03.004

Y. Deng, T. Chothia, C. Palamidessi, and J. Pang, Metrics for Action-labelled Quantitative Transition Systems, Proc. of QAPL, pp.79-96, 2006.
DOI : 10.1016/j.entcs.2005.10.033

URL : https://hal.archives-ouvertes.fr/hal-00159689

Y. Deng, J. Pang, and P. Wu, Measuring Anonymity with Relative Entropy, Proc. of FAST, pp.65-79, 2006.
DOI : 10.1007/978-3-540-75227-1_5

J. Desharnais, R. Jagadeesan, V. Gupta, and P. Panangaden, The metric analogue of weak bisimulation for probabilistic processes, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.413-422, 2002.
DOI : 10.1109/LICS.2002.1029849

C. Dwork, Differential Privacy, Proc. of ICALP, pp.1-12, 2006.
DOI : 10.1007/11787006_1

R. Focardi and R. Gorrieri, Classification of security properties (part i: Information flow), FOSAD, pp.331-396, 2000.

M. Gaboardi, A. Haeberlen, J. Hsu, A. Narayan, and B. C. Pierce, Linear dependent types for differential privacy, POPL, pp.357-370, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00909340

C. Jou, . Scotta, and . Smolka, Equivalences, congruences, and complete axiomatizations for probabilistic processes, Proc. of CONCUR, pp.367-383, 1990.
DOI : 10.1007/BFb0039071

A. Kiehn and S. Arun-kumar, Amortised Bisimulations, FORTE, pp.320-334, 2005.
DOI : 10.1007/3-540-10235-3

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

G. Kim, A. Larsen, and . Skou, Bisimulation through probabilistic testing, Inf. and Comp, vol.94, issue.1, pp.1-28, 1991.

A. Machanavajjhala, D. Kifer, J. M. Abowd, J. Gehrke, and L. Vilhuber, Privacy: Theory meets Practice on the Map, 2008 IEEE 24th International Conference on Data Engineering, pp.277-286, 2008.
DOI : 10.1109/ICDE.2008.4497436

R. Milner, Communication and Concurrency, Series in Comp. Sci, 1989.

C. Mu, Measuring Information Flow in Reactive Processes, ICICS, pp.211-225, 2009.
DOI : 10.1007/978-3-642-11145-7_17

A. Narayanan and V. Shmatikov, De-anonymizing Social Networks, 2009 30th IEEE Symposium on Security and Privacy, pp.173-187, 2009.
DOI : 10.1109/SP.2009.22

J. Reed and B. C. Pierce, Distance makes the types grow stronger: a calculus for differential privacy, Proc. of ICFP, pp.157-168, 2010.

Y. A. Peter, S. A. Ryan, and . Schneider, Process algebra and non-interference, Journal of Computer Security, vol.9, issue.12, pp.75-103, 2001.

G. Smith, Probabilistic noninterference through weak probabilistic bisimulation, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings., pp.3-13, 2003.
DOI : 10.1109/CSFW.2003.1212701

C. Michael, D. Tschantz, A. Kaynar, and . Datta, Formal verification of differential privacy for interactive systems (extended abstract), ENTCS, vol.276, pp.61-79, 2011.

L. Xu, Modular Reasoning about Differential Privacy in a Probabilistic Process Calculus, TGC, pp.198-212, 2012.
DOI : 10.1007/978-3-642-41157-1_13

URL : https://hal.archives-ouvertes.fr/hal-00691284