期刊文献+

基于标签分类的云数据完整性验证审计方案 被引量:5

Cloud storage integrity verification audit scheme based on label classification
原文传递
导出
摘要 随着云存储技术的发展,更多用户为了降低成本将数据存储到云服务器,但同时也失去了数据控制权,导致无法确保云存储数据的完整性和安全性。针对上述问题,提出一种基于快速标签查询的安全数据完整性审计方案。首先,利用混沌系统对云存储数据进行加密,以保证数据机密性。然后,利用数据块的哈希值作为标签对数据块分类。将Merkle哈希树(MHT)每个叶节点对应一个标签,每个标签对应多个数据块,提高了数据查询索引速度。本方案满足了云数据存储完整性审计方案的安全性要求,还降低了审计过程的通信开销。实验结果表明,本方案安全有效。 With the development of cloud storage technology,more and more users store data to the cloud server in order to reduce the cost,but at the same time they lose the right to control the data,which leads to the fact that the integrity and security of cloud storage data cannot be ensured.To solve these problems,this paper proposes a security data integrity audit scheme based on fast tag query.Firstly,chaotic system is used to encrypt cloud storage data to ensure data confidentiality.Then,the Hash Value of the data block is used as the label to classify data blocks.In this paper,each leaf node of Merkle Hash Tree(MHT)corresponds to a label,and each label corresponds to multiple data blocks,which increases the speed of data query index.This scheme not only meets the security requirements of the cloud data storage integrity audit scheme,but also reduces the communication expenses of the audit process.The experimental results suggests that the scheme is safe and effective.
作者 王春波 底晓强 WANG Chun-bo;DI Xiao-qiang(College of Computer Science and Technology,Changchun University of Science and Technology,Changchun 130022,China;School of Information Technology,Changchun Automobile Industry Institute,Changchun 130013,China;Information Center,Changchun University of Science and Technology,Changchun 130022,China)
出处 《吉林大学学报(工学版)》 EI CAS CSCD 北大核心 2021年第4期1364-1369,共6页 Journal of Jilin University:Engineering and Technology Edition
基金 国家重点研发计划项目(2018YFB1800303).
关键词 计算机应用技术 审计 云存储 Merkle哈希树 完整性检查 computer application technology audit cloud storage Merkle Hash tree(MHT) integrity check
  • 相关文献

参考文献3

二级参考文献45

  • 1Gaiperin,Rivest R.Scapegoat Trees[C].In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms(SODA 93),1993:165-174.
  • 2Sleator D D,Tarjan R E.Self-adjusting Binary Search Trees[J].JACM,1985,32:652-686.
  • 3Bent S W,Driscoli J R.Randomly Balanced Search Trees[M].Manuscript,1991.
  • 4Haeupler B,Sen S,Tarjan R E.Rank-Balanced Trees[C].11th International Workshop on Algorithms and Data Structures(WADS 2009),Aug 21-23,2009 Banff Canada.Algorithms and Data Structures,2009:351-362.
  • 5Adelson-Velskii G M,Landis E M.An Algorithm for the Organization of Information[J].Soviet.Mat.Doklady,1962.
  • 6Baer J L.Weight-balanced Trees[C].Proceedings of AFIPS 1975 NCC.,1975,44:467-472.
  • 7Mykletun E, Narasimha M, Tsudik G. Authentication and Integrity in Outsourced Database[J]. ACM Transactions on Storage, 2006,2(2) : 107-138.
  • 8Merkle R C. A Certified Digital Signature[C]//Proc of the 9th CRYPTO, 1989:218 238.
  • 9Li F F, Hadlieleftheriou M, Kollios G, et al. Dynamic Authenticated Index Structures for Outsourced Databases[C]// Proc of ACM SIGMOD Conf, 2006:121 132.
  • 10Pang HweeHwa, Jain A, Ramamritham K, et al. Verifying Completeness of Relational Query Results in Data Publishing [C]//Proc ACM of SIGMOD Conference, 2005:407-418.

共引文献32

同被引文献40

引证文献5

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部