Identity-based deterministic signature scheme without forking-lemma

13Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Sharmila Deva Selvi, S., Sree Vivek, S., & Pandu Rangan, C. (2011). Identity-based deterministic signature scheme without forking-lemma. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7038 LNCS, pp. 79–95). https://doi.org/10.1007/978-3-642-25141-2_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free