Efficient Multi Secret Sharing with Generalized Access Structures
This work addresses secure and verifiable multi-secret sharing for applications like distributed systems, though it appears incremental as it builds on existing secret sharing techniques.
The paper tackles the problem of sharing multiple secrets among participants with different access structures, achieving computational efficiency and enabling participants to verify shares and reconstructed secrets without requiring secure channels.
Multi-secret sharing is an extension of secret sharing technique where several secrets are shared between the participants, each according to a specified access structure. The secrets can be reconstructed according to the access structure by participants using their private shares.Each participant has to hold a single share, additional information are made available in a public bulletin board.The scheme is computationally efficient and also each participant can verify the shares of the other participants and also the reconstructed secret.The scheme does not need any secure channel also.