首页> 外文会议>International conference on information security and cryptology >A Provable Data Possession Scheme with Data Hierarchy in Cloud
【24h】

A Provable Data Possession Scheme with Data Hierarchy in Cloud

机译:云中具有数据层次结构的可证明数据拥有方案

获取原文
获取外文期刊封面目录资料

摘要

In recent years, numerous provable data possession (PDP) schemes have been proposed for checking the availability and integrity of data stored on cloud storage server (CSS) which is not fully trusted. However, these schemes do not work with specific subsets of verifiers, and they do not efficiently support dynamic enrollment and revocation of verifiers. In this paper, we propose a novel provable data possession scheme under hierarchical data framework in cloud environment. Our scheme can be considered as a generalization of privately verifiable PDP schemes. Specifically, data of different values are integrated into a data hierarchy, and clients are classified and authorized different access permissions according to their amounts of payment. Furthermore, our scheme allows the data owner to efficiently enroll and revoke clients. The scheme satisfies existential unforgeability against malicious CSS based on the hardness of the computational Diffie-Hellman problem.
机译:近年来,已经提出了许多可证明的数据拥有(PDP)方案,以检查存储在不完全受信任的云存储服务器(CSS)上的数据的可用性和完整性。但是,这些方案不适用于验证者的特定子集,并且不能有效地支持验证者的动态注册和吊销。在本文中,我们提出了一种在云环境中分层数据框架下可证明的新型数据拥有方案。我们的方案可以看作是可私有验证的PDP方案的概括。具体而言,将不同值的数据集成到数据层次结构中,并根据客户的付款金额对客户端进行分类并授予不同的访问权限。此外,我们的计划允许数据所有者有效地注册和撤消客户端。该方案基于计算Diffie-Hellman问题的严重性,满足了针对恶意CSS的现有不可伪造性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号