![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/3/33/Visual_cryptography_development.svg/640px-Visual_cryptography_development.svg.png&w=640&q=50)
Visual cryptography
From Wikipedia, the free encyclopedia
Visual cryptography is a cryptographic technique which allows visual information (pictures, text, etc.) to be encrypted in such a way that the decrypted information appears as a visual image.
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/3/33/Visual_cryptography_development.svg/320px-Visual_cryptography_development.svg.png)
One of the best-known techniques has been credited to Moni Naor and Adi Shamir, who developed it in 1994.[1] They demonstrated a visual secret sharing scheme, where a binary image was broken up into n shares so that only someone with all n shares could decrypt the image, while any n − 1 shares revealed no information about the original image. Each share was printed on a separate transparency, and decryption was performed by overlaying the shares. When all n shares were overlaid, the original image would appear. There are several generalizations of the basic scheme including k-out-of-n visual cryptography,[2][3] and using opaque sheets but illuminating them by multiple sets of identical illumination patterns under the recording of only one single-pixel detector.[4]
Using a similar idea, transparencies can be used to implement a one-time pad encryption, where one transparency is a shared random pad, and another transparency acts as the ciphertext. Normally, there is an expansion of space requirement in visual cryptography. But if one of the two shares is structured recursively, the efficiency of visual cryptography can be increased to 100%.[5]
Some antecedents of visual cryptography are in patents from the 1960s.[6][7] Other antecedents are in the work on perception and secure communication.[8][9]
Visual cryptography can be used to protect biometric templates in which decryption does not require any complex computations.[10]