J. Heather, G. Lowe, and S. Schneider, How to prevent type flaw attacks on security protocols, Journal of Computer Security, vol.11, issue.2, pp.217-244, 2003.
DOI : 10.3233/JCS-2003-11204

F. J. Thayer, J. C. Herzog, and J. D. Guttman, Strand spaces: Why is a security protocol correct?, Proc. IEEE Symposium on Research in Security and Privacy, pp.160-171, 1998.

E. Cohen, Taps: A first-order verifier for cryptographic protocols, Computer Security Foundations Workshop (CSFW), pp.144-158, 2000.

J. Heather and S. Schneider, Towards automatic verification of security protocols on an unbounded network, Proc. 13th Computer Security Foundations Workshop, pp.132-143, 2000.

R. Ramanujam and S. P. Suresh, Tagging Makes Secrecy Decidable with Unbounded Nonces as Well, Lecture Notes in Computer Science, vol.2914, pp.23-323, 2003.
DOI : 10.1007/978-3-540-24597-1_31

URL : http://www.cmi.ac.in/~spsuresh/pdffiles/fsttcs03.pdf

R. Küsters and T. Truderung, Reducing protocol analysis with xor to the xor-free case in the horn theory based approach, ACM Conference on Computer and Communications Security, pp.129-138, 2008.

S. Escobar, C. Meadows, and J. Meseguer, Equational Cryptographic Reasoning in the Maude-NRL Protocol Analyzer, Electronic Notes in Theoretical Computer Science, vol.171, issue.4, pp.23-36, 2007.
DOI : 10.1016/j.entcs.2007.02.053

V. Cortier, S. Delaune, and P. Lafourcade, A survey of algebraic properties used in cryptographic protocols, Journal of Computer Security, vol.14, issue.1, pp.1-43, 2006.
DOI : 10.3233/JCS-2006-14101

URL : https://hal.archives-ouvertes.fr/inria-00000552

Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, An NP decision procedure for protocol insecurity with XOR, Proc. 18 th Annual IEEE Symposium on Logic in Computer Science (LICS'03), pp.261-270, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00103807

S. Malladi and G. S. Hura, What is the best way to prove a cryptographic protocol correct? (position paper), Systems and Networks IEEE International Symposium on Parallel and Distributed Processing, pp.1-7, 2008.

S. Malladi, Phd dissertation -formal analysis and verification of password protocols, 2004.

F. Baader and K. U. Schulz, Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures, Journal of Symbolic Computation, vol.21, issue.2, pp.211-243, 1996.
DOI : 10.1006/jsco.1996.0009

J. Millen and V. Shmatikov, Constraint solving for bounded-process cryptographic protocol analysis, Proceedings of the 8th ACM conference on Computer and Communications Security , CCS '01, pp.166-175, 2001.
DOI : 10.1145/501983.502007

URL : http://www.cs.utexas.edu/~shmat/shmat_ccs01.pdf

Y. Chevalier, A simple constraint solving procedure for protocols with exclusiveor, 2004.

M. Tuengerthal, Implementing a Unification Algorithm for Protocol Analysis with XOR, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00103602

V. Cortier and S. Delaune, Deciding Knowledge in Security Protocols for Monoidal Equational Theories, In: LPAR, pp.196-210, 2007.
DOI : 10.1007/978-3-540-75560-9_16

URL : https://hal.archives-ouvertes.fr/inria-00181606

D. Coppersmith, M. Franklin, J. Patarin, and M. Reiter, Low-exponent RSA with related messages. Lecture notes in computer science, p.1070, 1996.
DOI : 10.1007/3-540-68339-9_1

URL : http://cnscenter.future.co.kr/resource/crypto/algorithm/pkc/lowexponent.pdf

S. Malladi and J. Alves-foss, How to prevent type-flaw guessing attacks on password protocols, Workshop on Foundations of Computer Security (FCS03), 2003.
DOI : 10.21236/ADA459892

URL : http://www.dtic.mil/cgi-bin/GetTRDoc?AD=ADA459892&Location=U2&doc=GetTRDoc.pdf

Y. Chevalier and S. Malladi, Decidability of " real-world " context-explicit security protocols, 2007.