Optimal colored threshold visual cryptography schemes
Visual cryptography schemes allow a dealer to divide a secret image into \(n\) shares which can then be distributed to the participants. Part of the participants receive special shares, with special properties which allow them to recover the original image from the shares they have. Such shares are considered to be all in the same set, and the sets are called qualified sets. Images have the property to be black and white or have at their disposal a set \(c\) of colors from which they are ``painted. This paper deals with visual cryptography schemes and selects for study special classes which present interesting properties. Introduction discusses previous work and presents some two basic notions, pixel expansion and contrast of a image, which are then used to compute visual properties of images. Coverage of some other basic notions is provided in section 2 where definitions to \((k,n)\)-treshold schemes, base matrices and efficiency of schemes are provided. The schemes are then studied based on the two properties, contrast and pixel expansion, section 3 deals with optimal contrast \((k,n)\) schemes and provides a linear program whose solution leads to a scheme with optimal contrast property. Section 3 opens the way for providing the proof of the lower bound on pixel expansion. Contrast optimal schemes of section 3, also called cannonical schemes for their strong symmetry properties, are used in section 4 for providing a constructive proof of optimality for \(c\)-color \((n,n)\)-treshold schemes. The final section is dedicated to a research result, a series of constructions for \(c\)-color \((2,n)\)-treshold schemes whose pixel expansion improves on previously proposed schemes.
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- Extended capabilities for visual cryptography
- scientific article; zbMATH DE number 1088898 (Why is no real title available?)
- Improved schemes for visual cryptography
- New colored visual secret sharing schemes
- Visual cryptography for general access structures
- Colored visual cryptography without color darkening
- MTVSS: (M)isalignment (T)olerant (V)isual (S)ecret (S)haring on resolving alignment difficulty
- On the contrast in visual cryptography schemes
- On general construction for extended visual cryptography schemes
- Perfect contrast XOR-based visual cryptography schemes via linear algebra
- Maximal contrast color visual secret sharing schemes
- Reduce shadow size in aspect ratio invariant visual secret sharing schemes using a square block-wise operation
- Multi secret image color visual cryptography schemes for general access structures\(^{*}\)
- 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
- 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
- Contrast Optimal Threshold Visual Cryptography Schemes
- scientific article; zbMATH DE number 2102766 (Why is no real title available?)
- scientific article; zbMATH DE number 6102189 (Why is no real title available?)
- Progress in Cryptology - INDOCRYPT 2003
- Probabilistic visual secret sharing schemes for grey-scale images and color images
- Security in Communication Networks
- Improved schemes for visual cryptography
- 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
- Optimal \((2, n )\) visual cryptographic schemes
- Visual cryptography schemes with optimal pixel expansion
- Extended color visual cryptography for black and white secret image
- Colored visual cryptography scheme based on additive color mixing
- Visual secret sharing for multiple secrets
This page was built for publication: Optimal colored threshold visual cryptography schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486869)
