摘要
本文提出(k,n)阈值可视秘密分存的一种新的分析和实现方案.该方案从可视分存的对比度条件和安全性条件入手,建立起一个方程组,最后得到其近似最优解和基本矩阵的构造方案.该方案将(k,n)和(n,n)方案统一起来分析,使之和谐统一;同时,通过理论分析代替了以往算法的部分工作;本文给出的算法可达到以往方案的安全强度而具备更高的实现效率.
A novel k-out-of-n threshold scheme for visual secret sharing is proposed. The construction scheme of basic matrix is brought forward from the approximate best optimized solution of the equation set which is established on the basis of contrast condition and security condition of the visual secret sharing. The proposed method analyses the （ k, n） and （ n, n） schemes uniformly and brings them into an integral framework. Furthermore, a fraction of algorithm operations were replaced by theoretical analysis in the new scheme. Consequently, it achieves higher efficiency with same security intensity compared with the previous schemes.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2006年第3期503-507,共5页
Acta Electronica Sinica
基金
国家自然科学基金(No.90304014)
国家863高技术研究发展计划(No.2005AA114160)
关键词
阈值
秘密分存
可视密码
threshold
secrest sharing
visual cryptography
