• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>2014 Communications security conference >Optimistic fair exchange of distributed signatures
【24h】

Optimistic fair exchange of distributed signatures

机译：分布式签名的乐观公平交换

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Consider a scenario in which one party A consisting of a number of manufactories would like to sign a contract with another party B who is a selling company so that they can unify prices to avoid over competition. This may be done via Internet to reduce travelling cost. To cater for such applications, we propose the concept of optimistic fair exchange of distributed signatures (OFEDS) which allows an authorized set of signers to fairly exchange signatures with a verifier, and a trusted arbitrator will intervene in the protocol only when there are disputes between two parties. We consider the security requirements for OFEDS, in which besides the standard security requirements for existing optimistic fair exchange protocols, robustness is introduced to ensure that OFEDS can be successfully performed even when there exist some dishonest signers. We instantiate a non-interactive construction of OFEDS based on the Computational Diffie-Hellman (CDH) assumption in the random oracle model. Our work shows that for any general monotone access structure, there exists a CDH-based OFEDS protocol if all the involved signers are honest.
机译：考虑一个场景，在该场景中，由多个工厂组成的甲方希望与作为销售公司的另一方B签订合同，以便他们可以统一价格以避免竞争过度。这可以通过互联网来完成，以减少旅行成本。为了满足此类应用的需要，我们提出了乐观公平交换分布式签名（OFEDS）的概念，该概念允许一组授权的签名者与验证者公平地交换签名，并且只有当双方之间存在争议时，受信任的仲裁者才会介入该协议。两党。我们考虑OFEDS的安全性要求，除了现有乐观公平交换协议的标准安全性要求外，还引入了鲁棒性以确保即使存在一些不诚实的签名者也可以成功执行OFEDS。我们基于随机预言模型中的计算Diffie-Hellman（CDH）假设，实例化OFEDS的非交互式构造。我们的工作表明，对于所有通用的单调访问结构，如果所有涉及的签名者都是诚实的，则存在基于CDH的OFEDS协议。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号