Basic properties of the (t,n)-threshold visual secret sharing scheme with perfect reconstruction of black pixels
From MaRDI portal
(Redirected from Publication:851738)
Basic properties of the \((t,n)\)-threshold visual secret sharing scheme with perfect reconstruction of black pixels
Basic properties of the \((t,n)\)-threshold visual secret sharing scheme with perfect reconstruction of black pixels
Recommendations
Cites work
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- Contrast Optimal Threshold Visual Cryptography Schemes
- Contrast-optimal k out of n secret sharing schemes in visual cryptography
- scientific article; zbMATH DE number 1950101 (Why is no real title available?)
- scientific article; zbMATH DE number 1445313 (Why is no real title available?)
- Improved schemes for visual cryptography
- New Results on Visual Cryptography
- On the contrast in visual cryptography schemes
- Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels
Cited in
(7)- On general construction for extended visual cryptography schemes
- Optimal (k, n) visual cryptographic schemes for general k
- On \({(k,n)^\ast}\)-visual cryptography scheme
- scientific article; zbMATH DE number 1950101 (Why is no real title available?)
- Construction of a \((k,n)\)-visual cryptography scheme
- A general method for construction of \((t, n)\)-threshold visual secret sharing schemes for color images
- A multisecret sharing scheme for color images based on cellular automata
This page was built for publication: Basic properties of the \((t,n)\)-threshold visual secret sharing scheme with perfect reconstruction of black pixels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851738)