Research on a New Dynamic Threshold Digital Signature Scheme

doi:10.3969/j.issn.1671-1122.2016.06.010

Abstract

Abstract:

The paper presents a new dynamic threshold digital signature scheme to solve two problems of current dynamic threshold digital signature which are big computational field and conspiracy forgery attack. At first, we design a new key distribution scheme which is based on the multi-threshold multi-secret sharing protocol. It will hand keys out to group members and compute group public keys and group member public keys by using the new key distribution scheme and hyperelliptic curve cryptosystems. At last a dynamic threshold digital signature scheme is proposed according to EIGamal’s digital signature scheme. In the proposed scheme, multiple group public keys are shared among a group of signers, and each group public key has its specific threshold value.The new scheme has small computational field comparing with current schemes, and it is proved to be correct and is able to resist many forgery attacks according to theorems.

Key words: dynamic threshold digital signature scheme, computational field, conspiracy forgery attack, key distribution, multi-threshold multi-secret sharing protocol, hyperelliptic curve cryptosystems

CLC Number:

TP309

Yansheng ZHANG, Xueming WANG, Gege QIU. Research on a New Dynamic Threshold Digital Signature Scheme[J]. Netinfo Security, 2016, 16(6): 62-67.

Figures/Tables 1

References 18

[1]	NEAL K.Hyperelliptic Cryptosystems[J]. Journal of Cryptology, 1989, 1(3):139-150.
[2]	张方国,王育民.超椭圆曲线密码体制的研究与进展[J].电子学报,2002,30(1):126-131.
[3]	张方国. 超椭圆曲线密码体制的研究[D].西安:西安电子科技大学,2001.
[4]	游林. 超椭圆曲线密码体制的研究[D].大连:大连理工大学,2002.
[5]	DESMEDT Y, FRANKEL Y.Shared Generation of Authenticators and Signatures[C]//CRYPTO′ 91, International Association for Cryptologic Research, Crypto'91 conference, August 11-15, 1991, University of California Santa Barbara, California, USA, Berlin: Springer Berlin Heidelberg, 1991: 457-469.
[6]	LI C M, HWANG T, LEE N Y.Remark on the Threshold RSA Signature Scheme[C]//CRYPTO′ 93, International Association for Cryptologic Research, 13th Annual International Cryptology Conference, August 22-26, 1993, University of California Santa Barbara, California, USA, Berlin:Springer Berlin Heidelberg, 1993: 413-419.
[7]	王斌,李建华.无可信中心的(t,n)门限签名方案[J].计算机学报,2003,26(11):1581-1584.
[8]	XIE Q, YU X Y.A New (t,n) Threshold Signature Scheme Withstanding the Conspiracy Attack[J]. Wuhan University Journal of Natural Sciences, 2005, 10(1):107-110.
[9]	张文芳,何大可,王宏霞,等.具有可追查性的抗合谋攻击(t,n)门限签名方案[J].西南交通大学学报, 2007,42(4):463-466.
[10]	张有谊,乜国雷,郑东.一种可防止合谋攻击的门限签名方案[J].计算机应用与软件,2008,25(12):51-52.
[11]	徐光宝,姜东焕. 抗合谋攻击的门限签名方案分析与改进[J].计算机工程,2010,36(20):155-156.
[12]	LEE N Y.Threshold Signature Scheme with Multiple Signing Policies[J]. Computers and Digital Techniques, 2001 , 148(2):95-99.
[13]	CHAN C W, CHANG C C.A Scheme for Threshold Multi-secret Sharing[J]. Applied Mathematics and Computation, 2005, 166(1):1-14.
[14]	李慧贤,蔡皖东,庞辽军.一个安全的动态门限签名体制[J].计算机研究与发展,2007,44(9): 1545-1549.
[15]	HERRANZ J, RUIZ A, SáEZ G. New Results and Applications for Multi-secret Sharing Schemes[J]. Designs, Codes and Cryptography, 2014, 73(3):841-864.
[16]	LIAO JUN P, YU MIN W.A Secure and Efficient (t,n) Multi-secret Sharing Scheme[J]. Wuhan University Journal of Natural Sciences, 2005, 10(1): 191-194.
[17]	黄东平,刘铎,王道顺,等. 一种安全的门限多秘密共享方案[J].电子学报,2006, 34(11): 1937-1940.
[18]	于佳, 陈养奎, 郝蓉, 等. 无可信中心的可公开验证多秘密共享[J].计算机学报,2014,37(5): 1030-1038.