Sharing multiple secrets in visual cryptography

  • Authors:

  • Shyong Jian Shyu;Shih-Yu Huang;Yeuan-Kuen Lee;Ran-Zan Wang;Kun Chen

  • Affiliations:

  • Department of Computer Science and Information Engineering, Ming Chuan University, Gwei-Shan, Taoyuan 333, Taiwan;Department of Computer Science and Information Engineering, Ming Chuan University, Gwei-Shan, Taoyuan 333, Taiwan;Department of Computer Science and Information Engineering, Ming Chuan University, Gwei-Shan, Taoyuan 333, Taiwan;Department of Computer and Communication Engineering, Ming Chuan University, Gwei-Shan, Taoyuan 333, Taiwan;Department of Computer Science and Information Engineering, Ming Chuan University, Gwei-Shan, Taoyuan 333, Taiwan

  • Venue:
  • Pattern Recognition
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

The secret sharing schemes in conventional visual cryptography arecharacterized by encoding one shared secret into a set of randomtransparencies which reveal the secret to the human visual systemwhen they are superimposed. In this paper, we propose a visualsecret sharing scheme that encodes a set of x≥2 secrets into twocircle shares such that none of any single share leaks the secretsand the x secrets can be obtained one by one by stacking the firstshare and the rotated second shares with x different rotationangles. This is the first true result that discusses the sharingability in visual cryptography up to any general number of multiplesecrets in two circle shares.