Back to Current Issues

Dynamic and Public Auditing with Fair Arbitration for Cloud Data


Asst.Professor, KG Reddy Engineering College, Hyderabad, Telangana

Storage outsourcing turned into a rising trend with the advent of the cloud computing, advancing the secure remote data auditing to be the future research area. Other than this research considers the problem of data dynamics support, public verifiability and dispute arbitration simultaneously. The data dynamics problem in auditing is solved by presenting an index switcher to preserve a mapping between block indices and tag indices and eradicate the passive outcome of block indices in the tag computation without incurring much overhead. We provide fairness guarantee and dispute arbitration in our scheme, which ensures that both the data owner and the cloud cannot misbehave in the auditing process or else it is easy for a third-party arbitrator to find out the cheating party. The framework is reaching out by executing the data dynamically and reasonable discretion on gatherings in the future.

Sajja Suneel, “Dynamic and Public Auditing with Fair Arbitration for Cloud Data”, International Journal Of Computer Engineering In Research Trends, 4(4):136-141, April-2017.

Keywords : Third Party Auditor (TPA), CSP, Proof Of Retrievability (POR).

1. Y. Deswarte, J. J. Quisquater, and A. Saïdane, “Remote integrity checking,” In Integrity and internal control in information systems VI, Springer US, 1-11 (2004).
2. D. L. Gazzoni Filho, and P. S. L. M. Barreto, “Demonstrating data possession and uncheatable data transfer,” IACR Cryptology ePrint Archive 2006, 150 (2006).
3. A. Juels, and B. S. Kaliski Jr, “PORs: Proofs of retrievability for large files,” In Proceedings of the 14th ACM conference on Computer and communications security, Acm, 584-597 (2007).
4. G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, “Provable data possession at untrusted stores,” In Proceedings of the 14th ACM conference on Computer and communications security, Acm, 598-609 (2007).
5. H. Shacham, and B. Waters, “Compact proofs of retrievability,” In International Conference on the Theory and Application of Cryptology and Information Security, Springer Berlin Heidelberg, 90-107 (2008).
6. Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou, “Enabling public verifiability and data dynamics for storage security in cloud computing,” In European symposium on research in computer security, Springer Berlin Heidelberg, 355-370 (2009).
7. M. A. Shah, R. Swaminathan, and M. Baker, “Privacy-Preserving Audit and Extraction of Digital Contents,” IACR Cryptology EPrint Archive 186 (2008).
8. C. Wang, K. Ren, W. Lou, and J. Li, “Toward publicly auditable secure cloud data storage services,” IEEE network 24, (2010).
9. C. C.  Erway, A. Küpçü, C. Papamanthou, and R. Tamassia, “Dynamic provable data possession,” ACM Transactions on Information and System Security (TISSEC) 17, (2015).
10. Y. Zhu, H. Wang, Z. Hu, G. J. Ahn, H. Hu, and S. S. Yau, “Dynamic audit services for integrity verification of outsourced storages in clouds,” In Proceedings of the 2011 ACM Symposium on Applied Computing, ACM, 1550-1557 (2011).
11. Q. Zheng, and S. Xu, “Fair and dynamic proofs of retrievability,” In Proceedings of the first ACM conference on Data and application security and privacy, ACM, 237-248 (2011).

DOI Link : NA

Download :

Refbacks : There are currently no refbacks

Quick Links


Science Central

Score: 13.30

Submit your paper to [email protected]