A multi-secret image sharing (MSIS) scheme is a procedure to break down secret images into numerous shares and distribute each share to each authorized participant. Most existing ( n , n ) schemes face the problem of all-or-nothing that is all the n shares are required to reconstruct a secret image. If a single share is lost, then the secret image will not be recovered. Moreover, the existing ( k , n ) MSIS schemes either require k consecutive shares or general access structure to recover the secret images. The proposed scheme addresses the previous schemes’ issues. It is based on Arnold cat map, Chinese remainder theorem (CRT), and Boolean operation. It is a ( k , n ) threshold scheme where k is the threshold, and n is the number of participants. Arnold cat map is adopted for the randomization of images, and Boolean operation is used for producing public share images. CRT is utilized for the recovery of images. It has high fault tolerance capability as any of the k participants can submit their shares to reconstruct images and consume less computational time due to employing the modular method. Moreover, it can withstand differential as well as statistical attacks.

中文翻译：

---

基于中文余数定理和阿诺德猫图的（k，n）多秘密图像共享方案

多秘密图像共享（MSIS）方案是一种将秘​​密图像分解为多个共享并将每个共享分发给每个授权参与者的过程。大多数现有的（n，n）方案都面临全有或全无的问题，即所有n份都需要重建秘密图像。如果丢失了一个共享，则秘密映像将无法恢复。此外，现有的（k，n）MSIS方案要么需要k个连续的份额，要么需要通用访问结构来恢复秘密图像。拟议方案解决了先前方案的问题。它基于Arnold猫图，中文余数定理（CRT）和布尔运算。它是（k，n）阈值方案，其中k是阈值，n是参与者的数量。采用Arnold猫图对图像进行随机化处理，布尔运算用于生成公共共享图像。CRT用于恢复图像。它具有很高的容错能力，因为采用模块化方法，k个参与者中的任何一个都可以提交其份额以重建图像，并减少计算时间。而且，它可以承受差异以及统计攻击。