Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation

This publication has 15 references indexed in Scilit:

• Symbolic protocol analysis with products and Diffie-Hellman exponentiation
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2004
• Intruder deductions, constraint solving and insecurity decision in presence of exclusive or
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation
  Published by Springer Nature ,2003
• Mechanized proofs for a recursive authentication protocol
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Constraint solving for bounded-process cryptographic protocol analysis
  Published by Association for Computing Machinery (ACM) ,2001
• Symbolic Trace Analysis of Cryptographic Protocols
  Published by Springer Nature ,2001
• Computing symbolic models for verifying cryptographic protocols
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2001
• Unification Theory
  Published by Elsevier ,2001
• On the Reachability Problem in Cryptographic Protocols
  Published by Springer Nature ,2000
• An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations
  Information and Computation, 1994