Region-in-Region incrementing visual cryptography scheme

  • Authors:
  • Ching-Nung Yang;Yi-Chin Lin;Chih-Cheng Wu

  • Affiliations:
  • Department of Computer Science and Information Engineering, National Dong Hwa University, Taiwan;Department of Computer Science and Information Engineering, National Dong Hwa University, Taiwan;Department of Computer Science and Information Engineering, National Dong Hwa University, Taiwan

  • Venue:
  • IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, some region incrementing VCSs (RIVCSs) were proposed, which can gradually reconstruct secrets in a single image. In RIVCS, the secret image is subdivided into multiple secrecy level regions, in such a way that more shadows can be used to reveal the more secrecy level regions. The incrementing region property provides an attractive feature, which enables progressive decoding. However, the secret level regions of all previous RIVCSs are disjointed, which any two secrecy level regions do not have the same overlapping areas. In this paper, we discuss a (k, n) region-in-region incrementing VCS (RiRIVCS). Our (k, n)-RiRIVCS has (n(k+1) secrecy level regions, which the next secrecy level region is in the preceding secrecy level region. Such region allocations in our RiRIVCS have more areas to hide the secret than the non-overlapping regions in the previous RIVCS.