Security Properties: Two Agents Are Sufficient

This publication has 20 references indexed in Scilit:

• An efficient cryptographic protocol verifier based on prolog rules
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
• Proving secrecy is easy enough
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
• Pattern-Based Abstraction for Verifying Secrecy in Protocols
  Published by Springer Nature ,2003
• On Name Generation and Set-Based Analysis in the Dolev-Yao Model
  Published by Springer Nature ,2002
• Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols
  Published by Springer Nature ,2001
• Computing symbolic models for verifying cryptographic protocols
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2001
• On the Reachability Problem in Cryptographic Protocols
  Published by Springer Nature ,2000
• Automatic recognition of tractability in inference relations
  Journal of the ACM, 1993
• A transformational approach to negation in logic programming
  The Journal of Logic Programming, 1990
• On the security of multi-party ping-pong protocols
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983