Visual Cryptography and Contrast Bounds - Visual Cryptography and Secret Image Sharing - page 248

[14] M. Krause and H. U. Simon. Determining the optimal contrast for se-
cret sharing schemes in visual cryptography. Combin. Probab. Comput.,
12(3):285{299, 2003. Combinatorics, probability and computing (Ober-
wolfach, 2001).

[15] N. Linial and N. Nisan. Approximate inclusion-exclusion. Combinatorica,
10(4):349{365, 1990.

[16] M. Naor and A. Shamir. Visual cryptography. In Alfredo De Santis,
editor, Advances in cryptology - EUROCRYPT '94, volume 950 of Lect.
Notes Comput. Sci., pages 1{12. Springer-Verlag, 1995.

[17] E. R. Verheul and H. C. A. van Tilborg. Constructions and properties of
k out of n visual secret sharing schemes. Des. Codes Cryptogr., 11(2):179{
196, 1997.

[18] G. A. Watson. Approximation Theory and Numerical Methods. John

Wiley & Sons, 1980.

[19] C.-N. Yang and T.-S. Chen. Visual secret sharing scheme: Improving
the contrast of a recovered image via different pixel expansions. In
A. Campilho and M. Kamel, editors, ICIAR 2006, volume 4141 of LNCS,
pages 468{479, Berlin Heidelberg, 2006. Springer-Verlag.

[20] C.-N. Yang and C.-S. Laih. New colored visual secret sharing schemes.
Des. Codes Cryptogr., 20(3):325{336, 2000.