| 基于格的大数据动态存储完整性验证方案 |
| |
| 引用本文： | 李雪晓,叶云,田苗苗,黄刘生. 基于格的大数据动态存储完整性验证方案[J]. 信息网络安全, 2014, 0(4): 46-50 |
| |
| 作者姓名： | 李雪晓 叶云 田苗苗 黄刘生 |
| |
| 作者单位： | [1]中国科学技术大学苏州研究院,江苏苏州215123 [2]中国电力科学研究院南京分院,江苏南京210003 |
| |
| 基金项目： | 国家电网公司基础前瞻性项目[XXN51201304253]、江苏省自然科学基金[BK2011357]、广东省中国科学院全面战略合作项目[20128090400013] |
| |
| 摘 要： | 文章提出了一种基于格的大数据动态存储完整性验证方案，方案基于量子计算机也难以破解的格上困难问题，具有较高的安全性，采用了Merkle哈希树技术，支持数据动态变化，并且运行效率也很高。最后文章论证了方案的正确性和安全性，该方案能够广泛的应用到与大数据动态完整性验证相关的场景中。
|
| 关 键 词： | 大数据 动态存储 完整性验证 量子计算机 格 Merkle哈希树 |
Big Data Dynamic Storage Integrity Verification Scheme based on Lattice |
| |
| LI Xue-xiao,YE Yun,TIAN Miao-miao,HUANG Liu-sheng. Big Data Dynamic Storage Integrity Verification Scheme based on Lattice[J]. Netinfo Security, 2014, 0(4): 46-50 |
| |
| Authors: | LI Xue-xiao YE Yun TIAN Miao-miao HUANG Liu-sheng |
| |
| Affiliation: | 1 .Suzhou Institute for Advanced Study, University of Science and Technology of China, Suzhou Jiangsu 215123, China;2. Nanjing Branch of China Electric Power Research Institute, Nanjing Jiangsu 210003, China) |
| |
| Abstract: | This paper presents a big data dynamic storage integrity verification scheme. This scheme, based on lattice problem--a difficult problem even for the quantum computers, has high security, supports dynamic changes of big data, and is also very efficient. In order to support the dynamic characteristics of big data, this scheme adopts the Merkle hash tree technique. This paper has demonstrated the correctness and security of this scheme which shows that it could be widely applied to verify the dynamic storage integrity.of big data. |
| |
| Keywords: | big data dynamic storage integrity verification quantum computer lattice Merkle hash tree |
| 本文献已被 CNKI 维普 等数据库收录！ |
