动态门限秘密共享方案  

Dynamic threshold secret sharing scheme

作　　者：黄东平[1] 王华勇[1] 黄连生[1] 戴一奇[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084

出　　处：《清华大学学报（自然科学版）》2006年第1期102-105,共4页Journal of Tsinghua University(Science and Technology)

基　　金：国家自然科学基金资助项目(90104032)

摘　　要：为了克服现有的门限秘密共享方案在处理参与者集合动态变化时灵活性差的缺点,提出了一个门限秘密共享方案,并给了一个简单实用的计算L agrange插值的方法。该方案可以动态添加或者删除参与者,而不需要重新分发子秘密,减小了方案实施的代价,子秘密由参与者自己保存,公开的是子秘密的一个影子,从而子秘密可以复用。与直接用基于一般访问结构的共享方案实现门限秘密共享相比,该方案运算代价小。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.

关 键 词：数据安全 秘密共享 门限 动态 

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