HB+-MHT: Lightweight and Efficient Data Integrity Verification Scheme for Cloud Virtual Machines

被引:0
作者
Yang, Zhi [1 ]
Li, Xiaopeng [1 ]
Jin, Shuyuan [2 ]
Sun, Lei [1 ]
Zhang, Zhao [1 ]
Yang, Baoshan [1 ]
Du, Xuehui [1 ]
Chao, Fan [1 ]
机构
[1] PLA Informat Engn Univ, Zhengzhou 450001, Peoples R China
[2] SUN YAT SEN Univ, Guangzhou 510006, Peoples R China
基金
中国国家自然科学基金;
关键词
PRIVACY;
D O I
10.1155/2022/9473246
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the rapid development of cloud computing, cloud storage is widely used. In the cloud environment, users' virtual machine system mirrors and data are stored in the cloud server. The escape of virtual machines and Trojan virus attacks make it challenging to ensure the integrity of virtual machine systems. Trusted computing is expensive to randomly verify data integrity and does not adapt to dynamic data changes. Provable data integrity is a potential solution to this problem. Merkle Hash Tree (MHT) model is widely adopted in provable data integrity. Although MHT requires only a small amount of evidence for verification, the verifier's number of hash calculations and the server's efficiency of evidence query are not optimal. Moreover, the verification frequency of each piece of data is not considered by MHT. Properly handling these factors can improve the actual verification performance. In this paper, a lightweight and efficient data integrity verification approach called HB+-MHT is proposed for the tenant virtual machine (TVM) in cloud computing. In HB+-MHT, the Huffinan hash tree scheme is used for small file verification to ensure that the hot file has a shorter path, which reduces the required amount of evidence for verification. Meanwhile, the B+ hash tree scheme is used for big files verification, which can effectively reduce evidence query time and hash calculation times. The experimental results show that the scheme proposed in this paper can perform data integrity verification well, with reduced computing and storage overhead.
引用
收藏
页数:13
相关论文
共 20 条
  • [1] Aldossary S, 2016, INT J ADV COMPUT SC, V7, P485
  • [2] [Anonymous], 2013, TCG SPEC ARCH OV REV
  • [3] [Anonymous], 2004, IFIP TC11/WG11.5 Sixth Working Conference on Integrity and Internal Control in Information Systems (IICIS), DOI DOI 10.1007/1-4020-7901-X_1
  • [4] Crypto.Stanford, 2021, E PAIR BAS CRYPT LIB
  • [5] Dynamic Provable Data Possession
    Erway, C. Chris
    Kupcu, Alptekin
    Papamanthou, Charalampos
    Tamassia, Roberto
    [J]. ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2015, 17 (04)
  • [6] Feng Deng-Guo, 2011, Journal of Software, V22, P71, DOI 10.3724/SP.J.1001.2011.03958
  • [7] RITS-MHT: Relative indexed and time stamped Merkle hash tree based data auditing protocol for cloud computing
    Garg, Neenu
    Bawa, Seema
    [J]. JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2017, 84 : 1 - 13
  • [8] Full integrity and freshness for cloud data
    Jin, Hao
    Zhou, Ke
    Jiang, Hong
    Lei, Dongliang
    Wei, Ronglei
    Li, Chunhua
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2018, 80 : 640 - 652
  • [9] Erasure Coding for Cloud Storage Systems: A Survey
    Li, Jun
    Li, Baochun
    [J]. TSINGHUA SCIENCE AND TECHNOLOGY, 2013, 18 (03) : 259 - 272
  • [10] Mell P, 2010, COMMUN ACM, V53, P50