Towards the Security of Big Data: Building a Scalable Hash Scheme for Big Graph

摘要

Big graph model is frequently used to represent large-scale datasets such as geographical and healthcare data. Deploying these datasets in a third-party public cloud is a common solution for data sharing and processing. Maintaining data security in a public cloud is crucial. Here we target the data integrity issue, which is mainly achieved by hash operations. Existing hash schemes for graphs-structured data are either not suitable to all type of graphs or not computationally efficient for big graph. In this paper, we propose a secure, scalable hash scheme that is applicable to big graphs/trees, and its computation is highly efficient. We use the graph structure information to make our scheme unforgeable. Furthermore, we skillfully tune the scheme to make the graph verification and update processes very efficient. We will prove that our hash scheme is cryptographically secure. Our experimental results show that it has scalable computation performance.