Multi-Use Multi-Secret Sharing Scheme for General Access Structure
This work addresses secure multi-secret sharing for applications requiring flexible access control, though it appears incremental as it builds on existing cryptographic methods.
The paper tackles the problem of sharing multiple secrets across a general access structure by proposing a scheme where each participant holds only one share, using hash functions and Lagrange interpolation to enable dynamic updates and verification.
The main aim of this paper is to construct a multi-secret sharing scheme for general access structure in a trusted dealer model using suitable hash function and Lagrange's interpolation method. Even though, the proposed scheme is a multi-secret and multi-use one, each participant has to carry only one share. The suitable use of collision resistant one way hash function makes the scheme efficient and multi-use. Moreover, the scheme has a nice property that secrets, participants or qualified sets of participants may be added to or even may be made inactive dynamically by the dealer to get a new access structure without altering the shares of the existing participants in the old access structure. Finally, in the proposed scheme, both the combiner and the share holders can verify the correctness of the information that they are receiving from each other.