| 基于几何方法的自更新Hash链构造方案 |
| |
| 引用本文： | 瓮佳佳,张敏情,刘昀昊.基于几何方法的自更新Hash链构造方案[J].计算机应用,2010,30(12):3343-3345. |
| |
| 作者姓名： | 瓮佳佳 张敏情 刘昀昊 |
| |
| 作者单位： | 1. 陕西省西安市三桥武警工程学院研究生36队2. |
| |
| 基金项目： | 国家自然科学基金资助项目，陕西省自然科学基金项目资助项目，武警工程学院基础基会资助项目 |
| |
| 摘 要： | 为解决已有自更新Hash链方案中根s信息泄漏的问题，构造了一种基于几何方法的自更新Hash链。方案利用“已知n维空间圆上n+1个不同点，可以唯一确定这个圆的方程”的数学原理，提出了一种数据分离—恢复方案，用于构造自更新Hash链。该设计方案计算简单，具有较高的安全性，而且可以在最多n个点不变的情况下，修改根s。
|
| 关 键 词： | 自更新Hash链 数据分离—恢复算法 几何方法 安全性 高效性 |
| 收稿时间： | 2010-05-14 |
| 修稿时间： | 2010-07-20 |
Self-renewal Hash chain based on geometric method |
| |
| WENG Jia-jia,ZHANG Min-qing,LIU Yun-hao.Self-renewal Hash chain based on geometric method[J].journal of Computer Applications,2010,30(12):3343-3345. |
| |
| Authors: | WENG Jia-jia ZHANG Min-qing LIU Yun-hao |
| |
| 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. |
| |
| Keywords: | self-renewal Hash chain data dispersal and restoring algorithm geometric method safety high efficiency |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
