作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程

• 安全技术 • 上一篇    下一篇

无双线性对的无证书分布环签名方案

张春生1,苏本跃1,姚绍文2   

  1. (1. 安庆师范学院计算机与信息学院,安徽 安庆 246133;2. 云南大学软件学院,昆明 650091)
  • 收稿日期:2012-10-26 出版日期:2013-12-15 发布日期:2013-12-13
  • 作者简介:张春生(1968-),男,讲师、硕士,主研方向:密码学,网络与信息安全;苏本跃、姚绍文,教授、博士
  • 基金资助:
    安徽省高校省级自然科学基金资助项目(KJ2011B077)

Certificateless Distributed Ring Signature Scheme Without Bilinear Pairing

ZHANG Chun-sheng 1, SU Ben-yue 1, YAO Shao-wen 2   

  1. (1. School of Computer and Information, Anqing Normal University, Anqing 246133, China; 2. School of Software, Yunnan University, Kunming 650091, China)
  • Received:2012-10-26 Online:2013-12-15 Published:2013-12-13

摘要: 现有分布环签名方案大多基于双线性对运算或模指运算,计算效率不高。针对该问题,提出一种无双线性对运算和模指运算的无证书分布环签名方案,只进行椭圆曲线上的模乘运算。通过复杂度分析结果证明该方案是高效的,仅需2s+3t–2次模乘运算(t表示存取结构中子集的个数,s表示实际签名子集中成员的个数),并且若方案存取结构中所有子集的成员数均设为某一门限值,该方案即成为无证书门限环签名方案。

关键词: 分布环签名, 无证书, 计算性Diffie-Hellman问题, 无双线性对运算, 存取结构, 门限环签名

Abstract: The previous distributed ring signature schemes need bilinear pairing operation or exponent operation, and their computation efficiency is not high. For improving the efficient of operations, a new certificateless distributed ring signature scheme without bilinear pairings operation or exponent operation is proposed. The scheme only needs a modular multiplication on elliptic curves. The results of complexity analysis show that the proposed scheme is efficient, and it only needs 2s+3t–2 modular multiplication(t is the number of subsets of access structure, s is the number of members of actual signing subset). In addition, the scheme becomes a certificateless threshold ring signature scheme when the number of all subsets members of access structure is set to a certain threshold value.

Key words: distributed ring signature, certificateless, Computational Diffie-Hellman Problem(CDHP), operation without bilinear pairing, access structure, threshold ring signature

中图分类号: