摘要
门限方案作为秘密共享、密钥恢复的重要方法自从提出以来得到广泛研究和应用。本文考虑实际应用的需要并且为了增强传统门限方案的安全性,提出一种基于次序的改进型门限方案,通过近似无限地扩大次序组合排列的个数,使得攻击者即使获取所有秘密份额也难以恢复原始秘密,极大提高了门限方案的安全性,扩大了门限方案的应用场合。
As an important method for secret sharing and key recovery,threshold scheme has been widely studied and applied since it has been proposed.Considering the needs of practical application and in order to enhance the security of traditional threshold scheme,this paper presents an improved threshold scheme based on order by approximate infinitely expanding the number of arrangement in the order of combination.So the attacker is difficult to recover the original secret even if he gets all shared secret.Thus,the security of threshold scheme is greatly increased,and the application of threshold scheme is expanded.
出处
《计算机与现代化》
2012年第11期142-144,共3页
Computer and Modernization
基金
国家自然科学基金资助项目(61003054)
关键词
秘密共享
门限
密钥
次序
组合
排列
secret sharing
threshold
key
order
combination
arrangement
