Abstracting Cryptographic Protocols by Prolog Rules
暂无分享,去创建一个
[1] Martín Abadi,et al. Prudent Engineering Practice for Cryptographic Protocols , 1994, IEEE Trans. Software Eng..
[2] A. W. Roscoe,et al. Automating Data Independence , 2000, ESORICS.
[3] Martín Abadi,et al. Mobile values, new names, and secure communication , 2001, POPL '01.
[4] Hugo Krawczyk,et al. SKEME: a versatile secure key exchange mechanism for Internet , 1996, Proceedings of Internet Society Symposium on Network and Distributed Systems Security.
[5] Andrew William Roscoe,et al. Proving security protocols with model checkers by data independence techniques , 1999 .
[6] Martín Abadi,et al. Explicit Communication Revisited: Two New Attacks on Authentication Protocols , 1997, IEEE Trans. Software Eng..
[7] Martín Abadi,et al. Secrecy by typing in security protocols , 1999, JACM.
[8] Lawrence C. Paulson,et al. The Inductive Approach to Verifying Cryptographic Protocols , 2021, J. Comput. Secur..
[9] Gavin Lowe,et al. Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR , 1996, Softw. Concepts Tools.
[10] David Monniaux,et al. Abstracting cryptographic protocols with tree automata , 1999, Sci. Comput. Program..
[11] Jean Goubault-Larrecq,et al. A Method for Automatic Cryptographic Protocol Verification , 2000, IPDPS Workshops.
[12] Martín Abadi,et al. Secrecy by Typing inSecurity Protocols , 1997, TACS.
[13] Bruno Blanchet,et al. An efficient cryptographic protocol verifier based on prolog rules , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..
[14] Dawn Xiaodong Song. Athena: a new efficient automatic checker for security protocol analysis , 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.
[15] Martín Abadi,et al. A logic of authentication , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.