M. Abadi and J. Jürjens, Formal Eavesdropping and Its Computational Interpretation, Proc. 4th TACS, pp.82-94, 2001.
DOI : 10.1007/3-540-45500-0_4

M. Abadi and P. Rogaway, Reconciling two views of cryptography: The computational soundness of formal encryption, Proc. 1st IFIP TCS, pp.3-22, 2000.

M. Backes and B. Pfitzmann, Computational Probabilistic Non-interference, Proc. 7th European Symp. on Research in Computer Security (ESORICS), pp.1-23, 2002.
DOI : 10.1007/3-540-45853-0_1

M. Backes and B. Pfitzmann, Symmetric encryption in a simulatable Dolev-Yao style cryptographic library, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004., pp.204-218, 2004.
DOI : 10.1109/CSFW.2004.1310742

M. Backes and B. Pfitzmann, Limits of the Cryptographic Realization of Dolev-Yao-Style XOR, Proc. 10th ESORICS, pp.178-196, 2005.
DOI : 10.1007/11555827_11

M. Backes and B. Pfitzmann, Relating Symbolic and Cryptographic Secrecy, IEEE Transactions on Dependable and Secure Computing, vol.2, issue.2, pp.109-123, 2005.
DOI : 10.1109/TDSC.2005.25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.8373

M. Backes, B. Pfitzmann, and M. Waidner, A composable cryptographic library with nested operations, Proceedings of the 10th ACM conference on Computer and communication security , CCS '03, pp.220-230, 2003.
DOI : 10.1145/948109.948140

M. Backes, B. Pfitzmann, and M. Waidner, Symmetric Authentication within a Simulatable Cryptographic Library, Proc. 8th ESORICS, pp.271-290, 2003.
DOI : 10.1007/978-3-540-39650-5_16

M. Backes, B. Pfitzmann, and M. Waidner, Limits of the Reactive Simulatability/UC of Dolev-Yao models with hashes, Proc. 11th ESORICS, 2006.

M. Baudet, V. Cortier, and S. Kremer, Computationally sound implementations of equational theories against passive adversaries, Proc. 32nd Intern. Colloquium on Automata, Languages and Programming (ICALP), pp.652-663, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00426620

R. Canetti, Towards realizing random oracles: Hash functions that hide all partial information, Proc. 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, Universally composable security: a new paradigm for cryptographic protocols, Proceedings 2001 IEEE International Conference on Cluster Computing, pp.136-145, 2001.
DOI : 10.1109/SFCS.2001.959888

R. Canetti and J. Herzog, Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols, Proc. 3rd Theory of Cryptography Conf. (TCC), pp.380-403, 2006.
DOI : 10.1007/11681878_20

R. Canetti, D. Micciancio, and O. Reingold, Perfectly one-way probabilistic hash functions, Proc. 30th ACM STOC, 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, IEEE Transactions on Information Theory, vol.29, issue.2, pp.198-208, 1983.
DOI : 10.1109/TIT.1983.1056650

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

P. Laud, Semantics and Program Analysis of Computationally Secure Information Flow, Proc. 10th European Symp. on Programming (ESOP), pp.77-91, 2001.
DOI : 10.1007/3-540-45309-1_6

P. Laud, Symmetric encryption in automatic analyses for confidentiality against active adversaries, Proc. 25th IEEE Symp. on Security & Privacy, pp.71-85, 2004.

P. Laud, Secrecy types for a simulatable cryptographic library, Proceedings of the 12th ACM conference on Computer and communications security , CCS '05, pp.26-35, 2005.
DOI : 10.1145/1102120.1102126

D. Micciancio and B. Warinschi, Soundness of Formal Encryption in the Presence of Active Adversaries, Proc. 1st Theory of Cryptography Conf. (TCC), pp.133-151, 2004.
DOI : 10.1007/978-3-540-24638-1_8

B. Pfitzmann and M. Waidner, Composition and integrity preservation of secure reactive systems, Proceedings of the 7th ACM conference on Computer and communications security , CCS '00, pp.245-254, 2000.
DOI : 10.1145/352600.352639

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

C. Sprenger, M. Backes, D. Basin, B. Pfitzmann, and M. Waidner, Cryptographically Sound Theorem Proving, 19th IEEE Computer Security Foundations Workshop (CSFW'06), 2006.
DOI : 10.1109/CSFW.2006.10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.4064