Fine-grained Data Deduplication and proof of storage Scheme in Public Cloud Storage

摘要

Verification of the integrity of the data stored on a public cloud server is a challenging research problem. While providing on-demand service to the service consumer, the cloud service provider also requires to ensure minimizing error in data stored in a cloud storage server. To address this issue, many schemes like proof of storage (POS), proof of data possession (PDP), proof of retrievability (POR) exist in the literature. However, for practical purpose, a scheme which verifies the data stored in the server should be compatible with the standard practice of data deduplication for an efficient storage system. There are a few proof of storage with data deduplication (POSD) schemes. We observe that these schemes do not consider stronger tag consistency properties and are vulnerable to duplicate data faking attacks. Moreover, existing POSD schemes are inefficient for real-world applications. In this paper, we present an efficient proof of storage scheme with data deduplication at the block-level which allows private as well as public verification of the data stored. DPoS is secure against duplicate faking attacks and unforgeable under the standard assumption. The theoretical analysis of the DPoS scheme shows that it is efficient in comparison to related schemes.