National University of Defense Technology, Hefei 230037, China.
Math Biosci Eng. 2019 Jun 20;16(5):5750-5764. doi: 10.3934/mbe.2019287.
Traditional visual secret sharing (VSS) encodes the original secret image into n shares, and each share is of equal importance. However, in some scenarios, we need to make a difference between the participants according to the levels of their importance. Therefore, the capability of each share to recover the original secret image will be different. In this paper, we proposed a weighted (k,n)-threshold random grid VSS(RG-VSS) with multiple decrytions and lossless recovery. When we get k or more shares for decryption, we will recover different levels of the original image because of the different weights of the shares. More importantly, the secret information can be recovered by OR and XOR operations in our scheme. When we get all the n shares and using the XOR operation to recover the image, we can recover the secret information losslessly. The experimental results and analyses show that our scheme outperforms the related schemes.
传统的可视秘密共享（VSS）将原始秘密图像编码为 n 个份额，每个份额同等重要。然而，在某些场景中，我们需要根据参与者的重要性级别区分他们。因此，每个份额恢复原始秘密图像的能力将有所不同。在本文中，我们提出了一种具有多重解密和无损恢复的加权（k，n）-门限随机网格 VSS（RG-VSS）。当我们获得 k 个或更多份额进行解密时，由于份额的权重不同，我们将恢复原始图像的不同级别。更重要的是，我们的方案可以通过 OR 和 XOR 操作恢复秘密信息。当我们获得所有 n 个份额并使用 XOR 操作恢复图像时，我们可以无损地恢复秘密信息。实验结果和分析表明，我们的方案优于相关方案。
