A Novel ID-based Threshold Ring Signature Scheme competent for Anonymity and Anti-forgery

This paper presents an approach to improving the (t, n) ring signature, which permits a signer to sign anonymously. Using fair partitioning to design a new (t, n) threshold ring signature based on bilinear pairing, the study develops a threshold signature method. The proposed method not only permits total signer anonymity, but also resists the signature of an anonymous signer from being forged even in a random oracle mode. Besides, the method is competent for protecting the identity and signature of a signer in regard to the anonymity property of ring signature. Therefore, this method trends suitable for those application complex, such as electronic voting and electronic cash, as well as for democratic management in which members with specific threshold value voice their opinion

[1]  Steven D. Galbraith,et al.  Implementing the Tate Pairing , 2002, ANTS.

[2]  David Chaum,et al.  Blind Signatures for Untraceable Payments , 1982, CRYPTO.

[3]  Hidenori Kuwakado,et al.  Threshold ring signature scheme based on the curve , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[4]  Yael Tauman Kalai,et al.  How to Leak a Secret: Theory and Applications of Ring Signatures , 2001, Essays in Memory of Shimon Even.

[5]  Jacques Stern,et al.  Threshold Ring Signatures for Ad-hoc Groups , 2002, CRYPTO 2002.

[6]  Joseph K. Liu,et al.  A Separable Threshold Ring Signature Scheme , 2003, ICISC.

[7]  Colin Boyd,et al.  Advances in Cryptology - ASIACRYPT 2001 , 2001 .

[8]  Paulo S. L. M. Barreto,et al.  Efficient Algorithms for Pairing-Based Cryptosystems , 2002, CRYPTO.

[9]  David Chaum,et al.  Group Signatures , 1991, EUROCRYPT.

[10]  Jongin Lim,et al.  Information Security and Cryptology - ICISC 2003 , 2003, Lecture Notes in Computer Science.

[11]  Joan Feigenbaum,et al.  Advances in Cryptology-Crypto 91 , 1992 .

[12]  Moti Yung,et al.  Advances in Cryptology — CRYPTO 2002 , 2002, Lecture Notes in Computer Science.

[13]  Dengguo Feng,et al.  A Ring Signature Scheme Using Bilinear Pairings , 2004, WISA.

[14]  M. Mambo,et al.  Proxy Signatures: Delegation of the Power to Sign Messages (Special Section on Information Theory and Its Applications) , 1996 .

[15]  Masayuki Abe,et al.  1-out-of-n Signatures from a Variety of Keys , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[16]  Yuliang Zheng,et al.  Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption) , 1997, CRYPTO.

[17]  Tzong-Chen Wu,et al.  An identity-based ring signature scheme from bilinear pairings , 2004, 18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004..

[18]  Jacques Stern,et al.  Threshold Ring Signatures and Applications to Ad-hoc Groups , 2002, CRYPTO.

[19]  Siu-Ming Yiu,et al.  Efficient Identity Based Ring Signature , 2005, ACNS.

[20]  Burton S. Kaliski.  Advances in Cryptology - CRYPTO '97 , 1997 .

[21]  Jiang Han.  Analysis on the t-out-of-n Ring Signatures from Discrete Logarithm Public Keys , 2006 .

[22]  Yvo Desmedt,et al.  Shared Generation of Authenticators and Signatures (Extended Abstract) , 1991, CRYPTO.

[23]  Siu-Ming Yiu,et al.  Identity Based Threshold Ring Signature , 2004, IACR Cryptol. ePrint Arch..

[24]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[25]  Choonsik Park,et al.  Information Security and Cryptology - ICISC 2004, 7th International Conference, Seoul, Korea, December 2-3, 2004, Revised Selected Papers , 2005, ICISC.

[26]  Yuliang Zheng,et al.  Advances in Cryptology — ASIACRYPT 2002 , 2002, Lecture Notes in Computer Science.

[27]  Kwangjo Kim,et al.  ID-Based Blind Signature and Ring Signature from Pairings , 2002, ASIACRYPT.