By Topic

Enhanced Matrix-Based Secret Image Sharing Scheme

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

4 Author(s)
Ching-Nung Yang ; Dept. of Comput. Sci. & Inf. Eng., Nat. Dong Hwa Univ., Hualien, Taiwan ; Chih-Cheng Wu ; Yi-Chin Lin ; Cheonshik Kim

Recently, Rey proposed an efficient (2, n) matrix- based secret image sharing (MSIS) scheme based on simple binary matrix operations. However, the threshold property of Rey's (2, n)-MSIS scheme is compromised. Elsheh and Hamza showed a weakness that if the ranks of the singular matrices used in Rey's scheme are not low enough then one can retrieve the secret information from only one shadow image. In this paper, we overcome this weakness. Our new (2, n)-MSIS scheme satisfies the threshold condition, and has low computational complexity for recovery.

Published in:

Signal Processing Letters, IEEE  (Volume:19 ,  Issue: 12 )