Abstract:

We used the modified Shamir’s threshold recursive algorithm to construct a multisecret sharing model with hierarchical structure. We used a secret distribution algorithm to share a subsecret in each layer, and then achieved huge data storage with short secret shares. Furthermore, the proposed scheme employed a twovariable resistant collision Hash function, so that the participants could dynamically  join or exit. At the same time, any participant could verify the authenticity of other participants  by exposing the Hash values of secret shares. The results show that the secret sharing scheme is dynamic and verifiable, and can achieve unconditional security.

Key words: hierarchical structure, big data, secret sharing, twovariable resistant collision Hash function