@article{1970,
  author = {Dhiraj Pandey, Uma Shankar Rawat},
  title = {A Novel Progressive Visual Cryptography Approach with Chaotic Map for Securing Digital Contents},
  journal = {Journal of Information Security Research},
  year = {2016},
  volume = {7},
  number = {1},
  doi = {},
  url = {http://www.dline.info/jisr/fulltext/v7n1/jisrv7n1_1.pdf},
  abstract = {Progressive Visual Cryptography (PVC) is quite suitable for sharing sensitive digital data where, as the
number of stacked share increases, more black regions will be decrypted. Over the past few years, designing of progressive
visual recovery technique has been studied by many researchers. Previous research on PVC, such as Fang et al. (2006)
and W.P.Fang et al. (2008) were all carrying pixel-expansion problem and also gives a poor visual quality on the
recovered stacked image. Recently, Hou et al. have developed a progressive scheme for secret sharing. In Hou et al.
scheme, secret object bits are encrypted sequentially by using randomly chosen number from encoding matrices. It is
observed that shares generated by the Hou scheme are free from pixel expansion problem, but shares are not fully
secure and even discloses secret itself in construction phase of encoding. In this paper, we propose a new robust
progressive algorithm based on logistic chaotic map to overcome the said limitation of Hou scheme. The irregular
outputs of the logistic map are used to encode a secret digital information carrying 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 Hou is critically analyzed and compared with new suggested scheme. Empirical results are
presented to showcase the performance of our proposed scheme in terms of its effectiveness (imperceptibility and security)
and feasibility.},
}