Bounds for visual cryptography schemes
From MaRDI portal
Publication:968192
DOI10.1016/j.dam.2009.12.005zbMath1185.94078MaRDI QIDQ968192
Abbas Cheraghi, Hossein Hajiabolhassan
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.12.005
94A60: Cryptography
94A08: Image processing (compression, reconstruction, etc.) in information and communication theory
94A62: Authentication, digital signatures and secret sharing
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Visual cryptography schemes with optimal pixel expansion
- A bound on the strong chromatic index of a graph
- 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
- A new approach for visual cryptography
- Visual cryptography for general access structures
- New Results on Visual Cryptography
- Graph homomorphisms through random walks
- Contrast Optimal Threshold Visual Cryptography Schemes