计算机应用 ›› 2010, Vol. 30 ›› Issue (12): 3343-3345.

• 信息安全 • 上一篇    下一篇

基于几何方法的自更新Hash链构造方案

瓮佳佳1,张敏情2,刘昀昊2   

  1. 1. 陕西省西安市三桥武警工程学院研究生36队
    2.
  • 收稿日期:2010-05-14 修回日期:2010-07-20 发布日期:2010-12-22 出版日期:2010-12-01
  • 通讯作者: 瓮佳佳
  • 基金资助:
    国家自然科学基金资助项目

Self-renewal Hash chain based on geometric method

  • Received:2010-05-14 Revised:2010-07-20 Online:2010-12-22 Published:2010-12-01

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

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

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