提出了一种新的秘密共享方案.该方案分两层实现:上层,基于Stern-Brocot树把一个大的秘密拆分为t个小整数(子秘密)；底层,借鉴一维元胞自动机模型中的进化方法,把上层的t个子秘密作为初始状态,动态生成各参与者的共享.特别地,该方案能够动态扩展参与者,动态调整门限值,动态更新秘密和共享.另外,还具有计算简单,各参与者共享份额短的优点.分析结果表明,该方案安全、有效.%A novel secret sharing scheme was proposed. This scheme consisted of two layer protocols: in the first layer, a larger secret was split into / smaller integers (sub-secrets) based on the Stern-Brocot tree; in the lower layer, (sub-secrets obtained from the first layer were regarded as t initial states in one-dimensional cellular automaton model, and then from the t initial states it could dynamic create all participants' shares according to the simple fixed rule. This scheme could dynamic add new member, adjust the threshold value and renew the secret and the shares. Besides, there were still other advantages that the costs of the computation were very low and the size of the shares was very small. The results of analysis show that it was secure and very efficient.
展开▼
