Research And Implementation Of Cloud Storage Data Integrity Authentication

The cloud is a multi-tenant environment, where resources are shared. Placing data in the hands of a vendor intuitively seems risky. How to keep cloud data intact and available to users is a problem to be solved.Merkle tree and Authenticated skip list are very important data structure. Those are used in cloud data integrity verification. How to get the membership proof of the element in Merkle tree and authenticated skip list efficiently is an important part of authentication. Currently, the computation of authentication path for Merkle tree is only applicable to complete binary tree, but not applicable to unbalanced tree.We propose a new approach for computing the authentication path for binary hash tree. It is applicable not only to balanced hash tree, such as Merkle tree, but also other binary hash trees. Therefore it is more versatile when compared with the previous algorithms. Besides, it is structurally very simple and easy to implement.Kaouthar Blibech and Alban Gabillon proposed a head proof and a tail proof algorithms for the membership proof of elements in the authenticated skip list. However, the proposed algorithms are uncorrelated each other and need plateau function. We propose a new algorithm for computing the membership proof for element in the authenticated skip list by using two stacks, one is for storing traversal chain of leaf node, the other is for storing authentication path for the leaf. The proposed algorithm is simple and effective without needing plateau function. It can also be applicable for other similar binary hash trees.In this paper, we implement cloud storage data integrity detection algorithm. In terms of performance, we compare our algorithms with previous methods. Analysis results show that our algorithms can use in cloud data integrity detection effectively, and the performance of our algorithms is better than the previous algorithms.