中文

Journal of Shanghai University >

2020 , Vol. 26 >Issue 1: 21 - 32

DOI: https://doi.org/10.12066/j.issn.1007-2861.1997

Research Articles

(k,n) visual cryptography scheme based on XOR decryption

Expand
  • 1. School of Communication and Information Engineering, Shanghai University, Shanghai 200444, China
    2. Shanghai Institute for Advanced Communication and Data Science, Shanghai 200444, China
    3. Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, Shanghai 200240,China

Received date: 2018-01-16

  Online published: 2020-03-22

Fold

Abstract

Traditional visual cryptography schemes recover secret images by stacking shares directly. Since the stacking operation can be denoted by logical OR operation and since white pixels can't be fully recovered with these schemes, the decryption effect is not satisfactory. This paper proposes a (k,n) random grid-based visual cryptography scheme based on exclusive OR (XOR) decryption by using reflexivity of XOR for encryption and by applying the same color representation method as digital images. The secret images can be recovered in two situations: when computational devices are not available, the secret images can be recovered by stacking shares directly; when computational devices are available, the secret images can be recovered by XOR operation. With better visual quality, the secret images recovered this way can be lossless since all shares are collected. Compared with existing visual cryptography schemes, better visual quality is obtained with this new scheme.

Key words： image encryption; visual cryptography; random grid; XOR decryption; lossless recovery

Cite this article

Songge GUO, Donghui LYU, Yujing DAI, Yanli REN . (k,n) visual cryptography scheme based on XOR decryption[J]. Journal of Shanghai University, 2020 , 26(1) : 21 -32 . DOI: 10.12066/j.issn.1007-2861.1997

References

[1] 郁滨, 付正欣, 沈刚 , 等. 视觉密码[M]. 合肥: 中国科学技术大学出版社, 2014: 1-16.
[2] D'Arco P, De Prisco R . Visual cryptography [C]//International Conference for Information Technology and Communications. 2016: 20-39.
[3] Yang C N . New visual secret sharing schemes using probabilistic method[J]. Pattern Recognition Letters, 2004,25(4):481-494.
[4] Kafri O, Keren E . Encryption of pictures and shapes by random grids[J]. Optics Letters, 1987,12(6):377-379.
[5] Shyu S J . Image encryption by random grids[J]. Pattern Recognition, 2007,40(3):1014-1031.
[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] Wu X T, Sun W . Improving the visual quality of random grid-based visual secret sharing[J]. Signal Processing, 2013,93(5):977-995.
[8] Yan X H, Wang S, El-Latif A A A , et al. Random grids-based visual secret sharing with improved visual quality via error diffusion[J]. Multimedia Tools and Applications, 2015,74(21):9279-9296.
[9] Shen G, Liu F, Fu Z X , et al. Perfect contrast XOR-based visual cryptography schemes via linear algebra[J]. Designs, Codes and Cryptography, 2017,85(1):15-37.
[10] Singh P, Raman B, Misra M . A $(n, n)$ threshold non-expansible XOR based visual cryptography with unique meaningful shares[J]. Signal Processing, 2018,142:301-319.
[11] Wu X T, Sun W . Random grid-based visual secret sharing with abilities of OR and XOR decryptions[J]. Journal of Visual Communication and Image Representation, 2013,24(1):48-62.
[12] Yan X H, Wang S, El-Latif A A A , et al. Visual secret sharing based on random grids with abilities of AND and XOR lossless recovery[J]. Multimedia Tools and Applications, 2015,74(9):3231-3252.
[13] Yan X H, Wang S, Niu X M . Threshold visual secret sharing based on Boolean operations and random grids [C]//International Conference on Neural Information Processing. 2014: 620-627.
Options
Outlines

/

〈 〉