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

Sigrid Gürgens, Carsten Rudolph

Research output: Contribution to journalArticleResearchpeer-review

Abstract

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. Attacks on these protocols are presented, that, to our knowledge, have not been published before. Finally, an improved version of the protocol is proposed.

Original languageEnglish
Pages (from-to)97-114
Number of pages18
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2629
Publication statusPublished - 1 Dec 2003
Externally publishedYes

Cite this

@article{0e07f46306d449089ccd1cd1e8428617,
title = "Security analysis of (Un-) fair non-repudiation protocols",
abstract = "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. Attacks on these protocols are presented, that, to our knowledge, have not been published before. Finally, an improved version of the protocol is proposed.",
author = "Sigrid G{\"u}rgens and Carsten Rudolph",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2629",
pages = "97--114",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer-Verlag London Ltd.",

}

Security analysis of (Un-) fair non-repudiation protocols. / Gürgens, Sigrid; Rudolph, Carsten.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2629, 01.12.2003, p. 97-114.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

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

AU - Gürgens, Sigrid

AU - Rudolph, Carsten

PY - 2003/12/1

Y1 - 2003/12/1

N2 - 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. Attacks on these protocols are presented, that, to our knowledge, have not been published before. Finally, an improved version of the protocol is proposed.

AB - 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. Attacks on these protocols are presented, that, to our knowledge, have not been published before. Finally, an improved version of the protocol is proposed.

UR - http://www.scopus.com/inward/record.url?scp=35248888130&partnerID=8YFLogxK

M3 - Article

VL - 2629

SP - 97

EP - 114

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -