安全协议的形式化描述和分析

Security protocols use cryptography system to complete the tasks of principal identity authentication and seccion key distribution. The correctness of security protocols is of vital importance to ensure the security of the Inter-net application. Formal methods have been proved to be a valid approach to analyze and verify security protocols. This paper briefly introduces the three main styles in the field of security protocol analysis and their representative work.After that,it points out the future deveopment direction.     

Modular approach to the design and analysis of password-based security protocols

In this paper, a general framework for designing and analyzing password-based security protocols is presented. First we introduce the concept of "weak computational indistinguishability" based on current progress of password-based security protocols. Then, we focus on cryptographic foundations for password-based security protocols, i.e., the theory of "weak pseudorandomness". Furthermore, based on the theory of weak pseudorandomness, we present a modular approach to design and analysis of password-based security protocols. Finally, applying the modular approach, we design two kinds of password-based security protocols, i.e., password-based session key distribution (PSKD) protocol and protected password change (PPC) protocol. In addition to having forward secrecy and improved efficiency, new protocols are proved secure.     

Security extension for the Canetti-Krawczyk model in identity-based systems

The Canetti-Krawczyk (CK) model is a formalism for the analysis of key-exchange protocols, which can guarantee many security properties for the protocols proved secure by this model. But we find this model lacks the ability to guarantee key generation center (KGC) forward secrecy, which is an important security property for key-agreement protocols based on Identity. The essential reason leading to this weakness is that it does not fully consider the attacker's capabilities. In this paper, the CK model is accordingly extended with a new additional attacker's capability of the KGC corruption in Identity-based systems, which enables it to support KGC forward secrecy.     

Analysis and design of a smart card based authentication protocol

Numerous smart card based authentication protocols have been proposed to provide strong system security and robust individual privacy for communication between parties these days. Nevertheless, most of them do not provide formal analysis proof, and the security robustness is doubtful. Chang and Cheng （2011） proposed an efficient remote authentication protocol with smart cards and claimed that their proposed protocol could support secure communication in a multi-server environment. Unfortunately, there are opportunities for security enhancement in current schemes. In this paper, we identify the major weakness, i.e., session key disclosure, of a recently published protocol. We consequently propose a novel authentication scheme for a multi-server envi- ronment and give formal analysis proofs for security guarantees.     

Multiparty Authentication Services and Key Agreement Protocols with Semi-Trusted Third Party

This paper introduces a new family of group key establishment protocols suitable for small or medium-sized groups.Five protocols are presented,using a semi-trusted server,with varying security service,The first one is a non-authenticated key agreement protocol suitable for applications with low security requirements.The second protocol adds an authenticated key agreement to provide collaborative authentication.The third and the fourth protocols provide key establishment with integrity and confirmation services,and the fifth protocol is the member adding protocol.A major advantage of the protocols is that they reduce the numbers of rouds from n to 5.     

A new approach for UC security concurrent deniable authentication

Deniable authentication protocols allow a sender to authenticate a message for a receiver, in a way which the receiver cannot convince a third party that such authentication ever took place. When we consider an asynchronous multi-party network with open communications and an adversary that can adaptively corrupt as many parties as it wishes, we present a new approach to solve the problem of concurrent deniable authentication within the framework of universally composable （UC） security. We formulate a definition of an ideal functionality for deniable authentication. Our constructions rely on a modification of the verifiably smooth projective hashing （VSPH） with projection key function by trapdoor commitment. Our protocols are forward deniable and UC security against adaptive adversaries in the common reference string model. A new approach implies that security is preserved under concurrent composition of an unbounded number of protocol executions; it implies non-malleability with respect to arbitrary protocols and more. The novelty of our schemes is the use of witness indistinguishable protocols and the security is based on the decisional composite residuosity （DCR） assumption. This new approach is practically relevant as it leads to more efficient protocols and security reductions.     

Integrating MOF-Compliant Analysis Results

