This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WASE International Conference on Information Engineering
Digital Signature Scheme Based on the Inverse Bilinear Pairing Operation Problem
Taiyuan, Shanxi, China
July 10-July 11
ISBN: 978-0-7695-3679-8
ASCII Text
x 
 
Xin Xiangjun, Shi Hailiang, "Digital Signature Scheme Based on the Inverse Bilinear Pairing Operation Problem," Information Engineering, International Conference on, vol. 2, pp. 225-228, 2009 WASE International Conference on Information Engineering, 2009.
 
 
BibTex
x
 
@article{ 10.1109/ICIE.2009.92,
author = {Xin Xiangjun and Shi Hailiang},
title = {Digital Signature Scheme Based on the Inverse Bilinear Pairing Operation Problem},
journal ={Information Engineering, International Conference on},
volume = {2},
year = {2009},
isbn = {978-0-7695-3679-8},
pages = {225-228},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICIE.2009.92},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Information Engineering, International Conference on
TI - Digital Signature Scheme Based on the Inverse Bilinear Pairing Operation Problem
SN - 978-0-7695-3679-8
SP225
EP228
A1 - Xin Xiangjun,
A1 - Shi Hailiang,
PY - 2009
KW - signature
KW - digital signature
KW - bilinear pairings
KW - security
VL - 2
JA - Information Engineering, International Conference on
ER -
 
First, based on the bilinear pairings, a new computing problem, Inverse Bilinear Paring Operation Problem (IBPOP), is proposed, which is proved to be not easier than the computing Diffie-Hellman problem (CDHP) and not harder than discrete logarithm problem (DLP). So, if the symbol “≤” denotes the increase of the hardness of computing problem, it can be deduced that CDHP≤IBPOP≤DLP. Then, based on the hardness assumption of IBPOP, by using the bilinear pairing, a certificate-based and randomized signature scheme is proposed. Under the hardness assumption of IBPOP, the signature scheme can be proved to be secure in random oracle. On the other hand, the security of most of the known pairing-based signature schemes depends on the hardness assumption of CDHP, which is a stronger assumption than the new scheme. The new signature is an efficient pairing-based one, since there is only one operation of pairings in it.
Index Terms:
signature, digital signature, bilinear pairings, security
Citation:
Xin Xiangjun, Shi Hailiang, "Digital Signature Scheme Based on the Inverse Bilinear Pairing Operation Problem," icie, vol. 2, pp.225-228, 2009 WASE International Conference on Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.