计算机科学 ›› 2009, Vol. 36 ›› Issue (8): 94-97.

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

对一种公平非否认协议的新改进

雷新锋,刘军,肖军模   

  1. (解放军理工大学通信工程学院 南京 210007)
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受江苏省自然科学基金(KB2008090)资助。

New Improvement on a Fair Non-repudiation Protocol

LEI Xin-feng, LIU Jun, XIAO Jun-mo   

  • Online:2018-11-16 Published:2018-11-16

摘要: Zhou-Gollmann协议是一种公平非否认协议,近年来得到广泛讨论。Kim发现该协议在时限公平性方面存在缺陷,针对该缺陷提出一种改进的协议,但其改进方法高度依赖于网络时钟的同步。通过详细分析,发现在缺乏时钟同步时Kim的改进协议也可导致不公平。针对此问题,提出一种新的改进方案。新的改进消除了协议对时钟同步的依赖性,保持了协议的公平非否认性,且不会降低协议的效率。

关键词: 公平性,非否认性,协议,时钟同步

Abstract: Zhou-Gollmann protocol is a fair non-repudiation protocol which is widely discussed in recent years. Kim found a flaw of this protocol on time-limited fairness. Rimming at this f1aw,Kim gave an improved protocol,but the improved schema highly depended on synchronization of network clock. We analyzed Kim's protocol in detail and show that, without clock synchronization, Kim's improved protocol is also unfair. Then we proposed a new schema to improve it further. Without reducing the efficiency of the original protocol, our new method avoids depending on synchronization of the clock, and keeps fairness and non-repudiation of the protocol.

Key words: Fairness, Non-repudiation, Protocol, Clock synchronization

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!