基于ID的盲签名方案

Two Kinds of ID-Based Blind Signature Schemes

以双线性映射为工具,基于SDH假设,构造了两种基于ID的盲签名方案。首先设计了一种基于ID的签名方案IBS,然后在此基础上设计了两种基于ID的盲签名方案,称为BIBS1和BIBS2;在随机预言模型中证明了它们的盲性和不可伪造性。基于ROS问题的难解性,BIBS1方案可抵抗generic parallel攻击。与2002年Zhang和Kim的方案相比,签名过程中少计算了一个双线性对,从而提高了效率。不依赖于ROS问题的难解性,BIBS2方案仍可抵抗generic parallel攻击,且与2003年Zhang和Kim的方案计算量相当。此外,这两种基于ID的盲签名方案均利用在适应性选择消息攻击下存在性不可伪造的BB在线/离线签名提取私钥,对于抵抗不固定身份伪造,具有更高的安全性。

In this paper,we propose two ID-based blind signatures based on SDH assumption from bilinear pairings. First we propose an ID-based signature called IBS. Then,based on IBS,we propose two ID-based blind signatures called BIBS1 and BIBS2, respectively, and prove their security from blindness and unforgeability in the random oracle model. Relying on the difficulty of ROS-problem, BIBS1 can resist the generic parallel attack. A paring computation being saved,BIBS1 is more efficient than the scheme proposed by Zhang and Kim in 2002. Being independent of the difficulty of ROS-problem,BIBS2 can resist the parallel attack. Moreover,BIBS2 is as efficient as the scheme proposed by Zhang and Kim in 2003. In addition,Extracting private key by making use of BB on-line/off- line signature which existed unforgeable against adaptively choosing message attack,BIBS1 and BIBS2 are more secure than Zhang and Kim＇s schemes against non-fixed ID forgery.