The optimized key distribution scheme in threshold RSA

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 C t n sub 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.