An Efficient and Secure Multi-secret Image Sharing Scheme with General Access Structure

In 2008, Shi et al. proposed a new (t, n)-threshold secret sharing scheme for image encryption. This paper indicates that their scheme is insecure because it is possible to find the secret image from the public image. In addition, it is inflexible since the width must be equal to the height and the size of the secret images must be the same upon sharing multi-image. Moreover, their scheme is not efficient enough. For these reasons, we propose two new schemes to avoid secret images that can be found from the public image and the width and height of secret image can be decided flexibly. Finally, the proposed schemes not only achieve some properties such as multi-secret images, multiuse, and the number of shares that are held by each participant is just one but also can be used for any general access structure in this paper.