| 动态门限秘密共享方案 |
| |
| 引用本文： | 黄东平,王华勇,黄连生,戴一奇.动态门限秘密共享方案[J].清华大学学报(自然科学版),2006,46(1):102-105. |
| |
| 作者姓名： | 黄东平 王华勇 黄连生 戴一奇 |
| |
| 作者单位： | 清华大学,计算机科学与技术系,北京,100084 |
| |
| 摘 要： | 为了克服现有的门限秘密共享方案在处理参与者集合动态变化时灵活性差的缺点,提出了一个门限秘密共享方案,并给了一个简单实用的计算L agrange插值的方法。该方案可以动态添加或者删除参与者,而不需要重新分发子秘密,减小了方案实施的代价,子秘密由参与者自己保存,公开的是子秘密的一个影子,从而子秘密可以复用。与直接用基于一般访问结构的共享方案实现门限秘密共享相比,该方案运算代价小。
|
| 关 键 词： | 数据安全 秘密共享 门限 动态 |
| 文章编号： | 1000-0054(2006)01-0102-04 |
| 修稿时间： | 2005年1月20日 |
Dynamic threshold secret sharing scheme |
| |
| HUANG Dongping,WANG Huayong,HUANG Liansheng,DAI Yiqi.Dynamic threshold secret sharing scheme[J].Journal of Tsinghua University(Science and Technology),2006,46(1):102-105. |
| |
| Authors: | HUANG Dongping WANG Huayong HUANG Liansheng DAI Yiqi |
| |
| Abstract: | Known threshold secret sharing schemes have limited flexibility when dealing with the dynamic joining and leaving of the participants.A threshold secret sharing scheme was developed and a utility method to solve the Lagrange interpolation was proposed.The scheme allows the participants to join or leave dynamically,without re-distributing the sub-secrets,which is easier to implement.As the sub-secrets are kept secretly by the participants and it is the shadows of the sub-secrets that is published,the sub-secrets can be re-utilized.The scheme requires less computing time than threshold secret sharing with direct general access structure secret sharing. |
| |
| Keywords: | data security secret sharing threshold dynamic |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
