The Securing Coding-based Cloud Storage opposed to malignant Attacks
Nowadays cloud is becoming an emerging technology where the user can store their data and access it remotely using the internet. But the security to the user data has become
a major concern. pollution attack, a set of malicious entities trying to corrupt our stored
data in the cloud, which is considered as one of the major risk that affect data security in cloud storage . In our proposed technique , we show how to prevent the pollution attack and how to store our file safely.. The following techniques and algorithm are implemented
in our projects.. our first technique is ,the user send the data by encrypting it using RC5
ALGORITHM. The user can able to upload the following file format only(.jpg, .txt). The another technique is Checksum Method, a user send an encrypted file to the admin by using this method. This generates a key for that particular encrypted file. The encrypted file has to be verified by the admin. By this verification the checksum method generates a key to the file if the file has same key means the file not hacked or not attached. After verification the admin has to upload the file safely in cloud. If the user need that file means,he has to send a request to the admin.Only after getting the response key from admin the user able to download the file. Our Approach is to very robust and the polluters can be easily isolated.
 C. Anglano, R. Gaeta, and M. Grangetto, “Exploiting rateless codes in cloud storage
systems,” IEEE Transactions on Parallel and Distributed Systems, vol. 26, no. 5, pp. 1313–1322, May 2015.
 L. Buttyan, L. Czap, and I. Vajda, “Detection and recovery from pollution attacks in
coding-based distributed storage schemes,” IEEE Transactions on Dependable and Secure Computing, vol. 8, no. 6, pp. 824–838, 2011.
 L. Buttyn, L. Czap, and I. Vajda, “Pollution attack defense for coding based sensor
storage,” in Proceedings of the IEEE Interna- tional Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC), 2010.
 E. Kehdi and B. Li, “Null keys: Limiting malicious attacks via null space properties of network coding,” in INFOCOM 2009, IEEE.
 M. N. Krohn, M. J. Freedman, and D. Mazieres, “On-the-fly verification of rateless erasure codes for efficient content distribution,” Security and Privacy, IEEE Symposium on, 2004.
 C. Gkantsidis and P. Rodriguez, “Cooperative security for network coding file distribution,” in IEEE INFOCOM, 2006.
 Z. Yu, Y. Wei, B. Ramkumar, and Y. Guan, “An efficient signaturebased scheme for securing network coding against pollution attacks,” in INFOCOM 2008. The 27th Conference on Computer Communications. IEEE, 2008.
 Z. Yu, Y. Wei, B. Ramkumar, and Y. Guan, “An efficient scheme for securing xor network
coding against pollution attacks,” in INFOCOM 2009, IEEE.
 N. Cao, S. Yu, Z. Yang, W. Lou, and Y. Hou, “LT codes-based secure and reliable cloud
storage service,” in IEEE INFOCOM, 2012, pp. 693–701.
Copyright (c) 2019 GPH - Journal Of Computer Science and Engineering
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Author(s) and co-author(s) jointly and severally represent and warrant that the Article is original with the author(s) and does not infringe any copyright or violate any other right of any third parties, and that the Article has not been published elsewhere. Author(s) agree to the terms that the GPH Journal will have the full right to remove the published article on any misconduct found in the published article.