Accurate Location in Batch Dynamic Provable Data Possession

The paper focused on the construction of an efficient DPDP for public audit. We improved the existing proof of storage model by manipulating authenticated skip list structure for authentication. We further explored embedded MHT structure helping our scheme to accurate locate the incorrect part in batch auditing. Extensive security and performance evaluation showed the proposed model is highly efficient and a nice trade-off between robust construction and storage cost.

[1]  Gail-Joon Ahn,et al.  Cooperative Provable Data Possession for Integrity Verification in Multicloud Storage , 2012, IEEE Transactions on Parallel and Distributed Systems.

[2]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[3]  Feifei Li,et al.  Dynamic authenticated index structures for outsourced databases , 2006, SIGMOD Conference.

[4]  Hovav Shacham,et al.  Short Signatures from the Weil Pairing , 2001, J. Cryptol..

[5]  Hovav Shacham,et al.  Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.

[6]  Cong Wang,et al.  Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing , 2009, ESORICS.

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

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

[9]  Hovav Shacham,et al.  Compact Proofs of Retrievability , 2008, Journal of Cryptology.

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

[11]  Hovav Shacham,et al.  Compact Proofs of Retrievability , 2008, ASIACRYPT.

[12]  Roberto Di Pietro,et al.  Scalable and efficient provable data possession , 2008, IACR Cryptol. ePrint Arch..

[13]  Ralph C. Merkle,et al.  Protocols for Public Key Cryptosystems , 1980, 1980 IEEE Symposium on Security and Privacy.