On the Equivalence of Two Definitions of Visual Cryptography Scheme
A visual cryptography scheme (VCS) is a secret sharing method, for which the secret can be decoded by human eyes without needing any cryptography knowledge nor any computation. To the best of our knowledge, there are two different definitions of basis matrix (k,n)-VCS. The definition of unconditional secure basis matrix (k,n)-VCS is the generally accepted one, and has been widely used since the pioneer work of Naor and Shamir in 1994, while the definition of stacking secure basis matrix (k,n)-VCS is relatively new, and has been used in many studies in recent years. Our study shows that the above two definitions are actually equivalent. Furthermore, we generalize the equivalence relation to general access structure basis matrix VCS and general access structure size invariant VCS. But the equivalence relation does not hold for non-basis matrix (k,n)-VCS.
KeywordsVisual cryptography Secret sharing Unconditional secure Stacking secure
Unable to display preview. Download preview PDF.
- 9.Droste, S.: New Results on Visual Cryptography. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 401–415. Springer, Heidelberg (1996)Google Scholar
- 12.Hou, Y.C., Xu, C.S.: A probability-based optimization model for sharing multiple secret images without pixel expansion (in chinese). Journal of Information, Technology and Society 2, 19–38 (2003)Google Scholar
- 21.Ito, R., Kuwakado, H., Tanaka, H.: Image size invariant visual cryptography. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science E82-A(10), 2172–2177 (1999)Google Scholar