Topic
Visual cryptography
About: Visual cryptography is a research topic. Over the lifetime, 1724 publications have been published within this topic receiving 25300 citations.
Papers published on a yearly basis
Papers
More filters
••
04 Jan 2012TL;DR: A new robust watermarking technique for copyright protection based on Discrete Wavelet Transform and Singular Value Decomposition is proposed and the visual quality of the watermarked image is undistinguishable from the original image.
Abstract: In this paper, a new robust watermarking technique for copyright protection based on Discrete Wavelet Transform and Singular Value Decomposition is proposed. The high frequency subband of the wavelet decomposed cover image is modified by modifying its singular values. A secret key is generated from the original watermark with the help of visual cryptography to claim the ownership of the image. The ownership of the image can be claimed by superimposing this secret key on the extracted watermark from the watermarked image. The robustness of the technique is tested by applying different attacks and the visual quality of the extracted watermark after applying these attacks is good. Also, the visual quality of the watermarked image is undistinguishable from the original image.
12 citations
••
TL;DR: A multi-factor cheating-preventing scheme, aiming at exploiting the hybrid codebook to hide the additional verification images into the share images, has been proposed without suffering the above-mentioned deficiencies.
12 citations
••
TL;DR: An optimization model is proposed that is based on the visual quality requirement of SIRDSs to develop construction rules for a \((2,n)\) -BVCS that maximize the contrast of the recovered image in the BVCS.
Abstract: Visual cryptography schemes (VCSs) generate random and meaningless shares to share and protect secret images Conventional VCSs suffer from a transmission risk problem because the noise-like shares will raise the suspicion of attackers and the attackers might intercept the transmission Previous research has involved in hiding shared content in halftone shares to reduce these risks, but this method exacerbates the pixel expansion problem and visual quality degradation problem for recovered images In this paper, a binocular VCS (BVCS), called the \((2,n)\) -BVCS, and an encryption algorithm are proposed to hide the shared pixels in the single image random dot stereograms (SIRDSs) Because the SIRDSs have the same 2D appearance as the conventional shares of a VCS, this paper tries to use SIRDSs as cover images of the shares of VCSs to reduce the transmission risk of the shares The encryption algorithm alters the random dots in the SIRDSs according to the construction rule of the \((2,n)\) -BVCS to produce nonpixel-expansion shares of the BVCS Altering the dots in a SIRDS will degrade the visual quality of the reconstructed 3D objects Hence, we propose an optimization model that is based on the visual quality requirement of SIRDSs to develop construction rules for a \((2,n)\) -BVCS that maximize the contrast of the recovered image in the BVCS
12 citations
01 Jan 2008
12 citations
••
TL;DR: In this article, the authors investigated the best pixel expansion of various models of visual cryptography schemes and proposed a lower bound based on an induced matching of hypergraphs of qualified sets.
12 citations