An ID-based signature scheme from bilinear pairing based on k-plus problem

Author

Mishra, Shivendu ; Sahu, Rajeev Anand ; Padhye, Sahadeo ; Yadav, Rama Shankar

Author_Institution

Dept. of Comput. Sci. & Eng., MNNIT, Allahabad, India

Volume

6

fYear

2011

fDate

8-10 April 2011

Firstpage

104

Lastpage

107

Abstract

An ID-based cryptosystem enables the user to use public keys without exchanging public key certificates. In this scheme, users can use their identity to generate their public and private keys. The notion of bilinear pairing makes the system easy and efficient providing specific securities. In this paper, we have proposed an ID-based signature scheme from bilinear pairing based on k-plus problem. We show that the proposed scheme is existential unforgeable in the random oracle model under the inverse CDHP assumption. Our scheme is computationally more efficient than other existing schemes.

Keywords

digital signatures; private key cryptography; public key cryptography; ID-based cryptosystem; ID-based signature scheme; bilinear pairing; inverse CDHP assumption; k-plus problem; private keys; public keys; random oracle model; Algorithm design and analysis; Elliptic curve cryptography; Forgery; Generators; Bilinear Pairing; ID-Based signature; Inverse-CDHP; k-plus problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Electronics Computer Technology (ICECT), 2011 3rd International Conference on

Conference_Location

Kanyakumari

Print_ISBN

978-1-4244-8678-6

Electronic_ISBN

978-1-4244-8679-3

Type

conf

DOI

10.1109/ICECTECH.2011.5942060

Filename

5942060