scispace - formally typeset
Book ChapterDOI

Contrast Optimal XOR Based Visual Cryptographic Schemes

TLDR
This is the first theoretical work to find a necessary and sufficient condition for a XOR-based VCS to achieve optimum relative contrast equal to 1 in terms of the underlying access structure.
Abstract
OR-based Visual Cryptographic Schemes (OVCS) suffer from poor visual quality of the reconstructed image. XOR-based visual secret sharing (XVCS) can be thought of as an alternative where the relative contrast of the reconstructed image is much better. Moreover, it is possible to achieve optimum relative contrast equal to 1 in XVCS which is an impossibility in case of OVCS. Although there are examples of XVCSs where optimum relative contrast is achieved but to the best of our knowledge, this is the first theoretical work to find a necessary and sufficient condition for a XOR-based VCS to achieve optimum relative contrast equal to 1 in terms of the underlying access structure.

read more

Citations
More filters
Journal ArticleDOI

A new lossless secret color image sharing scheme with small shadow size

TL;DR: This work proposes a new lossless secret color image sharing scheme with small shadow size, which directly deals with the three components of the intensities of the RGB values of each color pixel of the secret image.
Journal ArticleDOI

Maximal contrast color visual secret sharing schemes

TL;DR: A generic construction method to share a color image in same color model achieving maximal contrast and a direct and efficient construction of visual secret sharing for monotone access structure.
Book ChapterDOI

A New Lossless Secret Image Sharing Scheme for Grayscale Images with Small Shadow Size

TL;DR: Wang et al. as discussed by the authors proposed a lossless (k, n)-threshold scheme with reduced shadow size using the algebraic properties of the polynomial ring over the field.
Book ChapterDOI

Color Visual Cryptography Schemes Using Linear Algebraic Techniques over Rings

TL;DR: In this article, a color VCS in same color model for the threshold access structures by extending linear algebraic techniques from the binary field to finite ring of integers modulo c is presented.
Journal ArticleDOI

An efficient verifiable (t,n)-threshold secret image sharing scheme with ultralight shares

TL;DR: The verifiable (t,n)-threshold secret image sharing (VSIS) scheme as discussed by the authors is a shared image among n participants with the intention that if t or more (t ≤ n) participants collaborate, then the secret image can be computed successfully.
References
More filters
Journal ArticleDOI

Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images

TL;DR: The method of construction of a strong monochrome visual cryptographic scheme (VCS) for general access structure using linear algebra is put forward and an efficient construction of $$(n-1,n)$$(n−1, n)-VCS is provided.
Journal ArticleDOI

Some Extensions on Threshold Visual Cryptography Schemes

TL;DR: It is proved that the TVCS proposed by Droste which was based on the OR operation is still a valid TVCS under the XOR operation, and a method to further reduce its pixel expansion is proposed.
Journal ArticleDOI

Applications of Partially Balanced Incomplete Block Designs in Developing (2,n) Visual Cryptographic Schemes

TL;DR: This paper shows how Partially Balanced Incomplete Block Designs (PBIBD) may be used to construct (2,n) visual cryptographic schemes for black and white images with small pixel expansion.
Book ChapterDOI

On (k, n) Visual Cryptography Scheme with t Essential Parties

TL;DR: Some bounds for the optimal pixel expansion and optimal relative contrast of \((k,n,t)\)-VCS are derived.
Related Papers (5)