An Extended Visual Cryptography Algorithm for General Access Structures.

IEEE Transactions on Information Forensics and Security (Impact Factor: 2.07). 02/2012; 7:219-229. DOI: 10.1109/TIFS.2011.2167611
Source: DBLP

ABSTRACT Conventional visual secret sharing schemes generate noise-like random pixels on shares to hide secret images. It suffers a management problem, because of which dealers cannot visually identify each share. This problem is solved by the extended visual cryptography scheme (EVCS), which adds a meaningful cover image in each share. However, the previous approaches involving the EVCS for general access structures suffer from a pixel expansion problem. In addition, the visual cryptography (VC)-based approach needs a sophisticated codebook design for various schemes. In this paper, we propose a general approach to solve the above-mentioned problems; the approach can be used for binary secret images in noncomputer-aided decryption environments. The proposed approach consists of two phases. In the first phase, based on a given access structure, we construct meaningless shares using an optimization technique and the construction for conventional VC schemes. In the second phase, cover images are added in each share directly by a stamping algorithm. The experimental results indicate that a solution to the pixel expansion problem of the EVCS for GASs is achieved. Moreover, the display quality of the recovered image is very close to that obtained using conventional VC schemes.

  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we propose the use of colors to improve visual cryptography schemes for black-and-white secret images. The resulting model is called colored-black-and-white visual cryptography (cbw-vc) model. Using this new model we exploit colors to obtain schemes to share b&w images using a smaller pixel expansion. In particular we provide (2,n)-threshold schemes with pixel expansion m=@?log"3n@?, improving on the best pixel expansion attainable in the normal b&w model (bw-vc). For the case of schemes with perfect reconstruction of black pixels we provide a general construction that allows us to transform any bw-vc scheme into a cbw-vc scheme whose pixel expansion is 1/3 of the pixel expansion of the starting bw-vc scheme. We prove that, in the cbw-vc model, it is not possible to construct (2,n)-threshold schemes, for n>=4, and (k,n)-threshold schemes, for k>=3, without pixel expansion. We also prove that there exist schemes with optimal contrast in the subset of schemes that use only full intensity colors; this is a direct consequence of the definition of contrast which distinguishes only black and non-black pixels. We discuss an alternative measure of contrast that takes into account the ''distance'' between colors. We conjecture that also with this definition of contrast there exist schemes that use only full intensity colors and achieve optimal contrast.
    Theoretical Computer Science 10/2013; 510:62-86. · 0.52 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Tagged visual cryptography (TVC) is a brand new type of visual cryptography (VC) in which additional tags are concealed into each generated share. By folding up each single share, the associated tagged pattern is visually revealed. Such additional tag patterns greatly enrich extra abilities of VC, such as augmented message carried in a single share, user-friendly interface to manage the shares, and/or evidence for verifying consistency among those shares cooperating in a decryption instance. However, reported (k, n) TVC proposed by Wang and Hsu still suffers from the defects such as pixel expansion, code book required in the encoding phase and low image quality. In this work, a (k, n) TVC by adopting the concept of random grid (RG) is introduced. The proposed method can solve the pixel expansion and code book needed problems. Further, cheating activity can be prevented by the proposed algorithm. Superior visual quality of both the recovered secret image and reconstructed tag image is provided as well according to the theoretical analysis and demonstrated experiments.
    Signal Processing 04/2014; 97:64–82. · 2.24 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Conventional visual secret sharing (VSS) schemes hide secret images in shares that are either printed on transparencies or are encoded and stored in a digital form. The shares can appear as noise-like pixels or as meaningful images; but it will arouse suspicion and increase interception risk during transmission of the shares. Hence, VSS schemes suffer from a transmission risk problem for the secret itself and for the participants who are involved in the VSS scheme. To address this problem, we proposed a natural-image-based VSS scheme (NVSS scheme) that shares secret images via various carrier media to protect the secret and the participants during the transmission phase. The proposed $(n,n)$- NVSS scheme can share one digital secret image over $n-1$ arbitrary selected natural images (called natural shares) and one noise-like share. The natural shares can be photos or hand-painted pictures in digital form or in printed form. The noise-like share is generated based on these natural shares and the secret image. The unaltered natural shares are diverse and innocuous, thus greatly reducing the transmission risk problem. We also propose possible ways to hide the noise-like share to reduce the transmission risk problem for the share. Experimental results indicate that the proposed approach is an excellent solution for solving the transmission risk problem for the VSS schemes.
    IEEE Transactions on Information Forensics and Security 01/2014; 9(1):88-98. · 2.07 Impact Factor