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

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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Formal aspects of computing 2005-10, Vol.17 (3), p.260-276
Hauptverfasser:	GÜRGENS, S, RUDOLPH, C
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Automata. Abstract machines. Turing machines Computer science control theory systems Exact sciences and technology Memory and file management (including protection and security) Memory organisation. Data processing Software Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0934-5043 1433-299X
DOI:	10.1007/s00165-004-0055-4