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

Certificateless Distributed Ring Signature Scheme Without Bilinear Pairing

作　　者：张春生[1] 苏本跃[1] 姚绍文[2] 

机构地区：[1]安庆师范学院计算机与信息学院,安徽安庆246133 [2]云南大学软件学院,昆明650091

出　　处：《计算机工程》2013年第12期141-143,147,共4页Computer Engineering

基　　金：安徽省高校省级自然科学基金资助项目(KJ2011B077)

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

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

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]