Multi-secret visual cryptography with deterministic contrast
The multi-secret visual cryptography scheme (MVCS) allows for the encryption of multiple secret images into a given image area. The previous works on MVCS with probabilistic contrast can not guarantee that every original pixel will be reconstructed correctly. However, MVCS with deterministic contrast can reconstruct every original pixel with simple computation for high-end applications, but they are all simple 2-out-of-2 cases. These drawbacks limit the applicability of MVCSs existed. Based on ringed shares, MVCS with deterministic contrast has been defined in this paper. Furthermore, an (k, n)-MVCS with deterministic contrast, which makes the number of secret images not restricted, is proposed on the basis of the share rotation algorithm and the basis matrices of single secret sharing visual cryptography. Experimental results show that our scheme is the first (k, n)-MVCS with deterministic contrast, which can be applied on any k and n.
KeywordsVisual cryptography Multiple secret images Deterministic contrast Ringed shares
- 2.Blakley GR (1979) Safeguarding cryptographic keys. In Proc. National Comput. Conf. pp 313–317Google Scholar
- 10.Hsu HC, Chen TS, Lin YH (2004) The ring shadow image technology of visual cryptography by applying diverse rotating angles to hide the secret sharing. In Proceedings of the 2004 IEEE International Conference on Networking, Sensing & Control, pp 996–1001Google Scholar
- 14.MacPherson LA (2002) Grey level visual cryptography for general access structures. Master Thesis, University of Waterloo, Waterloo, ON, CanadaGoogle Scholar
- 21.Wu CC, Chen LH (1998) A study on visual cryptography, Master Thesis. PhD thesis, Institute of Computer and Information Science, National Chiao Tung University, Taiwan, R.O.CGoogle Scholar