Paper Titles

An Edge-Based Algorithm for Text Extraction in Images and Video Frame
p.900

Multiresolution LBP Correlogram for Texture Image Indexing and Retrieval
p.908

Paper Currency Recognition System Using Characteristics Extraction and Negatively Correlated NN Ensemble
p.915

Rule Extraction from Privacy Preserving Neural Network: Application to Banking
p.920

An ID-Based Signature Scheme from Bilinear Pairing Based on Ex-K-Plus Problem
p.929

A Distributed Method for Two Simultaneous Events Detection in WSNs
p.935

Efficiency Enhancement through Decision Support Based on Data Mining
p.942

Bluetooth Based 12- Channel Temperatures Data Acquisition System
p.948

Web-Base Group Decision Support System for Information Security Decision Making in Case of Indian E-Government Systems
p.954

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 403-408An ID-Based Signature Scheme from Bilinear Pairing...

An ID-Based Signature Scheme from Bilinear Pairing Based on Ex-K-Plus Problem

Article Preview

Abstract:

In an ID-Based cryptosystem, identity of users are used to generate their public and private keys. In this system private key is generated by trusted private key generator (PKG). Unlike traditional PKI, this system enables the user to use public keys without exchanging public key certificates. With the exploitation of bilinear pairing, several secure and efficient ID-Based signature schemes have been proposed till now. In this paper, we have proposed an ID-Based signature scheme from bilinear pairing based on Ex-K-Plus problem. The proposed scheme is existentially unforgeable in the random oracle model under the hardness of K-CAA problem. Our scheme is also unforgeable due to hardness of ex-k-plus problem and computationally more efficient than other existing schemes.

You might also be interested in these eBooks

MEMS, NANO and Smart Systems

Info:

Periodical:

Advanced Materials Research (Volumes 403-408)

Pages:

929-934

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.403-408.929

Citation:

Cite this paper

Online since:

November 2011

Authors:

Shivendu Mishra, Ritika Yaduvanshi, Anjani Kumar Rai, Nagendra Pratap Singh

Keywords:

Bilinear Pairing, Ex-K-Plus Problem, ID-Based Signature, K-CAA Problem

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Shamir, Identity-base cryptosystems and signature schemes, Proc. Of Crypto 84, Lecture Notes in Computer Science, Vol. 196, pp.47-53, Springer-Verlag, 1985.18,19, 29.

DOI: 10.1007/3-540-39568-7_5

[2] F. Hess, Efficient identity based signature schemes based on pairings, In Proceedings of 9th workshop on selected areas in Cryptography – SAC 2002, LNCS, Springer-Verlag, 2002, pp.310-324

DOI: 10.1007/3-540-36492-7_20

[3] K.G. Paterson, Id-based signatures from pairings on elliptic curves, Cryptology ePrint Archive, Report 2002/004, (2002)

[4] N.P. Smart, An identity based authenticated key agreement protocol based on the weil pairing, Electronic Letters, 38(13), 2002, pp.630-632

DOI: 10.1049/el:20020387

[5] Yi, X, An Identity-Based Signature Scheme from the Weil Pairing, IEEE Communications Letters, Vol. 7(2), 2003, pp.76-78.

DOI: 10.1109/lcomm.2002.808397

[6] J.C. Cha and J.H. Cheon, An identity-based signature from gap Diffie- Hellman groups, PKC 2003, LNCS 2567, Springer-Verlag, 2003, pp.18-30.

DOI: 10.1007/3-540-36288-6_2

[7] X. G Cheng, J. M Liu, and X.M Wang, Identity-based aggregate and verifiably encrypted signatures from bilinear pairing, O. Gervasi et al. (Eds.): Springer-Verlag Berlin Heidelberg 2005ICCSA 2005, LNCS 3483, 2005, pp.1046-1054.

DOI: 10.1007/11424925_109

[8] D. Boneh and M. Franklin, Identity Based Encryption from the Weil Pair- ing, Proc. of Crypto 01, Lecture Notes in Computer Science, Vol. 2139, pp.213-229, Springer-Verlag, 2001. (A full version is available from http://crypto.stanford.edu/ dabo/pubs.html) 18, 19, 21, 22, 26, 27, 28, 29.

DOI: 10.1007/3-540-44647-8_13

[9] Y. Desmedt and J. Quisquater, Public-key Systems based on the Difficulty of Tampering, Proc. of Crypto 86, Lecture Notes in Computer Sciences, Vol. 263, pp.111-117, Springer-Verlag, 1987.

DOI: 10.1007/3-540-47721-7_9

[10] U. Maurer and Y. Yacobi, Non-interective public-key cryptography, Proc. of Eurocrypto 91, Lecture Nores in Computer Sciences, Vol. 547, pp.498-507, Springer-Verlag, 1992.

DOI: 10.1007/3-540-46416-6_43

[11] H. Tanaka, A realization scheme for the identity-based cryptosystem, Proc. of Crypto 87, Lecture Nores in Computer Sciences, Vol. 293, pp.341-349, Springer-Verlag, 1987.

[12] S. Tsuji and T. Itoh, An ID-based cryptosystem based on the discrete logarithm problem, IEEE Journal of Selected Areas in Communications, Vol. 7, No. 4, pp.467-473, 1989.

DOI: 10.1109/49.17709

[13] D. Boneh, B. Lynn, and H. Shacham, Short Signatures from the Weil Pairing, Proc. of Asiacrypt 01, Lecture Notes in Computer Sciences, Vol. 2248, pp.514-532, Springer-Verlag, 2001.

DOI: 10.1007/3-540-45682-1_30

[14] Hongzhen Du,Qiaoyan Wen,An efficient Identity-based short signature scheme from Bilinear Pairings, international Conference on Computational intelligence and security,2007,p.725 – 729.

DOI: 10.1109/cis.2007.168

[15] Takeshi Okamoto, Atsuo Inomata, Eiji Okamoto, A Proposal of Short Proxy Signature using Pairing, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I, pp.631-635.

DOI: 10.1109/itcc.2005.27

[16] D. Pointcheval and J. Stern, Security arguments for digital signatures and blind signatures, J. of Cryptology, Vol. 13, pp.361-396, 2000.

DOI: 10.1007/s001450010003