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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Gürgens, S., Rudolph, C., & Vogt, H. (2003). On the security of fair non-repudiation protocols. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2851, 193–207. https://doi.org/10.1007/10958513_15
Mendeley helps you to discover research relevant for your work.