A Logic for the Analysis of Cryptographic Protocols
作者： Paul F. Syverson
DOI: 10.21236/ADA230779
关键词: Autoepistemic logic 、 Multimodal logic 、 Description logic 、 Computer science 、 Cryptographic primitive 、 Higher-order logic 、 Classical logic 、 Theoretical computer science 、 Metalogic 、 Zeroth-order logic
摘要: Abstract : A logic designed to analyze cryptographic protocols is presented in this report. The has distinct means for representing propositional knowledge the sense of familiarity with an individual, e.g., a particular key. It argued that introduction predicate useful and genuine increase expressive power. semantics metalogic are also explored.
sci-hub.st 参考文章(4)
Joseph Y. Halpern, Moshe Y. Vardi, The Complexity of Reasoning about Knowledge and Time: Extended Abstract symposium on the theory of computing. pp. 304- 315 ,(1986)
Brian F. Chellas, Modal Logic: An Introduction ,(1980)
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
L.E. Moser, A logic of knowledge and belief for reasoning about computer security Proceedings of the Computer Security Foundations Workshop II. pp. 57- 63 ,(1989) , 10.1109/CSFW.1989.40587