Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels
Consider an image that is a collection of black and white pixels. Each pixel is divided into \(m\) subpixels. In a \((k,n)\)-threshold visual cryptography system (VCS) each of \(n\) participants is given a share (or transparency) consisting of a collection of subpixels such that if \(k\) of the \(n\) participants stack their transparencies together the image is revealed but if fewer than \(k\) participants do so, the image will be indistinguishable from random noise. More formally define two sets of binary \(n \times m\) basis matrices \({\mathcal C}_0\) and \({\mathcal C}_1\). To encode a white pixel, a random \(C \in {\mathcal C}_0\) is chosen and on share \(i\) is placed \(m\) subpixels indicated by the nonzero elements of row \(i\) with a similar operation for black pixels by using a matrix of \({\mathcal C}_1\). The construction of these sets is crucial to the VCS. It should be noted that reconstruction of the image is not perfect in the sense that white pixels, under reconstruction, will not be all white and black pixels will not be all black. If the exact image is obtained on reconstruction with \(k\) or more shares, it is called a strong VCS. In section 2 the model of a VCS is given more formally including the use of the basis matrices. A new measurement is then given for contrast measurement for use in the reconstruction process. In section 6 new \((2,n)\) schemes are given with the new contrast parameters and is shown to be optimal with respect to pixel expansion. The main result of the work is given in section 6, which gives a new bound on \(m\) for \((2,n)\) schemes for given values of the contrast parameters. Section 7 considers the effect of forcing the basis matrices for white pixels to have constant weight and similarly for basis matrices for black pixels. Section 9 shows how to pose the minimum pixel expansion for \((2,n)\) schemes for specified contrast parameters as an integer linear programming problem. It is also shown how well the bounds derived here predict the actual pixel expansion. Some open problems in this area are also considered.
- On the security of a visual cryptography scheme for color images
- Image encryption by multiple random grids
- Colored visual cryptography without color darkening
- On the contrast in visual cryptography schemes
- Efficient visual secret sharing scheme for color images
- Perfect contrast XOR-based visual cryptography schemes via linear algebra
- Reduce shadow size in aspect ratio invariant visual secret sharing schemes using a square block-wise operation
- An explicit formula and its fast algorithm for a class of symmetric balanced incomplete block designs
- A minimum pixels scheme of 2 out of 2-visual cryptography
- Secure two-party computation: a visual way
- Measure-independent characterization of contrast optimal visual cryptography schemes
- Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques
- A new online extended visual cryptography scheme for STS access structures
- Color visual cryptography schemes for black and white secret images
- New visual cryptographic schemes derived from orthogonal and mixed orthogonal arrays
- Visual cryptograms of random grids for threshold access structures
- Multi-pixel encryption visual cryptography
- Robust progressive block based visual cryptography with chaotic map
- Construction of a \((k,n)\)-visual cryptography scheme
- A new visual cryptography scheme for STS based access structures
- Fundamentals of Computation Theory
- Improved schemes for visual cryptography
- 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: Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959833)
