loading...
An identity-based proxy ring signature scheme from bilinear pairings
Alexandria, Egypt June 28-July 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCC.2004.1358441Ninth IEEE Symposium on Computers and ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Wenqing Cheng, Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Hubei, China
Weimin Lang, Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Hubei, China
Zongkai Yang, Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Hubei, China
Gan Liu, Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Hubei, China
Yunmeng Tan, Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Hubei, China
We propose an identity-based proxy ring signature scheme from bilinear pairings which combines the advantages of proxy signature and of ring signature. Furthermore, our scheme can prevent the original signer form generating the proxy ring signature, thus the profits of the proxy signer are guaranteed. We introduce bilinear pairings to minimize the computation overhead and to improve the related performance of our scheme. As compared with Zhang's scheme, our scheme is a computational efficiency improvement for signature verification because the computational cost of bilinear pairings required is reduced form O(n) to O(1). In addition, the proxy ring signature presented in This work is signer ambiguous, nonforgeable, verifiable, nonrepudiable and identifiable.
Citation:
Wenqing Cheng, Weimin Lang, Zongkai Yang, Gan Liu, Yunmeng Tan, "An identity-based proxy ring signature scheme from bilinear pairings," iscc, vol. 1, pp.424-429, Ninth IEEE Symposium on Computers and Communications 2004 Volume 1 (ISCC'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.