基于新型秘密共享方法的高效RSA门限签名方案

张文芳; 何大可; 王小敏; 郑宇

基于新型秘密共享方法的高效RSA门限签名方案

张文芳^{①②;何大可},
何大可,
王小敏,
郑宇

计量
- 文章访问数: 2867
- HTML全文浏览量: 124
- PDF下载量: 888
- 被引次数: 0
出版历程
- 收稿日期: 2004-05-31
- 修回日期: 2004-11-19
- 刊出日期: 2005-11-19

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

摘要

摘要: 针对传统的门限RSA签名体制中需对剩余环Z(N)中元素求逆(而环中元素未必有逆)的问题，该文首先提出一种改进的Shamir秘密共享方法。该方法通过在整数矩阵中的一系列运算来恢复共享密钥。由于其中涉及的参数均为整数，因此避免了传统方案中由Lagrange插值公式产生的分数而引起的环Z(N)中的求逆运算。然后基于该改进的秘密共享方法给出了一个新型的门限RSA Rivest Shanair Atleman签名方案。由于该方案无须在任何代数结构(比如Z(N))中对任何元素求逆，也无须进行代数扩张，因此在实际应用中更为方便、有效。
- 秘密共享;门限群签名;RSA;子密钥(密钥影子);可信任中心
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.

HTML全文

参考文献(1)

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

施引文献

资源附件(0)

访问统计