Robust progressive block based visual cryptography with chaotic map
Dhiraj Pandey, Umashankar Rawat, Anil Kumar · Journal of Discrete Mathematical Sciences and Cryptography · 2016
Over the past few years, designing of progressive visual recovery technique has been studied by many researchers. Previous research on PVC were all carrying pixel-expansion problem. Young et al. (2013) suggested a new dimension of Progressive visual secret sharing with the feature of Block based encoding and recovery of an original secret. In the Young scheme (2013), a secret image is subdivided into n non-overlapped image sections. When L (2 ≤ L ≤ n) participants stack their shadow images, all the image sections associated with these L participants will be recovered. In this article, the scheme suggested for a block based progressive scheme is critically analyzed and we show that leakage of secret information is possible in the scheme during the encoding process of the shares. Further, we propose a new robust progressive algorithm based on the logistic chaotic map to overcome the said limitation. The irregular outputs of the logistic map are used to encode a secret digital image. To provide robustness during the encoding process of the share, noise has been introduced along with chaotic sequences. The performance of the algorithm in the scheme of Young is critically analyzed and compared with the new suggested scheme. The empirical results are presented to showcase the performance of our proposed scheme in terms of its effectiveness and feasibility.