首页> 外文期刊>電子情報通信学会技術研究報告. 情報通信システムセキュリティ >A Multi-Party Optimistic Certified Email Protocol Using Verifiably Encrypted Signature Scheme For Line Topology
【24h】

A Multi-Party Optimistic Certified Email Protocol Using Verifiably Encrypted Signature Scheme For Line Topology

机译:使用行加密的可验证加密签名方案的多方乐观认证电子邮件协议

获取原文
获取原文并翻译 | 示例
           

摘要

While many two-party fair exchange protocols have been proposed, more than three-party fair exchange protocol is required depending on a type of applications. Asokan et al. have proposed a multi-party fair exchange protocol for mesh topology. This scheme can be adapted to all kinds of topologies but requires much communication costs, which is 4n(n -1) passes in the all n-participators honest case and 8n~2 -n -10 passes in the worst case. In previous works, more efficient and multi-functional schemes specialized for a kind of topologies have been proposed but most of these are for ring topology and star topology. Zhou et al. have proposed an efficient multi-party contract signing protocol for line topology. It is shown the two protocols such that a simple protocol which is completed with 4(n -1) passes in the all honest case and 5n -3 passes in the worst case and an optimized protocol which is completed with 3(n -1) passes in the all honest case and 4n -2 passes in the worst. This result means that a fair exchange protocol for line topology is efficient in a number of communications nevertheless a certified email protocol specialized for line topology has not been proposed. That is, a certified email protocol run on line topology is only a protocol for mesh proposed by Asokan et al. adapted to line topology, therefore there is large room for reducing a number of communications by specializing for a certified email protocol. In this paper, we propose a multi-party certified email protocol for fine topology. The proposed protocol has such basic properties of certified email as fairness, non-repudiation, trusted third party invisibility and timeliness, as same as the previous works. Our scheme is completed with 4(n -1) passes in the all n-participators honest case and 5n -3 passes in the worst. The communication cost is less than the Asokan et al.'s scheme with 4n(n -1) passes even if the all n-participators are honest.
机译:尽管已经提出了许多两方公平交换协议,但是根据应用的类型,需要多于三方公平交换协议。 Asokan等。已经提出了用于网格拓扑的多方公平交换协议。该方案可以适用于各种拓扑,但是需要很高的通信成本,在所有n个参与者诚实的情况下为4n(n -1)次,最坏情况为8n〜2-n -10次。在先前的工作中,已经提出了专门针对一种拓扑的更有效和多功能的方案,但是大多数方案是针对环形拓扑和星形拓扑的。周等。已经提出了用于线路拓扑的有效的多方合同签署协议。显示了这两个协议,以使在真实情况下以4(n -1)完成的简单协议通过,在最坏情况下以5n -3通过,并且以3(n -1)完成的优化协议在所有诚实的情况下都通过,最差的情况下通过4n -2。该结果意味着,针对线路拓扑的公平交换协议在许多通信中都是有效的,但是尚未提出专门针对线路拓扑的认证电子邮件协议。也就是说,在线路拓扑上运行的经过认证的电子邮件协议只是Asokan等人提出的网状协议。因此,通过专门用于经过认证的电子邮件协议,可以节省大量空间来减少通信数量。在本文中,我们提出了一种多方认证的电子邮件协议,用于精细拓扑。与先前的作品一样,该协议具有认证电子邮件的基本属性,如公平性,不可否认性,可信任的第三方隐身性和及时性。在所有n个参与者诚实的情况下,我们的计划以4(n -1)次通过而最坏的情况是5n -3次通过。即使所有n个参与者都是诚实的,通信成本也低于Asokan等人的4n(n -1)通过方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号