Efficient multi-secret image sharing based on Boolean operations

  • Authors:
  • Tzung-Her Chen;Chang-Sian Wu

  • Affiliations:
  • Department of Computer Science and Information Engineering, National Chiayi University, 300 University Rd., Chia-Yi City, Taiwan 600, ROC;Department of Computer Science and Information Engineering, National Chiayi University, 300 University Rd., Chia-Yi City, Taiwan 600, ROC

  • Venue:
  • Signal Processing
  • Year:
  • 2011

Quantified Score

Hi-index 0.08

Visualization

Abstract

(n,n) visual secret sharing (VSS), first proposed by Naor and Shamir (1995) [4], is used to encode (encrypt) a secret image into n meaningless share images to be superimposed later to decode (decrypt) the original secret by human visual system after collecting all n secret images. In recent years, VSS-based image sharing (encryption) and image hiding schemes, two of a variety of applications based on VSS, have drawn much attention. In this paper, an efficient (n+1,n+1) multi-secret image sharing scheme based on Boolean-based VSS is proposed to not only keep the secret images confidential but also increase the capacity of sharing multiple secrets. The Boolean-based VSS technology, used to encode the secret images, generates n random matrices; then the n secret images are subsequently encoded into the n+1 meaningless share images. It is worthwhile to note that n secret images can be hidden by means of sharing only n+1 share images in the proposed scheme instead of 2n share images. Thus, the present scheme thus benefits from (1) reducing the demand of image transmission bandwidth, (2) easing the management overhead of meaningless share images, and (3) involving neither significant extra computational cost nor distortion for reconstructed secret images. The experimental results show the performance in terms of feasibility and image sharing capacity. Applied into image hiding schemes, the proposed scheme can enhance the hiding capacity.