By Topic

An Efficient and Secure Multi-secret Image Sharing Scheme with 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
$33 $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

2 Author(s)
Ching-Fan Lee ; Dept. of Comput. Sci. & Inf. Eng., Nat. Chi Nan Univ., Nantou, Taiwan ; Justie Su-Tzu Juan

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.

Published in:

Secure Software Integration and Reliability Improvement, 2009. SSIRI 2009. Third IEEE International Conference on

Date of Conference:

8-10 July 2009