A Hierarchical Weighted Threshold Multi-Secret Sharing Scheme

摘要

In a multi-secret sharing scheme, a group of n participants is allowed to share multiple secrets and a unique secret can be reconstructed with the knowledge of at least t shadows. We would propose a simple hierarchical weighted threshold multi-secret sharing scheme in this paper. The proposed scheme can be optionally equipped with cheating detection and cheater identification. Besides, the dealer can freely add new secrets to old secrets, and the shadow kept by each participant is publicly verifiable and reusable in the scheme. Furthermore, each participant has his/her own weight according to the relative level it is, in the hierarchy, which may reflect his/her position in a company. Finally, we have shown that the security of our scheme is based on the difficulty of solving the discrete logarithm and the factorization problem.