基于异或解密的$(k,n)视觉密码方案

doi:10.12066/j.issn.1007-2861.1997

上海大学学报(自然科学版) ›› 2020, Vol. 26 ›› Issue (1): 21-32.doi: 10.12066/j.issn.1007-2861.1997

基于异或解密的$(k,n)视觉密码方案

郭松鸽¹, 吕东辉¹(), 戴玉静¹, 任艳丽^1,^2,³

^1. 上海大学通信与信息工程学院, 上海 200444
^2. 上海先进通信与数据科学研究院, 上海 200444
^3. 上海交通大学可扩展计算与系统重点实验室, 上海 200240

收稿日期:2018-01-16 出版日期:2020-02-28 发布日期:2020-03-22
通讯作者: 吕东辉 E-mail:dhlu@shu.edu.cn
基金资助:
国家自然科学基金资助项目(U1736120);国家自然科学基金资助项目(61572309);上海交通大学可扩展计算与系统重点实验室开放课题资助项目

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

Songge GUO¹, Donghui LYU¹(), Yujing DAI¹, Yanli REN^1,^2,³

^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:2018-01-16 Online:2020-02-28 Published:2020-03-22
Contact: Donghui LYU E-mail:dhlu@shu.edu.cn

摘要/Abstract

摘要：

传统的视觉密码方案是通过直接叠加分享份来恢复秘密图像的,这种解密方式实质上是对分享份进行逻辑或运算, 白像素无法完全恢复,解密效果不理想. 利用异或运算的自反性改进加密方式,并使用与数字图像相同的颜色表示方式,提出一种基于异或解密的(k,n)随机网格视觉密码方案.该方案有两种解密方式: 当没有计算设备时, 使用传统的叠加解密,解密过程简单; 当有计算设备时, 使用异或解密, 需少量计算,但具有更好的视觉质量, 并且当所有分享份都参与异或解密时,可以无损恢复秘密图像. 与已有的视觉密码方案相比,该方案提高了解密图像的视觉质量.

关键词: 图像加密, 视觉密码, 随机网格, 异或解密, 无损恢复

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

中图分类号:

TP309.7

郭松鸽, 吕东辉, 戴玉静, 任艳丽. 基于异或解密的$(k,n)视觉密码方案[J]. 上海大学学报(自然科学版), 2020, 26(1): 21-32.

Songge GUO, Donghui LYU, Yujing DAI, Yanli REN. (k,n) visual cryptography scheme based on XOR decryption[J]. Journal of Shanghai University（Natural Science Edition）, 2020, 26(1): 21-32.

图/表 8

图1

图2

表1

图3

表2

图4

表3

图5

参考文献 13

[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.

基于异或解密的$(k,n)视觉密码方案

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

RichHTML

PDF

可视化

摘要/Abstract

引用本文

使用本文

图/表 8

参考文献 13

相关文章 0

编辑推荐

Metrics

本文评价