Security analysis of efficient (Un-) fair non-repudiation protocols-Reference-Cited by-同舟云学术

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

Published:2005-10 Issue:3 Volume:17 Page:260-276
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Gürgens S.¹,Rudolph C.¹

Affiliation:

1. Fraunhofer – Institute for Secure Telecooperation SIT, Rheinstrasse 75, D-64295, Darmstadt, Germany

Abstract

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

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00165-004-0055-4.pdf

Reference28 articles.

1. Lecture Notes in Computer Science;Boyd C,2000

2. Lecture Notes in Computer Science;Gürgens S,2002

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tidy: Symbolic Verification of Timed Cryptographic Protocols;Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security;2022-11-07

2. A Novel Approach for Reasoning about Liveness in Cryptographic Protocols and Its Application to Fair Exchange;2017 IEEE European Symposium on Security and Privacy (EuroS&P);2017-04

3. Security Analysis on Digital Signature Function Implemented in PDF Software;Future Generation Information Technology;2011

4. A Formal Method for Analyzing Fair Exchange Protocols;2009 WASE International Conference on Information Engineering;2009-07

5. Automatic Analysis of Fair Exchange Protocols in TLA;2009 Second International Symposium on Electronic Commerce and Security;2009