解决方案-不可能签订合同协议

19th IEEE Computer Security Foundations Workshop (CSFW'06) Pub Date : 2006-07-05 DOI:10.1109/CSFW.2006.27

Aybek Mukhamedov, M. Ryan

{"title":"解决方案-不可能签订合同协议","authors":"Aybek Mukhamedov, M. Ryan","doi":"10.1109/CSFW.2006.27","DOIUrl":null,"url":null,"abstract":"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 pre-agreed 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 > 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\"","PeriodicalId":131951,"journal":{"name":"19th IEEE Computer Security Foundations Workshop (CSFW'06)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Resolve-impossibility for a contract-signing protocol\",\"authors\":\"Aybek Mukhamedov, M. Ryan\",\"doi\":\"10.1109/CSFW.2006.27\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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 pre-agreed 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 > 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\\\"\",\"PeriodicalId\":131951,\"journal\":{\"name\":\"19th IEEE Computer Security Foundations Workshop (CSFW'06)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"19th IEEE Computer Security Foundations Workshop (CSFW'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSFW.2006.27\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"19th IEEE Computer Security Foundations Workshop (CSFW'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSFW.2006.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

多方合同签署协议允许一组参与者相互交换消息，以达到一种状态，在这种状态下，每个参与者都有一个由所有其他人签名的预先商定的合同文本。这种协议是Garay和MacKenzie在1999年提出的;它由一个主协议和一个涉及可信方的子协议组成。Chadha, Kremer和Scedrov在CSFW 2004上指出了他们的协议存在缺陷。这些作者还提出了一个修复方案——为受信任方修改的子协议。在我们的工作中，我们展示了对修改后的协议的攻击，对于任何数量n > 4的签名者。此外，我们概括了我们的攻击，以表明Garay和MacKenzie的主协议的消息交换结构是有缺陷的:无论受信任方做什么，都会导致某些签署人的不公平。这意味着不可能为Garay和MacKenzie的主协议定义一个可信方协议;我们称之为"解决-不可能"

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Resolve-impossibility for a contract-signing protocol

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 pre-agreed 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 > 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"

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

19th IEEE Computer Security Foundations Workshop (CSFW'06)

自引率

0.00%

发文量