Two secret sharing schemes based on Boolean operations
Two secret sharing schemes based on Boolean operations
复制标题
DOI：
10.1016/j.patcog.2006.11.018
复制
发表时间：
2007-10
期刊：
影响因子：
--
通讯作者：
Daoshun Wang;Lei Zhang;N. Ma;Xiaobo Li
中科院分区：
文献类型：
--
作者：
Daoshun Wang;Lei Zhang;N. Ma;Xiaobo Li
传统的秘密共享方案涉及复杂的计算。视觉秘密共享（VSS）方案无需计算即可解码秘密，但每个阴影都是原始阴影的m倍。概率VSS同时解决了计算复杂度和空间复杂度问题。本文提出了二值图像的概率（2,n）格式和灰度图像的确定性（n,n）格式。两者都使用简单的布尔运算，都没有像素扩展。与其他方法相比，（2,n）方案提供了更好的对比度和明显更小的识别区域。（n,n）格式给出了精确的重构。
Traditional secret sharing schemes involve complex computation. A visual secret sharing (VSS) scheme decodes the secret without computation, but each shadow is m times as big as the original. Probabilistic VSS solved the computation complexity and space complexity problems at once. In this paper we propose a probabilistic (2,n) scheme for binary images and a deterministic (n,n) scheme for grayscale images. Both use simple Boolean operations and both have no pixel expansion. The (2,n) scheme provides a better contrast and significantly smaller recognized areas than other methods. The (n,n) scheme gives an exact reconstruction.