上海交通大学学报（英文版） ›› 2011, Vol. 16 ›› Issue (5): 551-556.doi: 10.1007/s12204-011-1186-4

• 论文 • 上一篇    下一篇

Threshold Signature Scheme with Threshold Verification Based on Multivariate Linear Polynomial

SHEN Zhong-hua  (沈忠华),    YU Xiu-yuan  (于秀源)   

  1. (1. Department of Mathematics, Hangzhou Normal University, Hangzhou 310036,
    China; 2. Deprtment of Mathematics, Quzhou College, Quzhou 324000,  Zhejiang, China)
  • 收稿日期:2011-03-10 出版日期:2011-10-29 发布日期:2011-10-20
  • 通讯作者: SHEN Zhong-hua (沈忠华), E-mail:ahtshen@126.com
  • 基金资助:

    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)

Threshold Signature Scheme with Threshold Verification Based on Multivariate Linear Polynomial

SHEN Zhong-hua  (沈忠华),    YU Xiu-yuan  (于秀源)   

  1. (1. Department of Mathematics, Hangzhou Normal University, Hangzhou 310036,
    China; 2. Deprtment of Mathematics, Quzhou College, Quzhou 324000,  Zhejiang, China)
  • Received:2011-03-10 Online:2011-10-29 Published:2011-10-20
  • Contact: SHEN Zhong-hua (沈忠华), E-mail:ahtshen@126.com
  • Supported by:

    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)

摘要： 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.

关键词: cryptography, multivariate linear polynomial, threshold
signature, threshold verification

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.

Key words: cryptography, multivariate linear polynomial, threshold
signature, threshold verification

中图分类号: