首页> 外文期刊>Journal of Discrete Mathematical Sciences and Cryptography >Unconditionally Anonymous Controllable ID-Based Ring Signatures
【24h】

Unconditionally Anonymous Controllable ID-Based Ring Signatures

机译:无条件的匿名可控的基于ID的环签名

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

摘要

ID-Based ring signatures are result of application of ID-Based cryptosystems to ring signature schemes. The contribution of this paper is twofold. At first the paper introduces a new variant of ID-based ring signatures named as controllable ID-Based ring signatures (CIBRS). This new primitive has additional properties like control linkability, anonymous authorship and convertibility. Formal definitions of these properties and the security model for the new primitive were presented. Secondly, the paper presents the first unconditionally anonymous CIBRS scheme from Chow et al.’s [4] scheme. The proposed scheme uses control linkability to achieve high efficiency of computation and storage. In the proposed scheme, to generate k signatures, a member of an n-member-ring needs only n+k scalar point multiplications and 2n+k-1 hash computations when compared to kn operations of Chow et al.’s scheme. Also, to verify k signatures the scheme requires only 2 pairing operations and n+k-1 hash computations compared to 2k and nk operations respectively. Link-signatures due to the proposed scheme are independent of size of the ring. Using the link-signatures our scheme achieves a significant signature size of 3(n+k)-1 compared to 2k(n+1) (in the units of size of the field element). The scheme provides unconditional anonymity and uncontrollability to the signer even in case of compromise of the key-escrow.
机译:基于ID的环签名是将基于ID的密码系统应用于环签名方案的结果。本文的贡献是双重的。首先,本文介绍了一种新的基于ID的环形签名,称为可控基于ID的环形签名(CIBRS)。这个新的原语具有其他属性,例如控件可链接性,匿名作者身份和可转换性。介绍了这些属性的形式定义以及新原语的安全模型。其次,本文介绍了Chow等人[4]方案中的第一个无条件匿名CIBRS方案。所提出的方案使用控制可链接性来实现高效的计算和存储。在拟议的方案中,要生成k个签名,与Chow等人方案的kn个操作相比,n个成员环的一个成员仅需要n + k个标量点乘法和2n + k-1个哈希计算。同样,为了验证k个签名,与分别进行2k和nk操作相比,该方案仅需要2个配对操作和n + k-1个哈希计算。由于所提出的方案,链路签名与环的大小无关。与2k(n + 1)相比,使用链接签名,我们的方案可实现显着的签名大小3(n + k)-1(以字段元素的大小为单位)。即使在妥协密钥托管的情况下,该方案也为签名者提供了无条件的匿名性和不可控性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号