Back
 IJCNS  Vol.4 No.10 , October 2011
A Threshold Signature Scheme Based on TPM
Abstract: For the traditional threshold signature mechanism does not considers whether the nodes which generate part signature are trusted and the traditional signature strategy doesn’t do well in resisting internal attacks and external attacks and collusion attacks, so this paper presents a new threshold signature based on Trusted Platform Module (TPM), based on TPM the signature node first should finish the trust proof between it an other members who take part in the signature. Using a no-trusted center and the threshold of the signature policy, this strategy can track active attacks of the key management center and can prevent framing the key management center, this strategy takes into account the limited computing power TPM and has parameters of simple, beneficial full using of the limited computing power TPM.
Cite this paper: nullZ. Zhang, S. Zhang, W. Yu, J. Li, B. Gong and W. Jiang, "A Threshold Signature Scheme Based on TPM," International Journal of Communications, Network and System Sciences, Vol. 4 No. 10, 2011, pp. 622-625. doi: 10.4236/ijcns.2011.410075.
References

[1]   Y. Desmedt and Y. Frankel, “Shared Generation of Authenticators and Signatures,” Proceedings of Cryptology-CRYPTO’91, Springer-Verlag, Berlin, 1991, pp. 457-469.

[2]   C. M. Li, T. Hwang and N. Y. Lee, “Remark on the Threshold RSA Signature Scheme,” Stinosn D. LNCS 773: Advances in Cryptology-CRYPTO’91, Springer-Verlag, Berlin, 1994, pp. 413-420.

[3]   R. Gennaro, S. Jareeki, H. Krawczyk, et a1., “Robust Threshold DSS,” BMaurer U. LNCS 1109: Advances in Cryptology-EUROCRYPT’96, Springer, Berlin, 1996, pp. 157-172.

[4]   C. T. Wang and C. H. Lin, “Threshold Signature Schemes with Trace Able Signers in Group Communications,” Computer Communications, Vol. 21, No. 8, 1998, pp. 771-776. doi:10.1016/S0140-3664(98)00142-X

[5]   L. Ham, “Group-Oriented (t, n) Threshold Digital Signature Scheme and Digital Multi-Signature,” IEEE Proceedings of Computers and Digital and Technique, Vol. 141, No. 5, 1994, pp. 307-313. doi:10.1049/ip-cdt:19941293

[6]   F. Hess, “Efficient Identity Based Signature Schemes Based on Parings,” Proceedings of Selected Areas in Crypto-graphy. SAC’02, Springer, Berlin, 2003, pp. 310-324.

[7]   X. Chen, F. Zhang and K. Kim, “A New ID Based Group Signature Scheme from Bilinear Pairings [EB/OL],” 2003. http://eprint. Iacr.org/2003/1 16.pdf.

[8]   M. C. Gorantla and A. Saxena, “An Efficient Certificate-Less Signature Scheme,” Proceedings of Computational Intelligence and Security, Springer, Berlin, 2006, pp. 110-116.

 
 
Top