The running-mode analysis of two-party optimistic fair exchange protocols

Authors:
Yuqing Zhang;Zhiling Wang;Bo Yang
Affiliations:
State Key Laboratory of Information Security, GUCAS, Beijing, China;National Key Laboratory of ISN, Xidian University, Xi’an, China;College of Information, South China Agricultural University, Guangzhou, China
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Year:
2005

Citing 3
Cited 1

An approach to the formal verification of the two-party cryptographic protocols

ACM SIGOPS Operating Systems Review
Simple and fast optimistic protocols for fair electronic exchange

Proceedings of the twenty-second annual symposium on Principles of distributed computing
An approach to the formal verification of the three-principal cryptographic protocols

ACM SIGOPS Operating Systems Review

On-the-Fly trace generation and textual trace analysis and their applications to the analysis of cryptographic protocols

FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a method of running-mode to analyze the fairness of two-party optimistic fair exchange protocols. After discussing the premises and assumptions of analysis introduced in this technique, we deduce all the possible running modes that may cause attack on the protocols. Then we illustrate our technique on the Micali’s Electronic Contract Signing Protocol (ECS1), and the checking results show that there are three new attacks on the protocol.