Visual Cryptography

@inproceedings{Naor1994VisualC,
  title={Visual Cryptography},
  author={M. Naor and A. Shamir},
  booktitle={EUROCRYPT},
  year={1994}
}
In this paper we consider a new type of cryptographic scheme, which can decode concealed images without any cryptographic computations. The scheme is perfectly secure and very easy to implement. We extend it into a visual variant of the k out of n secret sharing problem, in which a dealer provides a transparency to each one of the n users; any k of them can see the image by stacking their transparencies, but any k-1 of them gain no information about it. 
Extended visual cryptography schemes
Various Visual Secret Sharing Schemes- A Review
An Improved Visual Cryptography Scheme for Secret Hiding
On visual cryptography schemes
A verifiable visual cryptography scheme based on XOR algorithm
Hiding Multiple Watermarks in Transparencies of Visual Cryptography
...
1
2
3
4
5
...

References

SHOWING 1-9 OF 9 REFERENCES
New Hash Functions and Their Use in Authentication and Set Equality
Universal Classes of Hash Functions
Simple Construction of Almost k-wise Independent Random Variables
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
Small-Bias Probability Spaces: Efficient Constructions and Applications
The Theory of Error-Correcting Codes
Small bias probability spaces: e cient constructions and ap plications, SIAM J
  • on Computing, vol 22,
  • 1993
and N
  • Nisan, Approximate inclusion-exlusion, Combinatorica 10,
  • 1990
and N
  • J. A. Sloane, The theory of error correcting codes, North Holland, Amsterdam,
  • 1977