The optimized key distribution scheme in threshold RSA

Authors:
CUI Jing-Song;Peng Rong;Wang Li-Na
Affiliations:
Wuhan University, Wuhan;State Key Lab. of Software Engineering, Wuhan;Wuhan University, Wuhan
Venue:
InfoSecu '04 Proceedings of the 3rd international conference on Information security
Year:
2004

Citing 3
Cited 0

Efficient Generation of Shared RSA Keys (Extended Abstract)

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Simplified Approach to Threshold and Proactive RSA

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Building intrusion tolerant applications

SSYM'99 Proceedings of the 8th conference on USENIX Security Symposium - Volume 8

Quantified Score

Hi-index	0.00

Visualization

Abstract

The (t, n) threshold RSA algorithm enables the system to keep the security and availability of the private key without a trusted dealer when parts of system are already under attack. In the traditional threshold RSA sub key distribution scheme, each party that shares the private key must keeps Ctnsub keys secretly in order to enable the whole system to reconstruct the original private key by any t out of n parties. This paper presents a scalable searching algorithm, which can find out the optimized sub key distribution scheme that can significantly decrease the number of sub keys that should be held by each party without weakening the system's security. Thus it can reduce the complexity of key management and related operations.