A generic model for symbolic analyzing security protocols
暂无分享,去创建一个
Yang Li | Xiaoju Dong | Yuxi Fu | Yonggen Gu | Y. Li | Yuxi Fu | Xiaoju Dong | Yonggen Gu
[1] Gavin Lowe,et al. Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR , 1996, Softw. Concepts Tools.
[2] Luca Cardelli,et al. Mobile Ambients , 1998, FoSSaCS.
[3] Dieter Gollmann,et al. Towards Verification of Non-repudiation Protocols , 1998 .
[4] Martín Abadi,et al. A Calculus for Cryptographic Protocols: The spi Calculus , 1999, Inf. Comput..
[5] Glynn Winskel,et al. Events in security protocols , 2001, CCS '01.
[6] Steve A. Schneider. Security properties and CSP , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.
[7] Robin Milner,et al. A Calculus of Mobile Processes, II , 1992, Inf. Comput..
[8] Martín Abadi,et al. A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.
[9] Michele Boreale,et al. Symbolic Trace Analysis of Cryptographic Protocols , 2001, ICALP.
[10] Maria Grazia Buscemi,et al. Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation , 2003, MFCS.
[11] Danny Dolev,et al. On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[12] Lawrence C. Paulson,et al. The Inductive Approach to Verifying Cryptographic Protocols , 2021, J. Comput. Secur..
[13] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.