By Topic

A color image secret sharing scheme satisfying the perfect reconstruction property

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

2 Author(s)
Lukac, R. ; Dept. of Electron. Comput. Eng., Toronto Univ., Ont., Canada ; Plataniotis, K.N.

A new scheme suitable for simultaneous encryption and secret sharing of color images is presented. Employing a generalized {k, n}-secret sharing principle the method encrypts the color image input into n noise-like color shares. The secret information is recovered only if k allowed shares are available for decryption. To overcome limitations of traditional secret sharing schemes, the method i) operates at the bit-levels of the input and share images, ii) increases the level of protection utilizing full color gamut in generating the shares, and iii) satisfies the perfect reconstruction property, in terms of both the spatial resolution and the color/structural image content, for an authorized decryption process.

Published in:

Multimedia Signal Processing, 2004 IEEE 6th Workshop on

Date of Conference:

29 Sept.-1 Oct. 2004