Identity-based deterministic signature scheme without forking-lemma

  • Authors:
  • S. Sharmila Deva Selvi;S. Sree Vivek;C. Pandu Rangan

  • Affiliations:
  • Theoretical Computer Science Laboratory, Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India;Theoretical Computer Science Laboratory, Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India;Theoretical Computer Science Laboratory, Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India

  • Venue:
  • IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.