M. Abadi and J. Jürjens, Formal Eavesdropping and Its Computational Interpretation, Proceedings of the Fourth International Symposium on Theoretical Aspects of Computer Software (TACS'01), volume 2215 of Lecture Notes in Computer Science, pp.82-94, 2001.
DOI : 10.1007/3-540-45500-0_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.1076

M. Abadi and P. Rogaway, Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)*, Journal of Cryptology, vol.15, issue.2, pp.103-127, 2002.
DOI : 10.1007/s00145-001-0014-7

M. Backes, B. Pfitzmann, and M. Waidner, Limits of the reactive simulatability/UC of Dolev-Yao models with hashes. Cryptology ePrint Archive Random oracles are practical: A paradigm for designing efficient protocols, Proceedings of the 1st ACM CCS, pp.62-73, 1993.

R. Canetti, Towards realizing random oracles: Hash functions that hide all partial information, Advances in Cryptology, 17th Annual International Cryptology Conference (CRYPTO'97, pp.455-469, 1997.
DOI : 10.1007/BFb0052255
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.5404

R. Canetti, Towards realizing random oracles: Hash functions that hide all partial information, Cryptology ePrint Archive, p.7, 1997.
DOI : 10.1007/BFb0052255

R. Canetti, D. Micciancio, and O. Reingold, Perfectly one-way probabilistic hash functions (preliminary version), Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.131-140, 1998.
DOI : 10.1145/276698.276721
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.7681

D. Dolev and A. C. Yao, On the security of public key protocols, Gol01] Oded Goldreich. Foundations of Cryptography, pp.198-208, 1983.
DOI : 10.1109/TIT.1983.1056650

D. Flavio, P. Garcia, and . Van-rossum, Completeness of formal hashes in the standard model, Cryptology ePrint Archive Report, vol.146, issue.146, 2006.

D. Flavio, P. Garcia, and . Van-rossum, Sound computational interpretation of formal hashes. Cryptology ePrint Archive, Report, p.14, 2006.

J. Herzog, A computational interpretation of Dolev???Yao adversaries, Theoretical Computer Science, vol.340, issue.1, pp.57-81, 2005.
DOI : 10.1016/j.tcs.2005.03.003

D. Micciancio and S. Panjwani, Adaptive Security of Symbolic Encryption, Theory of Cryptography: Second Theory of Cryptography Conference (TCC'05), pp.169-187, 2005.
DOI : 10.1007/978-3-540-30576-7_10

D. Micciancio, B. W. , P. Rogaway, and T. Shrimpton, Completeness theorems for the Abadi???Rogaway language of encrypted expressions1, PW00] Birgit Pfitzmann and Michael Waidner Proceedings of the 7th ACM CCS Fast Software Encryption: 11th International Workshop, pp.99-129, 2000.
DOI : 10.3233/JCS-2004-12105