Efficient Certificate-based and Randomized Signature from Pairings

摘要：

Most of pairing-based schemes need two or more operations of pairings. To find an efficient randomized certificate-based signature from pairings, by constructing a fraction such that a random element of the gap Diffie-Hellman group is included in the numerator and the sum of the master key and the output of the hash function is included in the denominator, a new signature scheme from pairings is proposed, in which only one operation of pairings is used. Under the hardness assumption of CDHP, the scheme can be proved to be secure in random oracle. The new signature is an efficient pairing-based one, since there is only one operation of pairings in it. The new randomized signature is short. On the other hand, the security proof has a tight reduction.

关键词： signature digital signature bilinear pairings security

作者: Xin Xiangjun Xing Peixu

作者单位: Department of Mathematics and Information Science, Zhengzhou University of Light Industry, Zhengzhou, China

会议类型: 国际会议

会议名称: 2009 WASE International Conference on Information Engineering(2009年国际信息工程会议)(ICIE 2009)

会议地点: 太原

会议语种:英文

页码: 881-883

在线出版日期: 2009-07-10（万方平台首次上网日期，不代表论文的发表时间）