In (k,n) secret sharing scheme, one secret is encrypted into n shares in such a way that only k or more shares can decrypt the secret. Secret sharing scheme can be extended into the field of multimedia that provides an efficient way to protect confidential information on multimedia. Secret image sharing is just the most important extension of secret sharing that can safely guard the secrecy of images among multiple participants. On the other hand, cheating detection is an important issue in traditional secret sharing schemes that have been discussed for many years. However, the issue of cheating detection in secret image sharing has not been discussed sufficiently. In this paper, we consider the cheating problem in the application of secret image sharing schemes and construct a (k,n) secret image sharing scheme with the ability of cheating detection and identification. Our scheme is capable of identifying cheaters when k participants involve in reconstruction. The cheating identification ability and size of shadow in the proposed scheme are improved from the previous cheating identifiable secret image sharing scheme.

在（k，n）个秘密共享方案中，一个秘密被加密为n个份额，这样，只有k个或更多共享可以解密机密。秘密共享方案可以扩展到多媒体领域，它提供了一种保护多媒体机密信息的有效方法。秘密图像共享只是秘密共享的最重要扩展，它可以安全地保护多个参与者之间的图像保密性。另一方面，作弊检测是已经讨论了很多年的传统秘密共享方案中的重要问题。但是，尚未充分讨论秘密图像共享中的作弊检测问题。在本文中，我们考虑了秘密图像共享方案在应用中的作弊问题，并构造了一个（k，n）具有作弊检测和识别能力的秘密图像共享方案。当k个参与者参与重建时，我们的方案能够识别作弊者。与以前的作弊可识别秘密图像共享方案相比，该方案中的作弊识别能力和阴影大小得到了改善。