An Efficient Data Integrity Verification Method Supporting Multi-granular Operation with Commutative Hash

Author(s):  
Long Chen ◽  
Banglan Liu ◽  
Wei Song
2014 ◽  
Vol 536-537 ◽  
pp. 489-493
Author(s):  
Long Chen ◽  
Xiao Yin Yi

To extend the flexibility of data integrity verification method,adapted to the different verification environment, proposed an improved solution that can support multi-granularity.It organizes files into three kinds of granularity such as data blocks,data sub-blocks and basic-blocks,basic-block realize data gathered to form data sub-block.Sign in the data sub-block,using signature of the sub-block to generate signature of block. Improvement program can achieve the verification of data blocks and sub-blocks. Validation of data block can reduce the data traffic in the validation process,two particle combination can improve the overall efficiency.In the proposed layered merkel hash tree is put forward,the dynamic operation can be supported by the sub-block or the block.Securitycommunication performance analysis show that the improvement program is effective and has a better practicability


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 90036-90044 ◽  
Author(s):  
Hongliang Zhu ◽  
Ying Yuan ◽  
Yuling Chen ◽  
Yaxing Zha ◽  
Wanying Xi ◽  
...  

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Kai He ◽  
Chunxiao Huang ◽  
Jiaoli Shi ◽  
Xinrong Hu ◽  
Xiying Fan

Cloud storage provides elastic storage services for enterprises and individuals remotely. However, security problems such as data integrity are becoming a major obstacle. Recently, blockchain-based verification approaches have been extensively studied to get rid of a centralized third-party auditor. Most of these schemes suffer from poor scalability and low search efficiency and even fail to support data dynamic update operations on blockchain, which limits their large-scale and practical applications. In this work, we propose a blockchain-based dynamic data integrity verification scheme for cloud storage with T-Merkle hash tree. A decentralized scheme is proposed to eliminate the restrictions of previous centralized schemes. The data tags are generated by the technique of ZSS short signature and stored on blockchain. An improved verification method is designed to check the integrity of cloud data by transferring computation from a verifier to cloud server and blockchain. Furthermore, a storage structure called T-Merkle hash tree which is built based on T-tree and Merkle hash tree is designed to improve storage utilization of blockchain and support binary search on chain. Moreover, we achieve efficient and secure dynamic update operations on blockchain by an append-only manner. Besides, we extend our scheme to support batch verification to handle massive tasks simultaneously; thus, the efficiency is improved and communication cost is reduced. Finally, we implemented a prototype system based on Hyperledger Fabric to validate our scheme. Security analysis and performance studies show that the proposed scheme is secure and efficient.


2017 ◽  
Vol 11 ◽  
pp. 10002
Author(s):  
Yun-Hao Xia ◽  
Han-Shu Hong ◽  
Guo-Feng Lin ◽  
Zhi-Xin Sun

Sign in / Sign up

Export Citation Format

Share Document