Proceedings ArticleDOI
Two Kinds of Ideal Contrast Visual Cryptography Schemes
Tan Xiao-qing
- pp 450-453
Reads0
Chats0
TLDR
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.read more
Citations
More filters
Posted Content
Secure Iris Authentication Using Visual Cryptography
TL;DR: In this article, a secret sharing scheme is proposed to secure the iris template, where a secret image is encrypted into the shares which independently disclose no information about the original secret image.
Posted Content
Optimal Contrast Greyscale Visual Cryptography Schemes with Reversing
TL;DR: An optimal-contrast grayscale RVCS (GRVCS) is proposed by using basis matrices of perfect black nRVCS, and an optimal GRVCS with a minimum number of shares held by each participant is proposed even though the basisMatrices are not perfectly black.
Journal ArticleDOI
Optimal Contrast Grayscale Visual Cryptography Schemes With Reversing
TL;DR: In this paper, the authors proposed an optimal-contrast grayscale RVCS (GRVCS) by using basis matrices of perfect black nRVCS, where the basis matrix is not perfectly black.
Journal ArticleDOI
A Visual Cryptography Based Digital Image Copyright Protection
TL;DR: Experimental results show the proposed method can recover the watermark pattern from the marked image even if major changes are made to the original digital image.
Proceedings ArticleDOI
An extensive review on visual cryptography schemes
J. Ramya,B. Parvathavarthini +1 more
TL;DR: This paper is intended to study the various visual cryptography schemes and also to analysis the performance on the basis of expansion of pixel, number of secret images, image format and type of share generated.
References
More filters
Visual Cryptography
Moni Naor,Adi Shamir +1 more
TL;DR: In this paper, a new type of cryptographic scheme, which can decode concealed images without any cryptographic computations, is proposed, which is called k-out-of-n secret sharing.
Journal ArticleDOI
On secret sharing systems
TL;DR: A linear coding scheme for secret sharing is exhibited which subsumes the polynomial interpolation method proposed by Shamir and can also be viewed as a deterministic version of Blakley's probabilistic method.
Journal ArticleDOI
Constructions and Properties of k out of nVisual Secret Sharing Schemes
TL;DR: Two general k out of n constructions that are related to those of maximum size arcs or MDS codes and the notion of coloured visual secret sharing schemes is introduced and a general construction is given.
Minimal Codewords and Secret Sharing
TL;DR: It is shown that the minimal codewords in the dual code completely specify the access structure of the secret-sharing scheme, and conversely, the apparently new notion of minimal codEWords in a linear code.
Book ChapterDOI
New Results on Visual Cryptography
TL;DR: A new principle of construction for k out of n secret sharing schemes is presented which is easy to apply and in most cases gives much better results than the former principlcs.