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
01 Jan 2019
TL;DR: A new algorithm for image watermarking using visual cryptography that generates two shares with DWT-SVD is projected that is highly protected and vital to the image processing assault.
Abstract: It has become earnest necessity to protect the digital multimedia content for the possessors of the documents and service providers. Watermarking is such a technique which helps us to attain copyright protection. The concerned literature includes various methods which help to embed information into various multimedia elements like images, audio, and video. In the given paper, we have reviewed DWT-SVD watermarking technique for image watermarking. We have projected a new algorithm for image watermarking using visual cryptography that generates two shares with DWT-SVD. The scheme is highly protected and vital to the image processing assault. The following material also gives an insight into implementation of the contained algorithm step-by-step and shows the future prospects.
22 citations
TL;DR: A novel hybrid encryption approach that includes a VC-based encryption and a camouflaging process that can increase the capacity efficient for VSSM schemes, but also maintains an excellent level of contrast in the recovered secret images.
22 citations
15 May 2009
TL;DR: This paper investigates threshold visual secret sharing schemes mixed XOR and OR operation with reversing and based on binary linear error-correcting code and shows that 2 out of 2 schemes mixed on Xor and ORoperation with reversing where the reconstruction of both black and white pixels is perfect.
Abstract: The (k, n) visual cryptography schemes (VCS) is a perfect secure method that encrypts a secret image by breaking it into shadow images. A Visual Crypto (VC) system based on the polarisation of light which has good resolution, contrast and color properties is introduced. Mathematically, the VC system is described by the XOR operation, which just mean modulo two addition and is equivalence of addition in the finite field GF(2). In this paper, we investigate threshold visual secret sharing schemes mixed XOR and OR operation with reversing and based on binary linear error-correcting code. Firstly, we show that 2 out of 2 schemes mixed on XOR and OR operation with reversing where the reconstruction of both black and white pixels is perfect. It turns out that scheme have much better resolution than their OR-based counterparts. Secondly, we provide one construction for general k out of n schemes based on binary linear error-correcting code. And we show these two schemes are ideal contrast.
22 citations
22 Oct 2012
TL;DR: This paper proposes a novel visual secret sharing scheme without image size expansion that not only does not have pixel expansion, but also provides a high quality recovered image.
Abstract: Over the past few years, increasing concern about the privacy of information shared in computer systems has increased interest in data security. Visual cryptography is a secure secret sharing scheme that divides secret images into shares which on their own reveal no information of the original secret image. Recovery of the secret image can be performed by superimposing the shares. Hence, the process does not require any special software or hardware for cryptographic computations. However, loss of resolution and contrast, and also the image size expansion which results in the need for storage space, are resulting problems and have been the focus of many researchers. In this paper, we propose a novel visual secret sharing scheme without image size expansion. Compared to other schemes of visual cryptography, our perfectly secure scheme not only does not have pixel expansion, but also provides a high quality recovered image.
22 citations