计算机科学 ›› 2010, Vol. 37 ›› Issue (5): 49-52.

• 计算机网络与信息安全 • 上一篇    下一篇

基于扩展CS逻辑的非否认协议形式化分析方法

王鹃,刘珺,张焕国   

  1. (武汉大学计算机学院 武汉430072)
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受国家自然科学基金(60673071)资助。

Extended CS Logic for Analyzing Non-repudiation Protocols

WANG Juan,LIU Jun,ZHANG Huan-guo   

  • Online:2018-12-01 Published:2018-12-01

摘要: 将基于知识逻辑的CS逻辑系统用于分析具有时限性的非否认协议,针对非否认协议的性质对CS逻辑进行了扩展,给出了描述和分析非否认性以及公平性的方法,并使用扩展后的逻辑对改进的ZG协议进行了分析。在分析过程中,发现了该协议存在对签名的重放攻击漏洞,不满足强非否认性。验证过程也表明,扩展后的CS逻辑能够有效地描述和分析具有时限性的非否认协议的安全性质。

关键词: 非否认协议,CS逻辑,时限性,非否认性,公平性

Abstract: This paper presented an extension of CS logic which is a type of knowledge logic and can be used to analyze the properties of non-reputation protocols with timeliness. Using the extended logic, we proved the improved ZG protocol and found a reply attack on signature message of the protocol. As a result, it is not satisfied with non-repudiation property. The example shows the non-reputation protocols with timeliness can be effectively analyzed by the extended CS logic.

Key words: Non-repudiation protocol, CS logic, Timeliness, Non-reputation, Fairness

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!