BAN逻辑及其在协议认证中的缺陷

BAN逻辑可以证明协议是否能够达到预期目标,还能够发现协议中存在的一些缺陷。论文在分析了BAN逻辑的主要规则和分析步骤之后,着重研究了BAN逻辑存在的各类缺陷,并对BAN类逻辑需要改进的方面进行了讨论。     

类BAN逻辑基本模型及缺陷

类BAN逻辑是一种用于分析密码协议安全性的逻辑.在分析了BAN,AT,MB,GNY,SVO等类BAN逻辑之后,指出这些逻辑的缺陷,包括若干新发现的缺陷.首先把类BAN的模型抽象出来,形成一个五元组模型,然后分析该模型的各个要素,并依据该模型对类BAN逻辑的缺陷进行分类,最后指出进一步发展类BAN逻辑应解决的问题.     

BAN逻辑及其在认证协议性质分析中的应用研究

在各类安全协议中,认证协议分析正成为热点,BAN逻辑是近年来主要的认证协议分析工具之一。在分析了BAN逻辑主要规则和分析步骤之后,研究了BAN逻辑存在的各类缺陷,并对BAN类逻辑需要改进的方面进行了讨论。     

一种新的类BAN逻辑模态语义模型——兼论类BAN逻辑的语法缺陷

由于类BAN逻辑缺乏明确而清晰的语义，其语法规则和推理的正确性就受到了质疑。本文定义了安全协议的计算模型，在此基础上定义了符合模态逻辑的类BAN逻辑“可能世界”语义模型，并从语义的角度证明了在该模型下的类BAN逻辑语法存在的缺陷，同时，指出了建立或改进类BAN逻辑的方向。     

认证协议的形式逻辑分析方法——BAN类逻辑综述

介绍了最早的认证协议形式化分析方法———BAN逻辑及扩展的BAN逻辑 ,统称为BAN类逻辑。并通过分析比较 ,指出了各种扩展的BAN逻辑对原BAN逻辑的扩展和改进之处。     

一种新的安全协议形式化验证方法

形式化方法能有效检验安全协议的安全性，BAN类逻辑的发展极大地促进了这一领域的研究，但是现有的BAN类逻辑仍然存在许多问题．在分析现有BAN类逻辑的基础上，提出一种新的安全协议形式化验证方法，实现现有BAN类逻辑的验证功能，并使安全协议验证工作简单可行，便于实现机器自动验证．为安全协议形式化验证提供了一种新的途径．     

NS对称密钥认证协议安全性分析

安全协议的形式化验证与分析已成为国际研究的热点.本文应用BAN逻辑研究Needham-Schroeder对称密钥认证协议,指出该协议存在的安全缺陷,利用消息新鲜性对其进行相应改进,并在BAN逻辑下形式化证明改进的协议可以满足安全目标.     

BAN逻辑在一类中间入侵攻击协议分析中的缺陷*

BAN逻辑通过对密钥协商协议的运行进行形式化分析,研究密钥协商双方通过相互接收和发送消息从最初的信仰逐渐发展到协议最终要达到的目的,证明协议是否能够达到预期目标,以此发现协议中存在的一些缺陷.通过一个端到端协议例子的证明和分析,指出BAN逻辑对于一类密钥协商协议中存在的中间入侵攻击分析方面存在缺陷,还需要结合非形式化的分析方法来加以解决.     

公钥密码体制下认证协议的形式化分析方法研究

本文通过对形式化方法中最广泛使用的类BAN逻辑进行研究发现，此方法更侧重于对称密码体制下认证协议的分析，而在分析基于公钥体制的认证协议时，该方法有很大的局限性。因此，文中针对公角密码的特点对类BAN逻辑进行了扩展。扩展后的逻辑方法能够更好地应用于分析公钥认证协议。     

Otway-Rees协议并行攻击的SG逻辑分析

网络信息安全很大程度上取决于密码协议的安全，重放攻击和并行攻击是对密码协议的常见攻击，能够分析并行攻击的形式化分析方法并不多见。该文介绍了一种分析密码协议并行攻击和重放攻击的逻辑方法——SG逻辑，应用它对改进版的Otway-Rees协议进行了分析，找出了BAN类逻辑所不能分析出来的缺陷，针对该缺陷给出了协议的进一步改进，并推证了改进后的协议对SG逻辑的分析是安全的。     

Knowledge structure approach to verification of authentication protocols

