不可否认协议时限性的形式化分析  

Formal Analysis of Timeliness in Non-Repudiation Protocols

作　　者：黎波涛[1] 罗军舟[1] 

机构地区：[1]东南大学计算机科学与工程系,江苏南京210096

出　　处：《软件学报》2006年第7期1510-1516,共7页Journal of Software

基　　金：国家自然科学基金;江苏省高技术研究项目;江苏省网络与信息安全重点实验室~~

摘　　要：虽然SVO逻辑由于其简单性在对不可否认协议的形式化分析中得到了广泛的应用,但它在时间描述能力上的不足使得它无法分析不可否认协议的时限性.通过向SVO逻辑添加一种简单的时间表达和分析方法扩展了SVO逻辑,并使用扩展后的逻辑对Zhou和Gollmann于1996年提出的一个公平不可否认协议及其一个改进协议进行了分析.分析结果表明,原协议不具有时限性,而改进协议具有时限性,因此也说明了扩展后的新逻辑能够分析不可否认协议的时限性.另外,新逻辑还能用来分析一般密码协议中的时间相关性质.While SVO logic has been widely used in the analysis of non-repudiation protocols for its simplicity, its lack of the ability in time description makes it helpless in the analysis of timeliness, which is one of the most important properties of non-repudiation protocols. SVO logic is extended by adding a simple time expression and analysis method into it. Then a widely discussed fair non-repudiation proposed by Zhou and Gollmann in 1996 and one of its improvements are analyzed with the newly extended logic. The result shows that Zhou-Gollmann＇s fair non-repudiation protocol does not provide timeliness while its improvement does. Therefore, the new logic is able to analyze timeliness of non-repudiation protocols. In addition, the new logic can be used to analyze other time-related properties of cryptographic protocols.

关 键 词：不可否认 时限性 SVO逻辑 形式化分析 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]