A Verifiable Secret Sharing Scheme without Using Multi-Party Computations

On information security area, it is important to guarantee data privacy, availability and integrity. Secret sharing schemes are known as technologies for protecting data privacy and attaining availability. In secret sharing schemes, n distributed informations of a secret value d, called as shares are constructed, and distributed those to n participants. Then, a group of t members for n participants reconstruct the secret value d by exchanging their shares each other. On the other hand, less than t shares cannot induce the secret value. Moreover, as secret sharing schemes for solving the issue for data integrity, there exist verifiable secret sharing schemes. In verifiable secret sharing schemes, we can also confirm the correctness of reconstructed secrets. In this paper, we focus on a previous verifiable secret sharing scheme and point out issues as necessity of multi-party computations to protect shares from malicious participants. Next, we propose a new verifiable secret sharing scheme without multi-party computations and prove the security of verifications by the proposed scheme.