Deriving the Complete Knowledge of Participants in Cryptographic Protocols

作者: Marie-Jeanne Toussaint

DOI: 10.1007/3-540-46766-1_2

关键词:

摘要: This paper shows how to derive a representation of the participants’ knowledge in cryptographic protocol. The modelization is based on assumption that underlying system perfect and an extension “Hidden Automorphism Model” introduced by Merritt. It can be used establish security protocols.

参考文章(16)
Shimon Even, Oded Goldreich, Adi Shamir, On the Security of Ping-Pong Protocols when Implemented using the RSA (Extended Abstract) theory and application of cryptographic techniques. pp. 58- 72 ,(1985) , 10.1007/3-540-39799-X_7
Marie-Jeanne Toussaint, Formal Verification of Probabilistic Properties in Cryptographic Protocols (Extended Abstract) international cryptology conference. pp. 412- 426 ,(1991) , 10.1007/3-540-57332-1_35
Vijay Varadharajan, Verification of network security protocols Computers & Security. ,vol. 8, pp. 693- 708 ,(1989) , 10.1016/0167-4048(89)90008-4
Shafi Goldwasser, Silvio Micali, Charles Rackoff, The knowledge complexity of interactive proof systems SIAM Journal on Computing. ,vol. 18, pp. 186- 208 ,(1989) , 10.1137/0218012
R.A. Kemmerer, Analyzing encryption protocols using formal verification techniques IEEE Journal on Selected Areas in Communications. ,vol. 7, pp. 448- 457 ,(1989) , 10.1109/49.17707
J.H. Moore, Protocol failures in cryptosystems Proceedings of the IEEE. ,vol. 76, pp. 594- 602 ,(1988) , 10.1109/5.4444
L. Gong, R. Needham, R. Yahalom, Reasoning about belief in cryptographic protocols ieee symposium on security and privacy. pp. 234- 248 ,(1990) , 10.1109/RISP.1990.63854
P. Syverson, The use of logic in the analysis of cryptographic protocols ieee symposium on security and privacy. pp. 156- 170 ,(1991) , 10.1109/RISP.1991.130784