Accurate Location in Batch Dynamic Provable Data Possession

Abstract:

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.

• Periodical: Applied Mechanics and Materials (Volumes 519-520)
• Pages: 9-12
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.519-520.9
• Online since: February 2014
• Authors: Ming Chu Li, Liang Zhang, Cheng Guo*
• Keywords: Accurate Location, Batch Audit, DPDP, Public Audit

References

[1] G. Ateniese, R. Burns, R. Curtmola, J. Herring, et al., in: Provable data possession at untrusted stores, edited by Proceedings of the 14th ACM conference, (2007), p.598–609.

DOI: 10.1145/1315245.1315318

[2] A. Juels and B. S. Kaliski Jr, in: Pors: Proofs of retrievability for large files, edited by Proceedings of the 14th ACM conference on Computer and communications security, (2007), p.584–597.

DOI: 10.1145/1315245.1315317

[3] H. Shacham and B. Waters, in: Compact proofs of retrievability, in Advances in Cryptology-ASIACRYPT (2008), p.90–107.

DOI: 10.1007/978-3-540-89255-7_7

[4] K. D. Bowers, A. Juels, and A. Oprea, in: Proofs of retrievability: Theory and implementation, edited by Proceedings of the 2009 ACM workshop (2009), p.43–54.

DOI: 10.1145/1655008.1655015

[5] G. Ateniese, R. Di Pietro, L. V. Mancini, and G. Tsudik, in: Scalable and efficient provable data possession, edited by Proceedings of the 4th international (2008), p.9.

DOI: 10.1145/1460877.1460889

[6] Erway C, Küpçü A, Papamanthou C, et al., in: Dynamic provable data possession, edited by Proceedings of the 16th ACM conference (2009), p.213–222.

DOI: 10.1145/1653662.1653688

[7] Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou, Enabling public verifiability and data dynamics for storage security in cloud computing, edited by Computer Security–ESORICS (2009), p.355–370.

DOI: 10.1007/978-3-642-04444-1_22

[8] Y. Zhu, H. Hu, G. Ahn, and M. Yu, in: Cooperative provable data possession for integrity verification in multi-cloud storage (2012).

[9] D. Boneh, B. Lynn, and H. Shacham, in: Short signatures from the weil pairing, edited by Advances in Cryptology-ASIACRYPT (2001), p.514–532.

DOI: 10.1007/3-540-45682-1_30

[10] R. C. Merkle, in: Protocols for public key cryptosystems, edited by IEEE Symposium on Security and privacy, vol. 1109 (1980), p.122–134.

DOI: 10.1109/sp.1980.10006

[11] F. Li, M. Hadjieleftheriou, G. Kollios, and L. Reyzin, in: Dynamic authenticated index structures for outsourced databases, edited by Proceedings of the 2006 ACM SIGMOD international conference on Management of data (2006), p.121–132.

DOI: 10.1145/1142473.1142488

[12] D. Boneh, C. Gentry, B. Lynn, and H. Shacham, Aggregate and verifiably encrypted signatures from bilinear maps, edited by Advances in Cryptology-EUROCRYPT (2003), p.416–432.

DOI: 10.1007/3-540-39200-9_26