摘要
研究新兴密码体制下的环签名问题。鉴于环签名应用的实际情况,利用双线性映射给出一个在强安全模型下可证安全的无证书环签名方案。在确定的匿名全集下,该方案在签名和验证阶段只需一个双线性运算。分析显示该方案满足环签名的各种安全性要求,它的安全性基于计算Diffie-Hellman问题的困难性,可广泛地应用于电子选举、电子拍卖等方面。
This paper studies ring signature in the newly proposed certificatelss public key setting. Due to the practical application of the ring signature, using bilinear maps, it constructs a certificateless ring signature scheme. It is proved secure in the strong security model. In the certain anonymous universal set, it just needs one pairing operation in its signing and verification phases. The analysis shows that the scheme satisfies all the security requirements. The security of the scheme is based on the fact that computational Diffie-Hellman problem is hard. It may have practical application in electronic election and electronic auction, etc.
出处
《计算机工程》
CAS
CSCD
北大核心
2009年第21期125-127,130,共4页
Computer Engineering
基金
国家"211工程"建设基金资助项目(181070H901)
江苏省自然科学基金资助项目(2003101SBRB231)