Visual Multi-Secret Sharing with Friendliness

doi:10.1007/s12204-014-1525-3

Abstract

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:

TN 911.73

JENG Fuh-gwoa (郑富国), LIN Kai-siangb (林恺翔), LIN Chih-hungc (林志鸿), CHEN Tzung-herb*(陈宗和). Visual Multi-Secret Sharing with Friendliness[J]. Journal of shanghai Jiaotong University (Science), 2014, 19(4): 455-465.

References

[1] Naor M, Shamir A. Visual cryptography [J]. Lecture Notes in Computer Science, 2005, 950: 1-12.
[2] Kafri O, Keren E. Encryption of pictures and shaped by random grids [J]. Optics Letters, 1987,12(6): 377-379.
[3] Ateniese G, Blundo C, Santis A D, et al. Visual cryptography for general access structures [J]. Information Computation, 1996, 129(2): 86-106.
[4] Ateniese G, Blundo C, Santis A D, et al. Extended capabilities for visual cryptography [J]. Theoretical Computer Science, 2001, 250(1-2): 143-161.
[5] Chen T H, Tsao K H. Visual secret sharing by random grids revisited [J]. Pattern Recognition, 2009,42(9): 2203-2217.
[6] Chen T H, Tsao K H. Threshold visual secret sharing by random grids [J]. Journal of Systems and Software,2011, 84(7): 1197-1208.
[7] Lee Y S, Wang B J, Chent H. Quality-improved threshold visual secret sharing scheme by random grids [J]. IET Image Processing, 2013, 7(2): 137-143.
[8] Shyu S J. Image encryption by random grids [J]. Pattern Recognition, 2007, 40(3): 1014-1031.
[9] Chen T H, Li K C. Multi-image encryption by circular random grids [J]. Information Sciences, 2012, 189:255-265.
[10] Chen T H, Tsao K H, Leey S. Yet another multipleimage encryption by rotating random grids [J]. Signal Processing, 2012, 92(9): 2229-2237.
[11] Shyu S J, Huang S Y, Lee Y K, et al. Sharing multiple secrets in visual cryptography [J]. Pattern Recognition,2007, 40(12): 3633-3651.
[12] Wu H C, Chang C C. Sharing visual multi-secrets using circle shares [J]. Computer Standards & Interfaces,2005, 28(1): 123-135.
[13] Wu Chen-chang. A study on visual cryptography [D].Hsinchu, China: Institute of Computer Science and Engineering, National Chiao Tung University, 1998 (in Chinese).
[14] Fang W P. Friendly progressive visual secret sharing[J]. Pattern Recognition, 2008, 41(4): 1410-1414.
[15] Chen T H, Tsao K H. User-friendly random-gridbased visual secret sharing [J]. IEEE Transactions on Circuits and Systems for Video Technology, 2011,21(11): 1693-1703.