Improved schemes for visual cryptography
A visual cryptography scheme (VCS) for a set of \(n\) participants is a technique to encode a secret image into \(n\) shadow images (also called shares or transparencies) where each participant receives one share with the property that certain sets of \(k\) or more of the shares allow the complete visual recovery of the image by stacking the transparencies, while fewer than \(k\) shares yields no information on the image. Such a system is called a \((k,n)\) threshold CVS. It is assumed that each pixel is either black or white and is divided into \(n\) shares, one for each transparency. Each share is a collection of \(b\) black and white subpixels, and a single pixel can be described by an \(n \times b\) Boolean matrix \(S = [s_{ij}]\) where \(s_{ij} = 1\) if the \(j\)th subpixel in the \(i\)th transparency is black. A pixel will be seen as white if sufficiently many subpixels are white and will be seen as black if not too many of them are white. This work analyzes VCS's in which the reconstruction of black pixels is perfect in the sense that all subpixels associated to a black pixel are black. New constructions are given for \((k,n)\) threshold VCS's that improve on the previously best known constructions. A construction is also given for coloured \((2,n)\) threshold VCS's and for coloured \((n,n)\) VCS's, again improving on previously known constructions.
- On the contrast in visual cryptography schemes
- Optimal colored threshold visual cryptography schemes
- Visual cryptography for general access structures
- Visual cryptography schemes with optimal pixel expansion
- Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels
- On the security of a visual cryptography scheme for color images
- Image encryption by multiple random grids
- Colored visual cryptography without color darkening
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- New colored visual secret sharing schemes
- Almost-aspect-ratio-invariant visual cryptography without adding extra subpixels
- On the contrast in visual cryptography schemes
- Randomness in secret sharing and visual cryptography schemes
- A new approach for visual cryptography
- On general construction for extended visual cryptography schemes
- Efficient visual secret sharing scheme for color images
- Two secret sharing schemes based on Boolean operations
- Optimal (k, n) visual cryptographic schemes for general k
- Maximal contrast color visual secret sharing schemes
- On \({(k,n)^\ast}\)-visual cryptography scheme
- Optimal colored threshold visual cryptography schemes
- Visual cryptography for general access structures
- Research on a novel construction of probabilistic visual cryptography scheme \((k, n, 0, 1, 1)\)-PVCS for threshold access structures
- scientific article; zbMATH DE number 1588476 (Why is no real title available?)
- On the equivalence of two definitions of visual cryptography scheme
- Measure-independent characterization of contrast optimal visual cryptography schemes
- On (k,n) visual cryptography scheme with t essential parties
- Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques
- New Results on Visual Cryptography
- A new online extended visual cryptography scheme for STS access structures
- Probabilistic (n, n) Visual Secret Sharing Scheme for Grayscale Images
- Color visual cryptography schemes for black and white secret images
- Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images
- scientific article; zbMATH DE number 1088898 (Why is no real title available?)
- Traceable visual cryptography
- scientific article; zbMATH DE number 1950101 (Why is no real title available?)
- Visual cryptography for gray-level images by dithering techniques
- Contrast Optimal Threshold Visual Cryptography Schemes
- scientific article; zbMATH DE number 1500549 (Why is no real title available?)
- New visual cryptographic schemes derived from orthogonal and mixed orthogonal arrays
- scientific article; zbMATH DE number 2102766 (Why is no real title available?)
- Visual cryptograms of random grids for threshold access structures
- Multi-pixel encryption visual cryptography
- Visual cryptographic schemes using combined Boolean operations
- Construction of a \((k,n)\)-visual cryptography scheme
- scientific article; zbMATH DE number 6741951 (Why is no real title available?)
- ESSVCS: an enriched secret sharing visual cryptography
- Flexible Visual Cryptography Scheme and Its Application
- Progress in Cryptology - INDOCRYPT 2003
- A new visual cryptography scheme for STS based access structures
- A new approach to image sharing with high-security threshold structure
- Eine Einführung in die visuelle Kryptographie
- Progress in Cryptology - INDOCRYPT 2004
- Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels
- A general method for construction of \((t, n)\)-threshold visual secret sharing schemes for color images
- New extended visual cryptography schemes with clearer shadow images
- Ideal contrast visual cryptography schemes with reversing
- Basic properties of the \((t,n)\)-threshold visual secret sharing scheme with perfect reconstruction of black pixels
- Visual cryptography schemes with optimal pixel expansion
- Colored visual cryptography scheme based on additive color mixing
- A new definition of the contrast of visual cryptography scheme
This page was built for publication: Improved schemes for visual cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5960282)
