A Weighted Threshold Visual Cryptography
Over the past years, a visual secret sharing scheme gave each share the same ability to reconstruct the secret image. That means each participant had the same significance to reveal the secret. However, it is not realistic in real world for some applications. In this paper, the weighted \( (k,n) \)-threshold visual cryptography scheme is proposed, in which the secret image is encoded into some shares with different weights and the sum of weights for all shares has to be equal to \( n \), according to the share-holders of different priority levels. In the decoding phase, when the shares with different weights are superimposed and the sum of weights of all stacking shares is equal to or larger than \( k \), the secret is then visually recognizable. Otherwise, no information about secret image is revealed. The proposed scheme is the first weighted \( (k,n) \)-threshold visual cryptography method with no pixel expansion. It is suitable for applications in the real life.
KeywordsCryptography Visual cryptography Weighted visual secret sharing Probabilistic visual secret sharing
This research was partially supported by Ministry of Science Technology, Taiwan, R.O.C., under contract no. MOST 105-2221-E-415 -012.
- 1.Blakley, G.: Safeguarding cryptographic keys. In: Proceedings AFIPS 1979 National Computer Conference, pp. 313–317, AFIPS Press, New York (1979)Google Scholar
- 4.Chen, S.K.: Weighted visual cryptography with non-expansible shares. J. Image Process. Commun. 5(1), 1–6 (2013)Google Scholar
- 5.Chen, T.H., Lee, Y.S.: Yet another friendly progressive visual secret sharing scheme. In: Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (2009)Google Scholar
- 11.Hou, Y.C., Chang, C.Y., Hsu, C.S.: Visual cryptography for color images without pixel expansion. In: Proceeding of CISST 2001, vol. I, pp. 239–245, Las Vegas (2001)Google Scholar
- 12.Hou, Y.C., Quan, Z.Y., Tsai, C.F.: General model for the priority-based progressive visual secret sharing. Journal of C.C.I.T, 42(2), 33–48 (2013)Google Scholar