作者
Paul F Syverson, Paul C van Oorschot
发表日期
1994/5/16
研讨会论文
IEEE Symp. on Security and Privacy (Oakland 1994)
页码范围
14-28
出版商
IEEE
简介
We present a logic for analyzing cryptographic protocols. This logic encompasses a unification of four of its predecessors in the BAN family of logics, namely those given by Li Gong et al. (1990); M. Abadi, M. Tuttle (1991); P.C. van Oorschot (1993); and BAN itself (M. Burrows et al., 1989). We also present a model-theoretic semantics with respect to which the logic is sound. The logic presented captures all of the desirable features of its predecessors and more; nonetheless, it accomplishes this with no more axioms or rules than the simplest of its predecessors.< >
引用总数
199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242451822132715282233213336233224201725107110811865672
学术搜索中的文章
PF Syverson, PC Van Oorschot - Proceedings of 1994 IEEE Computer Society …, 1994
P Syverson, C Paul, V Oorshot - Proc. of IEEE Computer Society Symposium on …, 1994