Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blundo, C., De Bonis, A., De Santis, A.: Improved schemes for visual cryptography. Design, Codes and Cryptography 24(3), 255–278 (2001)
Blundo, C., De Santis, A.: Visual cryptography schemes with perfect reconstruction of black pixels. Computer and Graphics 22(4), 449–455 (1998)
Hofmeister, T., Krause, M., Simon, H.U.: Contrast-optimal k out of n secret sharing schemes in visual cryptography. In: Jiang, T., Lee, D.T. (eds.) COCOON 1997. LNCS, vol. 1276, pp. 176–186. Springer, Heidelberg (1997)
Hofmeister, T., Krause, M., Simon, H.U.: Contrast-optimal k out of n secret sharing schemes in visual cryptography. Theoretical Computer Science 240(2), 471–485 (2000)
Koga, H., Ueda, E.: The optimal (t, n)-threshold visual secret sharing scheme with perfect reconstruction of black pixels (submitted)
Krause, M., Simon, H.U.: Determining the optimal contrast for secret sharing schemes in visual cryptography. In: Proceedings of the 4th Latin American Conference on Theoretical Informatics, pp. 280–291 (2000)
Krause, M., Simon, H.U.: Determining the optimal contrast for secret sharing schemes in visual cryptography. Combinatorics, Probability and Computing 12(3), 285–299 (2003)
Kuhlmann, C., Simon, H.U.: Construction of visual secret sharing schemes with almost optimal contrast. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 263–272 (2000)
Naor, M., Shamir, A.: Visual cryptography. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 1–12. Springer, Heidelberg (1995)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Englewood Cliffs (1982)
Rivlin, T.J.: An Introduction to the Approximation of Functions. Blaisdell Publishing Company (1969)
Verheul, E.R., van Tilborg, H.C.A.: Constructions and properties of k out of n visual secrete sharing schemes. Design, Codes and Cryptography 11(2), 179–196 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simon, H.U. (2005). Perfect Reconstruction of Black Pixels Revisited. In: Liśkiewicz, M., Reischuk, R. (eds) Fundamentals of Computation Theory. FCT 2005. Lecture Notes in Computer Science, vol 3623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11537311_20
Download citation
DOI: https://doi.org/10.1007/11537311_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28193-1
Online ISBN: 978-3-540-31873-6
eBook Packages: Computer ScienceComputer Science (R0)