A Provable Data Possession (PDP) scheme allows a client which has stored data at an untrusted server to verify that the server possesses the original data that it stored without retrieving the entire file. In this thesis study, a new PDP scheme is built using the concept of sigma protocols. The client pre-processes a file and stores it on the server. At a later time, the client issues a challenge to the server requesting it to compute a Proof of Possession. The client verifies the response using its locally stored metadata. The challenge-response protocol that is derived from the sigma protocol, minimizes both computation and communication complexity. Implementation and complexity analysis of the algorithms used in the sigma-PDP scheme was done as a part of this thesis. The main goal of this research was to minimize computation and communication complexity of sigma-PDP scheme as compared to the existing PDP schemes. The main goal of this research was to minimize computation and communication complexity of sigma-PDP scheme as compared to the existing PDP schemes.