一种可定期更新的(t,n)门限多秘密共享方案  

Periodically renewed ( t,n )threshold multi-secret sharing scheme

作　　者：王伟丛[1] 李志慧[1] 

机构地区：[1]陕西师范大学数学与信息科学学院,西安710062

出　　处：《计算机工程与应用》2011年第36期96-98,共3页Computer Engineering and Applications

基　　金：国家自然科学基金(the National Natural Science Foundation of China under Grant No.10571112)

摘　　要：提出了一种可定期更新的(t,n)门限多秘密共享方案。该方案一次可共享多个秘密。参与者的子秘密由参与者自己生成,并且子秘密可定期得到更新。分发者与参与者之间不需要维护安全信道。方案可有效地防止分发者和参与者的欺诈行为,同时可抵抗外界攻击。该方案具有较好的安全性和实用性。A periodically renewed （ t,n ）threshold multi-secret sharing scheme is proposed.In the scheme many secrets can be shared once.Each participant’s sub-secret is produced by the participant himself and can be renewed periodically.A secure channel between the dealer and the participant is unnecessary.The scheme can prevent both the dealer and the participant from cheating effectively,in the same time it can be against attacks.The scheme has better security and practicability.

关 键 词：秘密共享 定期更新 安全性 防欺诈 (T N)门限 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]