Lossless secret image sharing based on generalized: LSB replacement

  • Authors:
  • Ruchira Naskar;Rajat Subhra Chakraborty

  • Affiliations:
  • Indian Institute of Technology Kharagpur, Kharagpur, India;Indian Institute of Technology Kharagpur, Kharagpur, India

  • Venue:
  • Proceedings of the 2012 ACM Research in Applied Computation Symposium
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In traditional secret sharing schemes a secret is shared within a group of users such that a subset of the group must come together and collaborate in order to reconstruct the secret. In general image secret sharing schemes, the cover image, within which a secret share is hidden, cannot be restored back to its original form. This loss is unaffordable in situations dealing with sensitive images, for example, medical, military and legal industries. In this paper we propose a secret image sharing scheme by which after secret reconstruction, the cover image can also be restored back to its original form without any bit loss. In the proposed scheme, the secret share generation and secret image reconstruction are based on the concept of the Chinese Remainder Theorem. Hiding of the secret image shares and the cover image retrieval are done utilizing a Generalized Least Significant Bit Replacement method. Implementation results show that the proposed method compares favorably to a recent method for lossless secret sharing.