Formal Analysis of Timeliness in Non-Repudiation Protocols
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    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.

    Reference
    Related
    Cited by
Get Citation

黎波涛,罗军舟.不可否认协议时限性的形式化分析.软件学报,2006,17(7):1510-1516

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 22,2004
  • Revised:July 11,2005
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063