Abstract: In order to solve the problem of information leakage in extant self-updating Hash chains, the authors proposed a new self-renewal Hash chain based on geometric method in this paper. By utilizing the property of circle that n+1 points given on the same n dimensional circle can determine its formula uniquely, a data dispersal and restoring algorithm was designed for construct a new self-renewal Hash chain. The performance analysis shows that our scheme is simple in calculation and has high security. Besides, it can change root s while keeping most n points unchanged.

Key words: self-renewal Hash chain, data dispersal and restoring algorithm, geometric method, safety, high efficiency

摘要： 为解决已有自更新Hash链方案中根s信息泄漏的问题，构造了一种基于几何方法的自更新Hash链。方案利用“已知n维空间圆上n+1个不同点，可以唯一确定这个圆的方程”的数学原理，提出了一种数据分离—恢复方案，用于构造自更新Hash链。该设计方案计算简单，具有较高的安全性，而且可以在最多n个点不变的情况下，修改根s。

关键词: 自更新Hash链, 数据分离—恢复算法, 几何方法, 安全性, 高效性