K. K. Choo, C. Boyd, and Y. Hitchcock, Errors in Computational Complexity Proofs for Protocols, Advances in Cryptology -Asiacrypt 2005, pp.624-643, 2005.
DOI : 10.1007/11593447_34

D. Hofheinz, J. Müller-quade, and R. Steinwandt, Initiator-Resilient Universally Composable Key Exchange, European Symposium on Research in Computer Security, Proceedings of ESORICS 2003, pp.61-84, 2003.
DOI : 10.1007/978-3-540-39650-5_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.7892

V. Shoup, OAEP reconsidered Advances in Cryptology ? CRYPTO, LNCS, vol.2139, pp.239-259, 2001.

M. Backes, B. Pfitzmann, and M. Waidner, Secure asynchronous reactive systems, Cryptology ePrint Archive Report, p.82, 2004.

B. Pfitzmann and M. Waidner, A model for asynchronous reactive systems and its application to secure message transmission, Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001, pp.184-200, 2001.
DOI : 10.1109/SECPRI.2001.924298

P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov, A probabilistic poly-time framework for protocol analysis, Proceedings of the 5th ACM conference on Computer and communications security , CCS '98, pp.112-121, 1998.
DOI : 10.1145/288090.288117

A. Ramanathan, J. Mitchell, A. Scedrov, and V. Teague, A probabilistic polynomialtime process calculus for the analysis of cryptographic protocols, Theoretical Computer Science, vol.353, pp.118-164, 2006.

R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch et al., Task-structured probabilistic I/O automata. MIT CSAIL Technical Reports - MIT-CSAIL-TR, pp.2006-2029, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00080681

R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch et al., Using task-structured probabilistic I/O automata to analyze an oblivious transfer protocol. MIT CSAIL Technical Reports -MIT-CSAIL-TR, 2006.

N. Lynch, R. Segala, and F. Vaandrager, Compositionality for Probabilistic Automata, Proceedings of the 14th International Conference on Concurrency Theory, CONCUR'03, pp.208-221, 2003.
DOI : 10.1007/978-3-540-45187-7_14

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

R. Canetti, Universally composable security: a new paradigm for cryptographic protocols, Proceedings 2001 IEEE International Conference on Cluster Computing, pp.136-145067, 2000.
DOI : 10.1109/SFCS.2001.959888

M. Bellare and P. Rogaway, The game-playing technique and its application to triple encryption, Cryptology ePrint Archive Report, vol.331, 2004.

V. Shoup, Sequences of games: a tool for taming complexity in security proofs, Cryptology ePrint Archive Report, vol.332, 2004.

O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game -a completeness theorem for protocols with honest majority, Proceedings of the 19th Annual ACM Symposium on the Theory of Computing (STOC), pp.218-229, 1987.

N. Lynch, I/O automaton models and proofs for shared-key communication systems, Proceedings of the 12th IEEE Computer Security Foundations Workshop, pp.14-29, 1999.
DOI : 10.1109/CSFW.1999.779759