Changeable Threshold Signature Scheme Based on Lattice Theory

The current changeable threshold signature schemes are generally based on RSA or ECC algorithm. They often have shortcomings of the large amount of calculation, need the dealer to participate in when adjusting the threshold etc. This paper introduced the related concepts and theories of lattice, proposed a novel changeable threshold signature scheme and analyzed the essential security, it based on the changeable threshold Shamir secret sharing scheme and NTRUSign signature algorithm. The scheme has the following properties: It is mainly based on polynomial multiplication and integer coefficient modular arithmetic and needn’t introduce exponential operation; It needn’t redistribute the subsecret and modify the group public key when changing threshold; The scheme guarantees threshold security, robustness and unforgeability.

[1]  Wang Xiao Dynamic Threshold Group Signature Scheme , 2004 .

[2]  Hu Yu A Novel NTRU-Class Digital Signature Scheme , 2008 .

[3]  Nicolas Gama,et al.  Symplectic Lattice Reduction and NTRU , 2006, EUROCRYPT.

[4]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[5]  William Whyte,et al.  NTRUSIGN: Digital Signatures Using the NTRU Lattice , 2003, CT-RSA.

[6]  Jiao Li-cheng Changeable Threshold Signature Scheme without a Trusted Center , 2008 .

[7]  Joseph H. Silverman,et al.  NSS: An NTRU Lattice-Based Signature Scheme , 2001, EUROCRYPT.

[8]  William Whyte,et al.  Performance Improvements and a Baseline Parameter Generation Algorithm for NTRUSign , 2005, IACR Cryptol. ePrint Arch..

[9]  Jiang Han Threshold Proxy Signature Scheme Based on RSA Cryptosystems , 2007 .

[10]  Joseph H. Silverman,et al.  Version 2 Title : Enhanced Encoding and Verification Methods for the NTRU Signature Scheme , 2001 .

[11]  Yvo Desmedt,et al.  Shared Generation of Authenticators and Signatures (Extended Abstract) , 1991, CRYPTO.

[12]  Guy Kindler,et al.  Approximating CVP to Within Almost-Polynomial Factors is NP-Hard , 2003, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[13]  J. Silverman Title: Estimated Breaking times for Ntru Lattices , 1999 .

[14]  Ron Steinfeld,et al.  Lattice-based threshold-changeability for standard CRT secret-sharing schemes , 2006, Finite Fields Their Appl..

[15]  Yu-Pu Hu A Novel NTRU-Class Digital Signature Scheme: A Novel NTRU-Class Digital Signature Scheme , 2009 .

[16]  Joseph H. Silverman,et al.  NTRU: A Ring-Based Public Key Cryptosystem , 1998, ANTS.

[17]  Liu Hong-wei Efficiency identity-based threshold group signature scheme , 2009 .

[18]  Ron Steinfeld,et al.  Lattice-Based Threshold Changeability for Standard Shamir Secret-Sharing Schemes , 2007, IEEE Trans. Inf. Theory.

[19]  N.-Y. Lee Threshold signature scheme with multiple signing policies , 2001 .

[20]  László Babai,et al.  On Lovász’ lattice reduction and the nearest lattice point problem , 1986, Comb..