新型的安全可变阈值图像秘密共享方案  

A novel and secure secret image sharing scheme based on variable threshold

作　　者：姜超 张敏情[1,2] 周潭平[1,2] 张雄 狄富强 JIANG Chao;ZHANG Minqing;ZHOU Tanping;ZHANG Xiong;DI Fuqiang(College of Cryptography Engineering,Engineering University of PAP,Xi’an 710086,China;Key Laboratory of PAP for Cryptology and Information Security,Xi’an 710086,China)

机构地区：[1]武警工程大学密码工程学院,西安710086 [2]中国人民武装警察部队密码与信息安全保密重点实验室,西安710086

出　　处：《中国科技论文》2023年第11期1172-1177,1185,共7页China Sciencepaper

基　　金：国家自然科学基金资助项目(62272478,62102451)。

摘　　要：从提高共享安全性的角度,提出一种新型的可变阈值图像秘密共享(secret image sharing,SIS)方案。首先对秘密图像进行置乱,以破坏像素之间较强的相关性;其次通过二元多项式对秘密图像进行分割,采用对角隐藏将秘密图像像素值设置在系数矩阵的对角上,其余系数均采用随机数。通过实验及对方案正确性和无条件安全性的证明和分析发现,所提方案能够提供多个可变阈值,算法复杂度为多项式时间算法复杂度,穷举攻击复杂度为O(p^(h)),可以达到无条件安全,适用于根据变化的安全环境来调整阈值的场景。This article proposed a new variable threshold secret image sharing(SIS)scheme from the perspective of improving sharing security.Firstly,the secret image was scrambled to disrupt the strong correlation between pixels.Secondly,the secret image was segmented using binary polynomials and diagonal hiding was used to set the pixel values of the secret image on the diagonal of the coefficient matrix.The remaining coefficients were all random numbers.Through experimentation,proof and analysis of the correctness and unconditional security of the scheme,this scheme can provide multiple variable thresholds,with an algorithm complexity of polynomial time and an exhaustive attack complexity of O(p^(h)).It can achieve unconditional security and is suitable for scenarios where thresholds are adjusted according to changing security environments.

关 键 词：图像秘密共享 可变阈值 穷举攻击 无条件安全 二元多项式 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]