A secret enriched visual cryptography

  • Authors:
  • Feng Liu;Wei Q. Yan;Peng Li;Chuankun Wu

  • Affiliations:
  • State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China;School of Computing and Mathematical Sciences, Auckland University of Technology, New Zealand;Department of Mathematics and Physics, North China Electric Power University, Baoding, Hebei, China;State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

Visual Cryptography (VC) is a powerful technique that combines the notions of perfect ciphers and secret sharing in cryptography with that of raster graphics. A binary image can be divided into shares that are able to be stacked together so as to approximately recover the original image. VC is a unique technique in the sense that the encrypted message can be decrypted directly by the Human Visual System (HVS). The distinguishing characteristic of VC is the ability of secret restoration without the use of computation. However because of restrictions of the HVS, pixel expansion and alignment problems, a VC scheme perhaps can only be applied to share a small size of secret image. In this paper, we propose a general method to let the VC shares carry more secrets, the technique is to use cypher output of private-key systems as the input random numbers of VC scheme, meanwhile the encryption key could be shared, the shared keys could be associated with the VC shares. After this operation, VC scheme and secret sharing scheme are merged with the private-key system. Under this design, we implement a (k,t,n)-VC scheme. Compared to those existing schemes, our approach could greatly enhance the ability of current VC schemes and could cope with pretty rich secrets.