scispace - formally typeset
Book ChapterDOI

Analysis of Abuse-Free Contract Signing

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
Dissertation

Security analysis of an e-commerce solution

TL;DR: The proposed protocol provides a method for fair exchange of valuable items between multiple-parties in accordance with the multi-level marketing business model and provides the required security services needed to increase the overall customers' trust in e-commerce, and hence increase the rate of committed online transactions.
Book ChapterDOI

e-Signatures for Delivery in e-Government

TL;DR: In this article, the Austrian model is introduced, the characteristics of which are openness, security and simplicity, and it is shown that using electronic signatures can solve the problems of signing the deliverables, receiver authentication and confirmation of delivery.
Proceedings Article

Towards a calculus for non repudiation protocols

TL;DR: A calculus that is specific to non-repudiation protocols, a subset of the Pi calculus, that uses the correspondence assertion of Woo and Lam and is shown to be usefulness by describing Zhou optimistic protocol.
Journal Article

Finite-state analysis of security protocols

TL;DR: Several approaches have been developed for analyzing security protocols as mentioned in this paper, including specialized logics that formalize notions such as secrecy and belief, special-purpose automated tools for cryptographic protocol analysis, and methods that apply general theorem-proving or model-checking tools to security protocols.
Proceedings ArticleDOI

Abuse-freeness Electronic Payment Protocol

TL;DR: An abuse-freeness electronic payment protocol for real goods is proposed in this paper and it has prevented both sides in payment to originate and terminate protocol maliciously and fairness and security are also achieved in the proposed protocol.
References
More filters

Breaking and Fixing the Needham−Schroeder Public−Key Protocol Using FDR

TL;DR: This paper uses FDR, a refinement checker for CSP to discover an attack upon the Needham-Schroeder Public-Key Protocol, which allows an intruder to impersonate another agent, and adapt the protocol, and uses FDR to show that the new protocol is secure, at least for a small system.
Patent

Untraceable electronic cash

TL;DR: An electronic cash protocol including the steps of using a one-way function f1 to generate an image f1 (x1) from a preimage x1 and receiving from the second party a note including a digital signature.
Book ChapterDOI

Untraceable Electronic Cash

TL;DR: The use of credit cards today is an act of faith on the p a t of all concerned as discussed by the authors, and each party is vulnerable to fraud by the others, and the cardholder in particular has no protection against surveillance.
Journal ArticleDOI

The inductive approach to verifying cryptographic protocols

TL;DR: Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions, which are based on ordinary predicate calculus and copes with infinite-state systems.
Book ChapterDOI

Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR

TL;DR: In this article, the authors analyse the Needham-Schroeder Public-Key Protocol using FDR, a refinement checker for CSP, and discover an attack upon the protocol, which allows an intruder to impersonate another agent.