On the security of fair non-repudiation protocols

Authors:
Sigrid Gürgens;Carsten Rudolph;Holger Vogt
Affiliations:
Fraunhofer – Institute for Secure Information Technology SIT, Rheinstrasse 75, 64295, Darmstadt, Germany;Fraunhofer – Institute for Secure Information Technology SIT, Rheinstrasse 75, 64295, Darmstadt, Germany;SRC Security Research & Consulting GmbH, Graurheindorfer Str. 149a, 53117, Bonn, Germany
Venue:
International Journal of Information Security - Special issue on SC 2003
Year:
2005

Citing 0
Cited 5

A survey of electronic signature solutions in mobile devices

Journal of Theoretical and Applied Electronic Commerce Research
Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder

Formal Aspects in Security and Trust
Complexity of fairness constraints for the Dolev-Yao attacker model

Proceedings of the 2011 ACM Symposium on Applied Computing
Risk balance in optimistic non-repudiation protocols

FAST'11 Proceedings of the 8th international conference on Formal Aspects of Security and Trust
Design and formal verification of a CEM protocol with transparent TTP

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

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.