Provable Data Possession using IBE in Multi cloud storage
NALLAMEKALA HEMANTH, K.KIRAN KUMAR, , ,
Affiliations M.Tech (CSE), Priyadarshini Institute of Technology & ManagementAssociate Professor ( Dept.of CSE), Priyadarshini Institute of Technology & Management
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
NALLAMEKALA HEMANTH,K.KIRAN KUMAR."Provable Data Possession using IBE in Multi cloud storage". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.831-834, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1126.pdf,
Keywords : Provable data possession, proofs of irretrievability, ID-DPDP system.
 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.
Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors.
News & Events
Latest issue :Volume 10 Issue 1 Articles In press
☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞ LAST DATE OF SUBMISSION : 31st March 2023
☞ SUBMISSION TO FIRST DECISION : In 7 Days
☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION
All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.