Sharing secret images using shadow codebooks
Information Sciences—Informatics and Computer Science: An International Journal
Communications of the ACM
Sharing a Secret Gray Image in Multiple Images
CW '02 Proceedings of the First International Symposium on Cyber Worlds (CW'02)
New visual secret sharing schemes using probabilistic method
Pattern Recognition Letters
Aspect ratio invariant visual secret sharing schemes with minimum pixel expansion
Pattern Recognition Letters
Sharing a Secret Two-Tone Image in Two Gray-Level Images
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Size-Adjustable Visual Secret Sharing Schemes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Two secret sharing schemes based on Boolean operations
Pattern Recognition
Sharing multiple secrets in visual cryptography
Pattern Recognition
Sharing visual multi-secrets using circle shares
Computer Standards & Interfaces
Ideal contrast visual cryptography schemes with reversing
Information Processing Letters
An extended multi-secret images sharing scheme based on boolean operation
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
Hi-index | 0.08 |
(n,n) visual secret sharing (VSS), first proposed by Naor and Shamir (1995) [4], is used to encode (encrypt) a secret image into n meaningless share images to be superimposed later to decode (decrypt) the original secret by human visual system after collecting all n secret images. In recent years, VSS-based image sharing (encryption) and image hiding schemes, two of a variety of applications based on VSS, have drawn much attention. In this paper, an efficient (n+1,n+1) multi-secret image sharing scheme based on Boolean-based VSS is proposed to not only keep the secret images confidential but also increase the capacity of sharing multiple secrets. The Boolean-based VSS technology, used to encode the secret images, generates n random matrices; then the n secret images are subsequently encoded into the n+1 meaningless share images. It is worthwhile to note that n secret images can be hidden by means of sharing only n+1 share images in the proposed scheme instead of 2n share images. Thus, the present scheme thus benefits from (1) reducing the demand of image transmission bandwidth, (2) easing the management overhead of meaningless share images, and (3) involving neither significant extra computational cost nor distortion for reconstructed secret images. The experimental results show the performance in terms of feasibility and image sharing capacity. Applied into image hiding schemes, the proposed scheme can enhance the hiding capacity.