Mathematical Problems in Engineering
Volume 2010 (2010), Article ID 593236, 18 pages
Research Article

Meaningful Share Generation for Increased Number of Secrets in Visual Secret-Sharing Scheme

Department of Computer Engineering, Karadeniz Technical University, 61080 Trabzon, Turkey

Received 3 October 2009; Revised 20 March 2010; Accepted 17 May 2010

Academic Editor: Panos Liatsis

Copyright © 2010 Mustafa Ulutas. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This paper presents a new scheme for hiding two halftone secret images into two meaningful shares created from halftone cover images. Meaningful shares are more desirable than noise-like (meaningless) shares in Visual Secret Sharing because they look natural and do not attract eavesdroppers' attention. Previous works in the field focus on either increasing number of secrets or creating meaningful shares for one secret image. The method outlined in this paper both increases the number of secrets and creates meaningful shares at the same time. While the contrast ratio of shares is equal to that of Extended Visual Cryptography, two secrets are encoded into two shares as opposed to one secret in the Extended Visual Cryptography. Any two natural-looking images can be used as cover unlike the Halftone Visual Cryptography method where one cover should be the negative of the other cover image and can only encode one secret. Effectiveness of the proposed method is verified by an experiment.