Private authentication, Theoretical Computer Science, vol.322, issue.3, pp.427-476, 2004. ,
DOI : 10.1016/j.tcs.2003.12.023
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
On the reachability problem in cryptographic protocols, Proceedings of CONCUR 00, 2000. ,
Probabilistic anonymity INRIA Futurs and LIX To appear in the proceedings of CONCUR, 2005. ,
A Theory of Communicating Sequential Processes, Journal of the ACM, vol.31, issue.3, pp.560-599, 1984. ,
DOI : 10.1145/828.833
Probable innocence revisited INRIA Futurs and LIX, 2005. ,
The dining cryptographers problem: Unconditional sender and recipient untraceability, Journal of Cryptology, vol.1, issue.1, pp.65-75, 1988. ,
DOI : 10.1007/BF00206326
Weak probabilistic anonymity INRIA Futurs and LIX, 2005. ,
Coarsening at Random, Proceedings of the First Seattle Symposium in Biostatistics, pp.255-294, 1997. ,
DOI : 10.1007/978-1-4684-6316-3_14
Updating probabilities, Journal of Artificial Intelligence Research, vol.19, pp.243-278, 2003. ,
Anonymity and information hiding in multiagent systems, Proc. of the 16th IEEE Computer Security Foundations Workshop, pp.75-88, 2003. ,
Probabilistic asynchronous ?-calculus, Proceedings of FOSSACS 2000, pp.146-160, 2000. ,
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
Analysis of an Electronic Voting Protocol in the Applied Pi Calculus, Programming Languages and Systems ? Proceedings of the 14th European Symposium on Programming, pp.186-200, 2005. ,
DOI : 10.1007/978-3-540-31987-0_14
Casper: A compiler for the analysis of security protocols, Proceedings of 10th IEEE Computer Security Foundations Workshop, pp.53-84, 1997. ,
DOI : 10.3233/JCS-1998-61-204
Communication and Concurrency. International Series in Computer Science, 1989. ,
Communicating and mobile systems: the ?-calculus, 1999. ,
A calculus of mobile processes, I and II. Information and Computation A preliminary version appeared as Technical Reports ECF-LFCS-89-85 and -86, pp.1-40, 1989. ,
A Randomized Distributed Encoding of the ??-Calculus with Mixed Choice, Theoretical Computer Science, vol.335, issue.2-3, pp.73-404, 2005. ,
DOI : 10.1007/978-0-387-35608-2_44
Crowds: anonymity for Web transactions, ACM Transactions on Information and System Security, vol.1, issue.1, pp.66-92, 1998. ,
Modelling and verifying key-exchange protocols using CSP and FDR, Proceedings The Eighth IEEE Computer Security Foundations Workshop, pp.98-107, 1995. ,
DOI : 10.1109/CSFW.1995.518556
Modelling and Analysis of Security Protocols, 2001. ,
Security properties and CSP, Proceedings 1996 IEEE Symposium on Security and Privacy, 1996. ,
DOI : 10.1109/SECPRI.1996.502680
CSP and anonymity, Proc. of the European Symposium on Research in Computer Security (ESORICS), pp.198-218, 1996. ,
DOI : 10.1007/3-540-61770-1_38
Probabilistic simulations for probabilistic processes An extended abstract, Proceedings of CONCUR '94, pp.250-273, 1995. ,
Group principals and the formalization of anonymity, World Congress on Formal Methods, pp.814-833, 1999. ,
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