You are looking at a specific version 20121102:063450 of this paper. See the latest version.

Paper 2011/217

Identity Based Deterministic Signature Scheme Without Forking-Lemma

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

Abstract

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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Identity Based CryptographyDeterministicSignatureTight SecurityRandom Oracle ModelProvable SecurityWithout Forking-Lemma.
Contact author(s)
sharmioshin @ gmail com,ssreevivek @ gmail com,prangan55 @ gmail com
History
2012-11-02: last of 6 revisions
2011-05-07: received
See all versions
Short URL
https://ia.cr/2011/217
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.