The formal definition of the rules are ,
Crypt (shrK A) {|Nonce NA ,
Crypt (shrK A) {|Nonce NA,Agent A, Agent B|}, Crypt (shrK B) {|Nonce NA ,
A logic of authentication, Proceedings of the Royal Society, pp.233-271, 1871. ,
Protecting the computation results of free-roaming agents, Proceedings of the 2nd International Workshop on Mobile Agents, Lecture Notes in Computer Science 1477, 1998. ,
Kerberos Version IV: Inductive analysis of the secrecy goals, Proceedings of the 5th European Symposium on Research in Computer Security, Lecture Notes in Computer Science 1485, 1998. ,
DOI : 10.1007/BFb0055875
Introducing trusted third parties to the mobile agent paradigm, Proceedings of the 4th ECOOP Workshop on Mobile Object Systems, Lecture Notes in Computer Science 1603, 1998. ,
Mobile agents for adaptive routing, Proceedings of the 31st Hawaii International Conference on System Sciences, 1998. ,
TAPS: a first-order verifier for cryptographic protocols, Proceedings of the 13th IEEE Computer Security Foundations Workshop, 2000. ,
DOI : 10.1109/csfw.2000.856933
Proving secrecy is easy enough, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., 2001. ,
DOI : 10.1109/CSFW.2001.930139
Undecidability of bounded security protocols, Proceedings of the Workshop on Formal Methods and Security Protocols, 1999. ,
Honest ideals on strand spaces, Proceedings of the 11th IEEE Computer Security Foundations Workshop, 1998. ,
Strand spaces: Why is a security protocol correct?, Proceedings of the IEEE Symposium on Security and Privacy, 1998. ,
The faithfulness of abstract protocol analysis, Proceedings of the 8th ACM conference on Computer and Communications Security , CCS '01, 2001. ,
DOI : 10.1145/501983.502009
Research on proof-carrying code for mobile-code security, DARPA Workshop on Foundations for Secure Mobile Code, 1997. ,
Towards a completeness result for model checking of security protocols, Proceedings of the 11th IEEE Computer Security Foundations Workshop, 1998. ,
An attack on the Needham-Schroeder public-key authentication protocol, Information Processing Letters, vol.56, issue.3, pp.131-133, 1995. ,
DOI : 10.1016/0020-0190(95)00144-2
Protocol-independent secrecy, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000, 2000. ,
DOI : 10.1109/SECPRI.2000.848449
Local secrecy for stated-based models, Workshop on Formal Methods in Computer Security, 2000. ,
Using encryption for authentication in large networks of computers, Communications of the ACM, vol.21, issue.12, pp.993-998, 1978. ,
DOI : 10.1145/359657.359659
Isabelle/HOL: A Proof Assistant for Higher-Order Logic, volume 2283 of Lecture Notes in Computer Science, 2002. ,
DOI : 10.1007/3-540-45949-9
Efficient and timely mutual authentication, ACM SIGOPS Operating Systems Review, vol.21, issue.1, pp.8-10, 1987. ,
DOI : 10.1145/24592.24594
Verifying the SET protocol, Proceedings of the 1st International Joint Conference on Automated Reasoning, 2001. ,
The inductive approach to verifying cryptographic protocols, Journal of Computer Security, vol.6, issue.1-2, pp.85-128, 1998. ,
DOI : 10.3233/JCS-1998-61-205
Inductive analysis of the Internet protocol TLS, ACM Transactions on Information and System Security, vol.2, issue.3, pp.332-351, 1999. ,
DOI : 10.1145/322510.322530
Relations between secrets: two formal analyses of the Yahalom protocol, Journal of Computer Security, vol.9, issue.3, pp.197-216, 2001. ,
DOI : 10.3233/JCS-2001-9302
PVS: Combining specification, proof checking, and model checking, Proceedings of the 1st International Conference on Formal Methods in Computer- Aided Design, 1996. ,
DOI : 10.1007/BFb0031813
Timing analysis of keystrokes and timing attacks on SSH, Proceedings of the 10th USENIX Security Symposium, 2001. ,
A Sanctuary for Mobile Agents, Proceedings of the 4th ECOOP Workshop on Mobile Object Systems, Lecture Notes in Computer Science 1603, 1998. ,
DOI : 10.1007/3-540-48749-2_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.280