A New RSA Threshold Group Signature Scheme Based on 

Modified Shamirs Secret Sharing Solution

Zhang Wen-fang; He Da-ke; Wang Xiao-min; Zheng Yu

Volume 27 Issue 11

Nov. 2005

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2005 > 27(11): 1745-1749

Zhang Wen-fang, He Da-ke, Wang Xiao-min, Zheng Yu. A New RSA Threshold Group Signature Scheme Based on Modified Shamirs Secret Sharing Solution[J]. Journal of Electronics & Information Technology, 2005, 27(11): 1745-1749.

Citation:

Zhang Wen-fang, He Da-ke, Wang Xiao-min, Zheng Yu. A New RSA Threshold Group Signature Scheme Based on Modified Shamirs Secret Sharing Solution[J]. Journal of Electronics & Information Technology, 2005, 27(11): 1745-1749.

Citation:

PDF( 267 KB)

A New RSA Threshold Group Signature Scheme Based on Modified Shamirs Secret Sharing Solution

Received Date: 2004-05-31
Rev Recd Date: 2004-11-19
Publish Date: 2005-11-19

Abstract

Abstract

In order to avoid computing elements inverses in the ring Z(N) since they may not exit, a new RSA threshold group signature scheme based on modified Shamirs secret sharing solution is proposed. Differing from the old schemes based on Lagrange interpolation solution in which fraction arithmetic operations leading to the computation of elements inverses in Z(N) should be handled, this new scheme reconstructs its group secret key through series of integer arithmetic operations in integral matrixes, by which it can efficiently avoid the computation of any elements inverse in any algebraic structure (such as Z(N)), and can further avoid algebraic extensions. Therefore, this new scheme is more efficient and convenient than the old ones.

FullText(HTML)

References(1)

References

Desmedt Y. Society and group oriented cryptography: A new concept. In: Pomerance C ed..[J].Advances in Cryptolog-Crypto87 Proceedings, LNCS 293. Berlin, Springer-Verlag.1988,:-[2]Boyd C. Digital multisignatures. In: Baker H and Piper F editors, Cryptography and Coding, Oxford, Clarendon Press, 1989: 241-246.Croft R A, Harris S P. Public-key cryptography and reusable shared secrets. In: Baker H and Piper F editors, Cryptography and Coding, Oxford, Clarendon Press, 1989: 189-201.[3]Desmedt Y.[J].Frankel Y. Threshold cryptosystems. In: Brassard G ed., Advances in Cryptology-Crypto89 Proceedings, LNCS 435. Berlin, Springer-Verlag.1990,:-[4]Desmedt Y.[J].Frankel Y. Shared generation of authenticators and signatures. In: Feigenbaum J ed., Advances in Cryptology - Crypto91 Proceedings, Lecture Notes in Computer Science 576, Berlin, Springer-Verlag.1992,:-[5]Santis A D, Desmedt Y, Frankel Y, et al.. How to share a function securely. In: Proceedings of the 26th ACM Symp on Theory of Computing, Montreal, Quebec, Canada, 1994: 522- 533.[6]Gennaro R.[J].Jarecki S, Krawczyk H, et a1.. Robust and efficient sharing of RSA functions. In: Koblitz N ed., Advances in Cryptology-Crypto96 Proceedings. Lecture Notes in Computer Science 1109. Berlin, Springer-Verlag.1996,:-[7]徐秋亮. 改进门限RSA数字签名体制. 计算机学报, 2000, 23(5): 449-453.[8]Shamir A. How to share a secret[J].Communications of the ACM.1979, 22(11):612-613

Relative Articles

Supplements(0)

Cited By

Proportional views