Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (18): 91-93.DOI: 10.3778/j.issn.1002-8331.2009.18.029

• 网络、通信、安全 • Previous Articles     Next Articles

Efficient and verifiable multi-threshold secret sharing scheme

LI Xiong1,LI Zhi-hui1,PENG Qing-yan2   

  1. 1.College of Mathematics and Information Science,Shaanxi Normal University,Xi’an 710062,China
    2.School of Mathematics and Statistics,Yunnan University,Kunming 650091,China
  • Received:2008-05-05 Revised:2008-08-04 Online:2009-06-21 Published:2009-06-21
  • Contact: LI Xiong

高效可验证的门限多秘密共享体制

李 雄1,李志慧1,彭清艳2   

  1. 1.陕西师范大学 数学与信息科学学院,西安 710062
    2.云南大学 数学与统计学院,昆明 650091
  • 通讯作者: 李 雄

Abstract: A new efficient and verifiable multi-threshold secret sharing scheme is proposed,which is based on RSA cryptosystem and one-way function.In this scheme,each participant’s secret shadow is selected by the participant himself,so it can avoid the secret dealer to distribute a fake shadow,and it isn’t need a secure channel between the dealer and participants,so the efficiency of the system is improved.In recovery phase,every participant can test whether other participants provided the true information or not.The security of this scheme is based on and one-way function.

Key words: multi secret sharing, threshold scheme, RSA cryptosystem, one-way function

摘要: 基于RSA密码体制和单向函数,提出了一个高效可验证的多秘密共享方案,每个参与者的秘密份额由自己选择,从而避免了分发者分发假的秘密份额,且分发者与参与者之间不需要安全信道,提高了系统的效率;在恢复秘密时,每个参与者可以检验其他参与者是否进行了欺诈。该方案的安全性基于大整数分解问题的难解性和单向函数的安全性。

关键词: 多秘密共享, 门限方案, RSA密码体制, 单向函数