A general method for construction of \((t, n)\)-threshold visual secret sharing schemes for color images
From MaRDI portal
Publication:717155
DOI10.1007/s10623-010-9449-xzbMath1236.94077OpenAlexW2025283288MaRDI QIDQ717155
Publication date: 27 September 2011
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-010-9449-x
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Visual cryptography for grey level images
- Basic properties of the \((t,n)\)-threshold visual secret sharing scheme with perfect reconstruction of black pixels
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
- New colored visual secret sharing schemes
- Efficient visual secret sharing scheme for color images
- Optimal colored threshold visual cryptography schemes
- Progress in Cryptology - INDOCRYPT 2003
- Security in Communication Networks
- Improved schemes for visual cryptography
This page was built for publication: A general method for construction of \((t, n)\)-threshold visual secret sharing schemes for color images