A Provable Data Possession Scheme with Data Hierarchy in Cloud

Published: 01 Jan 2015, Last Modified: 27 Jul 2024Inscrypt 2015EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: 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.
Loading

OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2025 OpenReview