计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (3): 110-112.DOI: 10.3778/j.issn.1002-8331.2011.02.033

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

对动态的(tn)门限多秘密分享方案的分析与改进

郭 振,张建中,兰建青   

  1. 陕西师范大学 数学与信息科学学院,西安 710062
  • 收稿日期:2009-05-06 修回日期:2009-09-04 出版日期:2011-01-21 发布日期:2011-01-21
  • 通讯作者: 郭 振

Analysis and improvement of dynamic(tn) threshold multi-secret sharing scheme

GUO Zhen,ZHANG Jianzhong,LAN Jianqing   

  1. College of Mathematics and Information Science,Shaanxi Normal University,Xi’an 710062,China
  • Received:2009-05-06 Revised:2009-09-04 Online:2011-01-21 Published:2011-01-21
  • Contact: GUO Zhen

摘要: 分析了刘锋等的动态(t,n)门限多秘密分享方案,发现此方案并不安全,攻击者可以由公开信息直接推出秘密参数c0,进而求得秘密S。基于单向函数和大素数因子分解问题,提出了一个新的动态(t,n)门限多秘密分享方案,该方案能够实现多重秘密共享,灵活地更新群组密钥,动态地加入新的参与者。在方案的实现过程中,能及时检测和识别SD对参与者以及参与者之间的欺骗,解决秘密重构时计算量大等问题。

关键词: 秘密分享, 门限体制, 单向函数, 安全

Abstract: A dynamic (t,n) threshold multi-secret sharing scheme proposed by Liu Feng is analyzed,by using the public massage,any attacker can easily recover the secrets.Based on a one-way function and the large-integer factorization problem,the paper proposes a new dynamic (t,n)threshold scheme.In this scheme,multi-secret can be shared.The shadows needn’t be changed when the shared secret is renewed or new participants are added.Moreover,the efficient solutions against multiform cheating are detected and recognized,therefore the scheme is highly security and practicality,and the computation of a secret recovery is overhead.

Key words: secret sharing, threshold scheme, one-way function, security

中图分类号: