• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Forensics and Security, IEEE Transactions on >Efficient Designated Confirmer Signature and DCS-Based Ambiguous Optimistic Fair Exchange
【24h】

Efficient Designated Confirmer Signature and DCS-Based Ambiguous Optimistic Fair Exchange

机译：高效的指定确认人签名和基于DCS的模糊乐观公平交易

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

摘要

Designated confirmer signature (DCS) extends the undeniable signature so that a party called confirmer can also confirm/disavow nonself-authenticating signatures on the signer's behalf. Previous DCS schemes, however, can let a signer confirm a valid signature but not disavow an invalid one, while only a confirmer can. It remains open to construct a DCS which also allows the signer to disavow. In this work, we propose new security models for formalizing the signer's ability to disavow. We propose a new DCS scheme and prove its security without random oracles. The new DCS scheme is efficient and also convertible. A signature in this new DCS consists of only three bilinear group elements. This is much shorter than any of the existing schemes. In addition, the scheme can be extended to support multiple confirmers and threshold conversion. Adding a confirmer incurs the addition of only one group element in a signature. Furthermore, we propose an efficient construction of ambiguous optimistic fair exchange (AOFE) of digital signatures based on the new DCS scheme. A partial AOFE signature consists of three elements in an elliptic curve group and four in group ${BBZ}_p$, and a full signature has only three group elements, which are shorter than those in Garay 's scheme (Crypto 1999) and Huang 's scheme (Asiacrypt 2008).
机译：指定的确认者签名（DCS）扩展了不可否认的签名，因此称为确认者的一方也可以代表签名者确认/拒绝非自我认证的签名。但是，以前的DCS方案可以使签名者确认有效签名，但不能拒绝无效签名，而只有确认者可以。它仍然可以构建DCS，这也允许签名者拒绝。在这项工作中，我们提出了新的安全模型，用于正式确定签名者的拒绝能力。我们提出了一种新的DCS方案，并在没有随机预言的情况下证明了其安全性。新的DCS方案既高效又可转换。此新DCS中的签名仅包含三个双线性组元素。这比任何现有方案都短得多。另外，该方案可以扩展为支持多个确认器和阈值转换。添加确认符会导致签名中仅添加一个组元素。此外，基于新的DCS方案，我们提出了一种有效的数字签名歧义乐观公平交换（AOFE）构建方法。局部AOFE签名由椭圆曲线组中的三个元素和$ {BBZ} _p $组中的四个元素组成，而完整签名只有三个组元素，比Garay方案（Crypto 1999）和Huang中的元素短。的计划（Asiacrypt 2008）。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号