安全外壳安全模型SSHSM构造及安全性能分析

网络管理协议SNMP安全缺陷不能自己得到解决,还必须借助其他的安全协议来解决。利用安全外壳协议SSH来解决这样的问题显然是一种好的方法。本文以SSH协议为基础构造安全外壳安全模型SSHSM,并对其安全性能进行了分析,对网络安全管理是一种不错的借鉴。     

一种安全协议组合分析方法*

提出了一种安全协议组合分析方法,即使用通用认证协议规范语言CAPSL描述安全协议,然后使用连接器,将CAPSL规范转换为其他安全协议分析工具的形式化输入,从而能够利用不同分析工具的优点,来更好地保证安全协议形式化分析的准确性,同时也方便了安全协议分析者。设计了两个CAPSL连接器,并给出一个协议转换实例。     

安全外壳传输模型SSHTM构造及性能分析

网络管理协议SNMP安全缺陷不能自己得到解决,还必须借助其他的安全协议来解决。利用安全外壳协议SSH来解决这样的问题显然是一种好的方法。本文以SSH协议为基础构造安全外壳传输模型SSHTM,并对其性能进行了分析,对现在网络安全管理是一种不错的借鉴。     

基于信念绑定的安全协议消息块设计方法

为解决安全协议设计中容易忽视的信念问题,分析了安全协议中密钥新鲜性、密钥共享性和公钥归属性等信念,定义了描述这些信念的参数,最后提出了一种基于信念绑定的安全协议消息块设计方法。利用该方法来设计安全协议,可提高安全协议抗攻击的能力。     

移动ad hoc网络安全路由协议综述

移动adhoc网络路由协议对于各种针对路由协议的攻击无能为力,因为路由协议并未考虑安全因素,攻击者肆意利用路由协议中的安全隐患来破坏网络。论文综述了移动adhoc网络安全路由协议研究方面的一些最新工作,对该领域各种安全路由协议进行了研究分析,并描述了移动adhoc网络安全路由协议所面临的安全挑战。     

一种基于TPM增强的ARAN安全路由协议

安全路由协议设计是Ad hoc网络安全研究的重要组成部分。当前研究主要集中在采用经典密码学中的方法来保证路由安全。结合可信计算中的TPM和典型的安全路由协议ARAN,提出了一种新的安全路由协议TEARAN,该协议不再采用集中式的公钥证书分发中心PKI,而是采用TPM中的DAA(Directed Anonymous Attestation)方式来进行节点的身份认证,以及软安全中可信阂值来监测部居节点的行为,从而进行公钥可信分发,同时确保了无恶意节点加入网络,另外,也采用公钥签名、会话密钥加密来保证端到端通信的保密性、完整性和不可否认性。理论证明了提出的TEARAN协议能够实现网络的匿名安全,防范当前常见的攻击方式,达到了很好的安全保证效果。     

RFID安全协议的设计与分析

回顾了已有的各种RFID安全机制,重点介绍基于密码技术的RFID安全协议;分析了这些协议的缺陷;讨论了基于可证明安全性理论来设计和分析RFID安全协议的模型和方法.     

基于GSPM的安全协议新鲜性分析*

安全协议形式化分析方法通过规范描述和数学推理来检验安全协议是否满足各种安全要求.GSPM是安全协议形式化分析的一般模型.在该模型中加入新鲜性的定义,形式化描述了新鲜性这一特殊的安全性质,扩展了GSPM的适用范围,并通过Andrew Secure RPC协议给出了形式化分析新鲜性的实例研究.     

基于Strand模型的Needham-Schroeder协议分析

Strand空间模型是一种安全协议分析模型.使用图的形式来描述协议,证明协议的正确性.通过分析研究,本文建立了攻击者模型.并在此基础上运用安全协议的形式化分析方法-Stmnd空间模型,对公开密钥协议NSPK进行了分析,说明了该方法进行协议分析的过程,证明了该协议在保密性和认证性方面的正确性,并分析了该协议存在的安全缺陷.     

状态绑定的安全协议消息块设计方法

研究抗攻击的安全协议设计方法是安全专家一直努力的方向,而安全协议中利用密码机制形成的消息块本身结构的构造,对于安全协议的抗攻击性起着非常重要的作用.本文在重放攻击层次基础上,通过提炼安全协议为避免各种攻击应具备的状态参数,提出了一种基于状态绑定的安全协议消息块设计方法.该方法针对安全协议各个层次可能存在的缺陷,通过状态绑定来解决这些缺陷,可极大限度地提高安全协议抗攻击的能力.     

基于XML的组员关系协议的设计与实现

结合开发的协同设计系统，给出了协作层基于XML的组员关系协议的设计与实现方法。分析了组员关系协议的通信行为，并使用UML的面向对象方法分析与设计了请求、响应和通知协议，详细说明了使用XML Schema实现通信协议的方法，结合协议实例，给出了基于XML的协议的打包和解析，并证明了协议的可行性。该协议能应用于异构平台下多种协同应用系统。     

Constraint-based structuring of network protocols

Summary. The complexity of designing protocols has led to compositional techniques for designing and verifying protocols. We propose a technique based on the notion of parallel composition of protocols. We view a composite protocol as an interleaved execution of the component protocols subject to a set of constraints. Using the constraints as building blocks, we define several constraint-based structures with each structure combining the properties of the component protocols in a different way. For instance, the component protocols of a multifunction protocol can be structured so that the composite protocol performs all the individual functions concurrently or performs only one of them depending on the order of initiation of the component protocols. We provide inference rules to infer safety and liveness properties of the composite protocol. Some properties are derived from those of the component protocols while others are derived from the structuring mechanism (the set of constraints) used to combine the component protocols. Received: October 1996 / Accepted: August 1998     

