Main Article Content
In the age of cloud computing, cloud users with limited storage can outsource their data to remote servers. These servers, in lieu of monetary benefits, offer retrievability of their clients’ data at any point of time. Secure cloud storage protocols enable a client to check integrity of outsourced data. In this work, we explore the possibility of constructing a secure cloud storage for dynamic data by leveraging the algorithms involved in secure network coding. We show that some of the secure network coding schemes can be used to construct efficient secure cloud storage protocols for dynamic data. In this we use SHA algorithm for deleting the dynamic data and it is used for decrypt data. By using Ceaser Cipher techniques the pre-processor data will divided in to blocks, and the data will encrypted. The Encrypted data will uploaded to cloud.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
B. Sengupta and S. Ruj, “Publicly verifiable secure cloud storage for dynamic data using secure network coding,” in ACM Asia Conference on Computer and Communications Security, 2016, pp. 107–118.
G. Ateniese, R. C. Burns, R. Curtmola, J Herring, L. Kissner, Z. N. J. Peterson, and D.XSong, “Provable data possession at untrusted stores,” in ACM Conference on Computer and Communications Security, 2007, pp. 598–609.
A. Juels and B. S. Kaliski, “PORs: Proofs of retrievability for large files,” in ACM Conference on Computer and Communications Security, 2007, pp. 584–597.
H. Shacham and B. Waters, “Compact proofs of retrievability,” Journal of Cryptology, vol. 26, no. 3, pp. 442–483, 2013.
C. C. Erway, A. K ?upc ? ? u, C. Papamanthou, and R. Tamassia, “Dynamic provable data possession,” ACM Transactions on Information and System Security, vol. 17, no. 4, pp. 15:1– 15:29, 2015.