This letter presents a novel visual cryptography scheme, called region incrementing visual cryptography (RIVC), for sharing visual secrets with multiple secrecy levels in a single image. In the proposed $n$-level RIVC scheme, the content of an image S is designated to multiple regions associated with $n$ secret levels, and encoded to $n +1$ shares with the following features: (a) each share cannot obtain any of the secrets in S, (b) any $t (2leq t leq n +1)$ shares can be used to reveal $t -1$ levels of secrets, (c) the number and locations of not-yet-revealed secrets are unknown to users, (d) all secrets in S can be disclosed when all of the $n +1$ shares are available, and (e) the secrets are recognized by visually inspecting correctly stacked shares without computation. The basis matrices for constructing the proposed $n$-level RIVC with small values of $n = 2$, 3, 4 are introduced, and the results from two experiments are presented.
展开▼
机译：这封信提出了一种新颖的视觉密码方案，称为区域递增视觉密码（RIVC），用于在单个图像中共享具有多个保密级别的视觉秘密。在建议的$ n $级RIVC方案中，将图像S的内容指定给与$ n $个秘密级相关联的多个区域，并编码为$ n + 1 $份，具有以下特征：（a）每个份不能获取S中的任何秘密，（b）任何$ t（2leq t leq n +1）$股可用于揭示$ t -1 $秘密级别，（c）尚未披露的数目和位置揭露的秘密对用户而言是未知的，（d）当所有$ n + 1 $份额可用时，S中的所有秘密都可以公开，并且（e）通过目视检查正确堆叠的份额而无需计算即可识别这些秘密。介绍了构建具有$ n = 2 $，3、4的小值的建议的$ n $级RIVC的基本矩阵，并给出了两个实验的结果。
展开▼
