On the security of fair non-repudiation protocols

Sigrid Gürgens, Carsten Rudolph, Holger Vogt

Research output: Contribution to journalArticleResearchpeer-review

Abstract

We analyzed two non-repudiation protocols and found some new attacks on the fairness and termination property of these protocols. Our attacks are enabled by several inherent design weaknesses, which also apply to other non-repudiation protocols. To prevent these attacks, we propose generic countermeasures that considerably strengthen the design and implementation of non-repudiation protocols. The application of these countermeasures is finally shown by our construction of a new fair non-repudiation protocol.

Original languageEnglish
Pages (from-to)193-207
Number of pages15
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2851
Publication statusPublished - 1 Dec 2003
Externally publishedYes

Cite this

@article{b64caf14e2d340fb8dec68d8d96b52e4,
title = "On the security of fair non-repudiation protocols",
abstract = "We analyzed two non-repudiation protocols and found some new attacks on the fairness and termination property of these protocols. Our attacks are enabled by several inherent design weaknesses, which also apply to other non-repudiation protocols. To prevent these attacks, we propose generic countermeasures that considerably strengthen the design and implementation of non-repudiation protocols. The application of these countermeasures is finally shown by our construction of a new fair non-repudiation protocol.",
author = "Sigrid G{\"u}rgens and Carsten Rudolph and Holger Vogt",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2851",
pages = "193--207",
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.",

}

On the security of fair non-repudiation protocols. / Gürgens, Sigrid; Rudolph, Carsten; Vogt, Holger.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2851, 01.12.2003, p. 193-207.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - On the security of fair non-repudiation protocols

AU - Gürgens, Sigrid

AU - Rudolph, Carsten

AU - Vogt, Holger

PY - 2003/12/1

Y1 - 2003/12/1

N2 - We analyzed two non-repudiation protocols and found some new attacks on the fairness and termination property of these protocols. Our attacks are enabled by several inherent design weaknesses, which also apply to other non-repudiation protocols. To prevent these attacks, we propose generic countermeasures that considerably strengthen the design and implementation of non-repudiation protocols. The application of these countermeasures is finally shown by our construction of a new fair non-repudiation protocol.

AB - We analyzed two non-repudiation protocols and found some new attacks on the fairness and termination property of these protocols. Our attacks are enabled by several inherent design weaknesses, which also apply to other non-repudiation protocols. To prevent these attacks, we propose generic countermeasures that considerably strengthen the design and implementation of non-repudiation protocols. The application of these countermeasures is finally shown by our construction of a new fair non-repudiation protocol.

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

M3 - Article

VL - 2851

SP - 193

EP - 207

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 -