一个公平的多方不可否认协议  

A Fair Multi-Party Non-Repudiation Protocol

作　　者：韩志耕[1] 罗军舟[1] 

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

出　　处：《计算机学报》2008年第10期1705-1715,共11页Chinese Journal of Computers

基　　金：国家自然科学基金重大研究计划项目(90604004);国家自然科学基金青年基金项目(60703115);江苏省自然科学基金重点项目(BK2007708);江苏省自然科学基金青年科技创新人才启动项目(BK2007560);江苏省"网络与信息安全"重点实验室(BM2003201);国家博士后科学基金(20070420955);江苏省博士后科研资助计划(0702003B);科技部国际科技合作项目资助

摘　　要：实用的多方不可否认协议必须具备存活性、公平性、时限性、无排斥性和保密性.文中指出现有典型协议,如KM,OZCL和OZL均无法提供时限性和无排斥性,而且易遭受服务失效等攻击,致使它们不能成为实用的协议.为此,给出一个新协议NKM,其基于无需全局时钟同步机制支持的时间段概念实现时限性,借助双重群加密技术确保具备保密性的同时不丢失无排斥性,利用证据链技术既可高效维护协议证据,又能避开服务失效和重放攻击;同时还形式化验证了该协议的安全性,并对协议部署时将牵涉到的安全问题进行了考虑.与现有协议相比,NKM在安全性和性能方面均存在优势,可成为实用的协议.Practical multi-party non-repudiation protocols must respect viability, fairness, timeli ness, exclusion-freeness and confidentiality. In this paper, the authors point out that most of the existing representative multi-party non-repudiation protocols with online trusted third party, such as KM and its extensional version OZCL and OZL, lack the supports for the properties of timeliness and exclusion-freeness, and are vulnerable to denial of the non-repudiation service attack and so on. Bearing these issues in mind, the authors present a new protocol NKM, which respects timeliness with time-span notion, which does not need any global clock synchronism mechanism, and respects exclusion-freeness and confidentiality with double group encryption notion, and makes evidence managed efficiently and avoids potential denial of non-repudiation service attack and replay attack with evidence chain notion. Subsequently, the authors give a formal analysis of its security and put some consideration on some security issues of protocol deployment. Compared with existing protocols, NKM have advantage over them in terms of security and performance and can be a practical protocol.

关 键 词：多方不可否认 时限性 无排斥性 服务失效攻击 重放攻击 

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