A new multi-secret images sharing scheme using Largrange's interpolation

Secret sharing is to send shares of a secret to several participants, and the hidden secret can be decrypted only by gathering the distributed shares. This paper proposes an efficient secret sharing scheme using Largrange's interpolation for generalized access structures. Furthermore, the generated shared data for each qualified set is 1/(r − 1) smaller than the original secret image if the corresponding qualified set has r participants. In our sharing process, a sharing circle is constructed first and the shared data is generated from the secret images according to this sharing circle. The properties of the sharing circle not only reduce the size of generated data between two qualified sets but also maintain the security. Thus the actual ratio of the shared data to the original secret images is reduced further. The proposed scheme offers a more efficient and effective way to share multiple secrets.