Identity-based ring signature scheme based on quadratic residues

被引:0
作者
Xiong, Hu [1 ]
Qin, Zhiguang [1 ]
Li, Fagen [1 ]
机构
[1] School of Computer Science and Engineering, University of Electronic Science and Technology of China
关键词
Identity-based signature; Provable security; Quadratic residue; Random oracle; Ring signature;
D O I
10.3772/j.issn.1006-6748.2009.01.017
中图分类号
学科分类号
摘要
Identity-based (ID-based) ring signature has drawn great concerns in recent years and many ID-based ring signature schemes have been proposed until now. Unfortunately, all of these ID-based ring signatures are constructed from bilinear pairings, a powerful but computationally expensive primitive. Hence, ID-based ring signature without pairing is of great interest in the field of cryptography. In this paper, the authors firstly propose an ID-based ring signature scheme based on quadratic residues. The proposed scheme is proved to be existentially unforgeable against adaptive chosen message-and-identity attack under the random oracle model, assuming the hardness of factoring. The proposed scheme is more efficient than those which are constructed from bilinear pairings. Copyright © by High Technology Letters Press.
引用
收藏
页码:94 / 100
页数:6
相关论文
共 18 条
[11]  
Chow S., Yiu S., Hui L., Efficient identity based ring signature, Applied Cryptography and Network Security-ACNS'05, LNCS3531, pp. 499-512, (2005)
[12]  
Nguyen L., Accumulators from bilinear pairings and applications to ID-based ring signatures and group membership revocation, Topics in Cryptology-CT-RSA'05, LNCS3376, pp. 275-292, (2005)
[13]  
Cao T., Lin D., Xue R., ID-based ring authenticated encryption, Proceedings of the 19th International Conference on Advanced Information Networking and Applications, pp. 591-596, (2005)
[14]  
Fabien L., Vergnaud D., Multi-designated verifiers signatures, Proceedings of International Conference on Information and Communications Security (ICICS 2004), LNCS3269, pp. 495-507, (2004)
[15]  
Cocks C., An identity based encryption scheme based on quadratic residues, Cryptography and Coding Lecture Notes in Computer Science, LNCS2260, pp. 360-364, (2001)
[16]  
Herranz J., Saez G., Forking lemmas for ring signature schemes, Proceedings of INDOCRYPT, LNCS2904, pp. 266-279, (2003)
[17]  
Pointcheval D., Stern J., Security arguments for digital signatures and blind signatures, Journal of Cryptology, 13, 3, pp. 361-369, (2000)
[18]  
Barreto P.S.L.M., Lynn B., Scott M., On the selection of pairing-friendly groups, SAC 2004, Lecture Notes in Computer Science, pp. 17-25, (2004)