| Robust Threshold Guillou-Quisquater Signature Scheme |
| |
| 作者姓名： | WANGHong ZHANGZhen-feng FENGdeng-guo |
| |
| 作者单位： | [1]StateKeyLaboratoryofInformationSecurity（GraduateSchoolofChineseAcademyofSciences）,Beijing100039 [2]StateKeyLaboratoryofInformationSecurity（InstituteofSoftwareofChineseAcademyofSciences）,Beijing100080,China |
| |
| 基金项目： | SupportedbytheNationalKeyBasicResearchProgramofChina(G1999035802)andtheNationalNaturalScienceFoundationofChina(60373039) |
| |
| 摘 要： | Tie deficiencies of the first threshold Guillou-Quisquater signature scheme presented by Li San Liu, Cheng-Kang Chu and Wen-Guey Tzeng are analysised at first, and then a new threshold Guillou-Quisquater signature scheme is presented. The new scheme is unforgeable and robust against any adaptive adversary if the base Guillou-Quisquater signature scheme is unforgeable under the chosen message attack and computing the discrete logarithm modulo a prime is hard. This scheme can also achieve optimal resilience. However, the new scheme does not need the assumption that N is the product of two safe primes. The basic signature scheme underlying the new scheme is exactly Guillot-Quisquater signature scheme, and the additional strong computation assumption introduced by the first threshold Guillou-Quisquater scheme is weaken.
|
| 关 键 词： | 域值密码学 数字签名 粗程序 Guillou-Quisquater签名 域签名 |
| 收稿时间： | 31 May 2004 |
Robust threshold Guillou-Quisquater signature scheme |
| |
| WANGHong ZHANGZhen-feng FENGdeng-guo.Robust Threshold Guillou-Quisquater Signature Scheme[J].Wuhan University Journal of Natural Sciences,2005,10(1):207-210. |
| |
| Authors: | Wang Hong Zhang Zhen-feng Feng Deng-guo |
| |
| Institution: | (1) State Key Laboratory of Information Security, Graduate School of Chinese Academy of Sciences, 100039 Beijing, China;(2) State Key Laboratory of Information Security, Institute of Software of Chinese Academy of Sciences, 00080 Beijing, China |
| |
| Abstract: | The deficiencies of the first threshold Guillou-Quisquater signature scheme presented by Li-San Liu, Cheng-Kang Chu and Wen-Guey Tzeng are analysised at first, and then a new threshold Guillou-Quisquater signature scheme is presented. The new scheme is unforgeable and robust against any adaptive adversary if the base Guillou-Quisquater signature scheme is unforgeable under the chosen message attack and computing the discrete logarithm modulo a prime is hard. This scheme can also achieve optimal resilience. However, the new scheme does not need the assumption that N is the product of two safe primes. The basic signature scheme underlying the new scheme is exactly Guillou-Quisquater signature scheme, and the additional strong computation assumption introduced by the first threshold Guillou-Quisquater scheme is weaken. |
| |
| Keywords: | veriable secret sharing threshold cryptography digital signature scheme robust secure multiparty computation |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
