(2,n) secret sharing scheme for gray and color images based on Boolean operation
- 147 Downloads
Traditional secret sharing (SS) schemes can reconstruct the secret precisely, but have high computation complexity. Visual secret sharing (VSS) schemes use human visual system to reconstruct the secret without cryptographic computation, but have pixel expansion and loss of contrast. Wang et al. proposed a (2,n)-SS scheme for binary images based on Boolean operation, which has low computation complexity, no pixel expansion and the contrast is 1/2. In this paper, we first construct an r runs (2,n)-SS scheme to improve the contrast of Wang et al.’s binary (2,n)-SS scheme. Then we present two approaches to construct r runs (2,n)-SS schemes for grayscale image and color image. The two approaches are both based on Boolean operation, while one approach uses halftone technology and the other uses bit level processing. These proposed schemes have low computation complexity and almost ideal contrast.
Keywordssecret sharing scheme Boolean operation halftone contrast
Unable to display preview. Download preview PDF.
- 1.Blakley G R. Safeguarding cryptographic keys. Proc AFIPS NCC, 1979, 48: 313–317Google Scholar
- 6.Naor M, Shamir A. Visual cryptography. In: Advances in Cryptology-EUROCRYPTO’94. Berlin: Springer-Verlag, 1995. 950: 1–12Google Scholar
- 13.Chang C C, Lin C C, Le T, et al. A probabilistic visual secret sharing scheme for grayscale images with voting strategy. In: International Symposium on Electronic Commerce and Security, Guangzhou, 2008. 184–188Google Scholar
- 14.Chang C C, Lin C C, Le T, et al. A new probabilistic visual secret sharing scheme for color images. In: 4th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, Harbin, 2008. 1305–1308Google Scholar