摘要
在Shamir门限方案思想的基础上,利用离散对数问题的难解性和Hash函数的单向性,我们提出一种防攻击的多秘密共享方案.对于较长生命周期的大数据的秘密共享问题,该方案具有可公开验证性、定期更新、对抗外部窃取和攻击等优点.
On the basis of Shamir threshold sharing scheme, By means of the intractability of discrete log- arithm problem and one--way property of Hash function, a multi--secret sharing scheme is presented to i- dentify cheaters and attackers. Aiming at the secret sharing problem of large data with very long life cycle, the scheme has good open verifiability and periodically renewing property. In the same time it can prevent external attacks and stealing.
出处
《德州学院学报》
2017年第2期23-25,51,共4页
Journal of Dezhou University
关键词
秘密共享
门限
定期更新
公开验证
secret sharing
threshold
periodically renewing
open verify