The week's pick
Random Articles
Reseach Article
Optimizing the Algorithm for Secure and Dynamic Cloud Storage using MHT
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 115 - Number 6 |
| Year of Publication: 2015 |
| Authors: Amit Kumar, S S Sambare |
10.5120/20155-2301
|
Amit Kumar, S S Sambare . Optimizing the Algorithm for Secure and Dynamic Cloud Storage using MHT. International Journal of Computer Applications. 115, 6 ( April 2015), 13-15. DOI=10.5120/20155-2301
Abstract
With the consistently increasing demand of storing data backup online by millions of users, cloud computing - which provides resources both hardware and software as a service through a network (usually internet) has gained much momentum and attention. Storing data on cloud services relieves the user from the task of storing data locally. As beneficial as it sounds, cloud storage comes along with the quintessential need to protect the stored data from threats such as loss of confidential data and denial of service. The purpose of this research paper is provide a mechanism which uses tokens and distributed forward error correction coded data. The mechanism not only provides the assurance of a secure storage but also provides with the identification of error or the wrongful server simultaneously. Considering the user to store data dynamically, we have also felicitated the dynamic operations such as insertion, deletion and appending blocks. In comparison to previous works, our algorithm can be more flexible with the use of Merkle Hash Tree (MHT) rather than contiguous block data structure.
References
- Kevin D. Bowers, Ari Juels, and Alina Oprea, Proofs of retrievability: theory and implementation, In Proceedings of the 2009 ACM workshop on Cloud computing security, CCSW 2009, pages 43-54, New York, NY, USA, 2009. ACM.
- Muntes-Mulero V, Nin J. Privacy and anonymization for very large datasets. In: Chen P, ed. Proc of the ACM 18th Int'l Conf. on Information and Knowledge Management, CIKM 2009. New York: Association for Computing Machinery, 2009.
- Hovav Shacham and Brent Waters, Compact proofs of retrievability, In Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, ASIACRYPT 2008, pages 90-107, Berlin, Heidelberg, 2008. Springer-Verlag.
- Yevgeniy Dodis, Salil Vadhan, and Daniel Wichs,Proofs of retrievability via hardness amplification, In Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography, TCC 2009, pages 109-127, Berlin, Heidelberg, 2009. Springer-Verlag.
- Cong Wang, Qian Wang, Kui Ren, Ning Cao and Wenjing Lou, Towards secure and dependable storage services on Cloud Computing, IEEE Transactions on Services Computing, Vol. 5, No. 2, pp. 220-232, April-June 2012, 2012/07/12.
- L. Carter and M. Wegman, Universal hash functions,Journal of Computer and System Sciences, vol. 18,no. 2, pp. 143-154, 1979.
- T. Schwarz and E. L. Miller, Store, forget, and check: Using algebraic signatures to check remotely administered storage, in Proc. of ICDCS 2006, 2006, pp. 12-12.
- M. Lillibridge, S. Elnikety, A. Birrell, M. Burrows,andM. Isard, A cooperative internet backup scheme, in Proc. of the 2003 USENIX Annual Technical Conference (General Track), 2003, pp. 29-41.
- M. Castro and B. Liskov, Practical byzantine fault tolerance and proactive recovery, ACM Transaction on Computer Systems, vol. 20, no. 4, pp. 398-461, 2002.
- J. Hendricks, G. Ganger, and M. Reiter, Verifying distributed erasure-coded data, in Proc. of 26th ACM Symposium on Principles of Distributed Computing, 2007, pp. 139-146.
- Chris Erway, Alptekin, Charalampos Papamanthou,and Roberto Tamassia, Dynamic provable data possession, In Proceedings of the 16th ACM conference on Computer and communications security, CCS 2009, pages 213-222, New York, USA, 2009 ACM.
Index Terms
Keywords