Mixed strand spaces
暂无分享,去创建一个
[1] B. Clifford Neuman,et al. A note on the use of timestamps as nonces , 1993, OPSR.
[2] Lawrence C. Paulson,et al. Proving properties of security protocols by induction , 1997, Proceedings 10th Computer Security Foundations Workshop.
[3] Owen Rees,et al. Efficient and timely mutual authentication , 1987, OPSR.
[4] Martín Abadi,et al. A logic of authentication , 1990, TOCS.
[5] Gavin Lowe,et al. Casper: a compiler for the analysis of security protocols , 1997, Proceedings 10th Computer Security Foundations Workshop.
[6] Tzonelih Hwang,et al. Two Attacks on Neuman-Stubblebine Authentication Protocols , 1995, Inf. Process. Lett..
[7] Joshua D. Guttman,et al. Strand spaces: why is a security protocol correct? , 1998, Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186).
[8] ProtocolsLi GongSRI InternationalComputer. Fail-Stop Protocols : An Approach to Designing Secure , 1994 .
[9] Joshua D. Guttman,et al. Honest ideals on strand spaces , 1998, Proceedings. 11th IEEE Computer Security Foundations Workshop (Cat. No.98TB100238).
[10] Bruce Schneier,et al. Protocol Interactions and the Chosen Protocol Attack , 1997, Security Protocols Workshop.
[11] F. Javier Thayer Fábrega,et al. Strand spaces: proving security protocols correct , 1999 .
[12] John A. Clark,et al. A survey of authentication protocol literature: Version 1.0 , 1997 .
[13] Martín Abadi,et al. A logic of authentication , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.
[14] John T. Kohl,et al. The Kerberos Network Authentication Service (V5 , 2004 .
[15] Catherine A. Meadows,et al. Analysis of the Internet Key Exchange protocol using the NRL Protocol Analyzer , 1999, Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344).