Contrast-optimal k out of n secret sharing schemes in visual cryptography

Theoretical Computer Science

Volumn 240, Issue 2, 2000, Pages 471-485

  Hofmeister, Thomas ^a   Krause, Matthias ^b   Simon, Hans U ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

Linear programming; Secret sharing schemes; Visual cryptography

Indexed keywords

EID: 0037600743     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00243-1     Document Type: Article

References (7)

1. G. Ateniese, C. Blundo, A. De Santis, D.R. Stinson, Visual cryptography for general access structures, Proc. ICALP 96, Springer, Berlin, 1996, pp. 416-428.
2. S. Droste, New results on visual cryptography, in: "Advances in Cryptology" - CRYPTO '96, Springer, Berlin, 1996, pp. 401-415.
3. R. Lidl, H. Niederreiter, Introduction to Finite Fields and their Applications, Cambridge University Press, Cambridge, 1994.
4. N. Linial, N. Nisan, Approximate inclusion-exclusion, Combinatorica 10 (1990) 349-365.
5. J.H. van Lint, R.M. Wilson, A Course in Combinatorics, Cambridge University Press, Cambridge, 1996.
6. M. Naor, A. Shamir, Visual Cryptography, in: "Advances in Cryptology - Eurocrypt 94", Springer, Berlin, 1995, pp. 1-12.
7. M. Naor, A. Shamir, Visual cryptography II: improving the contrast via the cover base, in: Proc. of "Security Protocols: International Workshop 1996", Lecture Notes in Computer Science, vol. 1189, Springer, Berlin, 1997, pp. 69-74.