| 1. D Dolev, A Yao. On the security of public-key protocols. IEEE Transactions on Information Theory, 1983, 29(2):198 ^ 2082. Steve Schneider. Verifying Authentication Protocols in CSP. IEEE Transactions on Software Engineering, 1998,24(9):741一7583. C Meadows. A Model of Computation for the NRI. Protocol Analyzer. In: Proceedings of the 1994 Computer Security Foundations Workshop. Franconia, NH, USA, 1994, 84一894. I. C Paulson. The Inductive Approach to Verifying Cryptographic Protocols. Journal of Computer Security, 1998(6):85-v 1285. F Javier Thayer F, abrega, Jonathan C Herzog, Joshua D Gunman. Strand Spaces: Proving Security Protocols Correct. Journal of Computer Security, 1999, 191-V2306. F Javier Thayer F, abrega, Jonathan C Herzog, Joshua D Gunman. Strand Spaces: Why is a Security Protocol Correct'? In: Proceed-ings of the 1998 IEEE Symposium on Security and Privacy. IEEE Computer Press, 1998, 160一1717. Dawn Song, Sergey Beresin, Adrian Perrig. Athena: a Novel Approach to Efficient Automatic Security Protocol Analysis, 20018. Gavin Lowe. Towards a Completeness Result for Model Checking of Security Protocols, In: Proceedings of 11'h IEEE Computer Se-curity Foundation Workshop (CSFW'98).Rockport Massachusetts USA, 19989. 5 Burris, H P Sankappanavar. A Course in Universal Algebra. New York: Springer-Vcrlag, 198110. J Baeten, W P Weijland. Process Algebra UK: Cambridge University Press, 199011. N A Durgin, P D Lincoln, J C Mitchell, A Scedrov. Undecidability of Bounded Security Protocols. In: Electronic Proceedings of the Workshop on Formal Methods and Security Protocols, 1999;http: //www. cs. bell-labs. com/who/nch/fmsp99/program. html |
