Equivalence Proof of Traditional and Random Grid-Based (2, 2) Visual Secret Sharing
Visual secret sharing (VSS) has attracted considerable attention to scientists and engineers as another branch alongside conventional cryptography to protect the sensitive visual information from several rapacious behaviors. In the literature, there are a number of several techniques used to protect the visual information, among which traditional VSS and random grid (RG)-based VSS are the primary branches. In this letter, we show, by examples, the two means are equal. In addition, the color representation of traditional VSS and RG-based VSS found it different from digital applications like images. Based on the given examples, it is demonstrated that the color representation of the two means can be the same and confirm with digital processing applications.
KeywordsVisual cryptography Visual secret sharing Random grid Equivalence proof Color representation
Unable to display preview. Download preview PDF.
- 8.Yan, X., Wang, S., El-Latif, A.A.A., Niu, X.: Visual secret sharing based on random grids with abilities of AND and XOR lossless recovery. IEEE Trans. on Circ. and Sys. for Video Tech. 21(11), 1693–1703 (2011); Accepted for publication in Multimedia tools and application (2013), doi: 10.1007/s11042-013-1784-2,2013Google Scholar
- 9.Wu, X., Sun, W.: Improving the visual quality of random grid-based visual secret sharing. Signal Processing (2012)Google Scholar
- 11.Guo, T., Liu, F., Wu, C.K.: Threshold visual secret sharing by random grids with improved contrast. Journal of Systems and Software (2013)Google Scholar