A Multi-secret Sharing Scheme with Combiner Identification Authentication

Abstract

Verifiable secret sharing is a hot topic in the field of secret sharing, but many verifiable secret sharing can not share more than one secret at the same time, moreover, some existing verifiable secret sharing schemes can not achieve the fairness of secret reconstruction in asynchronous environment. In this paper, an improved verifiable multi-secret sharing scheme is proposed by using one-way Hash function and Lagrange interpolation formula. In the scheme we introduce combiner verification and recognition and make the combiner and participants authenticate each other. Participants can check whether secret share submission requests from effective combiner is true, and combiner can detect and identify the participant. Our scheme has the following characteristics: Multiple Secrets can be reconstructed at the same time, and no safe channel is needed between the secret distributor and the participants, most importantly, our scheme adds validation to the combiner by the participants, making it impossible for an attacker to obtain information by impersonating the combiner.