A Novel Group Signature Scheme Based on NTRU

Based on the encryption principle of NTRU public key cryptography, construction thought of group signature, and characteristics of Chinese Remainder Theorem found on polynomial, a sort of novel group signature scheme which is of polynomial and NTRU system is presented, whose security and computational efficiency is analyzed as well.

[1]  Hideki Imai,et al.  Public Quadratic Polynominal-Tuples for Efficient Signature-Verification and Message-Encryption , 1988, EUROCRYPT.

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Lidong Chen,et al.  New Group Signature Schemes (Extended Abstract) , 1994, EUROCRYPT.

[4]  Ludovic Perret,et al.  A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem , 2005, EUROCRYPT.

[5]  Bo-Yin Yang,et al.  A More Secure and Efficacious TTS Signature Scheme , 2003, ICISC.

[6]  Dongho Won,et al.  Group Signatures for Hierarchical Multigroups , 1997, ISW.

[7]  Jacques Patarin,et al.  Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms , 1996, EUROCRYPT.

[8]  Zulfikar Ramzan,et al.  Group Blind Digital Signatures: A Scalable Solution to Electronic Cash , 1998, Financial Cryptography.

[9]  Holger Petersen,et al.  How to Convert any Digital Signature Scheme into a Group Signature Scheme , 1997, Security Protocols Workshop.

[10]  Willi Meier,et al.  An attack on the isomorphisms of polynomials problem with one secret , 2003, International Journal of Information Security.

[11]  Jintai Ding,et al.  Rainbow, a New Multivariable Polynomial Signature Scheme , 2005, ACNS.

[12]  Marc Joye,et al.  A Practical and Provably Secure Coalition-Resistant Group Signature Scheme , 2000, CRYPTO.

[13]  Jan Camenisch,et al.  Efficient and Generalized Group Signatures , 1997, EUROCRYPT.

[14]  David Chaum,et al.  Group Signatures , 1991, EUROCRYPT.

[15]  Wang Zhiwen.  Algorithm of keys generation for NTRUSign based on matrix transformation , 2007 .

[16]  Li Xin-she.  Research on efficient NTRU implementations scheme , 2007 .

[17]  Jintai Ding,et al.  A New Variant of the Matsumoto-Imai Cryptosystem through Perturbation , 2004, Public Key Cryptography.

[18]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[19]  Louis Goubin,et al.  Improved Algorithms for Isomorphisms of Polynomials , 1998, EUROCRYPT.

[20]  Jan Camenisch,et al.  Efficient Group Signature Schemes for Large Groups (Extended Abstract) , 1997, CRYPTO.

[21]  Jean-Charles Faugère,et al.  Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects , 2006, EUROCRYPT.

[22]  Jean-Charles Faugère,et al.  Differential-Algebraic Algorithms for the Isomorphism of Polynomials Problem , 2009, IACR Cryptol. ePrint Arch..

[23]  Jintai Ding,et al.  Secure Electronic Voting , 2006, Advances in Information Security.

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

[25]  Gene Tsudik,et al.  Some Open Issues and New Directions in Group Signatures , 1999, Financial Cryptography.

[26]  Ludovic Perret,et al.  Polynomial Equivalence Problems and Applications to Multivariate Cryptosystems , 2003, INDOCRYPT.

[27]  Jan Camenisch,et al.  Efficient group signature schemes for large groups , 1997 .

[28]  Olivier Billet,et al.  A Traceable Block Cipher , 2003, ASIACRYPT.

[29]  Jinn-ke Jan,et al.  A Novel ID-based Group Signature , 1999, Inf. Sci..