可公开验证的短份额秘密共享算法  

Public verifiable algorithm of threshold secret sharing with short share

作　　者：刘镇[1] 杨晓元[1,2] 魏萍[1] 肖海燕[1] 

机构地区：[1]武警工程学院网络与信息安全武警部队重点实验室,西安710086 [2]西安电子科技大学计算机网络与信息安全教育部重点实验室,西安710071

出　　处：《计算机应用》2009年第9期2363-2365,共3页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60842006);武警部队军事应用科研项目(wjk2009020)

摘　　要：为弥补传统秘密共享方案秘密长度不能太长的缺点,同时又能防止参与者作弊,利用Jordan矩阵理论,结合拉格朗日插值公式,提出了一种可验证的短份额门限秘密共享算法。算法能有效抵抗统计攻击和任意少于r个腐败的分享者的合谋攻击;各分享者保存的份额很短。当秘密是一个大的隐私文件、在一个不可信链路上传输的大消息、几个分享者共享的一个秘密数据库或者分布式存储的海量数据时,都具有重要的应用。To make up the limitation that the length of secret can not be too long and prevent the action of cheating, using the theory of Jordan matrix, and combining with the formulary of Lagrange, the authors put forward an algorithm of threshold secret sharing with short share. It could effectively resist the statistical attack and the united attack of corrupt participants less than r. The length of secret share that each participator needed to conserve was very short. It had a very important application when the secret was a big privacy file, a big message transmitted in an insecure channel, a secret database shared by several participants or enormous data in distributed storage.

关 键 词：秘密共享 可验证 门限方案 Jordan矩阵 

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