Visual cryptography schemes with optimal pixel expansion
From MaRDI portal
Recommendations
Cites work
Cited in
(24)- Visual cryptography schemes with optimal pixel expansion
- On the pixel expansion of hypergraph access structures in visual cryptography schemes
- Probabilistic visual secret sharing schemes for grey-scale images and color images
- Shift visual cryptography scheme of two secret images.
- Verifiable visual cryptography based on group structure
- Bounds for visual cryptography schemes
- Using colors to improve visual cryptography for black and white images
- scientific article; zbMATH DE number 2102766 (Why is no real title available?)
- Progress in Cryptology - INDOCRYPT 2004
- Improved schemes for visual cryptography
- Measure-independent characterization of contrast optimal visual cryptography schemes
- Colored visual cryptography without color darkening
- Visual cryptographic schemes using combined Boolean operations
- A reversible steganography scheme of secret image sharing based on cellular automata and least significant bits construction
- Visual cryptography on graphs
- Probabilistic (n, n) Visual Secret Sharing Scheme for Grayscale Images
- On \({(k,n)^\ast}\)-visual cryptography scheme
- Optimal colored threshold visual cryptography schemes
- Visual cryptography for general access structures
- A new approach for visual cryptography
- Optimal \((2, n )\) visual cryptographic schemes
- Visual cryptography for gray-level images by dithering techniques
- A minimum pixels scheme of 2 out of 2-visual cryptography
- Prevention of cheating in visual cryptography by using coherent patterns
This page was built for publication: Visual cryptography schemes with optimal pixel expansion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861259)