Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Constructions and Properties of k out of nVisual Secret Sharing Schemes
Designs, Codes and Cryptography
Construction of visual secret sharing schemes with almost optimal contrast
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Contrast-optimal k out of n secret sharing schemes in visual cryptography
Theoretical Computer Science - computing and combinatorics
Improved Schemes for Visual Cryptography
Designs, Codes and Cryptography
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography
Combinatorics, Probability and Computing
| Hi-index | 0.00 |
It has been shown recently in [5] that the visual secret sharing scheme proposed in [1] leads to the largest possible visual contrast among all schemes that perfectly reconstruct black pixels. The main purpose of this paper is to demonstrate that the largest optimal contrast (for this kind of schemes) equals the smallest possible error when we try to approximate a polynomial of degree k on k + 1 interpolation points by a polynomial of degree k – 1. Thus, the problem of finding a contrast-optimal scheme with perfect reconstruction of black pixels boils down to a well-known problem (with a well-known solution) in Approximation Theory. A second purpose of this paper is to present a tight asymptotic analysis for the contrast parameter. Furthermore, the connection between visual cryptography and approximation theory discussed in this paper (partially known before) may also find some interest in its own right.