A Karnaugh map {2,2} secret sharing scheme for color images
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
Further improvements on secret image sharing scheme
Proceedings of the 2nd ACM workshop on Multimedia in forensics, security and intelligence
A verifiable secret sharing scheme based on AMBTC
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
(r, n)-threshold image secret sharing methods with small shadow images
IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
| Hi-index | 0.00 |
This paper presents a reliable image secret sharing method which incorporates two k-out-of-n secret sharing schemes: i) Shamir's secret sharing scheme and ii) matrix projection secret sharing scheme. The technique allows a colored secret image to be divided as n image shares so that: i) any k image shares (k \leqslant n) are sufficient to reconstruct the secret image in the lossless manner and ii) any (k - 1) or fewer image shares cannot get enough information to reveal the secret image. It is an effective, reliable and secure method to prevent the secret image from being lost, stolen or corrupted. In comparison with other image secret sharing methods, this approach's advantages are its large compression rate on the size of the image shares, its strong protection of the secret image and its ability for the realtime processing.