Computationally Sound and Effective Symbolic Analysis of Group Key Exchange Protocols: Computationally Sound and Effective Symbolic Analysis of Group Key Exchange Protocols
暂无分享,去创建一个
[1] Steve A. Schneider. Verifying Authentication Protocols in CSP , 1998, IEEE Trans. Software Eng..
[2] Jonathan Herzog,et al. A computational interpretation of Dolev-Yao adversaries , 2005, Theor. Comput. Sci..
[3] Flavio D. Garcia,et al. Sound and complete computational interpretation of symbolic hashes in the standard model , 2006, Theor. Comput. Sci..
[4] Jonathan Katz,et al. Scalable Protocols for Authenticated Group Key Exchange , 2003, Journal of Cryptology.
[5] Véronique Cortier,et al. A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems , 2011, Journal of Automated Reasoning.
[6] Oded Goldreich,et al. On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits , 2007, Journal of Cryptology.
[7] Yvo Desmedt,et al. A secure and scalable Group Key Exchange system , 2005, Inf. Process. Lett..