基于XML的WebGIS通信协议的设计与实现

针对WebGIS通信中面向复杂对象及大容量传输的特点,给出了一个新的基于XML的WebGIS通信协议的设计和实现方法.使用UML工具以面向对象的方法细致分析了WebGIS典型的请求和响应协议,并据此详细说明了使用W3C的xML Schema规范设计WebGIS的通信协议的基本方法.最后结合一个WebGIS应用原型,给出了在WebGIS系统中通过对基于xML的通信协议的打包和解析,完成嵌入的主要流程.该通信协议能够适用于分布式异构平台下多种WebGIS系统架构的空间信息交换.     

一种分析安全协议的新逻辑

提出了一种分析安全协议的新逻辑，既能有效地分析认证协议的认证性，又能分析电子商务协议的可追究性和公平性。该方法对认证协议的分析，不需要协议理想化，避免了因理想化而导致的各类问题。能够有效地分析电子商务协议的可追究性和公平性，用于分析实用协议。分析过程简单直观，便于实现机器自动验证。     

Timer-based composition of fault-containing self-stabilizing protocols

One of the desired properties of distributed systems is self-adaptability against faults. Self-stabilizing protocols provide autonomous recovery from any finite number of transient faults. However, in practice, catastrophic faults rarely occur, while small-scale faults are more likely to occur. Fault-containing self-stabilizing protocols promise not only self-stabilization but also containment of the effect of small-scale faults, i.e., they promise quick recovery and small effect for small-scale faults. Hierarchical composition of self-stabilizing protocols is expected to ease the design of new self-stabilizing protocols. However, existing composition techniques for self-stabilizing protocols cannot preserve the fault-containment property of source protocols. In this paper, we propose a novel timer-based hierarchical composition of fault-containing self-stabilizing protocols that preserves the fault-containment property of source protocols. To implement timers, we propose a local neighborhood synchronizer that synchronizes limited number of processes during a short time after a fault without involving the entire network into the synchronization. The proposed composition technique facilitates the design of new fault-containing self-stabilizing protocols and enhances the reusability of existing fault-containing self-stabilizing protocols.     

The cost of recovery in message logging protocols

Past research in message logging has focused on studying the relative overhead imposed by pessimistic, optimistic and causal protocols during failure-free executions. In this paper, we give the first experimental evaluation of the performance of these protocols during recovery. Our results suggest that applications face a complex tradeoff when choosing a message logging protocol for fault tolerance. On the one hand, optimistic protocols can provide fast failure-free execution and good performance during recovery, but are complex to implement and can create orphan processes. On the other hand, orphan-free protocols either risk being slow during recovery (e.g. sender-based pessimistic and causal protocols) or incur a substantial overhead during failure-free execution (e.g. receiver-based pessimistic protocols). To address this tradeoff, we propose hybrid logging protocols, which are a new class of orphan-free protocols. We show that hybrid protocols perform within 2% of causal logging during failure-free execution and within 2% of receiver-based logging during recovery     

Model-based testing of internet e-mail protocols

This paper considers Model-Based Testing of e-mail protocols: a method for modeling mail protocols is proposed, specific features of mail protocols are considered in the context of testing, and results of testing of popular open-source mail servers are presented. As an example, test suites for the SMTP and POP3 protocols developed in JavaTESK (a Java extension for testing with formal methods) are presented. The test suites consist of two parts: independent conformance tests for protocols and a joint test imitating the operation of mail protocols in a network.     

无线传感器网络的路由协议研究

无线传感器网络(WSNs)是计算机、通信和传感器3项技术相结合的产物,因其巨大的应用前景受到了越来越广泛的关注。介绍了WSNs的一些特点,指出传统路由协议不能有效应用于WSNs的路由协议;然后分类阐述了当前较为典型的路由协议,分析了它们的优缺点;对比分析了这些协议的特点;总结了路由协议设计应满足的要求、存在的挑战以及可能的研究方向。     

An algebra for commitment protocols

Protocols enable unambiguous, smooth interactions among agents. Commitments among agents are a powerful means of developing protocols. Commitments enable flexible execution of protocols and help agents reason about protocols and plan their actions accordingly, while at the same time providing a basis for compliance checking. Multiagent systems based on commitments can conveniently and effectively model business interactions because the autonomy and heterogeneity of agents mirrors real-world businesses. Such modeling, however, requires multiagent systems to host a rich variety of protocols that can capture the needs of different applications. We show how a commitment-based semantics provides a basis for refining and aggregating protocols. We propose an approach for designing commitment protocols wherein traditional software engineering notions such as refinement and aggregation are extended to apply to protocols. We present an algebra of protocols that can be used to compose protocols by refining and merging existing ones, and does this at a level of abstraction high enough to be useful for real-world applications. We thank Amit Chopra, Nirmit Desai, and anonymous referees for valuable comments. This research was supported partially by the NSF under grant DST-0139037, and partially by DARPA under contract F30603-00-C-0178.     

安全协议的自动化设计

阐述了安全协议的自动生成-约简-优化模型。在第1阶段，依据系统规范的要求生成候选协议，并用简单的句法约束规则和基于简单冒充的早期删减规则对候选协议进行约简。第2阶段，以串空间理论为依据制定删减规则，对以上候选协议进行进一步的优化，生成符合安全需求的正确协议。