Security analysis of efficient (Un-) fair non-repudiation protocols

被引：9

作者：

Gürgens, S ^{[1
]}

Rudolph, C ^{[1
]}

机构：

[1] Fraunhofer Inst Secure Telecooperat SIT, D-64295 Darmstadt, Germany

来源：

FORMAL ASPECTS OF COMPUTING | 2005年 / 17卷 / 03期

关键词：

non-repudiation; fairness; protocol analysis; asynchronous product automata;

D O I：

10.1007/s00165-004-0055-4

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

An approach to protocol analysis using asynchronous product automata (APA) and the simple homomorphism verification tool (SHVT) is demonstrated on several variants of the well known Zhou-Gollmann fair non-repudiation protocol and on two more recent optimistic fair non-repudiation protocols. Attacks on all these protocols are presented and an improved version of the Zhou-Gollmann protocol is proposed.

引用

页码：260 / 276

页数：17