New concurrent digital signature scheme based on the computational Diffie-Hellman problem

作     者：QIN Wen,ZHOU Nan-run Department of Electronic Information Engineering,Nanchang University,Nanchang 330031,China 

作者机构：Department of Electronic Information Engineering Nanchang University Nanchang 330031 China 

出 版 物：《The Journal of China Universities of Posts and Telecommunications》 (中国邮电高校学报（英文版）)

年 卷 期：2010年第17卷第6期

页      面：89-94,100页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：supported by the National Natural Science Foundation of China (10647133) the Natural Science Foundation of Jiangxi Province (2007GQS1906, 2009GQS0080) the Research Foundation of the Education Department of Jiangxi Province (22, GJJ10070) the Scientific Research Start-up Foundation for the Recruitment Talent of Nanchang University of China 

主　　题：designated verifiers signature fairness concurrent signature information security 

摘      要：Based on strong designated verifiers signatures,a new fair concurrent signature scheme is proposed. Compared with the previous concurrent signature schemes,even if a keystone must be chosen by the initial signer,the matching signer will easily get the keystone through an extraction algorithm. Due to the property of strong designate verifying,the initial signer couldn＇t make use of the keystone prepared carefully to deceive the matching signer. Then the matching signer is able to participate actively the signature scheme. Besides,there aren＇t bilinear operations in the keystone algorithm to deliver the keystone efficiently. Therefore the efficiency of our signature scheme is also improved.