基于id的盲签名方案-信息工程大学学报.pdfVIP

第 8卷第 4期 信 息 工程 大学 学 报 V ol8 No4 2007年 12月 Journal of Inform ation Engineering Un iversity Dec2007 ID 王 璇, 戚文峰 ( , 450002) : 以双线性映射为工具, 基于 SDH 假设, 构造了两种基于 ID 的盲签名方案首先设计了 一种基于 ID的签名方案 IBS, 然后在 基础上设计了两种基于 ID 的盲签名方案, 称为 BIBS1 和BIBS2; 在随机预言模型中证明了它们的盲性和不可伪造性基于 ROS 问题的难解性, BIBS1方案可抵抗 generic parallel攻击与 2002年 Zhang和K mi 的方案相比, 签名过程中少 计算了一 个双线性对, 从而提高了效率不依赖于 ROS 问题的难解性, BIBS2方案仍可抵抗 generic parallel攻击, 且与 200 年 Zhang 和K mi 的方案计算量相当 外, 这两种基于 ID 的 盲签名方案均利用在适应性选择消息攻击下存在性不可伪造的 BB 在线/离线签名提取私钥, 对于抵抗不固定身份伪造, 具有更高的安全性 : 双线性映射; 盲签名; 基于 ID : TN918. 1; O157. 4 : A : 1671- 067 ( 2007) 04- 0 91- 05 Tw o K inds of ID-B ased B lind S ignature Schem es WANG Xuan, QIW en-feng ( Insititute of Inform ation Engineering, Inform ation Engineering University, Zhengzhou 450002) Ab stract: In th is paper, w e propose wt o ID-based blind signatures based on SDH assumption from b-i linear pairings. F irst we propose an ID-based signature called IBS. Then, based on IBS, w e propose wt o ID-based blind signatures called BIBS1 and BIBS2, respectively, and prove their security from blindness and unforgeability in the random oracle mode.l Relying on the difficu lty of ROS-problem, BIBS1 can resist the generic parallel attack. A paring computation being saved, BIBS1 is more eff-i cient than the scheme proposed by Zhang and K mi in 2002. Being independent of the difficulty of ROS-problem, BIBS2 can resist the parallel attack. Moreover, BIBS2 is as efficient as the scheme pro- posed by Zhang and K mi in 200 . In addition, Extracting private key bymak ing use ofBB on-line/off- line signaturew hich existed unforgeable again