...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Future generation computer systems >Efficient dynamic multi-replica auditing for the cloud with geographic location
【24h】

Efficient dynamic multi-replica auditing for the cloud with geographic location

机译：高效动态多副本审计云与地理位置

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Data backup is a pervasive strategy adopted by cloud service providers (CSPs) to avoid potential risks of data loss. As a result, a CSP normally maintains multiple replicas for each piece of data on geographically distributed servers to improve reliability. A key problem of this replication technique is that users will be charged more when more replicas are stored. Therefore, an auditing service is desired to help users verify whether an untrusted CSP stores all their replicas in different geographic locations or not. In this paper, we propose a dynamic multi-replica auditing scheme that has the following features: (1) it can verify both the integrity and geographic locations of a cloud user's data replicas; (2) the proposed scheme can identify different copies with geographic locations, which reduces the complexity in data preprocessing, dynamic operations and backup recovery; (3) by introducing an Indexed Merkle Hash Tree (IMHT), we can reduce overall costs of existing Merkle Hash Trees. We prove the security of the proposed scheme under the random oracle model, and further provide a comprehensive comparison between the proposed scheme and existing schemes. The theoretical analysis and experiment evaluation show that our scheme reduces both the communication and computation costs compared with existing schemes. The analysis also shows that the proposed scheme can achieve 99% verification probability by challenging only 90 data blocks.
机译：数据备份是云服务提供商（CSP）采用的普遍策略，以避免数据丢失的潜在风险。结果，CSP通常为地理分布式服务器上的每条数据维护多个副本，以提高可靠性。此复制技术​​的关键问题是，当存储更多副本时，用户将被收取更多。因此，期望审计服务来帮助用户验证不可信的CSP在不同地理位置中的所有副本存储在不同的地理位置中。在本文中，我们提出了一种动态的多副本审计方案，具有以下功能：（1）它可以验证云用户数据副本的完整性和地理位置; （2）该方案可以识别与地理位置的不同副本，这降低了数据预处理，动态操作和备份恢复的复杂性; （3）通过介绍索引Merkle哈希树（IMHT），我们可以降低现有Merkle哈希树的总成本。我们在随机甲骨文模型下证明了拟议计划的安全性，并进一步提供了拟议计划和现有计划之间的全面比较。理论分析和实验评估表明，与现有方案相比，我们的方案可降低通信和计算成本。分析还表明，该方案可以通过仅具有90个数据块来实现99％的验证概率。

著录项

  • 来源
    《Future generation computer systems》 |2021年第12期|285-298|共14页
  • 作者

    Haiyang Yu; Zhen Yang; Muhammad Waqas; Shanshan Tu; Zhu Han; Zahid Halim; Richard O. Sinnott; Udaya Parampalli;

  • 作者单位

    Faculty of Information Technology Beijing University of Technology Chaoyang District Beijing 100124 China;

    Faculty of Information Technology Beijing University of Technology Chaoyang District Beijing 100124 China;

    Faculty of Information Technology Beijing University of Technology Chaoyang District Beijing 100124 China;

    Faculty of Information Technology Beijing University of Technology Chaoyang District Beijing 100124 China;

    Department of Electrical and Computer Engineering University of Houston Houston TX 77004 USA;

    GIK Institute of Engineering Sciences and Technology Khyber Pakhtunkhwa 23640 Pakistan;

    School of Computing and Information System Melbourne School of Engineering University of Melbourne VIC 3040 Australia;

    School of Computing and Information System Melbourne School of Engineering University of Melbourne VIC 3040 Australia;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Cloud storage auditing; Multiple replicas; Geographic location; Merkle hash tree;

    机译：云存储审计;多副本;地理位置;Merkle哈希树;

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号