Book ChapterDOI
Analysis of Abuse-Free Contract Signing
Vitaly Shmatikov,John C. Mitchell +1 more
- pp 174-191
Reads0
Chats0
TLDR
This work analyzes the abuse-free optimistic contract signing protocol of Garay, Jakobsson, and MacKenzie and discovers an attack in which negligence or corruption of the trusted third party may allow abuse or unfairness.Abstract:
Optimistic contract signing protocols may involve subprotocols that allow a contract to be signed normally or aborted or resolved by a third party. Since there are many ways these subprotocols might interact, protocol analysis involves consideration of a number of complicated cases. With the help of Murk?, a finite-state verification tool, we analyze the abuse-free optimistic contract signing protocol of Garay, Jakobsson, and MacKenzie. In addition to verifying a nmnber of subtle properties, we discover an attack in which negligence or corruption of the trusted third party may allow abuse or unfairness. Contrary to the intent of the protocol, the cheated party is not able to hold the third party accountable. In addition to analyzing a modification to the protocol that avoids these problems, we discuss issues involved in the application of finite-state analysis to fair exchange protocols, in particular models of fairness guarantees, abuse, and corrupt protocol participants.read more
Citations
More filters
Journal ArticleDOI
An intensive survey of fair non-repudiation protocols
TL;DR: This paper clearly defines the properties a fair non-repudiation protocol must respect, and gives a survey of the most important non- repudiation protocols without and with trusted third party (TTP).
Proceedings Article
Timed Commitments
Dan Boneh,Moni Naor +1 more
TL;DR: This work introduces and constructs timed commitment schemes, an extension to the standard notion of commitments in which a potential forced opening phase permits the receiver to recover (with effort) the committed value without the help of the committer.
Proceedings ArticleDOI
Successive approximation of abstract transition relations
Satyaki Das,David L. Dill +1 more
TL;DR: Recently, the efficiency of the predicate abstraction scheme presented by Das, Dill and Park (1999) has been improved, and the number of validity checks needed to prove the necessary verification condition has been reduced.
Journal ArticleDOI
Finite-state analysis of two contract signing protocols
TL;DR: Modifications are presented and analyze modifications to the protocols that avoid these problems and the basic challenges involved in formal analysis of fair exchange protocols are discussed.
Book ChapterDOI
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols
TL;DR: A verification method based on the idea that non-repudiation protocols are best modeled as games is proposed, which uses alternating transition systems and alternating temporal logic, a game based logic, to express requirements that the protocols must ensure.
References
More filters
Proceedings ArticleDOI
Efficient finite-state analysis for large security protocols
Vitaly Shmatikov,Ulrich Stern +1 more
TL;DR: An optimization method for evaluating parameterized rule conditions, which are common in models of security protocols, are described and implemented in the Mur/spl phi/ verifier.
Book ChapterDOI
Towards a Mechanization of Cryptographic Protocal Verification
TL;DR: It is shown that for a wide range of practical situations and properties it is possible to perform the verification on a finite and safe abstract model.