计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (19): 81-82.DOI: 10.3778/j.issn.1002-8331.2009.19.024

• 网络、通信、安全 • 上一篇    下一篇

多重秘密共享方案的分析与设计

隗 云1,熊国华2,徐永杰3,田志刚1   

  1. 1.信息工程大学 电子技术学院,郑州 450004
    2.空军电子技术研究所,北京 100097
    3.中国人民解放军63837部队
  • 收稿日期:2008-04-16 修回日期:2008-09-01 出版日期:2009-07-01 发布日期:2009-07-01
  • 通讯作者: 隗 云

Analysis and design of multiple secret sharing schemes

WEI Yun1,XIONG Guo-hua2,XU Yong-jie3,TIAN Zhi-gang1   

  1. 1.Institute of Electronic Technology,the PLA Information Engineering University,Zhengzhou 450004,China
    2.Air Force Graduate school of Electronic Technology,Beijing 100097,China
    3.Unit of 63837,PLA
  • Received:2008-04-16 Revised:2008-09-01 Online:2009-07-01 Published:2009-07-01
  • Contact: WEI Yun

摘要: 分析了以往文献中基于椭圆曲线门限多重秘密共享方案存在的安全漏洞和缺陷:秘密恢复者可通过恢复某一秘密得到共享秘密集中其他所有秘密,对秘密共享方案是一种致命的威胁,且在删除某一子秘密时,该方案需要更新其他所有参与者的子秘密;提出了一种新的多重秘密共享方案,很好地解决了上述安全问题,使得任意秘密的恢复不影响其他秘密的安全,在删除某参与者的子秘密时,其他参与者的子秘密保持不变。

关键词: 秘密共享, 子秘密, 门限方案

Abstract: This paper analyzes the security weakness of a threshold multiple secret sharing scheme based on the elliptic curve.In the original scheme,the secret recuperator can obtain all other secrets after recuperating one secret which intimidates the scheme fatally.And the scheme has to update all the shares if it wants to delete one share.A new scheme is proposed in which recuperating one secret do not affect the security of other secrets and one share can be deleted without changing any other share.

Key words: secret sharing, share, threshold scheme