Robust/Recover Provable Data Possession Protocol

Provable data possession (PDP) allows a client that has stored data at remote server to verify that the server correctly possesses the original data. A long-standing problem is how to reduce I/O cost. Through the integration of Online-code and PDP, a challenge/check protocol that can verifies the possession is proposed. The protocol generates probabilistic proofs of possession by sampling tiny sets of data, which obviously reduces I/O cost. Meanwhile, the protocol can recover corrupted data. The authors formalize this notion in the Robust/Recover (RR) provable data possession guarantee. Briefly speaking, the client maintains a constant amount of metadata to verify the proof. The challenge/check protocol transmits a constant amount of data, which reduces communication complexity. The authors give a detailed analysis of this protocol and build a simulation to evaluate practicability in reliability, space overhead, computation complexity, and communication complexity.

[1]  Thomas Plantard,et al.  Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy , 2017, ISPEC.

[2]  Ari Juels,et al.  Proofs of retrievability: theory and implementation , 2009, CCSW '09.

[3]  Michael Gertz,et al.  Authentic Data Publication Over the Internet , 2003, J. Comput. Secur..

[4]  Ramakrishna Kotla,et al.  SafeStore: A Durable and Practical Storage System , 2007, USENIX Annual Technical Conference.

[5]  Michael Gertz,et al.  Authentic Third-party Data Publication , 2000, DBSec.

[6]  Reza Curtmola,et al.  Robust remote data checking , 2008, StorageSS '08.

[7]  Ivan Damgård,et al.  Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks , 1991, CRYPTO.

[8]  Reza Curtmola,et al.  Provable data possession at untrusted stores , 2007, CCS '07.

[9]  Yi Mu,et al.  On Indistinguishability in Remote Data Integrity Checking , 2015, Comput. J..

[10]  Jian Shen,et al.  Provable data transfer from provable data possession and deletion in cloud storage , 2017, Comput. Stand. Interfaces.

[11]  Stanislaw Jarecki,et al.  Cryptographic Primitives Enforcing Communication and Storage Complexity , 2002, Financial Cryptography.

[12]  Brent Waters,et al.  Secure Conjunctive Keyword Search over Encrypted Data , 2004, ACNS.

[13]  Gene Tsudik,et al.  Authentication and integrity in outsourced databases , 2006, TOS.

[14]  Mihir Bellare,et al.  The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols , 2004, CRYPTO.

[15]  Ari Juels,et al.  Pors: proofs of retrievability for large files , 2007, CCS '07.