Meaningful share generation for increased number of secrets in visual secret-sharing scheme
From MaRDI portal
Publication:1958863
DOI10.1155/2010/593236zbMath1195.94070OpenAlexW2070660708WikidataQ58653205 ScholiaQ58653205MaRDI QIDQ1958863
Publication date: 30 September 2010
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/224544
Cryptography (94A60) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- Unnamed Item
- Unnamed Item
- Visual secret sharing for multiple secrets
- Sharing multiple secrets in visual cryptography
- Colored visual cryptography without color darkening
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- Extended capabilities for visual cryptography
- On the contrast in visual cryptography schemes
- Efficient visual secret sharing scheme for color images
- Visual cryptography for general access structures
- A steganographic method for images by pixel-value differencing
- Visual cryptography for gray-level images by dithering techniques
This page was built for publication: Meaningful share generation for increased number of secrets in visual secret-sharing scheme