Construction of Yet Another Forward Secure Signature Scheme Using Bilinear Maps

  • Authors:
  • Jia Yu;Fanyu Kong;Xiangguo Cheng;Rong Hao;Guowen Li

  • Affiliations:
  • College of Information Engineering, Qingdao University, Qingdao, China 266071;Institute of Network Security, Shandong University, Jinan, China 250100;College of Information Engineering, Qingdao University, Qingdao, China 266071;College of Information Engineering, Qingdao University, Qingdao, China 266071;School of Computer Science and Technology, Shandong Jianzhu University, Jinan, China 250101

  • Venue:
  • ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Forward secure signatures are proposed to deal with the key exposure problem. Compared to regular signatures, forward secure signatures can protect the security of signatures previous to the time period of key exposure. The efficiency is an important issue of forward secure signatures. In this paper, we construct yet another forward secure signature scheme using bilinear maps. In this scheme, all performance parameters have complexities of log magnitude in terms of the total time periods. In addition, our scheme needs very few pairing operations in verifying algorithm, which is very important because the pairing operation is very time-consuming. At last, we prove that our scheme is forward secure in random oracle model assuming CDH problem is hard.