loading...
Resolve-Impossibility for a Contract-Signing Protocol
Venice, Italy July 05-July 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSFW.2006.2719th IEEE Computer Security Foundatio ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Aybek Mukhamedov, Mark D. Ryan, "Resolve-Impossibility for a Contract-Signing Protocol," Computer Security Foundations Workshop, IEEE, pp. 167-176, 19th IEEE Computer Security Foundations Workshop (CSFW'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/CSFW.2006.27,
author = {Aybek Mukhamedov and Mark D. Ryan},
title = {Resolve-Impossibility for a Contract-Signing Protocol},
journal ={Computer Security Foundations Workshop, IEEE},
volume = {0},
year = {2006},
issn = {1063-6900},
pages = {167-176},
doi = {http://doi.ieeecomputersociety.org/10.1109/CSFW.2006.27},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Security Foundations Workshop, IEEE
TI - Resolve-Impossibility for a Contract-Signing Protocol
SN - 1063-6900
SP167
EP176
A1 - Aybek Mukhamedov,
A1 - Mark D. Ryan,
PY - 2006
KW - null
VL - 0
JA - Computer Security Foundations Workshop, IEEE
ER -
 
Aybek Mukhamedov, The University of Birmingham, UK
Mark D. Ryan, The University of Birmingham, UK
A multi-party contract signing protocol allows a set of participants to exchange messages with each other with a view to arriving in a state in which each of them has a preagreed contract text signed by all the others. Such a protocol was introduced by Garay and MacKenzie in 1999; it consists of a main protocol and a sub-protocol involving a trusted party. Their protocol was shown to have a flaw by Chadha, Kremer and Scedrov in CSFW 2004. Those authors also presented a fix -a revised sub-protocol for the trusted party.

In our work, we show an attack on the revised protocol for any number n gt 4 of signers. Furthermore, we generalise our attack to show that the message exchange structure of Garay and MacKenzie?s main protocol is flawed: whatever the trusted party does will result in unfairness for some signer. This means that it is impossible to define a trusted party protocol for Garay and MacKenzie?s main protocol; we call this "resolve-impossibility".

Citation:
Aybek Mukhamedov, Mark D. Ryan, "Resolve-Impossibility for a Contract-Signing Protocol," csfw, pp.167-176, 19th IEEE Computer Security Foundations Workshop (CSFW'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.