Abstract
Naor and Shamir ([1]) defined the basic problem of visual cryptography by a visual variant of the k out of n secret sharing problem: how can an original picture be encoded by n transparencies so that less than k of them give no information about the original, but by stacking k of them the original can be seen? They described a solution to this problem by a structure called k out of n secret sharing scheme whose parameters directly correspond to quality and usability of the solution. In this paper a new principle of construction for such schemes is presented which is easy to apply and in most cases gives much better results than the former principles. New bounds on relevant parameters of k out of n schemes are developed, too. Furthermore, an extension of the basic problem is introduced and solved in which every combination of the transparencies can contain independent information.
Chapter PDF
Similar content being viewed by others
References
M. Naor and A. Shamir, Visual cryptography, in “Advances in Cryptology — Eurocrypt’ 94”, Springer-Verlag, Berlin, pp. 1–12, 1995
N. Linial and N. Nisan, Approximate inclusion-exclusion, Combinatorica 10, pp. 349–365, 1990
N. Alon, O. Goldreich, J. Hastad and R. Peralta, Simple constructions of almost k-wise independent random variables, Random Structures and Algorithms 3, pp. 289–304, 1992
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Droste, S. (1996). New Results on Visual Cryptography. In: Koblitz, N. (eds) Advances in Cryptology — CRYPTO ’96. CRYPTO 1996. Lecture Notes in Computer Science, vol 1109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68697-5_30
Download citation
DOI: https://doi.org/10.1007/3-540-68697-5_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61512-5
Online ISBN: 978-3-540-68697-2
eBook Packages: Springer Book Archive