...
首页> 外文期刊>International journal of digital crime and forensics >Dynamic Provable Data Possession of Multiple Copies in Cloud Storage Based on Full-Node of AVL Tree
【24h】

Dynamic Provable Data Possession of Multiple Copies in Cloud Storage Based on Full-Node of AVL Tree

机译:基于AVL树全节点的云存储中多个副本的动态可证明数据拥有

获取原文
获取原文并翻译 | 示例
           

摘要

This article describes how to protect the security of cloud storage, a provable data possession scheme based on full-nodes of an AVL tree for multiple data copies in cloud storage. In the proposed scheme, a Henon chaotic map is first implemented for the node calculation of the AVL tree, and then the location of the data in the cloud is verified by AVL tree. As an AVL tree can keep the balance even with multiple dynamic operations made on the data in the cloud, it can improve the search efficiency of the data block, and reduce the length of the authentication path. Simulation results and analysis confirm that it can achieve good security and high efficiency.
机译:本文介绍如何保护云存储的安全性,云存储是一种可验证的数据拥有方案,基于AVL树的完整节点,用于云存储中的多个数据副本。在提出的方案中,首先实现了Henon混沌图用于AVL树的节点计算,然后通过AVL树验证数据在云中的位置。由于AVL树即使对云中的数据进行多次动态操作也可以保持平衡,因此可以提高数据块的搜索效率,并减少身份验证路径的长度。仿真结果和分析表明,该方法可以达到良好的安全性和高效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号