Visual cryptography schemes with optimal pixel expansion
From MaRDI portal
Publication:861259
DOI10.1016/j.tcs.2006.08.008zbMath1107.68040OpenAlexW2041565771MaRDI QIDQ861259
Carlo Blundo, Stelvio Cimato, Alfredo De Santis
Publication date: 9 January 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.008
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (8)
Visual cryptographic schemes using combined Boolean operations ⋮ Visual cryptography schemes with optimal pixel expansion ⋮ A reversible steganography scheme of secret image sharing based on cellular automata and least significant bits construction ⋮ Measure-Independent Characterization of Contrast Optimal Visual Cryptography Schemes ⋮ Visual cryptography on graphs ⋮ On \({(k,n)^\ast}\)-visual cryptography scheme ⋮ Prevention of cheating in visual cryptography by using coherent patterns ⋮ Bounds for visual cryptography schemes
Cites Work
This page was built for publication: Visual cryptography schemes with optimal pixel expansion