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

摘要

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