Secured Erasure Code For Distributed Storage System

Authors

  • G Geetha Devi  Assistant Professor, Department of Information Technology, Bhoj Reddy Engineering College for Women, Hyderabad, India
  • A. Harika  Department of Information Technology, Bhoj Reddy Engineering College for Women, Hyderabad, India
  • M. Kalyani Rao  Department of Information Technology, Bhoj Reddy Engineering College for Women, Hyderabad, India

Keywords:

Encryption, Threshold Proxy Re-encryption, Severs, Cloud storage, Storage sever, Decentralized

Abstract

A cloud storage system, consisting of a collection of storage servers, provides long-term storage services over the Internet. Storing data in a third party’s cloud system causes serious concern over data confidentiality. General encryption schemes protect data confidentiality, but also limit the functionality of the storage system because a few operations are supported over encrypted data. Constructing a secure storage system that supports multiple functions is challenging when the storage system is distributed and has no central authority. We propose a threshold proxy re-encryption scheme and integrate it with a decentralized erasure code such that a secure distributed storage system is formulated. The distributed storage system not only supports secure and robust data storage and retrieval, but also lets a user forward his data in the storage servers to another user without retrieving the data back. The main technical contribution is that the proxy re-encryption scheme supports encoding operations over encrypted messages as well as forwarding operations over encoded and encrypted messages. Our method fully integrates encrypting, encoding, and forwarding. We analyze and suggest suitable parameters for the number of copies of a message dispatched to storage servers and the number of storage servers queried by a key server. These parameters allow more flexible adjustment between the number of storage servers and robustness.

References

  1. J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gumadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells and B. Zhao,” Oceanstore: An Architecture for Global-Scale Persistent Storage,” Proc. NinthInt’ l Conf. Architectural support for programming languages and operating systems(ASPLOS), pp.190-201,2000.
  2. P. Druschel and A. Rowstron,”PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility,” Proc. Eighth Workshop Hottopics in Operating System (HotOS VIII), pp. 75-80,2001.
  3. Adya, W. J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R.Wattenhofer,” Farsite:Federated, Available, and Reliable Storage for an Incompletely Trusted Environment,” Proc.Fifth Symp. Operating
  4. Haeberlen, A. Mislove, and P. Druschel, “Glacier: HighlyDurable, Decentralized Storage Despite Massive Correlated Failures,”Proc. Second Symp.Networked Systems Design and implementation(NSDI),pp.143-158,2005.
  5. Z.Wilcox-O’Hearn and B.Warner, “Tahoe: The LeastAuthority Filesystem.”Proc. Fourth ACM Int’l Workshop Storage Security and Survivability (StorageSS), pp.21-26,2008.
  6. H.-Y.Lin and W.-G.Tzeng, “A Secure Decentralized Erasure Code for Distributed Network Storage,” IEEE Trans. Parallel and Distributed Systems, vol.21, no. 11, pp. 1586-1594, Nov.2010.
  7. D. R. Brownbridge, L. F. Marshall, and B. Randell, ”The Newcastle Connection or Unixes of the World Unite!,”Software Practice and Experience, vol. 12, no. 12,pp. 1147-1162,1982.
  8. R.Sandberg, D.Goldberg, S.Kleiman, D.Walsh, and B.Lyon,”Design and Implementation of the Sun Network Filesystem,” Proc.USENIX Assoc. Conf.1985.
  9. M.Kallahalla, E.Riedel, R.Swaminathan, Q.Wang, and K.Fu, “Plutus: Scalable Secure File Sharing on Untrusted Storage.” Proc. Second USENIX Conf. File and Storage Technologies(FAST),pp. 29-42,2003.
  10. S.C.Rhea, P.R.Eaton, D.Geels, H.Weatherspoon, B.Y.Zhao, and J.Kubiatowicz, “Pond: The Oceanstore Prototype,” Proc.Second USENIX Conf, File and storage Technologies(FAST). Pp. 1-14,2003.
  11. R.Bhagwan, K.Tati, Y.-C.Cheng, S.Savage, and G.M.Voelker,”Total Recall: System Support for Automated Availability Management,” Proc. First Symp. Networked Systems Design and Implementation (NSDI), pp. 337-350,2004.
  12. A. G. Dimakis, V. Prabhakaran, and K.Ramchandran, “Ubiquitous Access to Distributed Data in Large-Scale Sensor Networks through Decentralized Erasure Codes,” Proc. Fourth Int’l Symp. Information Processing in Sensor Networks (IPSN), pp. 111-117,2005.
  13. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran, “Decentralized Erasure codes

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2023-04-30

Issue

Volume 9, Issue 2, March-April-2023

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
G Geetha Devi, A. Harika, M. Kalyani Rao, " Secured Erasure Code For Distributed Storage System, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 9, Issue 2, pp.661-665, March-April-2023.