Paper 2003/261

A provably secure ID-based ring signature scheme

Javier Herranz and Germán Sáez


Identity-based (ID) cryptosystems avoid the necessity of certificates to authenticate public keys in a digital communications system. This is desirable, specially for these applications which involve a large number of public keys in each execution. For example, any computation and verification of a ring signature scheme, where a user anonymously signs a message on behalf of a set of users including himself, requires to authenticate the public keys of all the members of the set. We use bilinear pairings to design a new ID-based ring signature scheme. We extend to the ID-based scehario some known results about the security of generic ring signature schemes. This allows us to formally prove the security of our scheme, under the assumption that the Computational Diffie-Hellman problem is hard to solve.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Identity-based schemesring signaturesrandom oracle model
Contact author(s)
jherranz @ mat upc es
2003-12-20: received
Short URL
Creative Commons Attribution


      author = {Javier Herranz and Germán Sáez},
      title = {A provably secure ID-based ring signature scheme},
      howpublished = {Cryptology ePrint Archive, Paper 2003/261},
      year = {2003},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.