Paper 2011/217

Identity Based Deterministic Signature Scheme Without Forking-Lemma

S. Sharmila Deva Selvi, S. Sree Vivek, and C. Pandu Rangan


Since the discovery of identity based cryptography, a number of identity based signature schemes were reported in the literature. Although, a lot of identity based signature schemes were proposed, the only identity based deterministic signature scheme was given by Javier Herranz. This signature scheme uses Schnorr signature scheme for generating the private key of the users and uses BLS short signature scheme for generating users signature. The security of this scheme was proved in the random oracle model using forking lemma. In this paper, we introduce a new identity based deterministic signature scheme and prove the security of the scheme in the random oracle model, without the aid of forking lemma. Hence, our scheme offers tighter security reduction to the underlying hard problem than the existing identity based deterministic signature scheme.

Note: Full version of the paper accepted in IWSEC-2011. This paper received the best student paper award.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Identity Based CryptographyDeterministicSignatureTight SecurityRandom Oracle ModelProvable SecurityWithout Forking-Lemma.
Contact author(s)
sharmioshin @ gmail com
ssreevivek @ gmail com
prangan55 @ gmail com
2012-11-02: last of 6 revisions
2011-05-07: received
See all versions
Short URL
Creative Commons Attribution


      author = {S.  Sharmila Deva Selvi and S.  Sree Vivek and C.  Pandu Rangan},
      title = {Identity Based Deterministic Signature Scheme Without Forking-Lemma},
      howpublished = {Cryptology ePrint Archive, Paper 2011/217},
      year = {2011},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.