基于单向散列链的可更新(t,n)门限秘密共享方案  

Renewable (t,n) threshold secret sharing scheme based on one-way hash chain

作　　者：李大伟[1] 杨庚[1] 

机构地区：[1]南京邮电大学计算机学院,江苏南京210003

出　　处：《通信学报》2010年第7期128-135,共8页Journal on Communications

基　　金：国家自然科学基金资助项目(60873231);江苏省高校自然科学基金资助项目(08KJB520006);江苏省"六大人才高峰"基金资助项目(06-E-044)~~

摘　　要：为了提高可更新秘密共享方案中影子秘密的更新效率,基于单向散列链的特性,提出了一种新型可更新秘密共享方案。该方案使用单向散列链构造更新多项式,避免了生成随机多项式带来的计算开销。秘密共享实现过程基于IBE公钥体制,具有良好的安全性能。影子秘密验证基于有限域上离散对数难解问题,能有效避免参与者欺骗。理论分析和仿真结果显示该方案能在保证安全性的前提下显著提高影子秘密更新的效率。In order to improve the efficiency of rekeying in renewable secret sharing schemes,on the basis of characteristics of one-way hash chain,a new proactive secret sharing scheme was proposed.In the scheme,the updated polynomial’s coefficients were generated by a one-way hash chain,which can save the computation costs of generating a random polynomial.The process of secret sharing was based on IBE public key algorithm,which has excellent security features.Under the assumption of DL problem in finite fields,the shares verification process can prevent cheating among participants efficiently.Theoretical analysis and simulation results demonstrate the improvement of the performance.

关 键 词：秘密共享 单向散列链 身份加密算法 

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