针对可再生散列链解决了资源受限的缺点,但现有构造方案在安全性和复杂性等方面存在缺陷这一问题,提出“重复”、“划分”和“划分树”的定义,以及基于(t,n)-Mignotte’s门限的中国剩余定理秘密共享方案,设计了一种新的可再生散列链构造方法。从明文空间、双重认证和可证明安全3个方面论证了新构造办案能确保新链中种子值的安全再生并有效抵制中间人攻击。仿真实验表明新构造方案在通信、计算和存储开销等方面相比于传统方案具有相同甚至更佳的性能。
The introduction of renewal hash chain overcame resource-constrained defect in traditional hash chains, but the existing renewable schemes had still held unsatisfactory performance especially on security and complexity. The defi- nitions of repetition, division and division-tree was proposed, and then a novel self-renewable hash chain construction scheme was put forward based on division and (t, n)-Mignotte's threshold Chinese remainder theorem secret sharing scheme. From three aspects of key space, twice authentication and provable security, it theoretically proves that the pro- posed hash scheme could ensure the novel seed value regenerated safely and resisting the middle-man attack effectively. Simulation experiments demonstrate that the novel scheme obtains equal or more satisfactory performances on the costs of communication, computation and storage than typical schemes.