摘要
该文依据授权子集的个数将共享份划分若干块,按照共享份分块构造的设计思路,结合(n,n)异或单秘密视觉密码的加密矩阵,构造了异或区域递增式视觉密码的秘密分享与恢复流程。与现有方案相比,该方案可以实现解密区域图像的完全恢复,且明显减小了共享份的大小。
By designing the block construction for each share, which is divided into several blocks according to the number of qualified sets, the secret sharing and recovering algorithms of the XOR-based region incrementing visual cryptography are designed with the encoding matrices of the （n, n） XOR-based single secret sharing visual cryptography. Comparing with the existing schemes, the proposed scheme realizes the perfect recovery of decoded regions in secret image, and the sizes of shares are also decreased efficiently.
出处
《电子与信息学报》
EI
CSCD
北大核心
2015年第8期1978-1983,共6页
Journal of Electronics & Information Technology
基金
国家自然科学基金(61070086)
信息保障技术重点实验室开放基金(KJ-13-107)资助课题
关键词
视觉密码
区域递增
密级
分块构造
异或运算
完全恢复
Visual cryptography
Region incrementing
Security level
Block construction
XOR operation
Perfect recovery
