Simple threshold RSA signature scheme based on simple secret sharing

Authors:
Shaohua Tang
Affiliations:
School of Computer Science and Engineering, South China University of Technology, Guangzhou, China
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Year:
2005

Citing 5
Cited 1

How to share a secret

Communications of the ACM
Society and Group Oriented Cryptography: A New Concept

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Threshold Cryptosystems

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Optimal-resilience proactive public-key cryptosystems

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Practical threshold signatures

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Anonymity and privacy in distributed early warning systems

CRITIS'10 Proceedings of the 5th international conference on Critical Information Infrastructures Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.