A secure and efficient multi-use multi-secret images sharing scheme for general access structure
Yu‐Ting Lin, Justie Su-Tzu Juan, Yichun Wang
Abstract
Yu‐Ting Lin, Justie Su-Tzu Juan, Yichun Wang
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 single gray-level image. Shyu and Chen proposed multiple secret images sharing scheme for general access structure in 2008. Lee and Juan solved the insecure situation of scheme in 2009. 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-variable 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 Chien and Chen's scheme held in 2006.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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 single gray-level image. Shyu and Chen proposed multiple secret images sharing scheme for general access structure in 2008. Lee and Juan solved the insecure situation of scheme in 2009. 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-variable 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 Chien and Chen's scheme held in 2006.
Key concepts: Secret sharing, Secure multi-party computation, Homomorphic secret sharing, Computer science, Access structure, Shamir's Secret Sharing, Scheme (mathematics), Hash function