Digital Signature Scheme Based on the Inverse Bilinear Pairing Operation Problem
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.
signature digital signature bilinear pairings security
Xin Xiangjun Shi Hailiang
Department of Mathematics and Information Science, Zhengzhou University of Light Industry, Zhengzhou, China
国际会议
2009 WASE International Conference on Information Engineering(2009年国际信息工程会议)(ICIE 2009)
太原
英文
884-887
2009-07-10（万方平台首次上网日期，不代表论文的发表时间）