Determining the optimal contrast for secret sharing schemes in visual cryptography

Combinatorics Probability and Computing

Volumn 12, Issue 3, 2003, Pages 285-299

  Krause, Matthias ^a   Simon, Hans Ulrich ^b  

^a UNIVERSITY OF MANNHEIM   (Germany)

^b RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; THEOREM PROVING;

VISUAL CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 0037658469     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096354830200559X     Document Type: Conference Paper

References (11)

1. Ateniese, G., Blundo, C., De Sands, A. and Stinson, D. R. (1996) Visual cryptography for general access structures. Inform, Comput. 129 86-106.
2. Blundo, C., D'Arco, P., De Santis, A. and Stinson, D. R. (1998) Contrast optimal threshold visual cryptography schemes. Available at: http: //www.cacr.math.uwaterloo.ca/̃dstinson/visual.html.
3. Blundo, C., De Santis, A. and Stinson, D. R. (1999) On the contrast in visual cryptography schemes. J. Cryptology 12 261-289.
4. Droste, S. (1996) New results on visual cryptography. In Proc. Conference on Advances in Cryptology: CRYPTO'96, Vol. 1109 of Lecture Notes In Computer Science, Springer, pp. 401-415.
5. Hofmeister, T., Krause, M. and Simon, H. U. (2000) Contrast-optimal k out of n secret sharing schemes in visual cryptography. Theoret. Comput. Sci. 240 471-485.
6. Kuhlmann, C. and Simon, H. U. (2000) Construction of visual secret sharing schemes with almost optimal contrast. In Proc. Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 263-272.
7. Linial, N. and Nisan, N. (1990) Approximate inclusion-exclusion. Combinatorica 10 349-365.
8. Naor, M. and Shamir, A. (1995) Visual cryptography. In Proc. Conference on Advances in Cryptology: EUROCRYPT'94, Vol. 950 of Lecture Notes in Computer Science, Springer, pp. 1-12.
9. Naor, M. and Shamir, A. (1997) Visual cryptography II: Improving the contrast via the cover base. In Proc. Workshop on Security Protocols, Vol. 1189 of Lecture Notes in Computer Science, Springer, pp. 197-202.
10. Papadimitriou, C. H. and Steiglitz, K. (1982) Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall.
11. Rivlin, T. J. (1969) An Introduction to the Approximation of Functions, Blaisdell Publishing Company.