Threshold Signature Scheme with Threshold Verification Based on Multivariate Linear Polynomial
SHEN Zhong-hua (沈忠华), YU Xiu-yuan (于秀源)
(1. Department of Mathematics, Hangzhou Normal University, Hangzhou 310036,
China;
2. Deprtment of Mathematics, Quzhou College, Quzhou 324000, Zhejiang, China)
Abstract Abstract: Secret sharing schemes are multi-party protocols related to
key establishment. They also facilitate distributed trust or shared control
for critical activities (e.g., signing corporate cheques and opening bank
vaults), by gating the critical action on cooperation from t(t∈ Z+) of n(n∈ Z+) users. A (t, n) threshold scheme (t<n) is a
method by which a trusted party computes secret shares γi (1≤i≤ n) from an initial secret γ0 and securely distributes
γi to user. Any t or more users who pool their shares may
easily recover γ0, but any group knowing only t-1 or fewer shares may
not. By the ElGamal public key cryptophytes and the Schnorr's signature
scheme, this paper proposes a new (t,n) threshold signature scheme with
(k,m) (k,m∈Z+) threshold verification based on the multivariate
linear polynomial.
Received: 10 March 2011
Published: 29 October 2011
the National Natural Science Foundation of China (No. 10671051), the Natiral Science Foundation of Zhejiang Province (No. Y6110782), and the Key Laboratory Foundation of Hangzhou (No.20100331T11)
