An Efficient Certificateless Ring Signature Scheme  

作　　者：ZHU Lijun ZHANG Futai 

机构地区：[1]College of Mathematics and Computer Science, NanjingNormal University, Nanjing 210097, Jiangsu, China

出　　处：《Wuhan University Journal of Natural Sciences》2008年第5期567-571,共5页武汉大学学报（自然科学英文版）

基　　金：the National Natural Science Foundation of China (60673070);the Natural Science Foundation of Jiangsu Province (BK2006217)

摘　　要：To overcome the drawbacks such as high computational cost, unreasonable security model and long signature length in existing certificateless ring signature schemes, we propose an efficient certificateless ring signature scheme in this paper. Our construction is inspired by some efficient ID-based ring signature schemes, and uses bilinear pairings as a basic tool. Using a reasonable security model, the unforgeability of the proposed scheme is proven based on the intractability of the computational Diffie-Hellman （CDH） problem. The signature length of the new scheme is only ｜G2｜＋n｜G1｜ （｜Gi｜ is the bit length of an element in group Gi, i =1, 2）. Compared with other existing certificateless ring signature schemes, the newly proposed scheme has a shorter signature length and is more efficient and practical.To overcome the drawbacks such as high computational cost, unreasonable security model and long signature length in existing certificateless ring signature schemes, we propose an efficient certificateless ring signature scheme in this paper. Our construction is inspired by some efficient ID-based ring signature schemes, and uses bilinear pairings as a basic tool. Using a reasonable security model, the unforgeability of the proposed scheme is proven based on the intractability of the computational Diffie-Hellman （CDH） problem. The signature length of the new scheme is only ｜G2｜＋n｜G1｜ （｜Gi｜ is the bit length of an element in group Gi, i =1, 2）. Compared with other existing certificateless ring signature schemes, the newly proposed scheme has a shorter signature length and is more efficient and practical.

关 键 词：certificateless ring signature UNFORGEABILITY bilinear pairings CDH problem 

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