• • 上一篇    下一篇

基于格的大数据动态存储完整性验证方案

李雪晓%叶云%田苗苗%黄刘生   

  • 基金资助:
    国家电网公司基础前瞻性项目[X XN51201304253]、江苏省自然科学基金[ BK2011357]、广东省中国科学院全面战略合作项目(2012B090400013)

Big Data Dynamic Storage Integrity Verification Scheme based on Lattice

LI Xue-xiao%YE Yun%TIAN Miao-miao%HUANG Liu-sheng   

  • About author:中国科学技术大学苏州研究院,江苏苏州,215123%中国电力科学研究院南京分院,江苏南京,210003

摘要: 文章提出了一种基于格的大数据动态存储完整性验证方案,方案基于量子计算机也难以破解的格上困难问题,具有较高的安全性,采用了Merkle哈希树技术,支持数据动态变化,并且运行效率也很高。最后文章论证了方案的正确性和安全性,该方案能够广泛的应用到与大数据动态完整性验证相关的场景中。

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.