Cryptology ePrint Archive: Report 2004/327

Efficient Identity Based Ring Signature

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

Abstract: 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.

Category / Keywords: public-key cryptography / Identity-based signature, ring signature, bilinear pairings, efficiency, real spontaneity, general access structure, anonymity

Publication Info: 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.

Date: received 25 Nov 2004, last revised 24 Apr 2005

Contact author: smchow at cs hku hk

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20050424:145023 (All versions of this report)

Discussion forum: Show discussion | Start new discussion