Paper 2004/327

Efficient Identity Based Ring Signature

Sherman S. M. Chow, S. M. Yiu, and Lucas C. K. Hui


Identity-based (ID-based) cryptosystems eliminate the need for validity checking of the certificates and the need for registering for a certificate before getting the public key. These two features are desirable especially for the efficiency and the real spontaneity of ring signature, where a user can anonymously sign a message on behalf of a group of spontaneously conscripted users including the actual signer. In this paper, we propose a novel construction of ID-based ring signature which only needs two pairing computations for any group size. The proposed scheme is proven to be existential unforgeable against adaptive chosen message-and-identity attack under the random oracle model, using the forking lemma for generic ring signature schemes. We also consider its extension to support the general access structure.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. In Angelos Keromytis and Moti Yung, editors, Applied Cryptography and Network Security, 3rd International Conference, ACNS 2005, New York, USA, June 7-10, 2005. Volume 3531 of Lecture Notes in Computer Science.
Identity-based signaturering signaturebilinear pairingsefficiencyreal spontaneitygeneral access structureanonymity
Contact author(s)
smchow @ cs hku hk
2005-04-24: last of 12 revisions
2004-11-26: received
See all versions
Short URL
Creative Commons Attribution


      author = {Sherman S. M.  Chow and S. M.  Yiu and Lucas C. K.  Hui},
      title = {Efficient Identity Based Ring Signature},
      howpublished = {Cryptology ePrint Archive, Paper 2004/327},
      year = {2004},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.