M. Abadi and A. 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 nonrepudiation protocol Process Algebra and Probabilist Methods. Performance Modeling and Verification: Second Joint International Workshop PAPM-PROBMIV, Proceedings, volume 2399 of Lecture Notes in Computer Science, p.17, 2002.

K. Chatzikokolakis and C. Palamidessi, A framework for analyzing probabilistic protocols and its application to the partial secrets ex- change, 2005.

L. Christoff and I. Christoff, Efficient algorithms for verification of equivalences for probabilistic processes, Proc. Workshop on Computer Aided Verification, 1991.
DOI : 10.1007/3-540-55179-4_30

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

O. Mihaela, H. , and C. Palamidessi, Probabilistic asynchronous ?calculus, Proceedings of FOSSACS 2000, pp.146-160, 2000.

B. Jonsson, K. G. Larsen, and W. Yi, Probabilistic extensions of process algebras. Handbook of Process Algebras, 2001.

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

R. , D. Nicola, and M. C. Hennessy, Testing equivalences for processes, Theoretical Computer Science, vol.34, pp.83-133, 1984.

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, 2005.
DOI : 10.1007/978-3-540-40981-6_9

C. Palamidessi and O. M. Herescu, A randomized encoding of the picalculus with mixed choice, Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, pp.537-549, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00201105

M. Rabin, How to exchange secrets by oblivious transfer, 1981.

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