指定验证方的门限验证签名方案及安全性证明.pdfVIP

1000-9825/2005/16(11)1967 ©2005 Journal of Software 软 件 学 报 Vol.16, No.11 指定验证方的门限验证签名方案及安全性证明∗ 1,2+ 3 4 陈伟东 , 冯登国 , 谭作文 1(信息安全国家重点实验室( 中国科学院 研究生院),北京 100049) 2( 中国科学院 电子学研究所,北京 100080) 3(信息安全国家重点实验室( 中国科学院 软件研究所),北京 100080) 4( 中国科学院 数学与系统科学研究院 系统科学研究所,北京 100080) Signature Scheme for Specified Threshold Verifiers and Security Proofs 1,2+ 3 4 CHEN Wei-Dong , FENG Deng-Guo , TAN Zuo-Wen 1(State Key Laboratory of Information Security (Graduate School, The Chinese Academy of Sciences), Beijing 100049, China) 2(Institute of Electronics, The Chinese Academy of Sciences, Beijing 100080, China) 3(State Key Laboratory of Information Security (Institute of Software, The Chinese Academy of Sciences), Beijing 100080, China) 4(Institute of Systems Science, Academy of Mathematics and System Sciences, The Chinese Academy of Sciences, Beij ing 100080, China) + Corresponding author: Phn: +86-10 Fax: +86-10 E-mail: wsy@163.net, Received 2004-03-23; Accepted 2005-06-02 Chen WD, Feng DG, Tan ZW. Signature scheme for specified threshold verifiers and security proofs. Journal of Software, 2005,16(11):1967−1974. DOI: 10.1360/jos161967 Abstract: The problem called “constructing signature schemes for specified verifiers” is proposed by Laih, and such a scheme is also given by Laih. It is shown that this scheme is not secure and a scheme called SV-EDL is put forward. Furthermore, the provable security theory is used to analyze such schemes, i.e. the security of SV-EDL scheme is proved in RO (random oracle) model. The security against forgery is tightly related to the Computational Diffie-Hellman problem, i.e. the forgery is almost as difficult as solving CDH (computational D