Theory and Implementation of outsourced Proof of Retrievability in Cloud

Author(s):

K.Anuja , Christian College of Engineering and Technology Dindigul, Tamilnadu-624619, India; Dr.A.Nirmal Kumar, Christian College of Engineering and Technology Dindigul, Tamilnadu-624619, India

Keywords:

Public Verifiability, Proof of Retrievability, Computational Complexities, Prover, Verifier, Data Integrity

Abstract:

To ensure the data integrity of the outsourced data Proof-of-Retrievability (POR) schemes has been proposed wherein storage server must prove to a verifier that all of a client’s data are stored correctly. Existing PoR schemes have computational complexities and allow only private verification. We focus on designing a scheme that achieves both public verifiability and constant communication cost simultaneously,and releases the data owners from the burden of staying online.In our proposed scheme, the message exchanged between the prover and verifier is composed of a constant number of group elements. We combine techniques such as constant size polynomial commitment and homomorphic linear authenticators.The Computational Diffie-Hellman Problem, the Strong Diffie-Hellman assumption and the Bilinear Strong Diffie-Hellman assumption is used to prove the security of our POR Scheme.

Other Details:

Manuscript Id	:	IJSTEV2I10027
Published in	:	Volume : 2, Issue : 10
Publication Date	:	01/05/2016
Page(s)	:	85-89

Download Article