With the increasing maturity of model-driven tools and methods, new model-based analysis methods are developed to support specific stakeholder concerns during software lifecycle. This multiplication of models and their related analysis tools calls for solution addressing the integration of MOF-based analysis methods. Current research works on integration of analysis methods have already addressed the extraction of the needed input data as well as the control and the integration of the tools supporting the analysis execution. However, little attention has been paid to the integration of analysis results back into initial model. We propose an MOF-based framework enabling the integration of analysis results that a) defines a meta-model capturing the integration requirements, b) provides an MOF meta-model extension mechanism with support for upward compatibility; and c) automatically generates a model transformation for model integration. We illustrate the use of our framework by integrating a reliability analysis methods and a fault tolerant reconfiguration method on the ABC/ADL Software Architecture. We applied the resulting analysis composition onto the ECPerf JEE system.     

A Multiple-Valued Algebra for Modeling MOS VLSI Circuits at Switch-Level

A multiple-valued algebra for modeling MOS VLSI circuits at switch-level is proposed in this paper,Its structure and properties are studied.This algebra can be used to transform a MOS digital circuit to a swith-level algebraic expression so as to generate the truth table for the circuit and to derive a Boolean expression for it.In the paper,methods to construct a switch-level algebraic expression for a circuit and methods to simplify expressions are given.This algebra provides a new tool for MOS VLSI circuit design and analysis.     

The Design of Image Compression Algorithms Testing and Analyzing Tool

This paper studies the evaluation methods for image compression algorithms and proposes test methods for compression algo- rithms including horizontal comparison test and vertical decomposition test. On the base of this, we design and realize a testing and analyzing tool for performance of image compression algorithms. This tool can test and analyze compression algorithms and generate kinds of analysis chart automatically, provides a lot of convenience for users and has very important practical value. In order to im- prove efficiency, veracity and perfectibility of the tool, this paper presents selection method for test images and analysis method for test results which have certain theoretical meaning.     

An immunity based network security risk estimation

There are two kinds of risk-estimation methods for the network security: static and real-time. The static methods estimate the network risk through statically evaluating the network value, security holes, and the occurring frequency of security events[1], e.g., COBRA1), OCTAVE[2], etc. Focusing on the static factors of the target system, the static methods can only make a rough estimation of the security risk that the network faced in the past, and cannot in real-time evaluate the risk of …     

基于进程代数安全协议验证的研究综述

安全协议用于实现开放互联网络的通信安全,进程代数是一类使用代数方法研究通信并发系统理论的泛称,基于进程代数的安全协议验证是以进程代数作为安全协议描述语言的安全协议形式化验证方法．描述了基于进程代数的安全协议验证研究的4种主要方法：基于踪迹语义的方法;基于互模拟验证的方法;基于类型理论的方法;基于逻辑程序的方法．并给出了基于进程代数的安全协议验证进一步的研究方向．     

安全协议的进程代数规约到逻辑程序的自动转换

安全协议用于实现开放互连网络的安全通讯，它本质上是分布式并发程序，使用进程代数可以将其描述为角色进程的并发合成系统。使用抽象方法，安全协议角色进程并发合成模型可以转化为逻辑程序；通过计算逻辑程序的不动点，能够对安全协议无穷会话的并发交叠运行进行验证。本文基于Objective Caml语言，实现了安全协议进程代数描述述到安全协议逻辑程序的自动转化。     

一种新的安全协议形式化分析方法——证据逻辑

形式化分析技术对于安全协议的正确设计至关重要,考虑到现有信仰逻辑分析方法的不足,该文提出一种新的安全协议形式化分析方法——证据逻辑,即通过对协议主体证据的推理来实现安全协议的形式化分析。与现有的方法相比,该方法不仅能够用于认证协议、密钥协商(交换)协议的分析,也能用于电子商务协议的不可否认性和公平性的分析,因此具有更好的通用性和更强的协议分析能力。     

Algebra model and security analysis for cryptographic protocols

