A (t, n) Threshold Signature Scheme Based on Factorial Decompose Theorem of Polynomial

Abstract:

Article Preview

The traditional threshold signature scheme is a combination of the digital signature scheme and the secret sharing scheme. Any group of t (threshold value) or more players can reconstruct the secret together but no group of fewer than t players can in secret sharing scheme. Because of this property of secret sharing scheme, the current threshold signature scheme has a natural weakness in the anti-collusion attack. A new threshold signature scheme based on the factorial decompose theorem is designed successfully without the secret sharing scheme in order to get the ability of anti-collusion attacks. It not only has the property of group signature and threshold signature, but also has some good features including traceability,robustness and resisting forgery attacks.

Info:

Periodical:

Edited by:

Shaobo Zhong, Yimin Cheng and Xilong Qu

Pages:

49-53

DOI:

10.4028/www.scientific.net/AMM.50-51.49

Citation:

Y. Q. Cai and F. L. Cheng, "A (t, n) Threshold Signature Scheme Based on Factorial Decompose Theorem of Polynomial", Applied Mechanics and Materials, Vols. 50-51, pp. 49-53, 2011

Online since:

February 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.