Basic properties of the \((t,n)\)-threshold visual secret sharing scheme with perfect reconstruction of black pixels
From MaRDI portal
Publication:851738
DOI10.1007/s10623-005-6700-yzbMath1261.94026OpenAlexW1989049582MaRDI QIDQ851738
Publication date: 22 November 2006
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-005-6700-y
Related Items
Optimal \((k, n)\) visual cryptographic schemes for general \(k\), On \({(k,n)^\ast}\)-visual cryptography scheme, Construction of a \((k,n)\)-visual cryptography scheme, A multisecret sharing scheme for color images based on cellular automata, On general construction for extended visual cryptography schemes, A general method for construction of \((t, n)\)-threshold visual secret sharing schemes for color images
Cites Work
- Unnamed Item
- Unnamed Item
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- Contrast-optimal k out of n secret sharing schemes in visual cryptography
- On the contrast in visual cryptography schemes
- New Results on Visual Cryptography
- Contrast Optimal Threshold Visual Cryptography Schemes
- Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels
- Improved schemes for visual cryptography