A Multi-Use Secure and Efficient Multi-Secret Images Sharing Scheme for General Access Structure

Abstract

Multiple secret images sharing scheme deals with the problem that how to secretly distribute several secret images among a group of participants at the same time, and reconstruct these secret images by collecting the shared images or the shares held in qualified subsets. Many studies explore the technique about the secret image sharing, but most of them only can be applied in special access structure or distributed single gray-level image. Shyu and Chen proposed multiple secret images sharing scheme for general access structure in 2008, but there may exists an unqualified subset which can reconstruct the secret images that should not be reconstructed by them in their scheme. Hence, Lee and Juan solved this insecure situation. In the mean time, they also reduced the time complexity, and the sizes of the public image are smaller than those for Shyu and Chen’s scheme. However, the computation of Shyu and Chen’s scheme and Lee and Juan’s scheme still can be reduced, and they both do not achieve the property of multi-use. Therefore, this paper uses two-variables one-way hash function to design a multiple secret images sharing scheme for general access structure, and makes the cost of computation and capability are better than the previous results. Besides, this paper also improve Jian and Chen’s scheme held in 2006 that makes the number of the public images less than that of Jian and Chen’s scheme, so the cost can be decreased.