基于Asmuth-Bloom门限共享秘密图像信息隐藏算法研究

Research on Secret Image Threshold Sharing Information Hiding Algorithm Based on Asmuth-Bloom

摘要: 为安全传输保密的图像，本文基于Asmuth-Bloom共享方案，设计了一个(t, n)门限秘密图像信息隐藏算法。首先将秘密图像共享成n份表面看似无意义的秘密共享图像，使用DCT算法将n份秘密共享图像分别嵌入到n个用户提供的彩色载体图像中，再将n份含秘密共享的载体图像分发给n个用户。在秘密恢复时，大于等于门限值t的用户从含秘密共享的彩色载体图像盲提取出秘密共享图像，再使用中国剩余定理还原秘密图像。实验结果表明，本文提出的算法能正确恢复秘密图像。通过峰值信噪比(PSNR)，平均结构相似性(MSSIM)，比特出错概率(BER)对本方案进行评估，优于其他方案。

Abstract: In order to transmit secret images more securely, this paper proposes a (t, n) threshold image data hiding algorithm based on Asmuth-Bloom secret sharing. First share the secret image into n meaningless secret shared images, use the DCT algorithm to embed the n meaningless images into n user-provided color cover images, and then distribute the n cover images with secret sharing to n users. Secondly, when the secret is recovered, users who are greater than or equal to the threshold t blindly extract meaningless secret sharing images from the cover image containing secret sharing, and then use the Chinese remainder theorem to recover the secret images. Finally, the experimental results proved that the algorithm proposed in this paper can recover the secret image correctly. This scheme is evaluated by peak signal-to-noise ratio (PSNR), mean structural similarity (MSSIM), and bit error ratio (BER), it is proved that this scheme is superior to other schemes.