Formal Analysis of Multi-Party Contract Signing
Rohit Chadha, Steve Kremer, and Andre Scedrov. Formal Analysis of Multi-Party Contract Signing. Journal of Automated Reasoning, 36(1-2):39–83, Springer, January 2006.
doi:10.1007/s10817-005-9019-5
Download
Abstract
We analyze the multi-party contract-signing protocols of Garay and MacKenzie (GM) and of Baum and Waidner (BW). We use a finite-state tool, Mocha, which allows specification of protocol properties in a branching-time temporal logic with game semantics. While our analysis does not reveal any errors in the BW protocol, in the GM protocol we discover serious problems with fairness for four signers and an oversight regarding abuse-freeness for three signers. We propose a complete revision of the GM subprotocols in order to restore fairness.
BibTeX
@article{CKS-jar2005, abstract = {We analyze the multi-party contract-signing protocols of Garay and MacKenzie (GM) and of Baum and Waidner (BW). We use a finite-state tool, {\scshape Mocha}, which allows specification of protocol properties in a branching-time temporal logic with game semantics. While our analysis does not reveal any errors in the BW protocol, in the GM protocol we discover serious problems with fairness for four signers and an oversight regarding abuse-freeness for three signers. We propose a complete revision of the GM subprotocols in order to restore fairness.}, author = {Chadha, Rohit and Kremer, Steve and Scedrov, Andre}, DOI = {10.1007/s10817-005-9019-5}, journal = {Journal of Automated Reasoning}, month = jan, number = {1-2}, pages = {39-83}, publisher = {Springer}, title = {Formal Analysis of Multi-Party Contract Signing}, volume = {36}, year = {2006}, nmonth = {1}, url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/mpcs-CKS.pdf}, }