By Topic

A secure and efficient multi-use multi-secret images sharing scheme for general access structure

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yu-Ting Lin ; Dept. of Comput. Sci. & Inf. Eng., Nat. Chi Nan Univ., Nantou, Taiwan ; Juan, J.S.-T. ; Yi-Chun Wang

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.

Published in:

Industrial Informatics (INDIN), 2010 8th IEEE International Conference on

Date of Conference:

13-16 July 2010