~~Knowledge structure approach to verification of authentication protocols1. Hintikka, J., Knowledge and Belief, Ithaca, NY. Cornell University Press, 1962. 2. Fagin, R., Halpern, J., Moses, Y. et al.,Reasoning About Knowledge, Cambridge, MA. MIT Press, 1995. 3. Halpern, I., Zuck, L., A little knowledge goes a long way. Simple knowledge based derivations and correctness proofs for a family of protocols. Journal of the ACM, 1992, 39(3): 449-478. 4. Stulp, F., Verbrugge, …     

人工智能中泛逻辑学的研究*

逻辑学的理论为人工智能的发展提供了有力的工具。标准逻辑促进了人工智能早期的发展,随着处理知识的随机性、模糊性和未知性等特点的出现,模糊逻辑等在人工智能中得到发展;各种形式的非标准逻辑的出现,促使建立尽可能包容一切逻辑形态和推理模式的泛逻辑学。在分析模糊逻辑规律的基础上,把三角范数理论和逻辑学紧密结合起来,利用三角范数理论提出命题泛逻辑学。目前,泛逻辑学在人工智能中已经取得了一定的研究成果。     

A survey on temporal logics for specifying and verifying real-time systems

Over the last two decades, there has been an extensive study of logical formalisms on specifying and verifying real-time systems. Temporal logics have been an important research subject within this direction. Although numerous logics have been introduced for formal specification of real-time and complex systems, an up to date survey of these logics does not exist in the literature. In this paper we analyse various temporal formalisms introduced for specification, including propositional/first-order linear temporal logics, branching temporal logics, interval temporal logics, real-time temporal logics and probabilistic temporal logics. We give decidability, axiomatizability, expressiveness, model checking results for each logic analysed. We also provide a comparison of features of the temporal logics discussed.     

Combining and automating classical and non-classical logics in classical higher-order logics

Numerous classical and non-classical logics can be elegantly embedded in Church??s simple type theory, also known as classical higher-order logic. Examples include propositional and quantified multimodal logics, intuitionistic logics, logics for security, and logics for spatial reasoning. Furthermore, simple type theory is sufficiently expressive to model combinations of embedded logics and it has a well understood semantics. Off-the-shelf reasoning systems for simple type theory exist that can be uniformly employed for reasoning within and about embedded logics and logics combinations. In this article we focus on combinations of (quantified) epistemic and doxastic logics and study their application for modeling and automating the reasoning of rational agents. We present illustrating example problems and report on experiments with off-the-shelf higher-order automated theorem provers.     

Justification logics, logics of knowledge, and conservativity

Several justification logics have been created, starting with the logic LP, (Artemov, Bull Symbolic Logic 7(1):1–36, 2001). These can be thought of as explicit versions of modal logics, or of logics of knowledge or belief, in which the unanalyzed necessity (knowledge, belief) operator has been replaced with a family of explicit justification terms. We begin by sketching the basics of justification logics and their relations with modal logics. Then we move to new material. Modal logics come in various strengths. For their corresponding justification logics, differing strength is reflected in different vocabularies. What we show here is that for justification logics corresponding to modal logics extending T, various familiar extensions are actually conservative with respect to each other. Our method of proof is very simple, and general enough to handle several justification logics not directly corresponding to distinct modal logics. Our methods do not, however, allow us to prove comparable results for justification logics corresponding to modal logics that do not extend T. That is, we are able to handle explicit logics of knowledge, but not explicit logics of belief. This remains open.     

Kripke Semantics for Modal Substructural Logics

We introduce Kripke semantics for modal substructural logics, and provethe completeness theorems with respect to the semantics. Thecompleteness theorems are proved using an extended Ishihara's method ofcanonical model construction (Ishihara, 2000). The framework presentedcan deal with a broad range of modal substructural logics, including afragment of modal intuitionistic linear logic, and modal versions ofCorsi's logics, Visser's logic, Méndez's logics and relevant logics.     

Deciding Regular Grammar Logics with Converse Through First-Order Logic

We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF², which is the intersection of the guarded fragment and the 2-variable fragment of first-order logic. The translation is theoretically interesting because it translates modal logics with certain frame conditions into first-order logic, without explicitly expressing the frame conditions. It is practically relevant because it makes it possible to use a decision procedure for the guarded fragment in order to decide regular grammar logics with converse. The class of regular grammar logics includes numerous logics from various application domains. A consequence of the translation is that the general satisfiability problem for every regular grammar logics with converse is in EXPTIME. This extends a previous result of the first author for grammar logics without converse. Other logics that can be translated into GF² include nominal tense logics and intuitionistic logic. In our view, the results in this paper show that the natural first-order fragment corresponding to regular grammar logics is simply GF² without extra machinery such as fixed-point operators.