With the rapid growth of the Internet and the World Wide Web a large number of cryptographic protocols have been deployed in distributed systems for various application requirements, and security problems of distributed systems have become very important issues. There are some natural problems: does the protocol have the right properties as dictated by the requirements of the system? Is it still secure that multiple secure cryptographic protocols are concurrently executed? How shall we analy…     

协议脆弱性分析及其测试研究

网络安全问题已引起人们的广泛关注,通信协议设计和实现的健壮与否对于网络安全至关重要。使用扩展了的构造类别代数描述协议规范,基于该描述,从一致性和完备性角度对协议可能存在的漏洞进行分析;系统地给出了一种针对潜在漏洞进行脆弱性测试的测试方法,使用类似于协议测试的方法测试实现系统能否抵御针对该漏洞的攻击。实现了一个分布式的协议脆弱性测试平台KD-TclRunner,对国内外著名厂商的通信设备进行脆弱性测试。     

电力智能单元传输规约安全性分析模型研究

电力智能单元传输规约的安全性是保障智能电网中智能通信实现高速、可靠、安全的基础。为了构建适用于电力智能单元传输规约的安全性分析模型,概述了主流的协议安全性分析理论与方法。基于符号模型的形式化方法包括逻辑推理、模型检验、定理证明;基于计算模型的计算方法包括RO模型、BCP模型、CK模型以及UC模型;基于计算可靠性理论的方法包括映射方法、模型方法、形式化方法的计算可靠性以及计算方法的直接形式化。提出了面向智能电网领域的电力智能单元传输规约安全性分析模型,为进一步的电力智能化单元传输规约的安全性分析奠定了基础。     

安全协议的可视化分析和设计研究

基于模态逻辑的安全协议形式化分析方法一直备受关注。本文在简述一个基于GNY逻辑实现的可视化集成工具的基础上，以SSL协议为例，详细阐述其自动分析过程。最后，就工具不能自动执行第三方信任逻辑的情况，提出了简单的可信第三方参与的扩展逻辑，为复杂安全协议的可视化分析和设计提供参考。     

基于理想的协议安全性分析

1998年,Guttman等人提出了串空间理论作为一种新的密码协议形式化分析的工具.并在1999年第1次引入了关于消息代数上的理想以及诚实的概念来分析协议的保密性.由于理想结构的特殊性使得它可以刻画协议运行中消息之间的关系.利用理想的结构来分析协议的一些安全性质,例如保密性、认证性、零知识性以及如何抵抗猜测攻击.     

安全协议的形式化需求及验证

该文采用近世代数和时序逻辑的方法提出并描述了密码协议的形式化安全需求,并在AT模型的基础上加入信任和知识的非单调逻辑,建立了安全协议的计算模型。利用该计算模型对Denning_Sacco公钥协议进行了验证,发现了对此协议的重放攻击,并对协议进行了修改。     

工控协议逆向分析技术研究与挑战

近年来,工业互联网的安全事件日益频发,尤其是工业控制系统(industrial control system, ICS),该现象揭示了目前ICS中已经存在较多的安全隐患,并且那些针对ICS安全隐患的大多数攻击和防御方法都需要对工控协议进行分析.然而,目前ICS中大多数私有工控协议都具有与普通互联网协议完全不同的典型特征,如结构、字段精度、周期性等方面,导致针对互联网协议的逆向分析技术通常都无法直接适用于工控协议.因此,针对工控协议的逆向分析技术已经成为近几年学术界和产业界的研究热点.首先结合2种典型工控协议,深入分析和总结了工控协议的结构特征.其次,给出了工控协议逆向分析框架,深入剖析了基于程序执行和基于报文序列的工控协议逆向分析框架的特点,并依次从人机参与程度和协议格式提取方式这2个角度,重点针对基于报文序列的工控协议分析方法进行详细阐述和对比分析.最后探讨了现有逆向分析方法的特点及不足,并对工控协议逆向分析技术的未来研究方向进行展望与分析.