Journal of shanghai Jiaotong University (Science) ›› 2014, Vol. 19 ›› Issue (4): 455-465.doi: 10.1007/s12204-014-1525-3

Previous Articles     Next Articles

Visual Multi-Secret Sharing with Friendliness

Visual Multi-Secret Sharing with Friendliness

JENG Fuh-gwoa (郑富国), LIN Kai-siangb (林恺翔), LIN Chih-hungc (林志鸿), CHEN Tzung-herb* (陈宗和)   

  1. (a. Department of Applied Mathematics; b. Department of Computer Science and Information Engineering; c. Graduate Institute of Mathematics and Science Education, National Chiayi University, Chiayi 60004, Taiwan, China)
  2. (a. Department of Applied Mathematics; b. Department of Computer Science and Information Engineering; c. Graduate Institute of Mathematics and Science Education, National Chiayi University, Chiayi 60004, Taiwan, China)
  • Published:2014-10-13
  • Contact: CHEN Tzung-herb* (陈宗和) E-mail:thchen@mail.ncyu.edu.tw

Abstract: Visual secret sharing (VSS) was used in the literature to encode and decode secret images until visual multi-secret sharing (VMSS) was proposed. Distinctly, multiple secret images can be encoded or decoded at a time in VMSS; however, only one secret image can be done in VSS. In VMSS, secrets are encoded into noise-like shares which have finally been stacked altogether so as to disclose each of the secrets by specific operations, such as rotating, flipping and sliding. Though the noise-like shares can be decoded by those operations, it is just like a fly in the ointment since they are hard to manage, to recognize and even to stack orderly. Based on some researches about user-friendly VSS for generating meaningful shares, a new friendly VMSS scheme is presented in this paper for achieving two main goals. One is trying to encode multiple secrets at a time and the other is making the decoding process easy to manage. The experimental results prove that our proposed scheme does work.

Key words: visual cryptography| random grids| visual secret sharing (VSS)| image encryption

摘要: Visual secret sharing (VSS) was used in the literature to encode and decode secret images until visual multi-secret sharing (VMSS) was proposed. Distinctly, multiple secret images can be encoded or decoded at a time in VMSS; however, only one secret image can be done in VSS. In VMSS, secrets are encoded into noise-like shares which have finally been stacked altogether so as to disclose each of the secrets by specific operations, such as rotating, flipping and sliding. Though the noise-like shares can be decoded by those operations, it is just like a fly in the ointment since they are hard to manage, to recognize and even to stack orderly. Based on some researches about user-friendly VSS for generating meaningful shares, a new friendly VMSS scheme is presented in this paper for achieving two main goals. One is trying to encode multiple secrets at a time and the other is making the decoding process easy to manage. The experimental results prove that our proposed scheme does work.

关键词: visual cryptography| random grids| visual secret sharing (VSS)| image encryption

CLC Number: