Provable Data Possession using Additive Homomorphic Encryption

Abstract

Efficiency, public verification, and robustness are essential characteristics of data possession schemes. The efficiency of such kinds of Provable Data Possession (PDP) schemes is possible due to homomorphic encryption, which is used to verify the integrity of data. Most of the existing schemes use multiplicative homomorphic encryption. The multiplicative homomorphic encryption is unsuitable for the low configured devices, which are quite constrained in terms of computation and storage. In this work, we have provided the solution using additive homomorphic encryption techniques like Paillier, ElGamal and Elliptic Curve Cryptosystem (ECC). The proposed solution is based on ECC, which requires less time to execute setup, tag generation, proof generation and proof verification phases to provide public verifiability. The proposed solution is secured under a random Oracle model. Correctness analysis of the proposed algorithm is given at the end of the algorithm.