ABSTRACT
In Shamir’s (k, n)-threshold secret sharing scheme, n shares are distributed among the participants. Each share incorporates an x-value uniquely designated for each participant. If the distribution takes place on insecure channels, malicious users may acquire few shares. If the number of shares obtained by the malicious users is k or more (≤ n), the malicious user can reconstruct the secret. We proposed a method for distribution of shares with RSA scheme to encrypt the x-values at insecure network along with verification, such that both the secrecy of shares and secret are maintained.
