摘要
针对分享多幅秘密图像存在信息损失的问题,该文给出(n,n)无损多秘密分享视觉密码的定义,在此基础上基于环状共享份设计了一种(n,n)多秘密视觉密码方案,使秘密图像的信息损失为零。实验结果表明,该方案不仅实现了在多个参与者之间分享多幅秘密图像,而且秘密图像能够完全恢复。
Considering the information loss during sharing multiple secrets, a definition of (n, n) lossless multi- secret sharing visual cryptography is proposed. In addition, based on ring shares, an (n, n) multi-secret visual cryptography scheme, which shares secret images with no information loss, is designed. The experimental results show that in this scheme, not only multiple participants can share multiple secret images, but also secret images can be reconstructed perfectly.
出处
《电子与信息学报》
EI
CSCD
北大核心
2012年第12期2885-2890,共6页
Journal of Electronics & Information Technology
基金
国家自然科学基金(61070086)资助课题
关键词
视觉密码
多秘密
无损
完全恢复
Visual cryptography
Multi-secret
Lossless
Perfect reconstruction