Paper Title : A Survey On Novel method for delegatable proofs of storage to prevent data leakage in cloud storage.
ISSN : 2394-2231
Year of Publication : 2020
MLA Style: Mrs.Madhuri Desalea " A Survey On Novel method for delegatable proofs of storage to prevent data leakage in cloud storage. " Volume 7 - Issue 6 November - December,2020 International Journal of Computer Techniques (IJCT) ,ISSN:2394-2231 , www.ijctjournal.org
APA Style: Mrs.Madhuri Desalea " A Survey On Novel method for delegatable proofs of storage to prevent data leakage in cloud storage. " Volume 7 - Issue 6 November - December,2020 International Journal of Computer Techniques (IJCT) ,ISSN:2394-2231 , www.ijctjournal.org
Distributed storage has been in far reaching use these days, which reduces clients' weight of neighbourhood information stockpiling. In the mean time, how to guarantee the security and uprightness of the redistributed information put away in a distributed storage worker has likewise pulled in colossal consideration from scientists. Evidences of capacity (POS) is the fundamental procedure acquainted with address this issue. Openly evident POS permitting a third gathering to confirm the information honesty for the information proprietor altogether improves the versatility of cloud administration. Notwithstanding, the vast majority of existing freely irrefutable POS plans are incredibly delayed to figure confirmation labels for all information obstructs because of numerous costly bunch exponentiation activities, even much more slow than ordinary system transferring pace, and in this manner it turns into the bottleneck of the arrangement period of the POS conspire. At that point, we build a lightweight security protecting DPOS conspire, which on one side is as productive as private POS plans, and on the opposite side can bolster outsider reviewer and can switch evaluators whenever, near the functionalities of openly undeniable POS plans. Contrasted with customary openly evident POS plans, we accelerate the label age process by at any rate a few multiple times, without giving up proficiency in some other viewpoint. Likewise, we stretch out our plan to help completely unique activities with high proficiency, lessening the calculation of any information update to O (log n) and at the same time just requiring consistent correspondence costs. We demonstrate that our plan is sound and protection safeguarding against evaluator in the standard model. Trial results confirm the effective execution of our plan.
. 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, CCS 2007, pp. 598–609, ACM.  C. Erway, A. K¨upc¸ ¨ u, C. Papamanthou, and R. Tamassia, “Dynamic provable data possession,” in Proceedings of the 16th ACM Conference on Computer and Communications Security, CCS 2009, pp. 213–222, ACM, 2009.  R. Curtmola, O. Khan, R. Burns, and G. Ateniese, “MR-PDP: Multiple-replica provable data possession,” in Proceedings of the 28th International Conference on Distributed Computing Systems, ICDCS 2008, pp. 411–420, IEEE, 2008.  B.Wang, B. Li, and H. Li, “Oruta: Privacy-preserving public auditing for shared data in the cloud,” in Proceedings of 5th International Conference on Cloud Computing, Cloud 2012, pp. 295–302, IEEE, 2012.  C. Wang, S. S. Chow, Q. Wang, K. Ren, and W. Lou, “Privacy preserving public auditing for secure cloud storage,” IEEE Transactions on Computers, TC 2013, vol. 62, no. 2, pp. 362–375, 2013.  J. Xu, A. Yang, J. Zhou, and D. S. Wong, “Lightweight Delegatable proofs of storage,” in Proceedings of 21st European Symposium on Research in Computer Security, ESORICS 2016, pp. 324–343, Springer International Publishing, 2016.  T. Okamoto, “Provably secure and practical identification schemes and corresponding signature schemes,” in CRYPTO ’92: Annual International Cryptology Conference on Advances in Cryptology, pp. 31– 53.  G. Ateniese, R. Burns, R. Curtmola, J. Herring, O. Khan, L. Kissner, Z. Peterson, and D. Song, “Remote data checking using provable data possession,” ACM Transaction on Information and System Security, TISSEC 2011, vol. 14, no. 1, pp. 12:1–12:34, 2011.  Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou, “Enabling public verifiability and data dynamics for storage security in cloud computing,” in The 14th European Symposium on Research in Computer Security, ESORICS 2009, vol. 5789 of LNCS, pp. 355–370, Springer, 2009.  Z. Hao, S. Zhong, and N. Yu, “A privacy-preserving remote data integrity checking protocol with data dynamics and public verifiability,” IEEE Transactions on Knowledge and Data Engineering, TKDE 2011, vol. 23, no. 9, pp. 1432–1437, 2011.  J. Yuan and S. Yu, “Proofs of retrievability with public verifiability and constant communication cost in cloud,” in Proceedings of the 2013 International Workshop on Security in Cloud Computing, Cloud Computing 2013, pp. 19–26, ACM, 2013.  F. Seb´e, J. Domingo-Ferrer, A. Mart´ınez-Ballest´e, Y. Deswarte, and J.-J. Quisquater, “Efficient remote data possession checking in critical information infrastructures,” IEEE Transactions on Knowledge and Data Engineering, TKDE 2008, vol. 20, no. 8, pp. 1034–1038, 2008.  G. Ateniese, R. D. Pietro, L. V. Mancini, and G. Tsudik, “Scalable and efficient provable data possession,” in Proceedings of the 4th International Conference on Security and Privacy in Communication Netowrks, SecureComm 2008, pp. 9:1–9:10, ACM, 2008.  K. D. Bowers, A. Juels, and A. Oprea, “HAIL: A high-availability and integrity layer for cloud storage,” in Proceedings of the 16th ACM Conference on Computer and Communications Security, CCS 2009, pp. 187–198, ACM, 2009.  K. D. Bowers, A. Juels, and A. Oprea, “Proofs of retrievability: Theory and implementation,” in Proceedings of the 2009 ACM Workshop on Cloud Computing Security, CCSW 2009, pp. 43–54, ACM, 2009.  Y. Dodis, S. Vadhan, and D. Wichs, “Proofs of retrievability via hardness amplification,” in 6th Theory of Cryptography Conference, TCC 2009, vol. 5444 of LNCS, pp. 109–127, Springer, 2009.  K. Yang and X. Jia, “Data storage auditing service in cloud computing: challenges, methods and opportunities,” World Wide Web, vol. 15, no. 4, pp. 409–428, 2012.  E.-C. Chang and J. Xu, “Remote integrity check with dishonest storage server,” in The 13th European Symposium on Research in Computer Security, ESORICS 2008, vol. 5283 of LNCS, pp. 223–237, Springer, 2008.  J. Xu and E.-C. Chang, “Towards efficient proofs of retrievability,” in Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security, ASIACCS 2012, pp. 79–90, ACM, 2012.  Y. Zhu, G.-J. Ahn, H. Hu, S. S. Yau, H. G. An, and C.-J. Hu, “Dynamic audit services for outsourced storages in clouds,” IEEE Transactions on Services Computing, vol. 6, pp. 227–238, April 2013.  K. Zeng, “Publicly verifiable remote data integrity,” in Proceedings of 10th International Conference on Information and Communications Security, ICICS 2008, vol. 5308 of LNCS, pp. 419–434, Springer, 2008.  Y. Zhang and M. Blanton, “Efficient dynamic provable possession of remote data via balanced update trees,” in Proceedings of the 8th ACM SIGSAC Symposium on Information, Computer and Communications Security, ASIACCS 2013, pp. 183–194, ACM, 2013.  E. Shi, E. Stefanov, and C. Papamanthou, “Practical dynamic proofs of retrievability,” in Proceedings of the 20th ACM Conference on Computer and Communications Security, CCS 2013, pp. 325–336,ACM, 2013.  H. Tian, Y. Chen, C.-C. Chang, H. Jiang, Y. Huang, Y. Chen, and J. Liu, “Dynamic-hash-table based public auditing for secure cloud storage,” IEEE Transactions on Services Computing, vol. 10, pp. 701
Proof of Storage, Cloud Computing, Third Party Auditor, Lightweight Homomorphic Authenticator, Data DynamicsCustomer, Distribution, Supply Chain Managements