Contrast-optimal k out of n secret sharing schemes in visual cryptography. (Extended abstract)
From MaRDI portal
(Redirected from Contrast-optimal k out of n secret sharing schemes in visual cryptography. (Extended abstract))
Contrast-optimal \(k\) out of \(n\) secret sharing schemes in visual cryptography. (Extended abstract)
Contrast-optimal \(k\) out of \(n\) secret sharing schemes in visual cryptography. (Extended abstract)
Recommendations
Cited in
(15)- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- 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
- On the contrast in visual cryptography schemes
- Randomness in secret sharing and visual cryptography schemes
- Meaningful share generation for increased number of secrets in visual secret-sharing scheme
- Boolean composition of visual secret sharing schemes
- Visual cryptography for grey level images
- Contrast Optimal Threshold Visual Cryptography Schemes
- scientific article; zbMATH DE number 2076151 (Why is no real title available?)
- Determining the optimal contrast for secret sharing schemes in visual cryptography
- scientific article; zbMATH DE number 1445313 (Why is no real title available?)
- Fundamentals of Computation Theory
- A new definition of the contrast of visual cryptography scheme
This page was built for publication: Contrast-optimal \(k\) out of \(n\) secret sharing schemes in visual cryptography. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4364587)
