Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography

Abstract

This paper shows that the largest possible contrast ). The proofs of our results proceed by finding a relationship between the largest possible contrast in a secret sharing scheme and the smallest possible approximation error in problems occurring in approximation theory.