符号
可视密码
计算机科学
像素
对比度(视觉)
密码学
图像(数学)
方案(数学)
构造(python库)
算法
集合(抽象数据类型)
离散数学
理论计算机科学
数学
人工智能
算术
程序设计语言
秘密分享
数学分析
作者
Feng Liu,Chuan-Kun Wu,Xi-Jun Lin
标识
DOI:10.1109/tifs.2009.2037660
摘要
Two common drawbacks of the visual cryptography scheme (VCS) are the large pixel expansion of each share image and the small contrast of the recovered secret image. In this paper, we propose a step construction to construct $\hbox{VCS}_{\rm OR}$ and $\hbox{VCS}_{\rm XOR}$ for general access structure by applying (2,2)-VCS recursively, where a participant may receive multiple share images. The proposed step construction generates $\hbox{VCS}_{\rm OR}$ and $\hbox{VCS}_{\rm XOR}$ which have optimal pixel expansion and contrast for each qualified set in the general access structure in most cases. Our scheme applies a technique to simplify the access structure, which can reduce the average pixel expansion (APE) in most cases compared with many of the results in the literature. Finally, we give some experimental results and comparisons to show the effectiveness of the proposed scheme.
科研通智能强力驱动
Strongly Powered by AbleSci AI