Hou et al. introduced a (2, n) block-based progressive visual cryptographic scheme (BPVCS). In (2, n)-BPVCS, a secret image is subdivided into n non-overlapped image blocks. When t (2 ≤ t ≤ n) participants stack their shadow images, the image blocks belonged to these t participants will be recovered. Unfortunately, Hou et al.’s (2, n)-BPVCS suffers from the cheating problem. Additionally, Hou et al.’s scheme is only suitable for 2-out-of-n case, i.e., (k, n)-BPVCS where k = 2. In this paper, we propose a cheating immune (k, n)-BPVCS for k>2. The main contribution of our paper is that the proposed (k, n)-BPVCS is not only cheating immune, but also suitable for general k-out-of-n threshold, where k and n are integers with 2 ≤ k ≤ n. Theoretical analysis demonstrates that our scheme still holds progressive recovery and security, and meantime has cheating immune capability.

侯等人。介绍了一种基于（2，n）块的渐进式可视密码方案（BPVCS）。在（2，n）-BPVCS中，秘密图像被细分为n个不重叠的图像块。当吨（2≤ 吨 ≤  Ñ）参与者堆叠它们的影子图像，图像块属于这些吨参与者将被恢复。不幸的是，侯等人的（2，n）-BPVCS遭受了作弊问题。此外，Hou等人的方案只适合2-失Ñ情况下，即，（K，N）-BPVCS其中ķ  = 2。在本文中，我们提出了一个作弊的免疫（K，N）-对于k > 2的BPVCS 。我们的论文的主要贡献在于提出的（K，N）-BPVCS不仅欺骗免疫，同时也适用于一般ķ退房手续，OF- ñ极限，其中ķ和ñ与2≤整数 ķ  ≤  ñ。理论分析表明，我们的方案仍然具有逐步恢复和安全性，同时具有欺骗免疫功能。