Simple Threshold RSA Signature Scheme Based on Simple Secret Sharing
- 742 Downloads
A new threshold RSA signature scheme is presented, which is based on a newly proposed simple secret sharing algorithm. The private key of RSA algorithm is divided into N pieces, and each piece is delivered to different participant. In order to digitally sign a message, each participant should calculate the partial signature for the message by using its own piece of shadow. Any K or greater than K participants out of N can combine the partial signatures to form a complete signature for the message. At the phase of signature combination, each participant’s partial secret (shadow) is not necessary to expose to others and the RSA private key is not required to reconstruct, thus the secret of the private key will not be exposed. Besides, fast computation and simple operation are also the features of this scheme.
Unable to display preview. Download preview PDF.
- 1.Desmedt, Y.: Society and group oriented cryptography: a new concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 120–127. Springer, Heidelberg (1988)Google Scholar
- 2.Frankel, Y., Gemmel, P., et al.: Optimal-resilience proactive public-key cryptosystems. In: IEEE Symposium on Foundations of Computer Science, pp. 384–393 (1997)Google Scholar
- 3.Shoup, V.: Practical threshold signatures. In: Proceedings of the Eurocypt 2000, pp. 207–220 (2000)Google Scholar
- 4.Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, Heidelberg (1990)Google Scholar
- 5.Tang, S.: Simple Secret Sharing and Threshold RSA Signature Scheme. Journal of Information and Computational Science 1(2), 259–262 (2004)Google Scholar