摘要
在多个参与者之间分享多幅秘密图像时,为了解决像素扩展度和相对差随着秘密图像和参与者数量的增加而分别急剧扩大和减小的问题,本文从代数结构入手,结合异或运算和柱面共享份旋转操作,给出了一种多秘密视觉密码方案的定义,能够支持(k,n)门限结构下多个秘密的分享.以基于异或的单秘密视觉密码方案的基矩阵为加密单元,设计了多秘密分享与恢复流程,给出了一种实现方案.仿真实验结果表明:本方案不仅在多个共享份之间能够分享多幅秘密图像,而且减小了像素扩展度,提高了相对差.
To solve the problem that the pixel expansion enlarges and contrast decreases rapidly along with increasing the secret images and participants when multiple participants share multiple secret images, starting with the algebraic structure, this paper gives a defini- tion of the multi-secret visual cryptography scheme with the operation XOR and cylinder share rotation, which supports sharing multi- ple secrets in the { k,n ) threshold structure. Regarding the basis matrices of XOR-based single secret sharing visual cryptography as the encryption unit, the procedures of multi-secret sharing and recovering are designed, furthermore, a scheme is realized. The exper- imental results show that the proposed scheme not only encrypts multiple secrets within multiple shares, but also improves the pixel expansion and the relative difference.
出处
《小型微型计算机系统》
CSCD
北大核心
2013年第9期2116-2119,共4页
Journal of Chinese Computer Systems
基金
国家自然科学基金项目(61070086)资助
关键词
视觉密码
多秘密
异或
柱面共享份
visual cryptography
multi-secret
XOR
cylinder shares