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

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

作　　者：郭松鸽 吕东辉[1] 戴玉静 任艳丽[1,2,3] GUO Songge;LYU Donghui;DAI Yujing;REN Yanli(School of Communication and Information Engineering,Shanghai University,Shanghai 200444,China;Shanghai Institute for Advanced Communication and Data Science,Shanghai 200444,China;Key Laboratory of Scalable Computing and Systems,Shanghai Jiao Tong University,Shanghai 200240,China)

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

出　　处：《上海大学学报（自然科学版）》2020年第1期21-32,共12页Journal of Shanghai University:Natural Science Edition

基　　金：国家自然科学基金资助项目(U1736120,61572309);上海交通大学可扩展计算与系统重点实验室开放课题资助项目。

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

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

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]