A Note on the Security Proof of Yet Another Forward Secure Signature From Bilinear Pairings
In the 8th Annual International Conference on Information Security and Cryptology, D. L. Vo and K. Kim proposed yet another forward secure signature from bilinear pairings. They claimed that their signature allows unlimited times of key update and is provably forward secure assuming CDH problem is hard. In this paper, we point out the security analysis of this scheme is not correct. Therefore, their scheme couldn’t achieve the unlimited key update ability they claimed under the condition of provable security. Assuming that the proof of forward security is right in their scheme, we can give the improved theorem and its proof.
forward security digital signature provable security
Jia Yu Fanyu Kong Xiangguo Cheng Guowen Li Rong Hao Xuliang Li
College of Information Engineering,Qingdao University,Qingdao 266071,R.P.China Institute of Network Security,Shandong University,Jinan 250100,R.P.China School of Computer Science and Technology,Shandong Jianzhu University,Jinan 250101,China
国际会议
The IET 2nd International Conference on Wireless,Mobile & Multimedia Networks(第二届IET国际无线移动多媒体网络会议)
北京
英文
2008-10-12(万方平台首次上网日期,不代表论文的发表时间)