A hierarchical threshold multi-secret sharing scheme

This paper first proposes a hierarchical threshold multi-secret sharing scheme based on solving the linearly independent equations. This scheme has the same power as T.Tassapsilas scheme, in which the participants of any authorized subset in the hierarchical threshold access structure can reconstruct the shared secret and the non-authorized subset cannot, and the size of all shares is same as that of the secret. But in our scheme there are more secrets reconstructed at the same time during a sharing process. Thus, our scheme is more efficient than their scheme.