Provable Data Possession using IBE in Multi cloud storage
Main Article Content
Abstract
In distributed computing frameworks, information proprietors normally store immense volume information on the cloud servers in this way customers may get to the information from Cloud servers without knowing their areas in this association outsourcing customer information among untrusted cloud servers, dependable check, proficient information outsourcing and framework execution is a testing issue .keeping in mind the end goal to address the above issues we utilize Centralized Cloud Service Provider to enhance the System Performance by decreasing the time unpredictability .Therefore, every Client solicitation is overseen by concentrated Cloud Service Provider. With a specific end goal to give the dependable check amid transferring and downloading User needs to answer the Security Question. Security Questions and Answers are given by client amid the enrollment stage. So amid Uploading/Downloading operation If client is typical then he can answer that security questions on the off chance that he/she is interloper then he/she can't answer that inquiries. In this manner, utilizing this we can give more Security. Additionally, we can give the Security to transferred information and the condensation by utilizing the encryption calculation in this manner we can accomplish productive information out sourcing with information uprightness. Besides, the honesty test convention must be proficient keeping in mind the end goal to spare the verifier's expense.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
IJCERT Policy:
The published work presented in this paper is licensed under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. This means that the content of this paper can be shared, copied, and redistributed in any medium or format, as long as the original author is properly attributed. Additionally, any derivative works based on this paper must also be licensed under the same terms. This licensing agreement allows for broad dissemination and use of the work while maintaining the author's rights and recognition.
By submitting this paper to IJCERT, the author(s) agree to these licensing terms and confirm that the work is original and does not infringe on any third-party copyright or intellectual property rights.
References
B. Sotomayor, R. S. Montero, I. M. Llorente, and I. T. Foster, Virtual infrastructure management in private and hybrid clouds,” IEEE Internet Computing, vol. 13, no. 5, pp. 14–22,2009.
G. Ateniese, R. C. Burns, R. Curtmola, J. Herring, L. Kissner, Z. N. J. Peterson, and D. X. Song, “Provable data possession at untrusted stores,” in ACM Conference on Computer and Communications Security, P. Ning, S. D. C. di Vimercati, and P. F. Syverson, Eds. ACM, 2007, pp. 598–609.
A. Juels and B. S. K. Jr., “Pors: proofs of retrievability for large files,” in ACMConference on Computer and Communications Security, P. Ning, S. D. C. di Vimercati, and P. F. Syverson, Eds. ACM, 2007, pp. 584–597.
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. 1–10.
C. C. Erway, A. K¨upc¸ ¨u, C. Papamanthou, and R. Tamassia, “Dynamic provable data possession,” in ACM Conference on Computer and Communications Security, E. Al-Shaer, S. Jha, and A. D. Keromytis, Eds. ACM, 2009, pp. 213–222.
H. Shacham and B. Waters, “Compact proofs of retrievability,” in ASIACRYPT, ser. Lecture Notes in Computer Science, J. Pieprzyk, Ed., vol. 5350. Springer, 2008, pp. 90–107.
Q. Wang, C.Wang, J. Li, K. Ren, and W. Lou, “Enabling public verifiability and data dynamics for storage security in cloud computing,” in ESORICS, ser. Lecture Notes in Computer Science, M. Backes and P. Ning, Eds., vol. 5789. Springer, 2009, pp. 355–370.
Q. Wang, C.Wang, J. Li, K. Ren, and W. Lou, “Enabling public Verifiability and data dynamics for storage security in cloud Computing,” in ESORICS, ser. Lecture Notes in Computer Science, M. Backes and P. Ning, Eds., vol. 5789. Springer, 2009, pp. 355–370.
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 SAC, W. C. Chu, W. E. Wong, M. J. Palakal, and C.-C. Hung, Eds. ACM, 2011, pp. 1550–1557.
K. D. Bowers, A. Juels, and A. Oprea, “Hail: a highavailability and integrity layer for cloud storage,” in ACM Conference on Computer and Communications Security, E. Al-Shaer, S. Jha, and A. D.Keromytis, Eds. ACM, 2009, pp. 187–198.
Y. Dodis, S. P. Vadhan, and D. Wichs, “Proofs of retrievability via hardness amplification,” in TCC, ser. Lecture Notes in Computer Science, O. Reingold, Ed., vol. 5444. Springer, 2009, pp. 109–127.
L. Fortnow, J. Rompel, and M. Sipser, “On the power of multiprover Interactive protocols,” in Theoretical Computer Science, 1988, pp.156–161