Contrast Optimal Threshold Visual Cryptography Schemes
The Threshold Visual Cryptography Schemes (VCS) were introduced by \textit{M. Naor} and \textit{A. Shamir} [Lect. Notes Comput. Sci. 950, 1--12 (1995; Zbl 0878.94048)] and have been widely studied since then. A \((k,n)\)-threshold VCS is a method of sharing a secret (black and white) image among a set of \(n\) participants, giving to each of them a \textit{share} of the image in such a way that any set of \(k\) or more participants can recover the image (without any cryptographic computation: only copying their shares into transparencies and stacking them) but any set of less than \(k\) participants has no information about the secret image. For doing so, each pixel is encoded in \(n\) versions, each of them a collection of \(m\) black and white subpixels. The number \(m\) is called the pixel expansion. Other authors have extended the scope of the Naor-Shamir model: [\textit{G. Ateniese, C. Blundo, A. de Santis} and \textit{D. R. Stinson}, VCS for general access structures, Inf. Comput. 129, 86--106 (1996)]; [\textit{E. R. Verheul} and \textit{H. C. A. van Tilborg}, Des. Codes Cryptography 11, 179--196 (1997; Zbl 0878.94049)] shares images that conceal the existence of a secret image (they look like innocent recognizable images: a dog, a house); [\textit{G. Ateniese, C. Blundo, A. de Santis} and \textit{D. R. Stinson}, Theor. Comput. Sci. 250, 143--161 (2001; Zbl 0952.68056)], etc. In the present paper the authors analyze the contrast of a VCS (the contrast is a value \(\alpha\geq 1/m\)\, that measures the difference between a black and a white pixel in the reconstructed image) and the maximum possible value of the contrast (contrast optimal) for any \(k,n\). The first two sections are introductory. In section 3 the authors define a canonical form for a \((k,n)\)-threshold VCS and they completely characterize contrast optimal \((n-1,n)\) VCS in that canonical form (subsection 4.1). For \(n\geq 4\) they prove an upper bound on the contrast of any \((3,n)\)-threshold VCS and provide a \((3,n)\) contrast optimal VCS (subsection 4.2). Finally for \(k=4\) (section 5) and \(k=5\) (section 6) they provide families of \((k,n)\)-threshold VCS achieving various values of contrast and pixel expansion and determine schemes in those families with the best contrast (in the paper's conclusions they conjecture that those schemes have optimal contrast).
- On the contrast in visual cryptography schemes
- Contrast-optimal k out of n secret sharing schemes in visual cryptography. (Extended abstract)
- Optimal colored threshold visual cryptography schemes
- Improved schemes for visual cryptography
- Contrast-optimal k out of n secret sharing schemes in visual cryptography
- On the security of a visual cryptography scheme for color images
- Colored visual cryptography without color darkening
- Contrast-optimal k out of n secret sharing schemes in visual cryptography
- Extended capabilities for visual cryptography
- A reversible steganography scheme of secret image sharing based on cellular automata and least significant bits construction
- Contrast optimal XOR based visual cryptographic schemes
- On the contrast in visual cryptography schemes
- Randomness in secret sharing and visual cryptography schemes
- Optimal (k, n) visual cryptographic schemes for general k
- Maximal contrast color visual secret sharing schemes
- Optimal colored threshold visual cryptography schemes
- Exploiting the error correction mechanism in QR codes for secret sharing
- Secure two-party computation: a visual way
- 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
- Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images
- Contrast-optimal k out of n secret sharing schemes in visual cryptography. (Extended abstract)
- Determining the optimal contrast for secret sharing schemes in visual cryptography
- Multi-pixel encryption visual cryptography
- scientific article; zbMATH DE number 1445313 (Why is no real title available?)
- Construction of a \((k,n)\)-visual cryptography scheme
- Information Security
- Applied Cryptography and Network Security
- Topics in Cryptology – CT-RSA 2004
- Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels
- A study for security of visual cryptography
- Towards cheat-preventing in block-based progressive visual cryptography for general access structures
- Ideal contrast visual cryptography schemes with reversing
- Basic properties of the \((t,n)\)-threshold visual secret sharing scheme with perfect reconstruction of black pixels
- A cheating prevention scheme for binary visual cryptography with homogeneous secret images
- Bounds for visual cryptography schemes
- A new definition of the contrast of visual cryptography scheme
- VCPSS: A two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches
This page was built for publication: Contrast Optimal Threshold Visual Cryptography Schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443082)
