首页> 中文期刊> 《计算机应用研究》 >基于双线性对的可验证可更新的秘密分享方案

基于双线性对的可验证可更新的秘密分享方案

         

摘要

提出了一种新的基于双线性对的可验证可更新的门限秘密分享方案.该方案通过秘密分发者和参与者双方验证一个等式是否成立,从而能够辨别双方提供的秘密份额是否有效.秘密分发者利用hash函数来定期更新插值多项式,使得参与者所持有的秘密份额能够定期更新.秘密份额验证基于有限域上离散对数困难问题,能够有效避免参与者欺骗.%This paper proposed a verifiable and renewable threshold secret sharing scheme based on bilinear pairings. According to setting up the equation which was verified by both the dealer and the participants,the scheme could identify the validity of the secret share provided by the parties. The dealer could regularly update interpolation polynomial using hash function,so the secret share held by the participants could be regularly updated. Under the assumption of DL problem in finite fields,the shares verification process could prevent from cheating among participants efficiently.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号