Visual secret sharing for multiple secrets

  • Authors:

  • Jen-Bang Feng;Hsien-Chu Wu;Chwei-Shyong Tsai;Ya-Fen Chang;Yen-Ping Chu

  • Affiliations:

  • Department of Computer Science and Engineering, National Chung Hsing University, 250, Kuo Kuang Road, Taichung City, Taiwan, ROC;Department of Computer Science and Information Engineering, National Taichung Institute of Technology, 129, Section 3, San Min Road, Taichung City, Taiwan, ROC;Department of Management Information Systems, National Chung Hsing University, Taiwan, ROC;Department of Computer Science and Information Engineering, National Taichung Institute of Technology, 129, Section 3, San Min Road, Taichung City, Taiwan, ROC;Department of Computer Science and Information Engineering, Tunghai University, 181, Section 3, Taichung Port Road, Situn District, Taichung City, Taiwan, ROC

  • Venue:
  • Pattern Recognition
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

Conventional visual secret sharing schemes are designed for a single secret image so it is inefficient to generate numerous share images for multiple secret images simultaneously. Therefore, a novel visual secret sharing scheme for multiple secret images is proposed in this paper. In the proposed encryption process, a stacking relationship graph of secret pixels and share blocks is generated to indicate the encryption functions, and a set of visual patterns is defined to produce two share images according to this graph. Based on the stacking properties of these patterns, the secret images can be obtained from the two share images at aliquot stacking angles. The proposed scheme makes the number of secret images not restricted and further extends it to be general. As a result, the proposed scheme enhances visual secret sharing schemes' ability for multiple secrets.